On search games that include ambush

Journal article (2013)
Department
Delft Institute of Applied Mathematics (EEMCS) (TU Delft)
Copyright: © 2013 SIAM
DOI: https://doi.org/doi:10.1137/110845665
Ambush strategy Noisy search game Poisson process
More Info
expand_more

Published Date

19-12-2013

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

SIAM Journal on Control and Optimization, 51 (6), 2013

ISSN:

0363-0129

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Abstract

We present a stochastic game that models ambush/search in a finite region Q which has area but no other structure. The searcher can search a unit area of Q in unit time or adopt an "ambush" mode for a certain period. The searcher "captures" the hider when the searched region contains the hider's location or if the hider moves while the searcher is in ambush mode. The payoff in this zero sum game is the capture time. Our game is motivated by the (still unsolved) princess and monster game on a star graph with a large number of leaves.

Files

Fokkink_2013.pdf
(pdf | 0.179 Mb)