Quantitative Analysis of Nearest-Neighbors Search in High-Dimensional Sampling-Based Motion Planning
- 26 August 2008
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The bridge test for sampling narrow passages with probabilistic roadmap plannersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Efficient nearest neighbor searching for motion planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Gaussian sampling strategy for probabilistic roadmap plannersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Randomized Kinodynamic Motion Planning with Moving ObstaclesThe International Journal of Robotics Research, 2002
- On the "dimensionality curse" and the "self-similarity blessing"IEEE Transactions on Knowledge and Data Engineering, 2001
- Lower bounds for high dimensional nearest neighbor search and related problemsPublished by Association for Computing Machinery (ACM) ,1999
- When Is “Nearest Neighbor” Meaningful?Lecture Notes in Computer Science, 1999
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- Multidimensional access methodsACM Computing Surveys, 1998
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996