Fast Patrol Route Planning in Dynamic Environments

Proper patrol route planning increases the effectiveness of police patrolling and improves public security. In this paper, we present a new approach for real-time patrol route planning in dynamic environments. We first build a mathematical formulation for the patrol route planning problem under a single patrol unit setting and then propose a fast algorithm developed from the cross entropy (CE) method to meet the real-time computation requirements needed for practical applications. We next generalized the result to the patrol team case. Since the size of feasible team routes grows exponentially as the number of patrol units increases, we propose an approximate CE (ACE) algorithm that balances convergence time with optimality. Compared with the CE algorithm, the ACE algorithm can reduce the convergence time by as much as 48.9% with a less than 1% performance loss.

[1]  David Mendonça,et al.  A Cognitive Model of Improvisation in Emergency Management , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[3]  Grantham Pang,et al.  People Counting and Human Detection in a Challenging Situation , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[4]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[5]  Charles M. Katz,et al.  The Police in America: An Introduction , 1992 .

[6]  Dirk P. Kroese,et al.  Convergence properties of the cross-entropy method for discrete optimization , 2007, Oper. Res. Lett..

[7]  Jiaqiao Hu,et al.  A Model Reference Adaptive Search Algorithm for Global Optimization , 2005 .

[8]  Athanassios N. Avramidis,et al.  Modelling and simulation of a telephone call center , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..

[9]  Sudarshan S. Chawathe,et al.  Organizing Hot-Spot Police Patrol Routes , 2007, 2007 IEEE Intelligence and Security Informatics.

[10]  Michael C. Fu,et al.  A Model Reference Adaptive Search Method for Global Optimization , 2007, Oper. Res..

[11]  Dirk P. Kroese,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

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

[13]  Dianxiang Xu,et al.  Integrating Safety Analysis With Functional Modeling , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[14]  Toyohide Watanabe,et al.  Planning high responsive police patrol routes with frequency constraints , 2011, ICUIMC '11.

[15]  Anand R. Tripathi,et al.  Security Policies in Distributed CSCW and Workflow Systems , 2010, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[16]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[17]  Hiromitsu Hattori,et al.  Learning From Humans: Agent Modeling With Individual Human Behaviors , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[18]  Sergio A. Velastin,et al.  PRISMATICA: toward ambient intelligence in public transport environments , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[19]  Xu Chen,et al.  Patrol districting and routing with security level functions , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[20]  Christopher S. Koper,et al.  Just enough police presence: Reducing crime and disorderly behavior by optimizing patrol time in crime hot spots , 1995 .

[21]  G. Manimaran,et al.  Cybersecurity for Critical Infrastructures: Attack and Defense Modeling , 2010, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[22]  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..

[23]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .