基于遗传算法的飞行器参考航迹规划  

Reference Route Planning for Aircraft Based on Genetic Algorithm

作　　者：李强[1] 王民钢[1] 李磊[1] 

机构地区：[1]西北工业大学航天学院,陕西西安710072

出　　处：《计算机仿真》2010年第2期34-37,共4页Computer Simulation

摘　　要：针对飞行器航迹规划问题展开研究,为了规划出最优满意的飞行轨迹,分析了飞行器航迹规划中存在的威胁与自身约束条件,提出了一种关于遗传算法的航迹规划方案,采用改进编码机制对飞行器在已知威胁情况下飞行航迹进行整体规划。取航迹个体只包含一个染色体,每个染色体为一个航迹点序列,随机生成种群,通过选择交叉变异,并将各种威胁和约束条件的影响适当的加入到适应值函数中,得到优化路径进行仿真。仿真结果给出了不同加权比例下所得到的最优航迹,通过仿真验证了算法的有效性。The problem on route planning for aircraft is studied, the threats and restrictions in the route planning for aircraft are analyzed. A method of route planning based on genetic algorithm is proposed. Improved coding mechanism is used to do an overall planning for aircraft in the flight region with confirmed threats. Assumed the route individual includes only one chromosome, every chromosome is a series of waypoints, and the colonies are generated randomly. By crossover and mutation, and by adding the affections of all the treats and restrictions to the fitness function, the optimal route is used to carry the simulation. The simulation results show the optimal route in different weight proportions, and validate the validity of the algorithm.

关 键 词：航迹规划 遗传算法 威胁 约束条件 

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