Abstract
Motion planning is a critical component for autonomous mobile robots, requiring a solution which is fast enough to serve as a building block, yet easy enough to extend that it can be adapted to new platforms without starting from scratch. This paper presents an algorithm based on randomized planning approaches, which uses a minimal interface between the platform and planner to aid in implementation reuse. Two domains to which the planner has been applied are described. The first is a 2D domain for small-size robot navigation, where the planner has been used successfully in various versions for five years. The second is a true 3D planner for autonomous fixed-wing aircraft with kinematic constraints. Despite large differences between these two platforms, the core planning code is shared across domains, and this flexibility comes with only a small efficiency penalty.
This work was supported by United States Department of the Interior under Grant No. NBCH-1040007, and by Rockwell Scientific Co., LLC under subcontract No. B4U528968 and prime contract No. W911W6-04-C-0058 with the US Army. The views and conclusions contained herein are those of the authors, and do not necessarily reflect the position or policy of the sponsoring institutions, and no official endorsement should be inferred.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Latombe, J.-C.: Robot Motion Planning. Kluwer, Dordrecht (1991)
Kavraki, L.E., Svestka, P., Latombe, J.-C., Overmars, M.H.: Probabalistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12, 566–580 (1996)
Kavraki, L.E., Latombe, J.-C.: Randomized preprocessing of configuration space for fast path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2138–2145. IEEE Computer Society Press, Los Alamitos (1994)
LaValle, S.M.: Rapidly-exploring random trees: A new tool for path planning. In Technical Report No. 98-11 (October 1998)
James, J., Kuffner, J., LaValle, S.M.: Rrt-connect: An efficient approach to single-query path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society Press, Los Alamitos (2000)
Bruce, J., Veloso, M.: Real-time randomized path planning for robot navigation. In: Proceedings of the IEEE Conference on Intelligent Robots and Systems (IROS) (2002)
Kitano, H., Asada, M., Kuniyoshi, Y., Noda, I., Osawa, E.: Robocup: The robot world cup initiative. In: Proceedings of the IJCAI-95 Workshop on Entertainment and AI/ALife (1995)
Lin, M., Gottschalk, S.: Collision detection between geometric models: A survey. In: Proc. of IMA Conference on Mathematics of Surfaces (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruce, J., Veloso, M. (2007). Real-Time Randomized Motion Planning for Multiple Domains. In: Lakemeyer, G., Sklar, E., Sorrenti, D.G., Takahashi, T. (eds) RoboCup 2006: Robot Soccer World Cup X. RoboCup 2006. Lecture Notes in Computer Science(), vol 4434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74024-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-74024-7_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74023-0
Online ISBN: 978-3-540-74024-7
eBook Packages: Computer ScienceComputer Science (R0)