Path Planning of Mobile Robot Based on an Improved Genetic Algorithm

Abstract

Translate Article

In order to solve the problem of premature convergence of the basic genetic algorithm when planning the robot running path, the basic genetic algorithm is improved and optimized. Different population initialization methods are used to initialize multiple populations randomly, so as to improve the diversity of populations; Improve the adaptive strategy and elite strategy of crossover and mutation operators to improve the convergence speed of the algorithm; Add the path tortuosity as the planning index in the fitness function to make the planned path smoother, and add constraints to the model to avoid obstacles; Finally, through the transformation of the coding paradigm of the above improved genetic algorithm, it can run on Flink distributed cluster to obtain faster solution speed, so as to meet the efficiency requirements of path planning in large-scale robot cluster system. The optimized algorithm is compared with the basic genetic algorithm. The simulation results show that the improved algorithm is efficient in robot path planning.