0
Research Papers

Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees

[+] Author and Article Information
Beth Boardman

Applied Engineering and Technology,
Los Alamos National Laboratory,
Los Alamos, NM 87545
e-mail: bboardman@lanl.gov

Troy Harden

Applied Engineering and Technology,
Los Alamos National Laboratory,
Los Alamos, NM 87545
e-mail: harden@lanl.gov

Sonia Martínez

Professor
Department of Mechanical Engineering,
University of California,
San Diego, CA 92093-0411
e-mail: soniamd@ucsd.edu

1Corresponding author.

Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT,AND CONTROL. Manuscript received May 18, 2017; final manuscript received July 19, 2018; published online August 20, 2018. Assoc. Editor: Suman Chakravorty.

J. Dyn. Sys., Meas., Control 141(1), 011002 (Aug 20, 2018) (10 pages) Paper No: DS-17-1259; doi: 10.1115/1.4040970 History: Received May 18, 2017; Revised July 19, 2018

Three algorithms that improve the performance of the asymptotically optimal Rapidly exploring Random Tree (RRT*) are presented in this paper. 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.

FIGURES IN THIS ARTICLE
<>
Copyright © 2019 by ASME
Topics: Algorithms , Vehicles
Your Session has timed out. Please sign back in to continue.

References

LaValle, S. M. , 2006, Planning Algorithms, Cambridge, UK.
Kavraki, L. E. , Svestka, P. , Latombe, J.-C. , and Overmars, M. H. , 1996, “Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces,” IEEE Trans. Rob. Autom., 12(4), pp. 566–580. [CrossRef]
Waringo, M. , and Henrich, D. , 2006, “Efficient Smoothing of Piecewise Linear Paths With Minimal Deviation,” IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3867–3872.
Carpin, S. , and Pillonetto, G. , 2005, “Motion Planning Using Adaptive Random Walks,” IEEE Trans. Rob., 21(1), pp. 129–136. [CrossRef]
Sánchez, G. , and Latombe, J.-C. , 2003, “A Single-Query Bi-Directional Probabilistic Roadmap Planner With Lazy Collision Checking,” International Symposium on Robotic Research, pp. 403–417.
Karaman, S. , and Frazzoli, E. , 2011, “Sampling-Based Algorithms for Optimal Motion Planning,” Int. J. Rob. Res., 30(7), pp. 846–894. [CrossRef]
Karaman, S. , Walter, M. R. , Perez, A. , Frazzoli, E. , and Teller, S. , 2011, “Anytime Motion Planning Using the RRT*,” IEEE International Conference on Robotics and Automation, pp. 1478–1483.
Perez, A. , Karaman, S. , Shkolnik, A. , Frazzoli, E. , Teller, S. , and Walter, M. R. , 2011, “Asymptotically-Optimal Path Planning for Manipulation Using Incremental Sampling-Based Algorithms,” IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4307–4313.
Shkolnik, A. , and Tedrake, R. , 2011, “Sample-Based Planning With Volumes in Configuration Space,” eprint, .
Arslan, O. , and Tsiotras, P. , 2013, “Use of Relaxation Methods in Sampling-Based Algorithms for Optimal Motion Planning,” In IEEE International Conference on Robotics and Automation, Karlsruhe, Germany, May 6–10, pp. 2421–2428.
Janson, L. , and Pavone, M. , 2015, “Fast Marching Tree: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions,” International Symposium on Robotic Research, Sestri Levante, italy, Sept 12–15, pp. 883–921.
Akgun, B. , and Stilman, M. , 2011, “Sampling Heuristics for Optimal Motion Planning in High Dimensions,” IEEE/RSJ International Conference on Intelligent Robots and Systems, San Francisco, CA, Sept. 25–30, pp. 2640–2645.
Islam, F. , Nasir, J. , Malik, U. , Ayaz, Y. , and Hasan, O. , 2012, “RRT - Smart: Rapid Convergence Implementation of RRT Towards Optimal Solution,” IEEE International Conference on Mechatronics and Automation, Chengdu, China, Aug. 5–8, pp. 1651–1656.
Koenig, S. , and Likhachev, M. , 2002, “ D ⋆ Lite,” Association for the Advancement of Artificial Intelligence, Menlo Park, CA, Vol. 15, pp. 476--483.
Stentz, A. , 1995, “The Focussed D* Algorithm for Real-Time Replanning,” 14th International Joint Conference on Artificial Intelligence, Montreal, QC, Canada, Aug. 20–25, pp. 1652–1659. http://www.frc.ri.cmu.edu/~axs/doc/ijcai95.pdf
Ferguson, D. , Kalra, N. , and Stentz, A. , 2006, “Replanning With RRTs,” IEEE International Conference on Robotics and Automation (ICRA), Orlando, FL, May 15–19, pp. 1243–1248.
Zucker, M. , Kuffner, J. , and Branicky, M. , 2007, “Multipartite RRTs for Rapid Replanning in Dynamic Environments,” IEEE International Conference on Robotics and Automation (ICRA), Roma, Italy, Apr. 10–14, pp. 1603–1609.
Bruce, J. , and Veloso, M. , 2002, “Real-Time Randomized Path Planning for Robot Navigation,” IEEE/RSJ International Conference on Intelligent Robots and Systems, Lausanne, Switzerland, Sept. 30–Oct. 4, pp. 2383–2388.
Li, T.-Y. , and Shie, Y.-C. , 2002, “An Incremental Learning Approach to Motion Planning With Roadmap Management,” In IEEE International Conference on Robotics and Automation (ICRA), Washington, DC, May 11--15, Vol. 4, pp. 3411–3416.
Gayle, R. , Klingler, K. R. , and Xavier, P. G. , 2007, “Lazy Reconfiguration Forest (LRF)—An Approach for Motion Planning With Multiple Tasks in Dynamic Environments,” IEEE International Conference on Robotics and Automation, pp. 1316–1323.
Kuffner, J. J. , LaValle, S. M. , 2000, “RRT-Connect: An Efficient Approach to Single-Query Path Planning,” IEEE International Conference on Robotics and Automation (ICRA), San Francisco, CA, Apr. 24–28, pp. 995–1001.
Otte, M. , and Frazzoli, S. , 2015, “ R R T x: Asymptotically Optimal Single-Query Sampling-Based Motion Planning With Quick Replanning,” Int. J. Rob. Res., 35(7), pp. 797–822.
Boardman, B. , Harden, T. , and Martínez, S. , 2014, “Optimal Kinodynamic Motion Planning in Environments With Unexpected Obstacles,” 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, Sept. 30–Oct 3, pp. 1026–1032.
Boardman, B. , Harden, T. , and Martínez, S. , 2015, “Focused Refinement in the RRT*: Trading Optimality for Improved Performance,” ASME Paper No. DETC2015-46535.
Karaman, S. , and Frazzoli, E. , 2010, “Optimal Kinodynamic Motion Planning Using Incremental Sampling-Based Methods,” IEEE International Conference on Decision and Control (CDC), Atlanta, GA, Dec. 15–17, pp. 7681–7687.
Bruce, J. W. , and Giblin, P. J. , 1984, “An Elementary Approach to Generic Properties of Plane Curves,” Proc. Am. Math. Soc., 90(3), pp. 455–458. [CrossRef]
Dubins, L. E. , 1957, “On Curves of Minimal Length With a Constraint on Average Curvature, and With Prescribed Initial and Terminal Positions and Tangents,” Am. J. Math., 73(3), pp. 497–516. [CrossRef]

