Mobile robot path planning based on improved genetic algorithm

摘要

It makes some improvements on the Genetic Algorithm based on the deficiencies of tra-ditional Genetic Algorithm used in the robot path planning,which is that the use of principle of Minkowshi to expand the obstacles,then to select real feasible region to initial population,which can improve the speed of evolution;the introduction of the concept of similarity in the selection operator,then to expand the type of parent,which can avoid local optimal solution quickly;and the application of the dynamic mutation probability in the crossover operator,which improves the quality of individual;the method is correct and ef-fective through the simulation,which proves the improved Genetic Algorithm can converge more quickly to the global optimal solution.