4.5 Article

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

期刊

MATHEMATICAL BIOSCIENCES AND ENGINEERING
卷 19, 期 1, 页码 225-252

出版社

AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/mbe.2022012

关键词

multi-robot; leader follower-ant colony algorithm (LF-ACO); formation path planning; dynamic tangent point method

资金

  1. National Natural Science Foundation of China [61163051]
  2. Yunnan Provincial Key R & D Program Project Research on key technologies of industrial robots and its application demonstration in intelligent manufacturing [202002AC080001]

向作者/读者索取更多资源

This paper proposes a leader follower-ant colony optimization (LF-ACO) algorithm to solve the collaborative path planning problem in multi-robot systems. The algorithm incorporates new heuristic functions, leader-follower structure, and path optimization techniques to improve performance.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据