![]() |
CiteULike | ![]() |
ansobol's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Efficient nearest neighbor searching for motion planningRobotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on In Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on, Vol. 1 (2002), pp. 632-637 vol.1.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe present and implement an efficient algorithm for performing nearest-neighbor queries in topological spaces that usually arise in the context of motion planning. Our approach extends the Kd tree-based ANN algorithm, which was developed by Arya and Mount (1993) for Euclidean spaces. We argue the correctness of the algorithm and illustrate its efficiency through computed examples. We have applied the algorithm to both probabilistic roadmaps (PRMs) and rapidly-exploring random trees (RRTs). Substantial performance improvements are shown for motion planning examples.
BibTeX record
RIS record