Abstract
We present a patrol problem where several patrollers move between locations dispersed throughout an area of interest in order to detect enemy attacks. To formulate an effective patrol policy, the patrollers must take into account travel time between locations, as well as location-specific parameters, which include patroller inspection times, enemy attack times, and cost incurred due to an undetected attack. We consider both random and strategic attackers. A random attacker chooses a location to attack according to a probability distribution, while a strategic attacker plays a two-person zero-sum game with the patrollers. We model the area of interest on a graph and, in some cases, can compute an optimal patrol solution using linear programming. This method, however, becomes computationally intractable as the problem size grows. Therefore, we present efficient heuristics, based on aggregate index values, fictitious play, and shortest paths. Numerical experiments using the heuristic methods produce excellent results on several graph sizes and structures, with computation time orders of magnitude less than what is required to compute an optimal solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
R. Ahuja, T. Magnanti, J. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993)
S. Alpern, Infiltration games on arbitrary graphs. J. Math. Anal. Appl. 163(1), 286–288 (1992)
S. Alpern, Search games on trees with asymmetric travel times. SIAM J. Control Optim. 48(8), 5547–5563 (2010)
S. Alpern, R. Fokkink, Accumulation games on graphs. Networks 64(1), 40–47 (2014)
S. Alpern, S. Gal, Searching for an agent who may or may not want to be found. Oper. Res. 50(2), 311–323 (2002)
S. Alpern, A. Morton, K. Papadaki, Patrolling games. Oper. Res. 59(5), 1246–1257 (2011)
J. Auger, An infiltration game on k arcs. Nav. Res. Logist. 38(4), 511–529 (1991)
R. Avenhaus, Applications of inspection games. Math. Model. Anal. 9(3), 179–192 (2004)
S. Benkoski, M. Monticino, J. Weisinger, A survey of the search theory literature. Nav. Res. Logist. 38, 469–464 (1991)
A. Garnaev, G. Garnaeva, P. Goutal, On the infiltration game. Int. J. Game Theory 26(2), 215–221 (1997)
J. Gittins, K. Glazebrook, R. Weber, Multi-armed Bandit Allocation Indices, 2nd edn. (Wiley, Hoboken, NJ, 2011)
K. Kikuta, A search game with traveling cost on a tree. J. Oper. Res. Soc. Jpn. 38(1), 70–88 (1995)
K. Kikuta, W. Ruckle, Initial point search on weighted trees. Nav. Res. Logist. 41, 821–831 (1994)
K. Kikuta, W. Ruckle, Continuous accumulation games on discrete locations. Nav. Res. Logist. 49(1), 60–77 (2002)
K. Lin, M. Atkinson, T. Chung, K. Glazebrook, A graph patrol problem with random attack times. Oper. Res. 61(3), 694–710 (2013)
R. McGrath, K. Lin, Robust patrol strategies against attacks at dispersed heterogeneous locations. Int. J. Oper. Res. 30(3), 340–358 (2017)
G. Owen, Game Theory, 3rd edn. (Academic, San Diego, CA, 1995)
M. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley-Interscience, New York, NY, 1994)
J. Robinson, An iterative method of solving a game. Ann. Math. 54(2), 296–301 (1951)
S. Ross, Introduction to Probability Models, 10th edn. (Academic, San Diego, CA, 2010)
W. Ruckle, Geometric Games and Their Applications (Pitman, Boston, MA, 1983)
A. Washburn, Two-Person Zero-Sum Games, 3rd edn. (INFORMS, Linthicum, MD, 2003)
A. Washburn, K. Wood, Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243–351 (1995)
K. Zoroa, P. Zoroa, M. Fernandez-Saez, Weighted search games. Eur. J. Oper. Res. 195(2), 394–411 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
McGrath, R.G. (2018). Optimal Patrol on a Graph Against Random and Strategic Attackers. In: Goldengorin, B. (eds) Optimization Problems in Graph Theory. Springer Optimization and Its Applications, vol 139. Springer, Cham. https://doi.org/10.1007/978-3-319-94830-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-94830-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94829-4
Online ISBN: 978-3-319-94830-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)