Dynamic path planning of mobile robot based on improved simulated annealing algorithm

Abstract

Dynamic path planning for mobile robots is an urgent issue that needs to be solved because of the growing use of mobile robots in daily life and industrial operations. This work focuses on avoiding moving obstacles in dynamic situations. The computational effort required by some current algorithms makes them difficult to utilize for path planning in dynamic situations whilst the computational effort required by other methods makes them simple yet prone to local minima. In this paper, an improved simulated annealing (SA) algorithm for dynamic path planning is proposed. To reduce its computational effort, the initial path selection method and deletion operation are introduced. Simulation results show the improved SA algorithm outperforms other algorithms and provides optimal solutions in static and dynamic environments.