UAV route planning based on the genetic simulated annealing algorithm
Hao Meng, Guizhou Xin · 2010
For the local minimum problem of genetic algorithm in unmanned aerial vehicle route planning, the Metropolis acceptance criteria of simulated annealing algorithm is incorporated into the genetic algorithm in this paper. In the algorithm, the original DEM (Digital Elevation Map) is processed into the smallest threat surface. In order to obtain a more smooth surface of flight, the original digital elevation map are processed in four directions, and then the genetic simulated annealing algorithm is used for three-dimensional route planning in this minimal threat surface. In addition, the distance between the track segment and threats are converted into elevation values and the value is added to the fitness function, a smaller code space was proposed at the same time. The simulation results show that the Genetic Simulated Annealing Algorithm proposed is good.