Proceedings ArticleDOI
A combinatorial approach to planar non-colliding robot arm motion planning
Ileana Streinu
- pp 443-453
TLDR
A combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework based on a novel class of one-degree-of-freedom mechanisms induced by pseudo triangulations of planar point sets that yields very efficient deterministic algorithms for a category of robot arm motion planning problems with many degrees of freedom.Abstract:
We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Our approach yields very efficient deterministic algorithms for a category of robot arm motion planning problems with many degrees of freedom, where the known general roadmap techniques would give exponential complexity. It is based on a novel class of one-degree-of-freedom mechanisms induced by pseudo triangulations of planar point sets, for which we provide several equivalent characterization and exhibit rich combinatorial and rigidity theoretic properties. The main application is an efficient algorithm for the Carpenter's rule problem: convexify a simple bar-and-joint planar polygonal linkage using only non self-intersecting planar motions. A step in the convexification motion consists in moving a pseudo-triangulation-based mechanism along its unique trajectory in configuration space until two adjacent edges align. At that point, a local alteration restores the pseudo triangulation. The motion continues for O(n/sup 2/) steps until all the points are in convex position.read more
Citations
More filters
Posted Content
On Reconfiguring Tree Linkages: Trees can Lock
Therese C. Biedl,Erik D. Demaine,Martin L. Demaine,Sylvain Lazard,Anna Lubiw,Joseph O'Rourke,Steve Robbins,Ileana Streinu,Godfried T. Toussaint,Sue Whitesides +9 more
TL;DR: In this paper, it was shown that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion, and that an N$-link tree can have equivalence classes of configurations.
Journal ArticleDOI
Non-Crossing Frameworks with Non-Crossing Reciprocals
David Orden,Günter Rote,Francisco Santos,Brigitte Servatius,Herman Servatius,Walter Whiteley +5 more
TL;DR: It is proved that all self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space, and characteristic geometric properties of the lifts of such non-crossing reciprocal pairs are proved.
Combinatorial Aspects of [Colored] Point Sets in the Plane
TL;DR: This work studies variations of the classical Erdős-Szekeres problems on convex k-gons and k-holes, and investigates the existence of compatible pointed pseudo-triangulations whose union is a maximal plane graph.
Journal ArticleDOI
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
TL;DR: In this paper, a subdivision of the plane that consists of both convex polygons and pseudo-triangles is proposed, which is significantly sparser than either convex decompositions or pseudo triangulations for planar point sets.
Proceedings ArticleDOI
The complexity of (un)folding
TL;DR: It is shown that deciding reconfigurability for trees in two dimensions and for chains in three dimensions is PSPACE-complete.
References
More filters
Journal ArticleDOI
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
TL;DR: Experimental results show that path planning can be done in a fraction of a second on a contemporary workstation (/spl ap/150 MIPS), after learning for relatively short periods of time (a few dozen seconds).
Book
The complexity of robot motion planning
TL;DR: John Canny resolves long-standing problems concerning the complexity of motion planning and, for the central problem of finding a collision free path for a jointed robot in the presence of obstacles, obtains exponential speedups over existing algorithms by applying high-powered new mathematical techniques.
Journal ArticleDOI
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
Jacob T. Schwartz,Micha Sharir +1 more
TL;DR: In this paper, a decision method for finding a continuous motion connecting two given positions and orientations of the whole collection of bodies is presented. But it is not shown that this problem can be solved in polynomial time.
Book
Handbook of convex geometry
Peter M. Gruber,Jörg M. Wills +1 more
TL;DR: This handbook should be useful for mathematicians working in other areas, as well as for econometrists, computer scientists, crystallographers, physicists and engineers who are looking for geometric tools for their own work.
Related Papers (5)
Topologically sweeping visibility complexes via pseudotriangulations
Michel Pocchiola,Gert Vegter +1 more