Journal of Systems Engineering and Electronics ›› 2010, Vol. 32 ›› Issue (9): 1937-1940.doi: 10.3969/j.issn.1001-506X.2010.09.32

• 系统工程 • 上一篇    下一篇

基于IBPSO的编队协同对地攻击目标分配算法

夏庆军,张安,张耀中   

  1. 西北工业大学电子信息学院, 陕西 西安 710129
  • 出版日期:2010-09-06 发布日期:2010-01-03

Target allocation algorithm in formation cooperative air-to-ground attacking based on IBPSO

XIA Qing-jun, ZHANG An, ZHANG Yao-zhong   

  1. School of Electronics and Information, Northwestern Polytechnical Univ., Xi’an 710129, China
  • Online:2010-09-06 Published:2010-01-03

摘要:

针对编队协同对地攻击目标分配问题特点,对二进制粒子群算法应用于编队协同对地攻击目标分配的若干问题进行研究。首先,通过战斗机毁伤目标收益和攻击目标代价建立了目标分配问题的评估标准。然后,在引入了一系列操作符的基础上,对二进制粒子群算法的速度和位置更新计算公式进行了改进,并利用改进的二进制粒子群算法完成了编队协同对地攻击目标分配。仿真结果表明,改进的二进制粒子群算法比遗传算法具有更强的全局寻优能力、更快的收敛速度。

Abstract:

According to the characteristics of target allocation in formation cooperative air-to-ground combat (FCAGC), some issues about the application of improved binary particle swarm optimization (IBPSO) to target allocation are studied. Firstly, by computing the income and cost of damaging targets, an evaluation standard of target allocation is set up. Secondly, the formulas about the velocity and position of binary particle swarm optimization are improved by introducing into a series of operators. Then, IBPSO is applied to target allocation. Simulation results show that IBPSO has a more powerful global search capability and faster convergence velocity than the genetic algorithm (GA).