期刊文献+

无人机群协同作战任务分配方法研究 被引量:23

Cooperative Combat Task Assignment Optimization Design for Unmanned Aerial Vehicles Cluster
在线阅读 下载PDF
导出
摘要 针对战场环境的多目标、多任务以及无人机能力有限等特点,设计了一种适应于多目标、多无人机、多任务种类的无人机群协同多任务分配模型。结合该模型以及其中的任务偏序约束、协同任务约束、无人机能力约束等约束条件提出了基于任务序列的遗传算法染色体编码方法,和基于同类任务的遗传算法交叉、变异算子。该方法利用遗传算法的全局搜索优化解特点,对无人机群的协同任务分配进行优化。仿真试验表明该方法能够保证满足任务分配约束条件的基础上使任务的分配更加优化。 A cooperative multi-task assignment problem (CMPAT) model is designed for battlefield environment of multi-objective, multi-task and limited capacity of unmanned aerial vehicle (UAV). According to the task sequence constraint, the cooperative task constraint, and the UAV capacity constraint in the CMPAT model, the chromosome coding method based on task sequence and the cross and disturbance operators based on same category tasks changing are proposed. With the feature of global searching optimal solution of genetic algorithms, this algorithm can optimize the cooperative multi-task assignment of UAVs cluster. Simulation shows that the proposed algorithm can achieve more optimized solution of cooperative multi-task assignment.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2013年第5期723-727,共5页 Journal of University of Electronic Science and Technology of China
基金 航空科学基金(2012ZC52042)
关键词 协同作战 遗传算法 多任务 任务分配 无人机群 cooperative combat genetic algorithms multi-task task assignment unmanned aerial vehicles cluster
  • 相关文献

参考文献3

二级参考文献30

  • 1张聪,马义忠.异构计算系统中基于遗传算法的任务分配与调度[J].微电子学与计算机,2004,21(6):74-78. 被引量:8
  • 2段海滨,王道波,朱家强,黄向华.蚁群算法理论及应用研究的进展[J].控制与决策,2004,19(12):1321-1326. 被引量:217
  • 3罗德林,段海滨,吴顺详,李茂青.基于启发式蚁群算法的协同多目标攻击空战决策研究[J].航空学报,2006,27(6):1166-1170. 被引量:50
  • 4段海滨.蚁群算法原理及应用[M].北京:科学出版社,2005.12.
  • 5Hamam Y, Hindi K S.Assignment of program modules to proceossors: A simulated annealing approach [J]. European Journal of Operational Research,2000,122:509-513.
  • 6Attiya G,Hamam Y.Task allocation for maximizing reliability of distributed systems: A simulated annealing approach[J].Joumal of Parallel and Distributed Computing,2006,66:1259-1266.
  • 7Chen W-H, Lin C-S.A hybrid heuristic to solve a task allocation problem [J]. Computers and Operations Research, 2000,27: 287-303.
  • 8Kaji T.Approach by ant tabu agents for traveling salesman problem [C]. Proceedings of the IEEE International Conference on Systems,2001.3429-3434.
  • 9Korosec P, Silc J.Solving the mesh-partitioning problem with an ant-colony algorithm [J]. Parallel Computing, 2004,30 (5-6): 785-801.
  • 10Shima T, Rasmussen S J, Sparks A G. Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms[J]. Computers & Operations Research, 2006, 33(11): 3252-3269.

共引文献97

同被引文献314

引证文献23

二级引证文献273

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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