| On Finding Narrow Passages with Probabilistic Roadmap Planners (2002) | |||||||||||||||||
Abstract | |||||||||||||||||
| This paper provides foundations for understanding the effect of passages on the connectedness of probabilistic roadmaps. It also proposes a new random sampling scheme for finding such passages. An initial roadmap is built in a "dilated" free space allowing some penetration distance of the robot into the obstacles. This roadmap is then modified by resampling around the links that do not lie in the true free space. Experiments show that this strategy allows relatively small roadmaps to reliably capture the free space connectivity | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||