Abstract: In the traditional artificial potential field method, the local minimum point problem exists in path planning, which makes the mobile robot unable to move to the target point. Therefore, an artificial potential field method based on simulated annealing algorithm is proposed. Artificial potential field method uses the simulated annealing algorithm to add random target points near the local minimum point and guide the mobile robot to escape from the local minimum point area gradually. Finally, Matlab simulation proves that the method can make the mobile robot escape from the local minimum position, successfully reach the target position, consumes shorter time, and is more stable.

Key words: mobile robot, path planning, artificial potential field method, simulated annealing algorithm