时间和制导资源约束下的武器目标分配  

Research on Weapon Target Allocation Restricted by Time and Guide Resource

作　　者：曾松林[1] 王文恽[1] 李彪[1] 张毅[1] 

机构地区：[1]海军航空工程学院,山东烟台264001

出　　处：《火力与指挥控制》2011年第7期95-98,102,共5页Fire Control & Command Control

摘　　要：针对防空作战过程中的武器-目标分配问题,以目标毁伤概率最大为目标函数,提出一种混合粒子群算法。该算法融合粒子群算法和遗传算法,首先利用粒子群算法找到不受时间和制导资源约束的一组解,再利用遗传算法对粒子群算法找到的解进行寻优,最终找到一组满足时间和制导资源约束的最优解。仿真结果表明,该算法收敛速度快,迭代次数少。Aim at the the problem of weapon-target allocation,which the objective function is kill target probability maximization,put forward a hybrid particle swarm algorithm to study this preblem. This algorithm fuses the particle swarm algorithm and genetic algorithm.Firstly,using particle swarm algorithm to find a set of solutions which are not constrainted by time and guidance resource,then using genetic algorithm to find a best solution which meets the constrains of time and guidance resource among the set of solutions.The simulation result indicates,this algorithm＇ convergence speed is quick,and iterative time.is a few.

关 键 词：武器目标分配 制导资源 粒子群算法 遗传算法 混合粒子群算法 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]