期刊
AEROSPACE
卷 9, 期 2, 页码 -出版社
MDPI
DOI: 10.3390/aerospace9020086
关键词
UAV; area coverage; GA; path planning; GPSA
资金
- National Natural Science Foundation Fund [52072309]
- Key Research and Development Program of Shaanxi [2019ZDLGY14-02-01]
- Shenzhen Fundamental Research Program [JCYJ20190806152203506]
- Aeronautical Science Foundation of China [ASFC-2018ZC53026]
This paper proposes an area coverage path planning method for a fixed-wing UAV based on an improved genetic algorithm. The algorithm improves the primary population generation of the traditional genetic algorithm and reduces the risk of local optimization with the help of better crossover and mutation operators.
When performing area coverage tasks in some special scenarios, fixed-wing aircraft conventionally adopt the scan-type of path planning, where the distance between two adjacent tracks is usually less than the minimum turning radius of the aircraft. This results in increased energy consumption during turning between adjacent tracks, which means a reduced task execution efficiency. To address this problem, the current paper proposes an area coverage path planning method for a fixed-wing unmanned aerial vehicle (UAV) based on an improved genetic algorithm. The algorithm improves the primary population generation of the traditional genetic algorithm, with the help of better crossover operator and mutation operator for the genetic operation. More specifically, the good point set algorithm (GPSA) is first used to generate a primary population that has a more uniform distribution than that of the random algorithm. Then, the heuristic crossover operator and the random interval inverse mutation operator are employed to reduce the risk of local optimization. The proposed algorithm is verified in tasks with different numbers of paths. A comparison with the conventional genetic algorithm (GA) shows that our algorithm can converge to a better solution.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据