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

基于改进蚁群算法并经Floyd算法优化的平滑路径规划方法研究

阅读:1

Abstract

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.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。