Journal
IEEE TRANSACTIONS ON ROBOTICS
Volume 23, Issue 1, Pages 151-157Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TRO.2006.886840
Keywords
configuration space; kd-trees; nearest-neighbor (NN); searching; probabilistic roadmaps (PRMs); rapidly exploring random trees (RRTs); sampling-based motion planning
Categories
Ask authors/readers for more resources
The cost of nearest-neighbor (NN) calls is one of the bottle-necks in the performance of sampling-based motion-planning algorithms. Therefore, it is crucial to develop efficient techniques for NN searching in configuration spaces arising in motion planning. In this paper, we present and implement an algorithm for performing NN queries in Cartesian products of R, S-1, and RP3, the most common topological spaces in the context A motion planning. Our approach extends the algorithm based on kd-trees, called ANN, developed by Arya and Mount for Euclidean spaces. We prove the correctness of the algorithm and illustrate substantial performance improvement over the brute-force approach and several existing NN packages developed for general metric spaces. Our experimental results demonstrate a clear advantage of using the proposed method for both probabilistic roadmaps and rapidly exploring random trees.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available