Probabilistic Multiagent Patrolling

Patrolling refers to the act of walking around an area, with some regularity, in order to protect or supervise it. A group of agents is usually required to perform this task efficiently. Previous works in this field, using a metric that minimizes the period between visits to the same position, proposed static solutions that repeats a cycle over and over. But an efficient patrolling scheme requires unpredictability, so that the intruder cannot infer when the next visitation to a position will happen. This work presents various strategies to partition the sites among the agents, and to compute the visiting sequence. We evaluate these strategies using three metrics which approximates the probability of averting three types of intrusion - a random intruder, an intruder that waits until the guard leaves the site to initiate the attack, and an intruder that uses statistics to forecast how long the next visit to the site will be. We present the best strategies for each of these metrics, based on 500 simulations.

[1]  Jaime Simão Sichman,et al.  Advances in Artificial Intelligence - IBERAMIA-SBIA 2006, 2nd International Joint Conference, 10th Ibero-American Conference on AI, 18th Brazilian AI Symposium, Ribeirão Preto, Brazil, October 23-27, 2006, Proceedings , 2006, IBERAMIA-SBIA.

[2]  Jaime Simão Sichman,et al.  Multi-Agent-Based Simulation II , 2003, Lecture Notes in Computer Science.

[3]  Yann Chevaleyre,et al.  A theoretical analysis of multi-agent patrolling strategies , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[4]  Bohdana Ratitch,et al.  Multi-agent patrolling with reinforcement learning , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[5]  E. Fernandez-Gaucherand,et al.  Cooperative control for multiple autonomous UAV's searching for targets , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[6]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[7]  Jose B. Cruz,et al.  Adaptive models of pop-up threats for multi-agent persistent area denial , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[8]  Patrícia C. A. R. Tedesco,et al.  Negotiator Agents for the Patrolling Task , 2006, IBERAMIA-SBIA.

[9]  Uriel Feige,et al.  Short Random Walks on Graphs , 1996, SIAM J. Discret. Math..

[10]  Yann Chevaleyre,et al.  Recent Advances on Multi-agent Patrolling , 2004, SBIA.

[11]  J. Baillieul,et al.  Stochastic Strategies for Autonomous Robotic Surveillance , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[13]  Alessandra Russo,et al.  Advances in Artificial Intelligence – SBIA 2004 , 2004, Lecture Notes in Computer Science.

[14]  Alexis Drogoul,et al.  Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures , 2002, MABS.

[15]  J.P. Hespanha,et al.  Multiple-agent probabilistic pursuit-evasion games , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[16]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..