A new path planning strategy integrating improved ACO and DWA algorithms for mobile robots in dynamic environments.

ABSTRACT

This article is concerned with the path planning of mobile robots in dynamic environments. A new path planning strategy is proposed by integrating the improved ant colony optimization (ACO) and dynamic window approach (DWA) algorithms. An improved ACO is developed to produce a globally optimal path for mobile robots in static environments. Through improvements in the initialization of pheromones, heuristic function, and updating of pheromones, the improved ACO can lead to a shorter path with fewer turning points in fewer iterations. Based on the globally optimal path, a modified DWA is presented for the path planning of mobile robots in dynamic environments. By deleting the redundant nodes, optimizing the initial orientation, and improving the evaluation function, the modified DWA can result in a more efficient path for mobile robots to avoid moving obstacles. Some simulations are conducted in different environments, which confirm the effectiveness and superiority of the proposed path planning algorithms.