动态火力接入下要地防空目标分配研究  

Target Allocation for Air-Defense of Key Position Under Dynamic Fire Access

作　　者：刘敬蜀[1,2] 姜文志[1] 代进进[1] 

机构地区：[1]海军航空工程学院兵器科学与技术系,山东烟台264001 [2]海军装备研究院,北京100161

出　　处：《电光与控制》2016年第6期34-39,共6页Electronics Optics & Control

基　　金：国防预研基金(4010804040102)

摘　　要：以海军要地防空作战为背景,针对动态火力接入下目标分配问题的特性,分析了动态火力接入下目标分配问题的关键因素,确定了时间、空间和资源约束条件,提出了集成火力单元的发射准备区及截止时间的计算方法,在传统"发射节点-目标"分配模型中增加了制导节点构建三者优化匹配模型,设计了基于离散粒子群的Anytime算法求解优化模型。仿真结果表明,算法能在规定的时间、空间和资源约束条件下,快速求得满足一定优化需求的分配方案。Under the background of navel air-defense of key positions,analysis is made to the key influence factors of target assignment problem under Dynamic Fire Access（DFA）,and the constraint conditions on time,space and resource are presented.Then the methods for calculating the ready-to-launch zone as well as the deadline of integrated firepower unit are given.The assignment problem is considered as the optimal matching among launch node,guide node and target.The Anytime algorithm based on Discrete Particle Swarm Optimization（DPSO） is designed for solving the assignment problem.Simulation result shows that the algorithm can obtain the optimal assignment scheme rapidly under given constraints of time,space and resources.

关 键 词：要地防空 目标分配 动态火力接入 ANYTIME算法 离散粒子群算法 

分 类 号：TJ761.1[兵器科学与技术—武器系统与运用工程] E927[军事—军事装备学]