Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm

DOI10.1007/978-3-540-85640-5_5zbMath1188.93116OpenAlexW2198789552MaRDI QIDQ3564528

Nicolas Jouandeau

Publication date: 2 June 2010

Published in: Informatics in Control, Automation and Robotics (Search for Journal in Brave)

Full work available at URL: https://zenodo.org/record/2599679

zbMATH Keywords

motion planningrapidly-exploring sorted random treesingle shot random algorithm

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Robot motion planning with uncertainty in control and sensing
• Spatial Planning: A Configuration Space Approach
• Kinodynamic motion planning
• Map focus: A way to reconcile reactivity and deliberation in multirobot systems
• Planning Algorithms

This page was built for publication: Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm