Motion planning in the presence of movable obstacles

DOI10.1007/BF01530890zbMath0875.68766MaRDI QIDQ1356169

Gordon Wilfong

Publication date: 9 November 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Push-Pull Block Puzzles are Hard ⋮ Pushing blocks is hard. ⋮ Particle computation: complexity, algorithms, and logic ⋮ Discrete warehouse problem ⋮ On Rearrangement of Items Stored in Stacks

Cites Work

• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Motion planning with inertial constraints
• Planning constrained motion
• Coordinated motion planning for two independent robots
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Kinodynamic motion planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Motion planning in the presence of movable obstacles