一种基于自适应遗传算法的航迹重规划  

A Route Re-planning Based on Adaptive Genetic Algorithm

作　　者：王健[1] 徐涵[1] 

机构地区：[1]国防科学技术大学计算机学院,湖南长沙410073

出　　处：《计算机与现代化》2011年第4期10-13,16,共5页Computer and Modernization

摘　　要：航迹重规划技术是保证无人飞行器航行安全的关键技术之一。本文针对遗传算法航迹重规划容易陷入局部最优解的问题展开研究。采用自适应交叉变异概率的遗传算法规划局部航迹,避免了航迹早熟,防止航迹陷入局部最优解。通过仿真实验表明,自适应遗传算法能在模拟环境中规划出满足约束条件的近似最优航迹,提升了遗传算法解决航迹重规划的效能。Route re-planning is known as one of the key techniques to guarantee the safe navigation of UAV.For genetic algorithm track re-planning is easy to fall into local optimal solution,this paper takes the adaptive crossover and mutation probability of genetic algorithm to solve local route planning problem.This algorithm avoids the track re-planning to finish early,and prevents the track into a local optimal solution.Simulation results show that the adaptive genetic algorithm meets the constraints of planning an approximate optimal track in the simulated environment,and improves the performance of the genetic algorithm tracks re-planning.

关 键 词：无人飞行器 自适应遗传算法 航迹重规划 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]