Abstract
We present a novel single shot random algorithm, named RSRT, for Rapidly-exploring Sorted Random Tree and based on inherent relations analysis between RRT components. Experimental results are realized with a wide set of path planning problems involving a free flying object in a static environment. The results show that our RSRT algorithm is faster than existing ones. These results can also stand as a starting point of a massive motion planning benchmark.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Canny, J.: The complexity of robot motion planning. PhD thesis, Massachusetts Institute of Technology. Artificial Intelligence Laboratory. (1987)
Schwartz, J., Sharir, M.: On the piano movers problem:I, II, III, IV, V. Technical report, New York University, Courant Institute, Department of Computer Sciences (1983)
Latombe, J.: Robot Motion Planning (4th edition). Kluwer Academic (1991)
Lozano-Pérez, T.: Spatial Planning: A Configuration Space Approach. In: Trans. on Computers. (1983)
Donald, B., Xavier, P., Canny, J., Reif, J.: Kinodynamic Motion Planning. Journal of the ACM (1993)
Fraichard, T.: Dynamic trajectory planning with dynamic constraints: a “state-time space” approach. In: Int. Conf. Robotics and Automation (ICRA’93). (1993)
Barraquand, J., Latombe, J.: A Monte-Carlo Algorithm for Path Planning with many degrees of Freedom. In: Int. Conf. on Robotics and Automation (ICRA’90). (1990)
Cheng, P.: Reducing rrt metric sensitivity for motion planning with differential constraints. Master’s thesis, Iowa State University (2001)
LaValle, S.: Planning Algorithms. [on-line book] (2004)http://msl.cs.uiuc.edu/planning/.
LaValle, S.: Rapidly-exploring random trees: A new tool for path planning. Technical Report 98-11, Dept. of Computer Science, Iowa State University (1998)
Ferré, E., Laumond, J.: An iterative diffusion algorithm for part disassembly. In: Int. Conf. Robotics and Automation (ICRA’04). (2004)
Kuffner, J., Nishiwaki, K., Kagami, S., Inaba, M., Inoue, H.: Motion planning for humanoid robots. In: Int’l Symp. Robotics Research (ISRR’03). (2003)
Williams, B.C., B.C., Kim, P., Hofbaur, M., How, J., Kennell, J., Loy, J., Ragno, R., Stedl, J., Walcott, A.: Model-based reactive programming of cooperative vehicles for mars exploration. In: Int. Symp. on Artificial Intelligence, Robotics and Automation in Space. 2001
Tovar, B., LaValle, S., Murrieta, R.: Optimal navigation and object finding without geometric maps or localization. In: Int. Conf. on Robotics and Automation (ICRA’03). (2003)
Simov, B., LaValle, S., Slutzki, G.: A complete pursuit-evasion algorithm for two pursuers using beam detection. In: Int. Conf. on Robotics and Automation (ICRA’02). (2002)
LaValle, S., Kuffner, J.: Randomized kinodynamic planning. In: Int. Conf. on Robotics and Automation (ICRA’99). (1999)
Russell, S., Norvig, P.: Artificial Intelligence, A Modern Approach (2ème édition). Prentice Hall (2003)
Kuffner, J., LaValle, S.: RRT-Connect: An efficient approach to single-query path planning. In: Int. Conf. on Robotics and Automation (ICRA’00). (2000)
LaValle, S., Kuffner, J.: Rapidly-exploring random trees: Progress and prospects. In: Workshop on the Algorithmic Foundations of Robotics (WAFR’00). (2000)
Cheng, P., LaValle, S.: Reducing Metric Sensitivity in Randomized Trajectory Design. In: Int. Conf. on Intelligent Robots and Systems (IROS’01). (2001)
Cheng, P., LaValle, S.: Resolution Complete Rapidly-Exploring Random Trees. In: Int. Conf. on Robotics and Automation (ICRA’02). (2002)
Carpin, S., Pagello, E.: On Parallel RRTs for Multi-robot Systems. In: 8th Conf. of the Italian Association for Artificial Intelligence (AI*IA’02). (2002)
Jouandeau, N., Chérif, A.A.: Fast Approximation to gaussian random sampling for randomized motion planning. In: Int. Symp. on Intelligent Autonomous Vehicules (IAV’04). (2004)
Cortès, J., Siméon, T.: Sampling-based motion planning under kinematic loop-closure constraints. In: Workshop on the Algorithmic Foundations of Robotics (WAFR’04). (2004)
Lindemann, S.R., LaValle, S.M.: Current issues in sampling-based motion planning. In: Int. Symp. on Robotics Research (ISRR’03). (2003)
Lindemann, S., LaValle, S.: Incrementally reducing dispersion by increasing Voronoi bias in RRTs. In: Int. Conf. on Robotics and Automation (ICRA’04). (2004)
Yershova, A., Jaillet, L., Simeon, T., LaValle, S.M.: Dynamic-domain rrts: Efficient exploration by controlling the sampling domain. In: Int. Conf. on Robotics and Automation (ICRA’05). (2005)
Russell, S.: Rationality and Intelligence. In Press, O.U., ed.: Common sense, reasoning, and rationality. (2002)
Gottschalk, S., Lin, M., Manocha, D.: Obb-tree: A hierarchical structure for rapid interference detection. In: Proc. of ACM Siggraph’96. (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jouandeau, N. (2009). Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm. In: Filipe, J., Cetto, J.A., Ferrier, JL. (eds) Informatics in Control, Automation and Robotics. Lecture Notes in Electrical Engineering, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85640-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85640-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85639-9
Online ISBN: 978-3-540-85640-5
eBook Packages: EngineeringEngineering (R0)