Research on Global Path of AGV Based on Improved Ant Colony Algorithm
YAN Changgang
GE Yuan
GAO Ang
Abstract：The route of AGV parts distribution is planned based on ant colony algorithm,and the actual working environment is simulated by grid diagram.Aiming at the problems of slow convergence speed and local optimization of ant colony algorithm,the heuristic information of targets,obstacles and nodes is proposed to be added and improved,and the ant route is selected according to the principle of survival of the fittest,so that the ant search has a certain direction and the search efficiency of ant colony algo-rithm is improved.The update strategy of increasing the gradient of arithmetic progression and decreasing the volatilization of adap-tive volatilization coefficient is adopted in the path pheromone,which expands the search range in the early stage of the current itera-tion,reduces the phenomenon of path crossing and deadlock,avoids blind search,and improves the convergence speed of ant colo-ny algorithm.Finally,through Matlab simulation platform,the optimal path length,convergence rate and global search ability of the improved algorithm and the original ant colony algorithm are compared in the same environment,and the effectiveness of the im-proved method is verified.
Keywords：AGVplanning of path trackant colony algorithm
Publication Date：2025-05-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 1322-1326,1355 )