基于PSO算法的多巡飞器任务分配方法  

Task Allocation Method for Multi-Loitering Units Using PSO Algorithm

作　　者：李大林[1] 李杰[1] 

机构地区：[1]北京理工大学机电学院,北京100081

出　　处：《北京理工大学学报》2010年第12期1436-1439,共4页Transactions of Beijing Institute of Technology

基　　金：国家部委预研项目(A2220060045;402030201)

摘　　要：为使多个巡飞器协同完成针对地面多个目标攻击任务,从巡飞器载荷较小的特点出发,基于PSO算法对其任务分配方法进行了研究.根据巡飞器两种任务介入方式的不同,分别建立了布撒方式任务分配问题模型以及陆基发射方式任务分配问题模型.根据模型的复杂程度,分别选择使用基本PSO全局优化算法以及考虑资源消耗情况下对PSO整数规划算法进行改进后的算法,求解两种任务分配问题.仿真结果表明,算法可解决任务分配问题,任务分配方法合理,适应巡飞器协同需求.For making multi-loitering units have more ability to complete complex task as attacking multi-target on the ground,the task allocation method for loitering units with small payload is studied based on particle swarm optimization（PSO） algorithm.In consideration of two main tasks with different starting modes,two models for task allocation were established separately.One task allocation model was designed for air-drop pattern using basic PSO global optimization algorithm and the other was designed for land launching pattern.The improved PSO integer programming algorithm could be used to solve the calculation problem under launching mode.Simulation results show that the algorithm can satisfy the needs of complex task.Task allocation method is reasonable to fit the requests of multi-loitering units.

关 键 词：粒子群优化算法 任务分配方法 多巡飞器 

分 类 号：TJ012.3[兵器科学与技术—兵器发射理论与技术]