Mobile robot global path planning based modified simulated annealing hybrid algorithm
XU Li-hong · Kongzhi yu juece · 2010
By using conjugate direction method and modified simulated annealing algorithm,mobile robot global path planning is proposed in this paper. On each temperature,the conjugate direction method is used to search local optimal solution,and the modified simulated annealing algorithm is used to move off the local optimal solution,then the temperature is updated. These operations are repeated until to obtain global optimal solution. The computer simulation results show that this hybrid algorithm is feasibility and better than simulated annealing algorithm on optimization,and its convergence speed is quicker than that of simulated annealing algorithm.