飞行器易损性指标计算的基本理论与方法(Ⅱ)

文章是飞行器易损性指标计算基本理论的第二部分。在第一部分给出的单次击中易损性指标计算公式的基础上, 研究了多次击中情况下飞行器易损性指标计算的两种方法, 并给出了相应的计算公式。最终通过具体的算例说明了方法的有效性     

激光制导航空炸弹三维动态数字仿真研究

以某型激光制导航空炸弹为例,进行了三维动态数字仿真研究,文中建立了该型激光制导炸弹六自由度空间运动方程和双通道控制系统模型。通过仿真计算,得到了该弹的三维攻击区,并将三维动画技术应用于实时仿真系统的软件开发中     

目标的规避过程与搜索运动

应用随机过程的观点,研究了静态目标和动态目标的几种规避方式、运动规律和目标位置的概率分布,导出了在上述几种情况下对规避目标的最优（理论）搜索计划。     

搜索力最优配置的求解与收敛性分析

讨论了搜索线上搜索力（密度）的最优配置问题,给出了求解的算法。并对其收敛性作了证明。     

海拔高度对发动机泵机组性能的影响

介绍250型泵机组基本参数,详细阐述该型发动机泵机组的动力传递关系,应用FST2E型测试台架开展泵机组发动机高原效能模拟试验,获取发动机在不同海拔高度的功率、燃油消耗率和油耗量数据,拟合生成发动机负荷特性曲线。定量分析不同海拔高度发动机功率下降对离心泵体积流量、效率、扬程等的影响,得出泵机组体积流量、扬程、效率的下降规律。研究结果可为现有泵机组的使用及新型泵机组的研制提供理论依据和数据参考。     

基于对抗模拟的箔条质心干扰决策计算方法

通过分析箔条质心干扰的作战过程,综合考虑了反舰导弹的来袭方向、性能参数、舰艇的物理和运动参数、作战海域的天气情况,建立箔条质心干扰反舰导弹的作战模拟模型,在此基础上提出了箔条质心干扰方案的计算方法.应用实例的过程和结果表明,该方法简易可行,通过真实模拟双方的对抗过程,所得决策方案可信度高,对质心干扰决策具有很好的指导价值.     

实施大区域防空应重视末端防御

结合大区域防空作战的理论研究,分析未来防空中末端防御在大区域防空体系中的地位和作用。提出末端防御是大区域防空的重要组成部分,是防空体系中实施大区域防空的最后一道防线,是实现歼灭敌空袭兵器与掩护重要目标安全的重要手段。通过分析现代空袭特点,提出实施末端防御对我防空武器装备发展的要求。     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007