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

Multiple Routes Planning for Air Vehicle Based on Genetic Algorithm

作　　者：田亮[1] 吴金荣[2] 孙富春[2] 

机构地区：[1]河北师范大学数学与信息科学学院计算机系,石家庄050016 [2]清华大学计算机科学与技术系智能技术与系统国家重点实验室,北京100084

出　　处：《计算机工程与应用》2006年第31期216-218,225,共4页Computer Engineering and Applications

摘　　要：提出了基于遗传算法的飞行器多航迹规划方法。该方法设计了一种新的分类评价体系,有效地解决了在约束条件多、部分约束条件互相冲突情况下的航迹评价问题。同时采用实数编码的染色体表示方法和特殊设计的进化算子,所有个体在各自子种群中同时进化。最后每个种群取一条最优航迹从而得到多条航迹。计算机仿真结果证明了该方法的有效性。A new multiple routes planner for air vehicle based on Genetic Algorithm is proposed.The approach designs a new classifying-evaluation system,which efficiently solves the route evaluation in the case of various mission constraints,part of which conflict.Using a real-value representation of chromosome and specific operators,all routes evolve in their own sub-population at the same time.At the end of the evolution,each sub-population provides an optimal route,and thus algorithm generates multiple routes for the vehicle.The results of simulation demonstrate the feasibility of the approach.

关 键 词：多航迹规划 分类 航迹评价 遗传算法 飞行器 

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