Robot Path Planning in Dynamic Environments Using a Simulated Annealing Based Approach

This paper proposes a simulated annealing based approach to determine the optimal or near-optimal path quickly for a mobile robot in dynamic environments with static and dynamic obstacles. The approach uses vertices of the obstacles to define the search space. It processes off-line computation based on known static obstacles, and,re-computes the route online if a moving obstacle is detected. The contributions of the work include the employment of the simulated annealing algorithm for robot path planning in dynamic environments, and the development of a new algorithm planner for enhancement of the efficiency of the path planning algorithm. The effectiveness of the proposed approach is demonstrated through simulations under typical dynamic environments and comparisons with existing methods.