Continuous alternation: the complexity of pursuit in continuous domains

DOI10.1007/BF01891838MaRDI QIDQ686740zbMATHOpenAlexFDO

Authors J. Reif, Stephen R. Tate

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)

Recommendations

• The sequential alternative search as a continuous Markov random walk
• Persistent search in single and multiple confined domains: a velocity-jump process model
• Continuous algorithms and stochastic dynamics of extremum search
• On an automaton model of pursuit
• The complexity of pursuit on a graph
• In pursuit of the dynamic optimality conjecture
• Generalization of nonlinear cyclic pursuit
• On the theory of a pursuit in the class of stroboscopic strategies
• scientific article; zbMATH DE number 1023207
• scientific article; zbMATH DE number 1045613

Cites work

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

Cited in

(3)

• On determining optimal strategies in pursuit games in the plane
• On determining optimal strategies in pursuit games in the plane
• Efficient path planning algorithms in reach-avoid problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686740)