Abstract & Overview
Ant colony algorithm is an intelligent optimization algorithm that is widely used in path planning for mobile robot due to its advantages, such as good feedback information, strong robustness and better distributed computing. However, it has some problems such as the slow convergence and the prematurity. This article introduces an improved ant colony algorithm that uses a stimulating probability to help the ant in its selection of the next grid and employs new heuristic information based on the principle of unlimited step length to expand the vision field and to increase the visibility accuracy; and also the improved algorithm adopts new pheromone updating rule and dynamic adjustment of the evaporation rate to accelerate the convergence speed and to enlarge the search space. Simulation results prove that the proposed algorithm overcomes the shortcomings of the conventional algorithms.