Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm
From MaRDI portal
Publication:3564528
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
- scientific article; zbMATH DE number 1305375 (Why is no real title available?)
- scientific article; zbMATH DE number 1871416 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- Kinodynamic motion planning
- Map focus: A way to reconcile reactivity and deliberation in multirobot systems
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Planning Algorithms
- Rapidly-exploring random trees: Progress and prospects
- Robot motion planning with uncertainty in control and sensing
- Spatial Planning: A Configuration Space Approach
Cited in
(6)- scientific article; zbMATH DE number 5936273 (Why is no real title available?)
- 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
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)