Advertisement

Optimal Patrol on a Graph Against Random and Strategic Attackers

  • Richard G. McGrathEmail author
Chapter
  • 832 Downloads
Part of the Springer Optimization and Its Applications book series (SOIA, volume 139)

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.

References

  1. 1.
    R. Ahuja, T. Magnanti, J. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993)Google Scholar
  2. 2.
    S. Alpern, Infiltration games on arbitrary graphs. J. Math. Anal. Appl. 163(1), 286–288 (1992)MathSciNetCrossRefGoogle Scholar
  3. 3.
    S. Alpern, Search games on trees with asymmetric travel times. SIAM J. Control Optim. 48(8), 5547–5563 (2010)MathSciNetCrossRefGoogle Scholar
  4. 4.
    S. Alpern, R. Fokkink, Accumulation games on graphs. Networks 64(1), 40–47 (2014)MathSciNetCrossRefGoogle Scholar
  5. 5.
    S. Alpern, S. Gal, Searching for an agent who may or may not want to be found. Oper. Res. 50(2), 311–323 (2002)MathSciNetCrossRefGoogle Scholar
  6. 6.
    S. Alpern, A. Morton, K. Papadaki, Patrolling games. Oper. Res. 59(5), 1246–1257 (2011)MathSciNetCrossRefGoogle Scholar
  7. 7.
    J. Auger, An infiltration game on k arcs. Nav. Res. Logist. 38(4), 511–529 (1991)MathSciNetCrossRefGoogle Scholar
  8. 8.
    R. Avenhaus, Applications of inspection games. Math. Model. Anal. 9(3), 179–192 (2004)MathSciNetzbMATHGoogle Scholar
  9. 9.
    S. Benkoski, M. Monticino, J. Weisinger, A survey of the search theory literature. Nav. Res. Logist. 38, 469–464 (1991)CrossRefGoogle Scholar
  10. 10.
    A. Garnaev, G. Garnaeva, P. Goutal, On the infiltration game. Int. J. Game Theory 26(2), 215–221 (1997)MathSciNetCrossRefGoogle Scholar
  11. 11.
    J. Gittins, K. Glazebrook, R. Weber, Multi-armed Bandit Allocation Indices, 2nd edn. (Wiley, Hoboken, NJ, 2011)CrossRefGoogle Scholar
  12. 12.
    K. Kikuta, A search game with traveling cost on a tree. J. Oper. Res. Soc. Jpn. 38(1), 70–88 (1995)MathSciNetCrossRefGoogle Scholar
  13. 13.
    K. Kikuta, W. Ruckle, Initial point search on weighted trees. Nav. Res. Logist. 41, 821–831 (1994)MathSciNetCrossRefGoogle Scholar
  14. 14.
    K. Kikuta, W. Ruckle, Continuous accumulation games on discrete locations. Nav. Res. Logist. 49(1), 60–77 (2002)MathSciNetCrossRefGoogle Scholar
  15. 15.
    K. Lin, M. Atkinson, T. Chung, K. Glazebrook, A graph patrol problem with random attack times. Oper. Res. 61(3), 694–710 (2013)MathSciNetCrossRefGoogle Scholar
  16. 16.
    R. McGrath, K. Lin, Robust patrol strategies against attacks at dispersed heterogeneous locations. Int. J. Oper. Res. 30(3), 340–358 (2017)MathSciNetCrossRefGoogle Scholar
  17. 17.
    G. Owen, Game Theory, 3rd edn. (Academic, San Diego, CA, 1995)zbMATHGoogle Scholar
  18. 18.
    M. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley-Interscience, New York, NY, 1994)CrossRefGoogle Scholar
  19. 19.
    J. Robinson, An iterative method of solving a game. Ann. Math. 54(2), 296–301 (1951)MathSciNetCrossRefGoogle Scholar
  20. 20.
    S. Ross, Introduction to Probability Models, 10th edn. (Academic, San Diego, CA, 2010)zbMATHGoogle Scholar
  21. 21.
    W. Ruckle, Geometric Games and Their Applications (Pitman, Boston, MA, 1983)zbMATHGoogle Scholar
  22. 22.
    A. Washburn, Two-Person Zero-Sum Games, 3rd edn. (INFORMS, Linthicum, MD, 2003)Google Scholar
  23. 23.
    A. Washburn, K. Wood, Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243–351 (1995)MathSciNetCrossRefGoogle Scholar
  24. 24.
    K. Zoroa, P. Zoroa, M. Fernandez-Saez, Weighted search games. Eur. J. Oper. Res. 195(2), 394–411 (2009)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.United States Naval AcademyAnnapolisUSA

Personalised recommendations