Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm
From MaRDI portal
Publication:3564528
DOI10.1007/978-3-540-85640-5_5zbMATH Open1188.93116OpenAlexW2198789552MaRDI QIDQ3564528FDOQ3564528
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5936273
- A rapid-exploring random tree algorithm for path planning of robot based on the grid method
- Rapidly-exploring random trees motion planning for non-holonomic robot with collision-test and regression mechanism
- Algorithmic Motion Planning: The Randomized Approach
- Nonpreemptive Ensemble Motion Planning on a Tree
Cites Work
- Title not available (Why is that?)
- Planning Algorithms
- Spatial Planning: A Configuration Space Approach
- Robot motion planning with uncertainty in control and sensing
- Kinodynamic motion planning
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Rapidly-exploring random trees: Progress and prospects
- Title not available (Why is that?)
- Title not available (Why is that?)
- Map focus: A way to reconcile reactivity and deliberation in multirobot systems
Cited In (6)
- Rapidly-exploring random trees: Progress and prospects
- Rapidly-exploring random trees motion planning for non-holonomic robot with collision-test and regression mechanism
- Steps toward derandomizing RRTs
- A rapid-exploring random tree algorithm for path planning of robot based on the grid method
- Sampling-based algorithm for testing and validating robot controllers
- Title not available (Why is that?)
This page was built for publication: Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564528)
