Research on Path Planning for Mobile Robot Based on Grid and Hybrid of GA/SA

Path planning is the kernel problem of the robot technology area. In this paper, the grid method is used to make environmental modeling, Since the Genetic Algorithm (GA) has its immanent limitations and the Simulated Annealing (SA) Algorithm has the advantages in some aspects, combined these two algorithms together just achieve the perfection. In view of this, a hybrid of GA and SA (GA-SA Hybrid) is proposed in this paper to solve path planning problem for mobile robot. The algorithm making the crossover and mutation probability adjusted adaptively and nonlinearly with the completion time, can avoid such disadvantages as premature convergence. The new algorithm has better capability of searching globally and locally. The simulation results demonstrate that the proposed algorithm is valid and effective.