Efficient nearest neighbor searching for motion planning
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 632-637
- https://doi.org/10.1109/robot.2002.1013429
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Randomized kinodynamic planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithms for fast vector quantizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A randomized roadmap method for path and manipulation planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- RRT-connect: An efficient approach to single-query path planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Refinements to nearest-neighbor searching ink-dimensional treesAlgorithmica, 1991
- Dynamic multi-dimensional data structures based on quad- and k—d treesActa Informatica, 1982
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977