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

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.