Improved Bidirectional RRT* Algorithm for Robot Path Planning
Open Access
Abstract
In order to address the shortcomings of the traditional bidirectional RRT* algorithm, such as its high degree of randomness, low search efficiency, and the many inflection points in the planned path, we institute improvements in the following directions. Firstly, to address the problem of the high degree of randomness in the process of random tree expansion, the expansion direction of the random tree growing at the starting point is constrained by the improved artificial potential field method; thus, the random tree grows towards the target point. Secondly, the random tree sampling point grown at the target point is biased to the random number sampling point grown at the starting point. Finally, the path planned by the improved bidirectional RRT* algorithm is optimized by extracting key points. Simulation experiments show that compared with the traditional A*, the traditional RRT, and the traditional bidirectional RRT*, the improved bidirectional RRT* algorithm has a shorter path length, higher path-planning efficiency, and fewer inflection points. The optimized path is segmented using the dynamic window method according to the key points. The path planned by the fusion algorithm in a complex environment is smoother and allows for excellent avoidance of temporary obstacles.Keywords
Funding Information
- National Natural Science Foundations of China (52001105, E2022402107, QN2021209, BJ2021012, ZD2021024, 21422301290)
- Natural Science Foundation of Hebei Province (52001105, E2022402107, QN2021209, BJ2021012, ZD2021024, 21422301290)
- University Science and Technology Research Project of Hebei Province (52001105, E2022402107, QN2021209, BJ2021012, ZD2021024, 21422301290)
- Key Projects of Hebei Provincial Department of Education (52001105, E2022402107, QN2021209, BJ2021012, ZD2021024, 21422301290)
- Handan science technology planning project (52001105, E2022402107, QN2021209, BJ2021012, ZD2021024, 21422301290)
This publication has 22 references indexed in Scilit:
- Hybrid Path Planning Based on Safe A* Algorithm and Adaptive Window Approach for Mobile Robot in Large-Scale Dynamic EnvironmentJournal of Intelligent & Robotic Systems, 2020
- A Comprehensive Review of Path Planning Algorithms for Autonomous Underwater VehiclesInternational Journal of Automation and Computing, 2020
- Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rateExpert Systems with Applications, 2019
- Path Planning of Industrial Robot Based on Improved RRT Algorithm in Complex EnvironmentsIEEE Access, 2018
- Power-minimization and energy-reduction autonomous navigation of an omnidirectional Mecanum robot via the dynamic window approach local trajectory planningInternational Journal of Advanced Robotic Systems, 2018
- A Learning-based Multi-RRT Approach for Robot Path Planning in Narrow PassagesJournal of Intelligent & Robotic Systems, 2017
- Optimal path planning in cluttered environment using RRT*-ABIntelligent Service Robotics, 2017
- DUBINS-RRT PATH PLANNING AND HEADING-VECTOR CONTROL GUIDANCE FOR A UUV RECOVERYInternational Journal of Robotics and Automation, 2016
- Investigation of Dynamic Window based navigation algorithms on a real robot2013
- Ant Colony Optimization with Immigrants Schemes in Dynamic Environments2010