In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restrictive capture condition: a pursuer must become colocated with the evader to win the game. We prove two general results about this adversarial motion planning problem in geometric spaces. First, we show that one pursuer has a winning strategy in any compact CAT(0) space. This complements a result of Alexander, Bishop and Ghrist, who provide a winning strategy for a game with positive capture radius. Second, we consider the game played in a compact domain in Euclidean two-space with piecewise analytic boundary and arbitrary Euler characteristic. We show that three pursuers always have a winning strategy by extending recent work of Bhadauria, Klein, Isler and Suri from polygonal environments to our more general setting.
@article{1060,
title = {Pursuit-evasion in a two-dimensional domain},
journal = {ARS MATHEMATICA CONTEMPORANEA},
volume = {14},
year = {2017},
doi = {10.26493/1855-3974.1060.031},
language = {EN},
url = {http://dml.mathdoc.fr/item/1060}
}
Beveridge, Andrew; Cai, Yiqing. Pursuit-evasion in a two-dimensional domain. ARS MATHEMATICA CONTEMPORANEA, Tome 14 (2017) . doi : 10.26493/1855-3974.1060.031. http://gdmltest.u-ga.fr/item/1060/