A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
From MaRDI portal
Publication:3449119
DOI10.1142/S0218195915500065zbMath1410.91095arXiv1401.2960MaRDI QIDQ3449119
Stephen Ragain, Claire Djang, Andrew Beveridge, Volkan Isler, Brendan P. W. Ames, Rosalie Carlson, Maxray Savage
Publication date: 3 November 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2960
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
Cooperative pursuit with Voronoi partitions, A new class of pursuer strategies for the discrete-time lion and man problem, A discrete-time pursuit-evasion game in convex polygonal environments
Cites Work
- A game of cops and robbers
- A framework for pursuit evasion games in
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
- “Lion and Man”: Upper and Lower Bounds
- Randomized Pursuit-Evasion with Local Visibility
- An algorithm for finding shortest routes from all source nodes to a given destination in general networks
- Solution of David Gale's lion and man problem