Progressive Rapidly-exploring Random Tree for Global Path Planning of Robots
Authors:
- 21 April 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 388-393
Abstract
Global path planning is an essential task for autonomous robots operating on the moon. To increase the efficiency of global path planning, we propose a Progressive Rapidly-exploring Random Tree (P-RRT) algorithm, which improves RRT in three aspects. First, to speed up the convergence rate, we proposed the Feasible Region-aware Ellipse Sampling strategy, which incrementally draws biased samples from an elliptical subspace with the current point and the target point as the focus. Second, we introduce dynamic forward step length to accelerate random tree growth. Third, given the wide range of applications for multi-core processors, we introduce parallel path planning, segmenting global path planning into several processing units, in an effort to further enhance the application efficiency of the algorithm. Finally, the proposed P-RRT is verified by extensive simulation experiments. The experimental results demonstrate the efficiency and practicability of the P-RRT algorithm.Keywords
This publication has 8 references indexed in Scilit:
- Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rateExpert Systems with Applications, 2019
- Genetic Algorithm2018
- Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic2014
- Kinodynamic Planner Dual-Tree RRT (DT-RRT) for Two-Wheeled Mobile Robots Using the Rapidly Exploring Random TreeIEEE Transactions on Industrial Electronics, 2014
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- A comparative study of Artificial Bee Colony algorithmApplied Mathematics and Computation, 2009
- A discrete binary version of the particle swarm algorithm2002
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968