Abstract
Aiming at the ant colony algorithm's(ACO) blind search, leads to slow search speed, easy to fall into the local optimum problem, etc., a fusion algorithm of multi-heuristic factor ant colony algorithm, Dynamic Window Approaches(DWA) algorithm is proposed. First, the convergence speed of ACO algorithm is improved by improving the heuristic function, optimizing the pheromone updating mechanism, obtaining the global optimal path of the robot. Then, the key point of the optimal path is extracted as the local path planning node, and the DWA algorithm is improved by adjusting the dynamic window size, adding adaptive speed adjustment, and the improved DWA algorithm is used to carry out the local path planning among the nodes to obtain the optimal path after fusion. Finally, the proposed algorithm is simulated and tested in a dynamic environment to verify the effectiveness of the algorithm. The proposed pre-calculated method avoids dynamic obstacles to achieve the local planning effect, and the better route planned by the fusion algorithm is obtained. Simulation results show that the improved algorithm can quickly, accurately find the optimal path, and compared with the traditional algorithm, the number of iterations of the improved algorithm is reduced by 80%, and the comprehensive index and the number of iteration stabilization are improved by 30%.