Movement Problems for 2-Dimensional Linkages

DOI10.1137/0213038zbMATH0588.68054OpenAlexW2076369477MaRDI QIDQ3716331FDOQ3716331

Authors John Hopcroft, Deborah Joseph, Sue Whitesides

Publication date 1984

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/6355

zbMATH Keywords

motion planningpolynomial timeroboticsPSPACE-hardmanipulatorsmechanical armsplanar linkages

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Recommendations

• scientific article; zbMATH DE number 2145225
• Lower Bounds for Geometrical and Physical Problems
• New algorithms for multilink robot arms
• On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
• The complexity of (un)folding

Cited in

(24)

• A tight lower bound for the complexity of path-planning for a disc
• Reconfiguring shortest paths in graphs
• New algorithms for multilink robot arms
• The complexity of (un)folding
• Higher-order rigidity -- what is the proper definition?
• On the reconfiguration of chains
• On the geometric definition of the hinge mechanism, Kempe's theorem and overripe mathematics
• Locked and unlocked smooth embeddings of surfaces
• Trajectory planning for an articulated probe
• Randomized query processing in robot path planning
• scientific article; zbMATH DE number 2145225 (Why is no real title available?)
• Nonconvex cases for carpenter's rulers
• On boundaries of highly visible spaces and applications
• Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
• Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases
• A survey of motion planning and related geometric algorithms
• Folding rulers inside triangles
• Stratified deformation space and path planning for a planar closed chain with revolute joints
• Automated generation of Kempe linkage and its complexity
• Computational complexity of puzzles and related topics
• Motion planning and control of a planar polygonal linkage
• Introducing a new NP-hard problem regarding an open chain linkage using an new greedy method
• Distances in a rigid unit-distance graph in the plane
• The Set of Admissible Positions for a Two‐DOF Linkage in the Presence of Obstacles

This page was built for publication: Movement Problems for 2-Dimensional Linkages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716331)