|国家预印本平台
首页|用于航迹规划的遗传算法多样性改进

用于航迹规划的遗传算法多样性改进

Improved genetic algorithm in diversity for route planning

中文摘要英文摘要

无人飞行器航迹规划的优化目标为寻找最优解或寻找多条互异解,遗传算法作为进化算法,其特性很适用于作为寻找多条互异解的方法,但是遗传算法的缺点在于容易过早收敛而使得所得航迹结果在空间上差异性不大。基于此,本文对传统遗传算法的选择与淘汰策略,使用了新的算子设计以增加遗传算法结果的多样性,并对其进行了仿真研究,并与传统遗传算法进行了比较。仿真研究表明,采用改进方案后,规划结果的多样性得到显著的提高。

Unmanned Aircraft planning optimization objective is to find the optimal solution or find a number of different solutions. the genetic algorithm as an evolutionary algorithm,is very suitable for looking for a number of different solutions, but the drawback of the genetic algorithm is the premature convergence. In this paper, We present a series of improvements program,which include improveing the strategy of selection and elimination and the new design of operator. Simulation results have shown that with the improvement program, the diversity of planning results significantly improved.

周志鹏、周成平

航空航天技术自动化技术、自动化技术设备计算技术、计算机技术

遗传算法航迹规划种群多样性

genetic algorithmroute Planningpopulation diversity

周志鹏,周成平.用于航迹规划的遗传算法多样性改进[EB/OL].(2013-01-25)[2025-08-23].http://www.paper.edu.cn/releasepaper/content/201301-1037.点此复制

评论