A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
2015
International journal of computational geometry and applications
We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader e is chased by pursuers p 1 , p 2 , . . . , p ℓ . The players have full information about the environment and the location of the other players. The pursuers are allowed to coordinate their actions. On the pursuer turn, each p i can move to any point at distance at most 1 from his current location. On the evader turn, he moves similarly. The pursuers win if some pursuer becomes
doi:10.1142/s0218195915500065
fatcat:onmb62lzfrg3haigd3fr5onezu