Introducing alarms in adversarial patrolling games: extended abstract

Authors:
Enrique Munoz de Cote;Ruben Stranders;Nicola Basilico;Nicola Gatti;Nick Jennings
Affiliations:
National Institute of Astrophysics, Optics and Electronics, Tonantzintla, Mexico;University of Southampton, Southampton, United Kingdom;Politecnico di Milano, Milano, Italy;Politecnico di Milano, Milano, Italy;University of Southampton, Southampton, United Kingdom
Venue:
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Year:
2013

Citing 4
Cited 0

Computing the optimal strategy to commit to

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Computing time-dependent policies for patrolling games with mobile targets

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder

Artificial Intelligence
Multi-robot adversarial patrolling: facing a full-knowledge opponent

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adversarial patrolling games (APGs) can be modeled as Stackelberg games where a patroller and an intruder compete. The former moves with the aim of detecting an intrusion, while the latter tries to intrude without being detected. In this paper, we introduce alarms in APGs, namely devices that can remotely inform the patroller about the presence of the intruder at some location. We introduce a basic model, provide an extended formulation of the problem and show how it can be cast as partially observable stochastic game. We then introduce the general resolution approach.