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
Binary Labelings for Plane Quadrangulations and their Relatives
TL;DR: As Schnyder labelings have been extended to 3-connected plane graphs, this work is able to extend its labeling from quadrangulations to a larger class of 2-connected bipartite graphs.
Journal ArticleDOI
The polytope of non-crossing graphs on a planar point set
David Orden,Francisco Santos +1 more
TL;DR: In this article, a simple polyhedron whose face poset is isomorphic to the poset of non-crossing marked graphs with vertex set is defined, where a marked graph is defined as a geometric graph together with a subset of its vertices.
Book ChapterDOI
Parallel-redrawing mechanisms, pseudo-triangulations and kinetic planar graphs
TL;DR: In this article, the authors study parallel redrawing graphs, which are planar graphs embedded on moving point sets in such a way that edges maintain their slopes all throughout the motion.
Journal ArticleDOI
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
TL;DR: For combinatorial pointed pseudotriangulations where faces have size 3 or 4, the authors of as discussed by the authors showed that the ip graph of combinatorially 4-PPTs is stretchable to a geometric pseudo-triangulation.
Posted Content
Computational Geometry Column 43
TL;DR: The concept of pointed pseudo-triangulations is defined and a few of its applications described.
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