Motion planning among time dependent obstacles

DOI10.1007/BF02915447zbMath0633.68117MaRDI QIDQ1096427

Klaus Sutner, Wolfgang Maass

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

motion planningpolynomial-time algorithmsmoving obstaclestime-dependent graphsc-hullpath existence problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Paths and cycles (05C38) Artificial intelligence (68T99) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (7)

Time-dependent routing problems: a review ⋮ A survey of motion planning and related geometric algorithms ⋮ The Computational Complexity of Portal and Other 3D Video Games ⋮ Time-minimal paths amidst moving obstacles in three dimensions ⋮ Fastest path across constrained moving rectilinear obstacles ⋮ Dynamic motion planning in low obstacle density environments ⋮ Dynamic motion planning in low obstacle density environments

Cites Work

• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Strong NP-hardness of moving many discs
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• On the Movement of Robot Arms in 2-Dimensional Bounded Regions
• Motion planning in the presence of moving obstacles

This page was built for publication: Motion planning among time dependent obstacles