Abstract
This paper presents a new sampling method for motion planning that can generate configurations more uniformly distributed on C-obstacle surfaces than prior approaches. Here, roadmap nodes are generated from the intersections between C-obstacles and a set of uniformly distributed fixed-length segments in C-space. The results show that this new sampling method yields samples that are more uniformly distributed than previous obstacle-based methods such as OBPRM, Gaussian sampling, and Bridge test sampling. UOBPRM is shown to have nodes more uniformly distributed near C-obstacle surfaces and also requires the fewest nodes and edges to solve challenging motion planning problems with varying narrow passages. © 2012 IEEE.
| Original language | English (US) |
|---|---|
| Title of host publication | 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 2655-2662 |
| Number of pages | 8 |
| ISBN (Print) | 9781467317368 |
| DOIs | |
| State | Published - Oct 2012 |
| Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): KUS-C1–016–04
Acknowledgements: The work of Yeh, Thomas and Amato supported in part by NSF Grants EIA-OI03742, ACR-0081510, ACR-0113971, CCR-0113974, ACI-0326350, CRI-0551685, CCF-0833199, CCF-0830753, by the DOE, Chevron, IBM, Intel, HP, and by King Abdullah University of Science and Technology (KAUST) Award KUS-C1–016–04. The work of Eppstein supported in part by NSF Grants 0830403 and 1217322, and by the Office of Naval Research under MURI grant N00014–08-1–1015.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.