AGV path planning combining A* and ant colony algorithm

Abstract

Aiming at the problems of lack of pheromone, slow convergence, and falling into local optimum when the ant colony algorithm is applied to the AGV path planning of Xinjiang cotton factory, a fusion A* ant colony algorithm path planning is proposed. The algorithm first initializes the ant colony pheromone with the two-way search A* heuristic function to solve the problem of low ant colony efficiency in the early stage. Secondly, according to the different times of selection of different paths, different pheromone weights are set, and the pheromone reaches a certain level. The optimal solution converges. The experimental results show that the improved algorithm effectively solves the problems of slow convergence, long search paths and falling into local optima.