On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles

DOI10.1002/CPA.3160370605zbMath0554.51009OpenAlexW2014151532MaRDI QIDQ3217190

Micha Sharir

Publication date: 1984

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160370605

zbMATH Keywords

algorithmsroboticsmotion planning problemconnectivity-graph techniquemotion of a general polyhedral body

Mathematics Subject Classification ID

Analytic and descriptive geometry (51N99) Topological geometry (51H99)

Related Items (11)

Optimal piecewise linear motion of an object among obstacles ⋮ Mobile robot map making using sonar ⋮ A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space ⋮ Lower bounds on moving a ladder in two and three dimensions ⋮ A survey of motion planning and related geometric algorithms ⋮ Separating a polyhedron by one translation from a set of obstacles ⋮ On the general motion-planning problem with two degrees of freedom ⋮ Rods and Rings: Soft Subdivision Planner for R^3 x S^2. ⋮ The Voronoi diagram of three lines ⋮ Voronoi diagrams with barriers and on polyhedra for minimal path planning ⋮ An approximation algorithm ford₁-optimal motion of a rod robot with fixed rotations

Cites Work

• Unnamed Item

This page was built for publication: On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles