Bilinear separation of two sets in n-space
Computational Optimization and Applications
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
The impact of adversarial knowledge on adversarial planning in perimeter patrol
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
Leader-follower strategies for robotic patrolling in environments with arbitrary topologies
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing optimal randomized resource allocations for massive security games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
AgentC: agent-based system for securing maritime transit
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Using multi-agent simulation to improve the security of maritime transit
MABS'11 Proceedings of the 12th international conference on Multi-Agent-Based Simulation
Agents vs. pirates: multi-agent simulation and optimization to fight maritime piracy
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Tactical operations of multi-robot teams in urban warfare (demonstration)
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Optimal patrol strategy for protecting moving targets with multiple mobile resources
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Introducing alarms in adversarial patrolling games: extended abstract
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Solving extensive-form games with double-oracle methods
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Protecting moving targets with multiple mobile resources
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We study how a mobile defender should patrol an area to protect multiple valuable targets from being attacked by an attacker. In contrast to existing approaches, which assume stationary targets, we allow the targets to move through the area according to an a priori known, deterministic movement schedules. We represent the patrol area by a graph of arbitrary topology and do not put any restrictions on the movement schedules. We assume the attacker can observe the defender and has full knowledge of the strategy the defender employs. We construct a game-theoretic formulation and seek defender's optimal randomized strategy in a Stackelberg equilibrium of the game. We formulate the computation of the strategy as a mathematical program whose solution corresponds to an optimal time-dependent Markov policy for the defender. We also consider a simplified formulation allowing only stationary defender's policies which are generally less effective but are computationally significantly cheaper to obtain. We provide experimental evaluation examining this trade-off on a set of test problems covering various topologies of the patrol area and various movement schedules of the targets.