Pages that link to "Item:Q3721314"
From MaRDI portal
The following pages link to On the Piano Movers' problem. III: Coordinating the motion of several independent bodies. The special case of circular bodies moving amidst polygonal barriers (Q3721314):
Displaying 27 items.
- Motion planning among time dependent obstacles (Q1096427) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- A search algorithm for motion planning with six degrees of freedom (Q1097053) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
- On multiple moving objects (Q1102134) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- On the problem of multiple mobile robots cluttering a workspace (Q1193826) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Coordinated motion planning for two independent robots (Q1356168) (← links)
- Motion planning in the presence of movable obstacles (Q1356169) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Planning motions of polyhedral parts by rolling (Q1974472) (← links)
- Multiple object semilinear motion planning (Q2457425) (← links)
- Pianos are not flat: rigid motion planning in three dimensions (Q2921707) (← links)
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers (Q3217189) (← links)
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles (Q3217190) (← links)
- An Effective Framework for Path Planning Amidst Movable Obstacles (Q3564297) (← links)
- Planning Among Movable Obstacles with Artificial Constraints (Q3564299) (← links)
- On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems (Q3721316) (← links)
- Real algebraic geometry and robotics. The complexity of piano moving (Q3989299) (← links)
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function (Q4955867) (← links)
- Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 (Q5102080) (← links)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch (Q5115797) (← links)
- Coordinated motion planning: the video (multimedia exposition) (Q5116536) (← links)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (Q5203793) (← links)
- Multi-robot motion planning for unit discs with revolving areas (Q6110072) (← links)
