A number of real-world security scenarios can be cast as a problem of transiting an area patrolled by a mobile adversary, where the transiting agent aims to choose its route so as to minimize the probability of encountering the patrolling agent, and vice versa. We model this problem as a two-player zero-sum game on a graph, termed the transit game. In contrast to the existing models of area transit, where one of the players is stationary, we assume both players are mobile. We also explicitly model the limited endurance of the patroller and the notion of a base to which the patroller has to repeatedly return. Noting the prohibitive size of the strategy spaces of both players, we employ iterative oracle-based algorithms including a newly proposed accelerated scheme, to obtain optimum route selection strategies for both players. We evaluate the developed approach on a range of transit game instances inspired by real-world security problems in the urban and naval security domains.
[1]
Michal Pěchouček,et al.
Adversarial Modeling and Reasoning in the Maritime Domain - Year 1 Report
,
2010
.
[2]
Branislav Bosanský,et al.
Transiting areas patrolled by a mobile adversary
,
2010,
Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games.
[3]
Avrim Blum,et al.
Planning in the Presence of Cost Functions Controlled by an Adversary
,
2003,
ICML.
[4]
Manish Jain,et al.
Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service
,
2010,
Interfaces.