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
Multi-step multi-sensor hider-seeker games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computing proper equilibria of zero-sum games
CG'06 Proceedings of the 5th international conference on Computers and games
Computing time-dependent policies for patrolling games with mobile targets
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned
Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned
Protecting moving targets with multiple mobile resources
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Previous work on Stackelberg Security Games for scheduling security resources has mostly assumed that the targets are stationary relative to the defender and the attacker, leading to discrete game models with finite numbers of pure strategies. This paper in contrast focuses on protecting mobile targets that lead to a continuous set of strategies for the players. The problem is motivated by several real-world domains including protecting ferries with escorts and protecting refugee supply lines. Our contributions include: (i) a new game model for multiple mobile defender resources and moving targets with a discretized strategy space for the defender and a continuous strategy space for the attacker; (ii) an efficient linear-program-based solution that uses a compact representation for the defender's mixed strategy, while accurately modeling the attacker's continuous strategy using a novel sub-interval analysis method; (iii) a heuristic method of equilibrium refinement for improved robustness and (iv) detailed experimental analysis in the ferry protection domain.