Moving game theoretical patrolling strategies from theory to practice: An USARSim simulation

Game theoretical approaches have been recently used to develop patrolling strategies for mobile robots. The idea is that the patroller and the intruder play a game, whose outcome depends on the combination of their actions. From the analysis of this game, an optimal strategy for the patrolling robot can be derived. Although game theoretical approaches are promising, their applicability in real settings is still an open problem. In this paper, we experimentally evaluate the practical applicability of the most general game theoretical approach for patrolling strategies, called BGA model. Experiments are conducted by using USARSim, with the goal of studying the behavior of the optimal patrolling strategy returned by the BGA model both in situations that violate its idealized assumptions and in comparison with other patrolling strategies that can be developed with much less computational effort.

[1]  Francesco Amigoni,et al.  A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[2]  S. Glantz.  Primer of applied regression and analysis of variance / Stanton A. Glantz, Bryan K. Slinker , 1990 .

[3]  Nicola Basilico,et al.  Capturing augmented sensing capabilities and intrusion delay in patrolling-intrusion games , 2009, 2009 IEEE Symposium on Computational Intelligence and Games.

[4]  Sarit Kraus,et al.  Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.

[5]  Nicola Basilico,et al.  Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.

[6]  Sarit Kraus,et al.  The impact of adversarial knowledge on adversarial planning in perimeter patrol , 2008, AAMAS.

[7]  S. Glantz,et al.  Primer of Applied Regression & Analysis of Variance , 1990 .

[8]  Sarit Kraus,et al.  Multi-robot perimeter patrol in adversarial settings , 2008, 2008 IEEE International Conference on Robotics and Automation.

[9]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[10]  Nicola Basilico,et al.  Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments , 2009, 2009 IEEE International Conference on Robotics and Automation.

[11]  Sarit Kraus,et al.  An efficient heuristic approach for security against multiple adversaries , 2007, AAMAS '07.

[12]  Sui Ruan,et al.  Patrolling in a Stochastic Environment , 2005 .

[13]  Stefano Carpin,et al.  Extracting surveillance graphs from robot maps , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Stefano Carpin,et al.  USARSim: a robot simulator for research and education , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[15]  S. Shankar Sastry,et al.  Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..

[16]  Elbert E. N. Macau,et al.  Patrol Mobile Robots and Chaotic Trajectories , 2007 .

[17]  S. Balakirsky,et al.  Mobility open architecture simulation and tools environment , 2005, International Conference on Integration of Knowledge Intensive Multi-Agent Systems, 2005..