Abstract
This paper contains two main results: First, we revisit the well-known visibility based pursuit-evasion problem and show that, in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simply-connected polygonal environment using a randomized strategy. The evader can be arbitrarily faster than the pursuer and it may know the position of the pursuer at all times but it does not have prior knowledge of the random decisions made by the pursuer. Second, using the randomized algorithm together with the solution of a known lion and man problem [12] as subroutines, we present a strategy for two pursuers (one of which is at least as fast as the evader) to quickly capture an evader in a simply-connected polygonal environment.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Isler, V., Kannan, S., Khanna, S. Locating and Capturing an Evader in a Polygonal Environment. In: Erdmann, M., Overmars, M., Hsu, D., van der Stappen, F. (eds) Algorithmic Foundations of Robotics VI. Springer Tracts in Advanced Robotics, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10991541_18
Download citation
DOI: https://doi.org/10.1007/10991541_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25728-8
Online ISBN: 978-3-540-31506-3
eBook Packages: EngineeringEngineering (R0)