A framework for pursuit evasion games in
From MaRDI portal
Publication:1044718
DOI10.1016/j.ipl.2005.04.012zbMath1179.91044OpenAlexW2066580552MaRDI QIDQ1044718
Swastik Kopparty, Chinya V. Ravishankar
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.04.012
Related Items
Cops and Robbers on Geometric Graphs, A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment, Cooperative pursuit with Voronoi partitions, The lion and man game on polyhedral surfaces with obstacles, Total curvature and simple pursuit on domains of curvature bounded above, On the advantage of centralized strategies in the three-pursuer single-evader game, \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas, Equal-speed pursuit and evasion on manifolds, Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas, Motion patterns and phase-transition of a defender-intruder problem and optimal interception strategy of the defender, Formulation of a cooperative-confinement-escape problem of multiple cooperative defenders against an evader escaping from a circular region, Capture bounds for visibility-based pursuit evasion, A new class of pursuer strategies for the discrete-time lion and man problem, Line-of-Sight Pursuit in Monotone and Scallop Polygons, ``Lion-man and the fixed point property, Chasing robbers on random geometric graphs-an alternative approach, A discrete-time pursuit-evasion game in convex polygonal environments
Cites Work
- Simple algorithms for searching a polygon with flashlights
- “Lion and Man”: Upper and Lower Bounds
- Kinetics of a diffusive capture process: lamb besieged by a pride of lions
- Randomized Pursuit-Evasion in Graphs
- Visibility-based pursuit-evasion in a polygonal environment
- Solution of David Gale's lion and man problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
