Path planning of mobile robot based on improved ant colony algorithm

摘要

Planning of the mobile robot is one of the core research areas which is complex, binding and non-linear. Ant colony algorithm is an intelligent optimization algorithm developed in recent years. Aiming at the problems of the ant colony algorithm such as slow convergence speed and long computation cycle, in order to improve the efficiency of route planning, proposed using improved ant colony algorithm for mobile robot path planning. In the existing basic Ant colony algorithm based on the simplified the pheromone storage method, improve operation efficiency and the stability of the algorithm. Through multiple MATLAB experiments, it is improved in convergence speed and the efficiency of ant colony algorithm.