Path Planning Based on GA in Convex Polygon Regio
XU Qiu-d · Aircraft Design · 2013
This paper put forward a genetic algorithm for path planning based on convex polygons region. According to constraint conditions, turn corners of aircraft and boundary conditions, we improved the coding method which used the backtracking method based on the direction to accomplish the generation of paths. In addition, genetic algorithm crossover operator and mutation operator has been improved. The simulation results show that this method can complete the task quickly and effectively.