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.3160360305zbMath0554.51007OpenAlexW2001804342MaRDI QIDQ3217189
Jacob T. Schwartz, Micha Sharir
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
Related Items
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Models and motion planning, A solution to the two-dimensional findpath problem, Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams, Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles, Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram, Motion planning among time dependent obstacles, Partitioning and separating sets of orthogonal polygons, A search algorithm for motion planning with six degrees of freedom, Optimal piecewise linear motion of an object among obstacles, Geometry and search in motion planning., On the two-dimensional Davenport-Schinzel problem, Time-optimal trajectories of a rod in the plane subject to velocity constraints, Mobile robot map making using sonar, On-line motion planning: Case of a planar rod, Coordinated motion planning for two independent robots, A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space, Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape, Lower bounds on moving a ladder in two and three dimensions, Algorithmic and complexity issues of robot motion in an uncertain environment, A survey of motion planning and related geometric algorithms, Moving a food trolley around a corner, On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, Motion planning algorithms for molecular simulations: a survey, Arrangements of curves in the plane --- topology, combinatorics, and algorithms, Polygon placement under translation and rotation, Partitioning a planar assembly into two connected parts is NP-complete, Discrete warehouse problem, Continuous alternation: the complexity of pursuit in continuous domains, Shortest paths for line segments, Motion planning via manifold samples, Models and motion planning, Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance, On the general motion-planning problem with two degrees of freedom, An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space, Rods and Rings: Soft Subdivision Planner for R^3 x S^2., On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds, On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, Voronoi diagrams with barriers and on polyhedra for minimal path planning, Characterizing the shortest path of an object among obstacles, Fast composition of sparse maps, The complexity of the free space for motion planning amidst fat obstacles, An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations, On the complexity of assembly partitioning, The complexity of the free space for a robot moving amidst fat obstacles, On soft predicates in subdivision motion planning, Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds
Cites Work
