Computing time-dependent policies for patrolling games with mobile targets

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 2, Issue , 2011, Pages 929-936

  Bošanský, Branislav ^a   Lisý, Viliam ^a   Jakob, Michal ^a   Pěchouček, Michal ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Game theory; Mathematical programming; Mobile targets; Patrolling game; Stackelberg equilibrium

Indexed keywords

AUTONOMOUS AGENTS; GAME THEORY; MATHEMATICAL PROGRAMMING; MULTI AGENT SYSTEMS; TOPOLOGY;

ARBITRARY TOPOLOGY; EXPERIMENTAL EVALUATION; MATHEMATICAL PROGRAM; MOBILE TARGETS; PATROLLING GAME; RANDOMIZED STRATEGY; STACKELBERG EQUILIBRIUM; STATIONARY TARGETS;

COMPUTER GAMES;

EID: 84899453905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. N. Agmon, S. Kraus, and G. A. Kaminka. Multi-robot perimeter patrol in adversarial settings. In ICRA, pages 2339-2345, 2008.
2. N. Agmon, V. Sadov, G. A. Kaminka, and S. Kraus. The impact of adversarial knowledge on adversarial planning in perimeter patrol. In AAMAS, pages 55-62, 2008.
3. N. Basilico, N. Gatti, and F. Amigoni. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In AAMAS, pages 57-64, 2009.
4. N. Basilico, N. Gatti, T. Rossi, S. Ceppi, and F. Amigoni. Extending algorithms for mobile robot patrolling in the presence of adversaries to more realistic settings. In WI-IAT, pages 557-564, 2009.
5. N. Basilico, N. Gatti, and F. Villa. Asynchronous Multi-Robot Patrolling against Intrusion in Arbitrary Topologies. In AAAI, 2010.
6. K. Bennett and O. Mangasarian. Bilinear separation of two sets inn-space. Computational Optimization and Applications, 2(3):207-227, 1993.
7. M. Jain, E. Karde, C. Kiekintveld, F. Ordóñez, and M. Tambe. Optimal defender allocation for massive security games: A branch and price approach. In Workshop on Optimization in Multi-Agent Systems at AAMAS, 2010.
8. C. Kiekintveld, M. Jain, J. Tsai, J. Pita, F. Ordóñez, and M. Tambe. Computing optimal randomized resource allocations for massive security games. In AAMAS, pages 689-696, 2009.
9. J. Lasserre. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization, 11(3):796-817, 2001.
10. J. Pita, M. Jain, J. Marecki, F. Ordónez, C. Portway, M. Tambe, C. Western, P. Paruchuri, and S. Kraus. Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles Int. Airport. In AAMAS, pages 125-132, 2008.
11. J. Tsai, S. Rathi, C. Kiekintveld, F. Ordóñez, and M. Tambe. IRIS - A Tool for Strategic Security Allocation in Transportation Networks Categories and Subject Descriptors. In AAMAS, pages 37-44, 2009.
12. Z. Yin, D. Korzhyk, C. Kiekintveld, V. Conitzer, and M. Tambe. Stackelberg vs. Nash in security games: Interchangeability, equivalence, and uniqueness. In AAMAS, pages 1139-1146, 2010.