Continuous alternation: the complexity of pursuit in continuous domains

DOI10.1007/BF01891838zbMath0798.90146OpenAlexW1963517913MaRDI QIDQ686740

Stephen R. Tate, John H. Reif

Publication date: 13 October 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01891838

zbMATH Keywords

complexityalternationspolyhedral pursuit games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

On determining optimal strategies in pursuit games in the plane ⋮ On determining optimal strategies in pursuit games in the plane

Cites Work

• Unnamed Item
• An algorithm for shortest-path motion in three dimensions
• Motion planning with inertial constraints
• An exact algorithm for kinodynamic planning in the plane
• Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• On the time-optimality of bang-bang trajectories in 𝐑³
• On Shortest Paths in Polyhedral Spaces
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
• Alternation

This page was built for publication: Continuous alternation: the complexity of pursuit in continuous domains