Capturing augmented sensing capabilities and intrusion delay in patrolling-intrusion games

Patrolling-intrusion games are recently receiving more and more attention in the literature. They are twoplayer non zero-sum games where an intruder tries to attack one place of interest and one patroller (or more) tries to capture the intruder. The patroller cannot completely cover the environment following a cycle, otherwise the intruder will successfully strike at least a target. Thus, the patroller employs a randomized strategy. These games are usually studied as leader-follower games, where the patroller is the leader and the intruder is the follower. The models proposed in the state of the art so far present several limitations that prevent their employment in realistic settings. In this paper, we refine the models from the state-of-the-art capturing patroller's augmented sensing capabilities and a possible delay in the intrusion, we propose algorithms to solve efficiently our extensions, and we experimentally evaluate the computational time in some case studies.

[1]  Nicola Basilico,et al.  Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments , 2009, 2009 IEEE International Conference on Robotics and Automation.

[2]  Anthony Stentz Optimal and efficient path planning for partially-known environments , 1994 .

[3]  Sarit Kraus,et al.  Multi-robot perimeter patrol in adversarial settings , 2008, 2008 IEEE International Conference on Robotics and Automation.

[4]  Nicola Basilico,et al.  Extending Algorithms for Mobile Robot Patrolling in the Presence of Adversaries to More Realistic Settings , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

[5]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[6]  Sarit Kraus,et al.  An efficient heuristic approach for security against multiple adversaries , 2007, AAMAS '07.

[7]  Nicola Gatti,et al.  Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form , 2008, ECAI.

[8]  Nicola Basilico,et al.  Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.

[9]  Sarit Kraus,et al.  Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.

[10]  B. Stengel,et al.  Leadership with commitment to mixed strategies , 2004 .

[11]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[12]  M. Dufwenberg Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[13]  Sarit Kraus,et al.  Uncertainties in Adversarial Patrol (Extended Abstract) , 2009 .

[14]  Sarit Kraus,et al.  Uncertainties in adversarial patrol , 2009, AAMAS.

[15]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[16]  Francesco Amigoni,et al.  A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[17]  Sushil J. Louis,et al.  Using a Genetic Algorithm to Explore A*-like Pathfinding Algorithms , 2007, 2007 IEEE Symposium on Computational Intelligence and Games.

[18]  Vincent Conitzer,et al.  Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.

[19]  M. M. Flood THE HIDE AND SEEK GAME OF VON NEUMANN , 1972 .