Movement Problems for 2-Dimensional Linkages
From MaRDI portal
Publication:3716331
DOI10.1137/0213038zbMath0588.68054OpenAlexW2076369477MaRDI QIDQ3716331
Deborah Joseph, John E. Hopcrofts, S. H. 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
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Artificial intelligence (68T99)
Related Items (16)
New algorithms for multilink robot arms ⋮ On boundaries of highly visible spaces and applications ⋮ A tight lower bound for the complexity of path-planning for a disc ⋮ Folding rulers inside triangles ⋮ A survey of motion planning and related geometric algorithms ⋮ On the reconfiguration of chains ⋮ Trajectory planning for an articulated probe ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automated generation of Kempe linkage and its complexity ⋮ Distances in a rigid unit-distance graph in the plane ⋮ 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 ⋮ Randomized query processing in robot path planning ⋮ Nonconvex cases for carpenter's rulers ⋮ Higher-order rigidity -- what is the proper definition?
This page was built for publication: Movement Problems for 2-Dimensional Linkages
