Continuous alternation: the complexity of pursuit in continuous domains
From MaRDI portal
Publication:686740
DOI10.1007/BF01891838zbMATH Open0798.90146OpenAlexW1963517913MaRDI QIDQ686740FDOQ686740
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
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
Analysis of algorithms and problem complexity (68Q25) Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Alternation
- On Shortest Paths in Polyhedral Spaces
- Motion planning with inertial constraints
- An exact algorithm for kinodynamic planning in the plane
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- An algorithm for shortest-path motion in three dimensions
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds
- On the time-optimality of bang-bang trajectories in 𝐑³
- Title not available (Why is that?)
Cited In (3)
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)
