期刊文献+

多UCAV协同目标分配算法研究 被引量:30

Cooperation mission assignment algorithm for multi-UCAV
下载PDF
导出
摘要 针对多无人作战飞机(unmanned combat aerial vehicle,UCAV)协同目标分配问题,提出了一种基于离散粒子群算法的多UCAV协同目标分配方法。根据多UCAV协同目标分配问题的特点,建立了粒子与实际问题间的映射,设计了新的粒子群位置和速度更新公式,并且对标准粒子群算法作了改进。充分利用粒子群优化算法的全局搜索能力,有效地解决多约束条件下多UCAV协同目标分配问题。仿真结果表明,离散粒子群算法能够稳定快速地找到较优分配方案,并且算法简单、灵活。 A discrete particle swarm optimization (DPSO) algorithm is put forward for multi-UCAV (unmanned combat aerial vehicle)cooperation mission assignment problems. In the algorithm, a new code for particles and new update strategy for the position and speed of particles are applied so as to make the DPSO algorithm more suitable for multi-UCAV cooperation mission assignment problems. Aiming at the shortcoming of prematurity and poorness resulted from pure PSO, the DPSO algorithm takes full advantage of the complementary strengths of the particle swarm optimization algorithm, and the algorithm could solve multi-UCAV cooperation mission assignment effectively. The simulation results show that the DPSO algorithm could find the better assignment scheme fleetly and is simple and flexible.
出处 《系统工程与电子技术》 EI CSCD 北大核心 2010年第1期104-108,共5页 Systems Engineering and Electronics
基金 航空科学基金(20085584010) 海军航空工程学院青年科研基金(HJHYQN200801)资助课题
关键词 多无人作战飞机协同 目标分配 离散 粒子群算法 multi-UCAV cooperation task assignment discretization particle swarm optimization (PSO)
  • 相关文献

参考文献7

  • 1叶媛嫒.多UCAV协同任务规划方法研究[D].长沙:国防科学技术大学,2005.
  • 2Rasmussen S, Chandler P R, Mitchell J W, et al. Optimal vs. heuristic assignment of cooperative autonomous unmanned air vehicles[C]//AIAA Guidance, Navigation, and Control Conference, 2003 : 679 - 708.
  • 3Curz J B, Jr C, Chen G. Particle swarm optimization for resource allocation in UAV cooperative control[C]//AIAA Guidance, Navigation, and Control Conference and Exhibit, 2004:16 - 19.
  • 4Fan Chunxia, Wan Youhong. An adaptive simple particle swarm optimization algorithm[C]//Control and Decision Conference, 2008 : 3067 - 3072.
  • 5Pan Q K,Tasgetiren M F,Liang Y C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion[C]// Proc. of the Int Workshop on UK Planning and Scheduling Special Interest Group, 2005:31 -41.
  • 6Pan Q K, Tasgetiren M F, Liang Y C. Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm[J]. Lecture Notes in Computer Science, 2006,4150 : 460 - 467.
  • 7潘全科,王文宏,朱剑英.解决无等待流水车间调度问题的离散粒子群优化算法[J].计算机集成制造系统,2007,13(6):1127-1130. 被引量:18

二级参考文献7

  • 1潘全科,朱剑英.基于进化算法和模拟退火算法的混合调度算法[J].机械工程学报,2005,41(6):224-227. 被引量:21
  • 2潘全科,朱剑英.一类解决Job Shop问题的禁忌搜索算法[J].中国机械工程,2006,17(5):536-539. 被引量:16
  • 3PAN Q K,TASGETIREN M F,LIANG Y C.A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion[C]//Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group.London,UK:City University,2005:31-41.
  • 4ALDOWAISAN T,ALLAHVERDI A.New heuristic for nowait flowshops to minimize makespan[J].Computer & Operation research,2003,30(8):1219-1231.
  • 5SCHUSTER C J,FRAMINAN J M.Approximative procedure for no-wait Job Shop scheduling[J].Operations Research Letters,2003,31(4):308-18.
  • 6GRABOWSKI J,PEMPERA J.Some local search algorithms for no-wait flow-shop problem with makespan criterion[J].Computers & Operations Research,2005,32(8):2197-2122.
  • 7潘全科,朱剑英.多工艺路线的批量生产调度优化[J].机械工程学报,2004,40(4):36-39. 被引量:52

共引文献18

同被引文献260

引证文献30

二级引证文献203

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部