skip to main content
10.1145/2822013.2822036acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmigConference Proceedingsconference-collections
short-paper

RT-RRT*: a real-time path planning algorithm based on RRT*

Published:16 November 2015Publication History

ABSTRACT

This paper presents a novel algorithm for real-time path-planning in a dynamic environment such as a computer game. We utilize a real-time sampling approach based on the Rapidly Exploring Random Tree (RRT) algorithm that has enjoyed wide success in robotics. More specifically, our algorithm is based on the RRT* and informed RRT* variants. We contribute by introducing an online tree rewiring strategy that allows the tree root to move with the agent without discarding previously sampled paths. Our method also does not have to wait for the tree to be fully built, as tree expansion and taking actions are interleaved. To our knowledge, this is the first real-time variant of RRT*.

We demonstrate our method, dubbed Real-Time RRT* (RT-RRT*), in navigating a maze with moving enemies that the controlled agent is required to avoid within a predefined radius. Our method finds paths to new targets considerably faster when compared to CL-RRT, a previously proposed real-time RRT variant.

Skip Supplemental Material Section

Supplemental Material

p113-naderi.mp4

mp4

118 MB

References

  1. Bruce, J., and Veloso, M. 2002. Real-time randomized path planning for robot navigation. In IROS, IEEE.Google ScholarGoogle Scholar
  2. Cannon, J., Rose, K., and Ruml, W. 2012. Real-Time Motion Planning with Dynamic Obstacles. In Symposium on Combinatorial Search.Google ScholarGoogle Scholar
  3. Gammell, D, J., Srinivasa, S, S., Barfoot, and D, T. 2014. Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic. In IROS, IEEE.Google ScholarGoogle Scholar
  4. Gutmann, J.-S., Fukuchi, M., and Fujita, M. 2005. Real-time path planning for humanoid robot navigation. In IJCAI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Hämäläinen, P., Rajamäki, J., and Liu, C. K. 2015. Online Control of Simulated Humanoids Using Particle Belief Propagation. In Proc. SIGGRAPH '15, ACM.Google ScholarGoogle Scholar
  6. Karaman, S., and Frazzoli, E. 2011. Sampling-based Algorithms for Optimal Motion Planning. Int. J. Rob. Res.. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Kavraki, L. E., Švestka, P., Latombe, J.-C., and Overmars, M. H. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom..Google ScholarGoogle ScholarCross RefCross Ref
  8. Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. LaValle, S. M. 1998. Rapidly-Exploring Random Trees: A new Tool for Path Planning.Google ScholarGoogle Scholar
  10. Luders, B. D., Karaman, S., Frazzoli, E., and How, J. P. 2010. Bounds on tracking error using closed-loop rapidly-exploring random trees. In American Control Conference, IEEE.Google ScholarGoogle Scholar
  11. Otte, M., and Frazzoli, E. 2015. RRTX: Real-time motion planning/replanning for environments with unpredictable obstacles. In Algorithmic Foundations of Robotics XI. Springer.Google ScholarGoogle Scholar
  12. Rastgoo, M. N., Nakisa, B., Nasrudin, M. F., Nazri, A., and Zakree, M. 2014. A critical evaluation of literature on robot path planning in dynamic environment. Journal of Theoretical & Applied Information Technology.Google ScholarGoogle Scholar
  13. Song, S., Liu, W., Wei, R., Xing, W., and Ren, C. 2014. Path planning directed motion control of virtual humans in complex environments. Journal of Visual Languages & Computing.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Sturtevant, N. R., Bulitko, V., and Björnsson, Y. 2010. On learning in agent-centered search. In AAMAS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Sud, A., Andersen, E., Curtis, S., Lin, M., and Manocha, D. 2008. Real-time path planning for virtual agents in dynamic environments. In ACM SIGGRAPH 2008 Classes, ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. RT-RRT*: a real-time path planning algorithm based on RRT*

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Other conferences
              MIG '15: Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games
              November 2015
              247 pages
              ISBN:9781450339919
              DOI:10.1145/2822013

              Copyright © 2015 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 16 November 2015

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • short-paper

              Acceptance Rates

              Overall Acceptance Rate-9of-9submissions,100%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader