Journal of Systems Engineering and Electronics ›› 2011, Vol. 33 ›› Issue (4): 806-810.doi: 10.3969/j.issn.1001-506X.2011.04.19

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

交叉粒群算法在无人机航路规划中的应用

倪天权1,3, 王建东1, 刘以安2   

  1. 1. 南京航空航天大学信息科学与技术学院, 江苏 南京 210016; 
    2. 江南大学信息工程学院, 江苏 无锡 214122; 
    3. 中国船舶重工集团公司第七二三研究所, 江苏 扬州 225001
  • 出版日期:2011-04-25 发布日期:2010-01-03

Application of particle swarm algorithm in route planning of UAV

NI Tian-quan1,3, WANG Jian-dong1, LIU Yi-an2   

  1. 1. College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;
    2. School of Information Engineering, Jiangnan University, Wuxi 214122, China;
    3. No.723 Institute of China Shipbuilding Industry Corporation, Yangzhou 225001, China
  • Online:2011-04-25 Published:2010-01-03

摘要:

随着现代战场环境的日益复杂和作战范围的不断扩大,给无人机(unmanned aerial vehicle, UAV)执行空中侦察、监视、作战等任务带来了严重挑战。为了提高UAV的作战效率和生存概率,从UAV的威胁空间建模出发,根据战场分布的威胁区域,先利用威胁回避技术快速地给出一条从起始点到目标点的粗选航路;然后在此基础上,应用粒群算法和遗传算法中交叉和变异操作相结合的思想,对粗选规划航路进行全局优化,从而找出一条能确保自身安全并威胁代价最小的最优飞行航路。仿真结果说明,该方法是有效、可行的。

Abstract:

The UAV faces a flinty challenge when executing aerial reconnaissance, surveillance and campaign as the environment of modern battle field is becoming more and more complicated and large. A route planning algorithm is proposed to increase efficiency of campaign and survival of unmanned aerial vehicles (UAV). The algorithm first search a coarse route as fast as possible based on threat avoidance technique according to threat areas in battle field. Then it optimizes the coarse route globally by employing the particle swarm algorithm and the idea of intercross and variation in genetic algorithm. The result of simulating shows the algorithm can find an optimized safe route by consuming less iteration times.