Optimal path planning for mobile robots based on intensified ant colony optimization algorithm

摘要

Optimal path planning for mobile robots plays an important role in the field of robotics. At present, there are many advanced algorithms used to solve this optimal problem. However, for those algorithms, it is very difficult to solve some path planning problems containing certain constraint conditions due to the complex background environment. Based on the intensified ant colony optimization algorithm, the path planning optimization is carried out with numerical analysis and computations. The simulation results are satisfactory. In this paper, for the first time, intensified ant colony optimization algorithm is used to solve path planning for mobile robots which is a continuous function optimization problem containing constraint conditions. It also provides a new solving approach to the similar problems.