Sciweavers

Share
IROS
2009
IEEE

On the performance of random linear projections for sampling-based motion planning

9 years 5 months ago
On the performance of random linear projections for sampling-based motion planning
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties such as coverage, as it is impractical to compute and store this information in the original space. Such estimates help motion planners determine the regions of space that merit further exploration. In general, the employed projections are user-defined, and to the authors’ knowledge, automatically computing them has not yet been investigated. In this work, the feasibility of offline-computed random linear projections is evaluated within the context of a state-of-the art samplingbased motion planning algorithm. For systems with moderate dimension, random linear projections seem to outperform human intuition. For more complex systems it is likely that non-linear projections would be better suited.
Ioan Alexandru Sucan, Lydia E. Kavraki
Added 24 May 2010
Updated 24 May 2010
Type Conference
Year 2009
Where IROS
Authors Ioan Alexandru Sucan, Lydia E. Kavraki
Comments (0)
books