Optimality of the greedy shooting strategy in the presence of incomplete damage information

Consider a situation where a single shooter engages, sequentially, a cluster of targets that may vary in terms of vulnerability and value or worth. Following the shooting of a round of fire at a certain target, the latter may either be killed or remain alive. We assume neither partial nor cumulative damage. If the target is killed, there is a possibility that the shooter is not aware of that fact and may keep on engaging that target. If the shooter recognizes a killed target as such, then this target is considered to be evidently killed. If the objective is to maximize the weighted expected number of killed targets, where the weight reflects the value of a target, then it is shown that a certain type of a shooting strategy, called a Greedy Strategy, is optimal under the general assumption that the more a target is engaged, but still not evidently killed, the less is the probability that the next round will be effective. If all weights are equal, then the greedy shooting strategy calls to engage, at each round, the least previously engaged target that is not evidently killed. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 613–622, 1997     

坦克连最优火力分配

坦克连火力分配方案的科学与否将直接关系到火力打击的整体效果。为了提高坦克连火力分配方案的科学合理性,力求结合我坦克连作战的实际,在充分考虑火力分配影响因素的基础上,建立了最优火力分配模型,这对于我坦克连充分发扬火力和提高整体作战能力具有重要的指导意义。     

混合攻击机机群在空战中的最优控制策略

研究了混合攻击机机群在对由截击 -歼击机机群组成的敌国土防空系统进行突防过程中的最优控制方法 ,以攻击机的最小突防损失为战效指标 ,给出了其最优控制策略。     

一类对固定目标的集群搜寻对策问题及求解

利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

雷达定时脉冲近距离传输的分析与电路设计

通过分析比较多种时间同步技术,对与雷达距离上百米的系统,采用有线传输雷达定时脉冲信号的方式来实现快速的时间同步。针对雷达脉冲信号边沿跳变迅速,在传输过程中存在延时、反射和畸变等问题,借助Cadence仿真软件对信号传输过程进行了仿真分析,设计了合理的传输电路。实验证明本方案结构简单,抗干扰能力强,同步时间可以达到亚微秒级,在雷达信号检测模拟器、雷达诱饵和雷达组网中都有着重要应用。     

导弹对抗离散数学模型

针对现代非接触战争的特点,用数学方法研究导弹对抗模型问题,针对作战的不同目的和要求,建立两个导弹对抗的非线性规划数学模型,对模型求解设计了近似方法,该方法把上述非线性规划模型化为多个线性规划模型进行求解.对一类较简单的特殊情况进行了仔细分析,得到了分析解.最后指出该方法如何应用于动态实时优化决策.本文的方法可用来预测和评估导弹对抗的效果,为作战实时优化决策提供参考.     

基于蚁群算法的火力分配寻优方法研究

火力分配的优化是最大限度的发挥火力单位效能,达到最大毁伤效果的基础和前提,将蚁群算法应用于火力分配的优化.研究了蚁群算法用于火力分配寻优的相关条件,给出了火力分配寻优的模型和算法.最后,结合一个应用实例,说明了蚁群算法用于解决火力分配问题有很好的应用价值.     

基于最大故障特征信息熵的测试点优化设计

为解决故障诊断和可测试性设计中普遍存在的测试点优化问题,以相关性矩阵模型为基础,建立了最大故障特征信息熵的优化准则,给出了相应的测试点优化设计方法。应用实例表明：该方法是可行的、正确的,能为武器装备的故障诊断和可测试性设计提供有力的支持。     

基于空间几何关系的反交会规避机动方法研究

针对具有自主接近能力的航天器开展了反交会规避机动方法研究。首先，建立了仅测角相对导航模型，对完全不可观测机动进行定义，基于空间几何关系推导并证明了完全不可观测机动是不存在的。随后，以施加规避机动后追踪器对逃逸器的测量值与未机动时的差异为优化目标，利用矢量乘积原理设计目标函数，建立优化模型并对变量约束进行分析，随后采用遗传算法对最优规避机动方向进行优化。给出的仿真算例结果表明，提出的规避机动方向计算方法能够使目标函数值达到最小，从而提升追踪器对逃逸器的状态估计难度，降低其估计精度。本文方法为规避机动问题研究提供了一种新的视角，可为以主动接近航天器这类新对象进行的规避研究提供有益借鉴。