A*-TEB: An Improved A* Algorithm Based on the TEB Strategy for Multi-Robot Motion Planning

A*-TEB:一种基于TEB策略的改进型A*算法,用于多机器人运动规划

阅读:1

Abstract

Multi-robot motion planning (MRMP) requires each robot to possess strong local planning capabilities while maintaining global consistency. However, existing research often fails to address both global and local planning simultaneously, resulting in conflicts in real-time path execution. The A* algorithm is widely used for global path planning due to its adaptability and search efficiency, while the Timed Elastic Band (TEB) algorithm excels in local trajectory optimization and real-time dynamic obstacle avoidance. This paper presents a novel motion planning framework integrating an improved A* algorithm with an enhanced TEB strategy to address both levels of planning collaboratively. The proposed improvements include the introduction of steering costs and dynamic weights into the A* algorithm to enhance path smoothness and efficiency, and a hierarchical obstacle treatment in TEB for improved local avoidance. Simulation and real-world experiments conducted with ROS confirmed the feasibility and effectiveness of the method. Compared to the traditional A* algorithm, the proposed framework reduces the average path length by 5.2%, shortens completion time by 11.5%, and decreases inflection points by 66.7%, demonstrating superior performance for multi-robot systems in dynamic environments.

特别声明

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

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

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

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