Computing spanners of asymptotically optimal probabilistic roadmaps
- 1 September 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (21530858), 4292-4298
- https://doi.org/10.1109/iros.2011.6095070
Abstract
Asymptotically optimal motion planning algorithms guarantee solutions that approach optimal as more iterations are performed. Nevertheless, roadmaps with this property can grow too large and unwieldy for fast online query resolution. In graph theory there are many algorithms that produce subgraphs, known as spanners, which have guarantees about path quality. Applying such an algorithm to a dense, asymptotically optimal roadmap produces a sparse, asymptotically near optimal roadmap. Experiments performed on typical, geometric problems in SE(3) show that a large reduction in roadmap edges can be achieved with a small increase in path length. Online queries are answered much more quickly with similar results in terms of path quality. This also motivates future work that applies the technique incrementally so edges that won't increase path quality will never be added to the roadmap and won't be checked for collisions.Keywords
This publication has 28 references indexed in Scilit:
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphsRandom Structures & Algorithms, 2006
- Anytime path planning and replanning in dynamic environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Approximate distance oraclesJournal of the ACM, 2005
- Motion planning using dynamic roadmapsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Strong Inapproximability of the Basic k-Spanner ProblemLecture Notes in Computer Science, 2000
- Near-Linear Time Construction of Sparse Neighborhood CoversSIAM Journal on Computing, 1998
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch tSIAM Journal on Computing, 1998
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Graph spannersJournal of Graph Theory, 1989
- Approximating the complete Euclidean graphLecture Notes in Computer Science, 1988