Research of hybrid path planning with improved A* and TEB in static and dynamic environments
摘要
In this study, we introduce a new approach to path planning suitable for both static and dynamic environments. Our method combines the Obstacle Avoidance Improved A* (OA-IA*) algorithm with the Time Elastic Band (TEB) technique. The OA-IA* incorporates four key elements: utilization of robot direction information, adaptive adjustment of bandwidth, enhancement of evaluation function, and path smoothing operations. We conducted experiments to validate our approach, including simulations and real-world verifications in various environments. In the simulation experiments, we compared our method with two previous approaches: Improved Local Particle Swarm Optimization (ILPSO) and Obstacle Avoidance RRT (OA-RRT) method. Across seven different simulated maps, the OA-IA* algorithm showed an average improvement of 0.19 in Path Optimal Degree (POD) compared to the ILPSO algorithm, along with an average time savings of 11 s. Furthermore, compared to the OA-RRT algorithm, the OA-IA* algorithm achieved an average POD increase of 0.36, resulting in an average time savings of 60.37 s. Moreover, we compared our method with APF-RRT*, APF-RRT, RRT, and RRT* approaches across 50 simulation maps. On average, our method achieved higher POD values by 0.54, 0.31, 0.85, and 0.26 compared to APF-RRT*, APF-RRT, RRT, and RRT* methods, respectively. Additionally, the average running time of our method was significantly reduced by 90 s, 64.7 s, 38.13 s, and 19.4 s compared to APF-RRT*, APF-RRT, RRT, and RRT* methods, respectively. In the experimental verification section, we tested our method in a real office, laboratory, and workshop environments. In two real-world environments spanning 9.4 m