Skip to main content
SpringerLink
Log in

\({\mathrm {RRT^{X}}}\): Real-Time Motion Planning/Replanning for Environments with Unpredictable Obstacles

  • Chapter
  • First Online:
Algorithmic Foundations of Robotics XI

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 107))

Abstract

We present \({\mathrm {RRT^{X}}}\), the first asymptotically optimal sampling-based motion planning algorithm for real-time navigation in dynamic environments (containing obstacles that unpredictably appear, disappear, and move). Whenever obstacle changes are observed, e.g., by onboard sensors, a graph rewiring cascade quickly updates the search-graph and repairs its shortest-path -to-goal subtree. Both graph and tree are built directly in the robot’s state space, respect the kinematics of the robot, and continue to improve during navigation. \({\mathrm {RRT^{X}}}\) is also competitive in static environments—where it has the same amortized per iteration runtime as RRT and RRT* \(\varTheta \left( \log {n}\right) \) and is faster than RRT# \(\omega \left( \log ^2{n}\right) \). In order to achieve \(O\left( \log {n}\right) \) iteration time, each node maintains a set of \(O\left( \log {n}\right) \) expected neighbors, and the search graph maintains \(\epsilon \)-consistency for a predefined \(\epsilon \).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    “\(\epsilon \)-consistency” means that the cost-to-goal stored at each node is within \(\epsilon \) of its look-ahead cost-to-goal, where the latter is the minimum sum of distance-to-neighbor plus neighbor’s cost-to-goal.

  2. 2.

    (1) Allows graph inconsistency. (2) Prevents the practical realization of some paths.

  3. 3.

    Replanning algorithms find a sequence of solutions to the same goal state “on-the-fly” versus an evolving obstacle configuration and start state, and are distinct from multi-query algorithms (e.g., PRM [6]) and single-query algorithms (e.g., RRT [10]).

  4. 4.

    The use of the term “dynamic” to indicate that an environment is “unpredictably changing” comes from the artificial intelligence literature. It should not be confused with the “dynamics” of classical mechanics.

  5. 5.

    For example, if \(\mathcal {X}\subset \mathbb {R}^d\) space, \(\mathbb {T}\) is time, and obstacle movement is known a priori, obstacles are stationary with respect to \({\hat{\mathcal {X}} \subset \left( \mathbb {R}^d \times \mathbb {T}\right) }\) space-time.

  6. 6.

    In particular, if a node \(u\) receives an \(\epsilon \)-cost decrease \(> \epsilon \) via another node \(v\), then \(u\) agrees to take responsibility for the runtime associated with that exchange (i.e., including it as part \(u\)’s next propagation time).

  7. 7.

    i.e., because the number of neighbors of a node converges to the function \(\log {n}\) with probability 1 (as explained in Lemma 5).

  8. 8.

    Note that neighbors that are not removed during a cull are touched again during the RRT*-like rewiring operation that necessarily follows a cull operation.

References

  1. Arslan, O., Tsiotras, P.: Use of relaxation methods in sampling-based algorithms for optimal motion planning. In: IEEE International Conference on Robotics and Automation (ICRA), 2013. pp. 2421–2428, IEEE (2013)

    Google Scholar 

  2. Bruce, J., Veloso, M.: Real-time randomized path planning for robot navigation. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 3, pp. 2383–2388 (2002)

    Google Scholar 

  3. Ferguson, D., Kalra, N., Stentz, A.: Replanning with rrts. In: IEEE International Conference on Robotics and Automation. pp. 1243–1248, May (2006)

    Google Scholar 

  4. Gayle, R., Klingler, K., Xavier, P.: Lazy reconfiguration forest (lrf)—an approach for motion planning with multiple tasks in dynamic environments. In: IEEE International Conference on Robotics and Automation, pp. 1316–1323, April 2007

    Google Scholar 

  5. Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846–894 (2011)

    Article  Google Scholar 

  6. Kavraki, L., Svestka, P., Latombe, J., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566–580 (1996)

    Article  Google Scholar 

  7. Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. J. 155(1–2), 93–146 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Koenig, S., Likhachev, M., Furcy, D.: D* lite. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 476–483 (2002)

    Google Scholar 

  9. LaValle, S.: Planning Algorithms. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  10. LaValle, S., Kuffner, J.J.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378–400 (2001)

    Article  Google Scholar 

  11. Lavalle, S.M., Lindemann, S.: Simple and efficient algorithms for computing smooth, collision-free feedback laws over given cell decompositions. Int. J. Robot. Res. 28(5), 600–621 (2009)

    Article  Google Scholar 

  12. Marble, J.D., Bekris, K.E.: Asymptotically near-optimal planning with probabilistic roadmap spanners. IEEE Trans. Robot. 29(2), 432–444 (2013)

    Article  Google Scholar 

  13. Otte, M.: Videos of RRTX simulations in various state spaces (March 2014), http://tinyurl.com/l53gzgd

  14. Otte, M.: Any-com multi-robot path planning. Ph.D. thesis, University of Colorado at Boulder (2011)

    Google Scholar 

  15. Rimon, E., Koditschek, D.E.: Exact robot navigation using artificial potential functions. IEEE Trans. Robot. Autom. 8(5), 501–518 (1992)

    Article  Google Scholar 

  16. Salzman, O., Halperin, D.: Asymptotically near-optimal rrt for fast, high-quality, motion planning. arXiv:1308.0189v3 (2013)

  17. Stentz, A.: The focussed D* algorithm for real-time replanning. In: Proceedings of the International Joint Conference on Artificial Intelligence, Aug 1995

    Google Scholar 

  18. Tedrake, R., Manchester, I.R., Tobenkin, M., Roberts, J.W.: Lqr-trees: Feedback motion planning via sums-of-squares verification. Int. J. Robot. Res. 29(8), 1038–1052 (2010)

    Article  Google Scholar 

  19. Zucker, M., Kuffner, J., Branicky, M.: Multipartite rrts for rapid replanning in dynamic environments. In: IEEE International Conference on Robotics and Automation. pp. 1603–1609, April 2007

    Google Scholar 

Download references

Acknowledgments

This work was supported by the Air Force Office of Scientific Research, grant #FA-8650-07-2-3744.

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Michael Otte & Emilio Frazzoli

Authors
  1. Michael Otte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emilio Frazzoli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Otte .

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Bogazici University, Istanbul, Turkey

    H. Levent Akin

  2. Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA

    Nancy M. Amato

  3. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, Minnesota, USA

    Volkan Isler

  4. Department of Information and Computing Sciences, Utrecht University, Utrecht, Utrecht, The Netherlands

    A. Frank van der Stappen

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Otte, M., Frazzoli, E. (2015). \({\mathrm {RRT^{X}}}\): Real-Time Motion Planning/Replanning for Environments with Unpredictable Obstacles. In: Akin, H., Amato, N., Isler, V., van der Stappen, A. (eds) Algorithmic Foundations of Robotics XI. Springer Tracts in Advanced Robotics, vol 107. Springer, Cham. https://doi.org/10.1007/978-3-319-16595-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16595-0_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-16594-3

  • Online ISBN: 978-3-319-16595-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation