Path Planning of Mobile Robot Based on Genetically Simulated Annealing Algorithm
Du Zong · Jisuanji fangzhen · 2009
Aimed at the path planning problem of mobile robot,a genetically simulated annealing algorithm of optimum path planning for mobile robots is proposed.In this paper,path planning of mobile robot is designed,grid is used to make environmental modeling.An improved obstacle avoidance algorithm is introduced to generate the initial population in order to improve the path planning efficiency.This paper develops a genetic simulated annealing algorithm by combining the genetic algorithm with simulated annealing algorithm.The new algorithm has better capability of searching globally and locally.The simulation results demonstrate that the proposed algorithm has achieved considerable improvements,in convergence speed,search quality and optimal solution output rate compared to the basic genetic algorithm.