Algorithms – ESA 2011

Volume 6942 of the series Lecture Notes in Computer Science pp 493-505

Motion Planning via Manifold Samples

  • Oren SalzmanAffiliated withTel-Aviv University
  • , Michael HemmerAffiliated withTel-Aviv University
  • , Barak RavehAffiliated withTel-Aviv UniversityHebrew University
  • , Dan HalperinAffiliated withTel-Aviv University

* Final gross prices may vary according to local VAT.

Get Access


We present a general and modular algorithmic framework for path planning of robots. Our framework combines geometric methods for exact and complete analysis of low-dimensional configuration spaces, together with sampling-based approaches that are appropriate for higher dimensions. We suggest taking samples that are entire low-dimensional manifolds of the configuration space. These samples capture the connectivity of the configuration space much better than isolated point samples. Geometric algorithms then provide powerful primitive operations for complete analysis of the low-dimensional manifolds. We have implemented our framework for the concrete case of a polygonal robot translating and rotating amidst polygonal obstacles. To this end, we have developed a primitive operation for the analysis of an appropriate set of manifolds using arrangements of curves of rational functions. This modular integration of several carefully engineered components has lead to a significant speedup over the PRM sampling-based algorithm, which represents an approach that is prevalent in practice.