摘要
舰艇编队网络化反导作战条件下,目标分配问题演变为"发射节点-制导节点-目标"三者的优化匹配问题,该问题具有很强的实时性和动态随机性。将目标分配分为拦截适应性判断和优化匹配决策两个阶段。拦截适应性判断阶段给出了集成火力单元目标分配区、截止期的计算方法,进而确定了每个目标的拦截适应性判断结果;优化匹配决策阶段建立了静态"发射节点-制导节点-目标"三者的优化匹配模型,分析了动态随机性对目标分配方案的影响。最后,设计了基于遗传算法的Anytime算法求解模型,重点给出了算法的随机事件处理方法和算法的元级控制策略。仿真结果验证了方法的可行性和模型、算法的有效性。
Under the condition of warship formation networked air-defense operation, the target allocation evolves into an optimization matching problem of ＂launch node-guide node-target＂, which has strongly real- time performance and dynamic randomness. In this paper, the target allocation procedure is divided into two phases： interception adaptative judging and optimization matching decision-making. In the phase of interception adaptative judging, calculating methods of allocation zone and deadlines of target are presented, and then the result of interception adaptative judging is determined. In the phase of optimization matching decision-making, static optimization matching model of ＂launch node-guide node-target＂ is established, and the influence of dynamic randomness on target allocation scheme is analyzed. Finally, an Anytime algorithm based on GA is designed to solve the model, for which the random event handling and meta-level control strategy are discussed. The feasibility of the method, and the validity of the model and algorithm are verified through simulation results
出处
《电光与控制》
北大核心
2013年第5期15-20,24,共7页
Electronics Optics & Control
基金
国防预研基金资助项目(4010804040102)
关键词
舰艇编队
网络化反导
动态目标分配
遗传算法
ANYTIME算法
元级控制
warship formation
networked air-defense
dynamic target allocation
genetic algorithm
Anytime algorithm
meta-level control
