On the Relationship between Classical Grid Search and Probabilistic Roadmaps
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 59-75
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A randomized roadmap method for path and manipulation planning2002
- Randomized Halton sequencesMathematical and Computer Modelling, 2000
- PATH PLANNING IN EXPANSIVE CONFIGURATION SPACESInternational Journal of Computational Geometry & Applications, 1999
- Nets, (t, s)-Sequences, and Algebraic Geometry1998
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- A Random Sampling Scheme for Path Planning1996
- Computation of configuration-space obstacles using the fast Fourier transformIEEE Transactions on Robotics and Automation, 1995
- Kinodynamic motion planningJournal of the ACM, 1993
- A potential field approach to path planningIEEE Transactions on Robotics and Automation, 1992
- A search algorithm for motion planning with six degrees of freedomArtificial Intelligence, 1987