空陆攻防博弈的动态武器目标分配

大规模作战具有高动态、非完全信息和不确定性，在分析归纳目前解决动态武器目标分配问题的一系列方法的基础上，尝试构建基于双方动态博弈的攻防对抗综合数学模型，并利用纳什均衡和帕累托最优算法进行分阶段求解。结果表明，该数学模型和博弈论方法结合能够有效解决武器目标动态分配问题。     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

炮控伺服系统自抗扰控制器优化设计

针对自抗扰控制器参数难于整定的问题,给出了一种基于自适应变异粒子群优化算法的炮控伺服系统自抗扰控制器优化设计方法.该算法结构简单,具有良好的全局收敛性,充分发挥了自抗扰控制器的控制性能.通过对某炮控伺服系统的仿真研究,表明了该设计方法的有效性.     

炮兵火力任务分配的优化模型

现代作战,参战兵种多,炮兵的火力单位和类型更为复杂,不同的火力单位具有不同的毁伤效果,如何用最小的代价取得最大的军事效益,是一种火力任务分配的优化问题.根据不同炮种和目标的特点,建立在一定约束条件下的炮兵火力任务分配模型,并将其转化为指派问题,运用匈牙利算法求解,达到优化分配火力任务的目的.通过仿真计算证明这是辅助指挥员进行射击决策的一种有效手段,为作战指挥理论提供了一种新的数学模型.     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.     

一种基于蚁群算法的准动态防空武器分配算法

武器目标分配问题是一个典型的限制组合优化问题,旨在得到在整个防御阶段中针对目标函数的最优武器分配方案。分配算法主要分为静态和动态两大类。针对传统静态分配模型中存在的几点问题,提出了基于时间窗的准动态武器目标分配算法,该算法综合考虑拦截概率、拦截时间和武器耗费多个优化指标,并将该算法推广至多类防空武器的优化分配中。通过大量实验验证,该算法在性能、时间复杂度等方面均有较大优势,并且能较好地适应战场态势的变化,及时调整分配方案,具有很好的实用性。     

某型末制导炮弹偏流的分析与计算

针对某型激光半主动式末制导炮弹偏流问题，基于考虑末制导炮弹各个典型弹道飞行阶段的刚体弹道模型，通过仿真计算，分析该末制导炮弹偏流的基本特点；探讨偏流形成的原因，确定影响其大小的关键因素，并对计算偏流所需要的数值积分时间步长进行了探讨。有关结论对准确编拟末制导炮弹射表所需要的偏流有直接应用价值，对新型末制导炮弹的弹道设计有积极的指导意义。     

船艇发动机虚拟维修中的场景优化技术研究

针对船艇发动机虚拟维修场景构建过程中模型的高逼真度和实时交互之间的矛盾,提出了降低场景复杂度的初期建模优化技术,以及模型合成后的全景优化技术。通过在发动机虚拟维修训练系统中的综合应用,有效地简化了模型的多边形网格,降低了场景的复杂度,提高了场景的生成速度。     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

隐身飞机突防建模及低可探测性轨迹规划

针对隐身飞机突防飞行规划,分析了隐身飞机对警戒雷达网突防过程问题特性,建立了雷达探测模型与组网警戒雷达信息融合模型;综合考虑隐身飞机的隐身能力、预警时间和燃料消耗将隐身飞机低可探测性轨迹规划问题形式化为一个复杂多目标非线性连续时间最优控制问题;并提出基于伪谱法的低可探测性轨迹规划方法。仿真实验实现了在组网警戒雷达下隐身飞机的低可探测性突防轨迹规划,证明了方法的可用性和有效性。