Efficient nearest neighbor searching for motion planning

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2002, Pages 632-637

  Atramentov, Anna ^a   LaValle, Steven M ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NEURAL NETWORKS; PROBABILITY; THREE DIMENSIONAL; TREES (MATHEMATICS);

NEAREST NEIGHBOR SEARCHING; PROBABILISTIC ROADMAPS; RAPIDLY-EXPLORING RANDOM TREES;

MOTION PLANNING;

EID: 0036061404     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A randomized roadmap method for path and manipulation planning
2. Choosing good distance metrics and local planners for probabilistic roadmap methods
3. Algorithm for fast vector quantization
4. Approximate nearest neighbor queries in fixed dimensions
5. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions (revised version)
6. Robust hybrid control for autonomous vehicles motion planning
7. An algorithm for finding best matches in logarithmic expected time
8. Approximate nearest neighbors: Towards removing the curse of dimensionality
9. Probabilistic roadmaps for path planning in high-dimensional configuration spaces
10. Two algorithms for nearest-neighbor search in high dimensions
11. RRT-connect: An efficient approach to single-query path planning
12. Rapidly-exploring random trees: A new tool for path planning
13. Randomized kinodynamic planning
14. Rapidly-exploring random trees: Progress and prospects
15. ANN programming manual
16. Dynamic multidimensional data structures based on Quad- and K-D trees
17. Refinements to nearest-neighbor searching in k-dimensional trees