Details

Autor(en) / Beteiligte

• Wang, Lina
• Wang, Hejing
• Yang, Xin
• Gao, Yanfeng
• Cui, Xiaohong
• Wang, Binrui

Titel

Research on smooth path planning method based on improved ant colony algorithm optimized by Floyd algorithm

Ist Teil von

• Frontiers in neurorobotics, 2022-08, Vol.16, p.955179-955179

Ort / Verlag

Lausanne: Frontiers Research Foundation

Erscheinungsjahr

2022

Quelle

EZB Electronic Journals Library

Beschreibungen/Notizen

• Aiming at the problems of slow convergence and easy fall into local optimal solution of the classic ant colony algorithm in path planning, an improved ant colony algorithm is proposed. Firstly, the Floyd algorithm is introduced to generate the guiding path, and increase the pheromone content on the guiding path. Through the difference in initial pheromone, the ant colony is guided to quickly find the target node. Secondly, the fallback strategy is applied to reduce the number of ants who die due to falling into the trap to increase the probability of ants finding the target node. Thirdly, the gravity concept in the artificial potential field method and the concept of distance from the optional node to the target node are introduced to improve the heuristic function to make up for the fallback strategy on the convergence speed of the algorithm. Fourthly, a multi-objective optimization function is proposed, which comprehensively considers the three indexes of path length, security, and energy consumption and combines the dynamic optimization idea to optimize the pheromone update method, to avoid the algorithm falling into the local optimal solution and improve the comprehensive quality of the path. Finally, according to the connectivity principle and quadratic B-spline curve optimization method, the path nodes are optimized to shorten the path length effectively.