On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
From MaRDI portal
Publication:3217189
DOI10.1002/CPA.3160360305zbMATH Open0554.51007OpenAlexW2001804342MaRDI QIDQ3217189FDOQ3217189
Authors: Micha Sharir, Jacob T. Schwartz 
Publication date: 1983
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpa.3160360305
Recommendations
- scientific article; zbMATH DE number 3951430
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
Cites Work
Cited In (66)
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
- Finding feasible paths for a two-point body
- Pianos are not flat: rigid motion planning in three dimensions
- A solution to the two-dimensional findpath problem
- Title not available (Why is that?)
- Computing push plans for disk-shaped robots
- Mobile robot map making using sonar
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Algorithmic and complexity issues of robot motion in an uncertain environment
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- Continuous alternation: the complexity of pursuit in continuous domains
- Shortest paths for line segments
- Title not available (Why is that?)
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
- Trajectory planning for an articulated probe
- A survey of motion planning and related geometric algorithms
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- On the complexity of assembly partitioning
- On-line motion planning: Case of a planar rod
- Optimal piecewise linear motion of an object among obstacles
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Lower bounds on moving a ladder in two and three dimensions
- Obstacle growing in a nonpolygonal world
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Coordinated motion planning for two independent robots
- Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds
- Models and motion planning
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- A :20piano movers' '
- Polygon placement under translation and rotation
- Computing the configuration space for a robot on a mesh-of-prosessors
- Moving a food trolley around a corner
- The complexity of cylindrical algebraic decomposition with respect to polynomial degree
- The complexity of the free space for a robot moving amidst fat obstacles
- On soft predicates in subdivision motion planning
- Geometry and search in motion planning.
- On the mobility of bodies in ℝn
- On the general motion-planning problem with two degrees of freedom
- Partitioning and separating sets of orthogonal polygons
- Moving a disc between polygons
- A “retraction” method for planning the motion of a disc
- Motion planning algorithms for molecular simulations: a survey
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
- The complexity of the free space for motion planning amidst fat obstacles
- Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
- An O(n2) shortest path algorithm for a non-rotating convex body
- A search algorithm for motion planning with six degrees of freedom
- Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles
- Characterizing the shortest path of an object among obstacles
- On the two-dimensional Davenport-Schinzel problem
- Motion planning among time dependent obstacles
- Time-optimal trajectories of a rod in the plane subject to velocity constraints
- Title not available (Why is that?)
- Fast composition of sparse maps
- Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
- Partitioning a planar assembly into two connected parts is NP-complete
- Discrete warehouse problem
- Motion planning with inertial constraints
- Models and motion planning
This page was built for publication: On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217189)
