Abstract
© 2014 IEEE. Maintaining clearance, or distance from obstacles, is a vital component of successful motion planning algorithms. Maintaining high clearance often creates safer paths for robots. Contemporary sampling-based planning algorithms That utilize The medial axis, or The set of all points equidistant To Two or more obstacles, produce higher clearance paths. However, They are biased heavily Toward certain portions of The medial axis, sometimes ignoring parts critical To planning, e.g., specific Types of narrow passages. We introduce Uniform Medial Axis Probabilistic RoadMap (UMAPRM), a novel planning variant That generates samples uniformly on The medial axis of The free portion of Cspace. We Theoretically analyze The distribution generated by UMAPRM and show its uniformity. Our results show That UMAPRM's distribution of samples along The medial axis is not only uniform but also preferable To other medial axis samplers in certain planning problems. We demonstrate That UMAPRM has negligible computational overhead over other sampling Techniques and can solve problems The others could not, e.g., a bug Trap. Finally, we demonstrate UMAPRM successfully generates higher clearance paths in The examples.
Original language | English (US) |
---|---|
Title of host publication | 2014 IEEE International Conference on Robotics and Automation (ICRA) |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 5798-5803 |
Number of pages | 6 |
ISBN (Print) | 9781479936854 |
DOIs | |
State | Published - May 2014 |
Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): KUS-C1-016-04
Acknowledgements: This research supported in part by NSF awards CNS-0551685, CCF-0833199, CCF-0830753, IIS-0916053, IIS-0917266, EFRI-1240483, RI-1217991, by NIH NCI R25 CA090301-11, by Chevron, IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King Abdullah Universityof Science and Technology (KAUST). J. Denny supported in part by anNSF Graduate Research Fellowship.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.