Path Planning for Mobile Robots Based on Improved Ant Colony Optimization

摘要

Although traditional ant colony system (ACS) has the ability of fast convergence, it tends to find local optima. To solve this problem, this paper proposes an improved ant colony system algorithm for path planning of mobile robots by considering two main aspects, including continuous tuning of a setting parameter and the establishment of new mechanisms for pheromone updating. As a result, the ability of global searching of the improved ACS can be significantly enhanced in comparison to the traditional ACS algorithms in deriving an optimal path for mobile robots. Simulation results show the proposed approach has a better performance in terms of shortest distance, mean distance, and successful rate of the optimal paths than those obtained by the traditional ACS algorithms.