节点文献

协同多目标攻击空战决策的启发式粒子群优化算法(英文)

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 罗德林杨忠段海滨吴在桂沈春林

【Author】 Luo Delin1, Yang Zhong1, Duan Haibin2, Wu Zaigui1, Shen Chunlin1(1.College of Automation Engineering, NUAA, 29 Yudao Street, Nanjing, 210016, P. R. China;2.School of Automation Science and Electrical Engineering,Beijing University of Aeronautics and Astronautics, Beijing, 100083, P. R. China)

【机构】 南京航空航天大学自动化学院北京航空航天大学自动化科学与电气工程学院南京航空航天大学自动化学院 南京210016中国南京北京100083

【摘要】 利用协同多目标攻击战术的特定知识,并结合粒子群算法,提出了一种用于空战决策的启发式粒子群算法。该算法利用粒子群算法对解空间探索能力强,容易跳出局部最优陷井及启发式算法局部搜索能力强的优点,快速、高效地对全局最优值进行搜索。该算法通过求解友机导弹对目标的最优分配来确定空战决策方案。仿真实验结果表明,本文算法对最优空战决策方案的搜索性能明显优于普通粒子群算法及其他两种遗传算法。

【Abstract】 Combining the heuristic algorithm (HA) developed based on the specific knowledge of the cooperative multiple target attack (CMTA) tactics and the particle swarm optimization (PSO), a heuristic particle swarm optimization (HPSO) algorithm is proposed to solve the decision-making (DM) problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts (FAs) to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA-based algorithms in searching for the best solution to the DM problem.

【基金】 航空科学基金(02F15001)资助项目~~
  • 【文献出处】 Transactions of Nanjing University of Aeronautics & Astronautics ,南京航空航天大学学报(英文版) , 编辑部邮箱 ,2006年01期
  • 【分类号】V325
  • 【被引频次】35
  • 【下载频次】466
节点文献中: 

本文链接的文献网络图示:

本文的引文网络