Research on the optimal search problem of UAV based on improved genetic algorithm

Traditional genetic algorithm is prone to precocious problem. An improved genetic algorithm based on improved ring is proposed. First, the parent generation is improved and optimized by the improved circle method, then the offspring are obtained by crossing, and the inferior individuals produced after crossing are reduced by keeping the excellent genes to the maximum extent in the process of crossing, and the convergence rate is improved. The population diversity of the algorithm is guaranteed by improved ring and by choosing crossover probability and the mutation probability. Finally, the optimal search path is obtained by selecting the parent and offspring. The simulation results show that compared with the traditional Hamilton trilateral exchange algorithm, the improved genetic algorithm is simple, fast, and it can jump out of local convergence and obtain the optimal solution. It is a more reasonable UAV route method to solve the optimal search problem.