Figures

Grahic Jump Location
Fig. 1

An illustrative example on choosing xnew when refining a single path. The rectangle is an obstacle in the environment. The dots are the set of vertices, VΠ, used to determine the region from which xnew is sampled. The k-component of xnew is a uniform random sample between the maximum and minimum (plus and minus ε, respectively) k-component values from VΠ. Next, with respect to xnewk, determine the nearest k-component from VΠ and label its corresponding j-component as xnearestj. Finally, xnewj is a random value from between xnearestj−ε and xnearestj+ε, ε>0. Sample xnew is represented as the green dot.

Grahic Jump Location
Fig. 2

The sampling region for a Dubins' vehicle as described in Definition 4

Grahic Jump Location
Fig. 3

Typical Dubins' vehicle trees in the 25 obstacle environment found by the (a) RRT*, (b) Grandparent-Connection, (c) Grandparent Connection with Focused-Refinement, (d) Focused Refinement, (e) RRT*-Smart, and (f) RRT with path smoothing algorithms

Grahic Jump Location
Fig. 4

Typical Dubins' vehicle trees after replanning in the 26 obstacle environment using the RRT* and GT algorithms: (a) RRT* and (b) Goal Tree

Grahic Jump Location
Fig. 5

The box is added to the environment so that it is in conflict with the manipulator's path

Grahic Jump Location
Fig. 6

The Goal Tree algorithm successfully replans to find a collision-free path

Tables

Errata

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In