DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees

Journal Article · · Journal of Dynamic Systems, Measurement, and Control
DOI: https://doi.org/10.1115/1.4040970 · OSTI ID:1467259

Three algorithms that improve the performance of the asymptotically optimal Rapidly exploring Random Tree (RRT*) are presented here. First, we introduce the Goal Tree (GT) algorithm for motion planning in dynamic environments where unexpected obstacles appear sporadically. The GT reuses the previous RRT* by pruning the affected area and then extending the tree by drawing samples from a shadow set. The shadow is the subset of the free configuration space containing all configurations that have geodesics ending at the goal and are in conflict with the new obstacle. Smaller, well defined, sampling regions are considered for Euclidean metric spaces and Dubins' vehicles. Next, the Focused-Refinement (FR) algorithm, which samples with some probability around the first path found by an RRT*, is defined. The third improvement is the Grandparent-Connection (GP) algorithm, which attempts to connect an added vertex directly to its grandparent vertex instead of parent. The GT and GP algorithms are both proven to be asymptotically optimal. Finally, the three algorithms are simulated and compared for a Euclidean metric robot, a Dubins' vehicle, and a seven degrees-of-freedom manipulator.

Research Organization:
Los Alamos National Laboratory (LANL)
Sponsoring Organization:
USDOE
Grant/Contract Number:
AC52-06NA25396
OSTI ID:
1467259
Report Number(s):
LA-UR-17-24020
Journal Information:
Journal of Dynamic Systems, Measurement, and Control, Journal Name: Journal of Dynamic Systems, Measurement, and Control Journal Issue: 1 Vol. 141; ISSN 0022-0434
Publisher:
ASMECopyright Statement
Country of Publication:
United States
Language:
English

References (16)

Sampling-based algorithms for optimal motion planning journal June 2011
On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents journal July 1957
Motion planning using adaptive random walks journal February 2005
Use of relaxation methods in sampling-based algorithms for optimal motion planning conference May 2013
Anytime Motion Planning using the RRT* conference May 2011
Sampling heuristics for optimal motion planning in high dimensions conference September 2011
Probabilistic roadmaps for path planning in high-dimensional configuration spaces journal January 1996
RRT-connect: An efficient approach to single-query path planning
  • Kuffner, J. J.; LaValle, S. M.
  • 2000 ICRA. IEEE International Conference on Robotics and Automation, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) https://doi.org/10.1109/ROBOT.2000.844730
conference January 2000
Multipartite RRTs for Rapid Replanning in Dynamic Environments conference April 2007
Optimal kinodynamic motion planning in environments with unexpected obstacles conference September 2014
Optimal kinodynamic motion planning using incremental sampling-based methods conference December 2010
Real-time randomized path planning for robot navigation conference January 2002
Replanning with RRTs conference January 2006
Lazy Reconfiguration Forest (LRF) - An Approach for Motion Planning with Multiple Tasks in Dynamic Environments conference April 2007
An elementary approach to generic properties of plane curves journal March 1984
RRT-Smart: Rapid convergence implementation of RRT towards optimal solution conference August 2012