LF-ACO: An effective formation path planning for multi-mobile robot

28Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Yang, L., Fu, L., Li, P., Mao, J., Guo, N., & Du, L. (2022). LF-ACO: An effective formation path planning for multi-mobile robot. Mathematical Biosciences and Engineering, 19(1), 225–252. https://doi.org/10.3934/mbe.2022012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free