运动规划
蚁群优化算法
数学优化
任意角度路径规划
启发式
路径(计算)
计算机科学
避障
机器人
网格参考
人工智能
移动机器人
数学
程序设计语言
作者
Liwei Yang,Fu Lixia,Ping Li,Jianlin Mao,Ning Guo,Linghao Du
出处
期刊:Mathematical Biosciences and Engineering
[American Institute of Mathematical Sciences]
日期:2022-01-01
卷期号:19 (1): 225-252
被引量:16
摘要
Multi-robot path planning is a hot problem in the field of robotics. Compared with single-robot path planning, complex problems such as obstacle avoidance and mutual collaboration need to be considered. This paper proposes an efficient leader follower-ant colony optimization (LF-ACO) to solve the collaborative path planning problem. Firstly, a new Multi-factor heuristic functor is proposed, the distance factor heuristic function and the smoothing factor heuristic function. This improves the convergence speed of the algorithm and enhances the smoothness of the initial path. The leader-follower structure is reconstructed for the position constraint problem of multi-robots in a grid environment. Then, the pheromone of the leader ant and the follower ants are used in the pheromone update rule of the ACO to improve the search quality of the formation path. To improve the global search capability, a max-min ant strategy is used. Finally, the path is optimized by the turning point optimization algorithm and dynamic cut-point method to improve path quality further. The simulation and experimental results based on MATLAB and ROS show that the proposed method can successfully solve the path planning and formation problem.
科研通智能强力驱动
Strongly Powered by AbleSci AI