Organizing Hot-Spot Police Patrol Routes

We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using an edge-weighted graph in which edges represent streets, vertices represent intersections, and weights represent importance of the corresponding streets. We describe efficient methods that use this input to determine the most important patrol routes. In addition to the importance of streets (edge weights), important routes are affected by the topology of the road network. Our methods permit automation of a labor-intensive stage of the patrol-planning process and aid dynamic adjustment of patrol routes in response to changes in the input graph (as a result of a developing situation, for instance).

[1]  Ming-Yang Kao,et al.  Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics , 2002, WABI.

[2]  André L. V. Coelho,et al.  Towards Optimal Police Patrol Routes with Genetic Algorithms , 2006, ISI.

[3]  Kun-Mao Chao,et al.  Finding a Length-Constrained Maximum-Density Path in a Tree , 2005, J. Comb. Optim..

[4]  Yaw-Ling Lin,et al.  Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis , 2002, J. Comput. Syst. Sci..

[5]  Hanan Samet,et al.  Efficient Processing of Spatial Queries in Line Segment Databases , 1991, SSD.

[6]  W. C. Collier,et al.  In-vehicle route guidance systems using map-matched dead reckoning , 1990, IEEE Symposium on Position Location and Navigation. A Decade of Excellence in the Navigation Sciences.

[7]  Sudarshan S. Chawathe.  Distributing the Cost of Securing a Transportation Infrastructure , 2006, ISI.

[8]  Yaw-Ling Lin,et al.  MAVG: locating non-overlapping maximum average segments in a given sequence , 2003, Bioinform..

[9]  T. Srikanthan,et al.  A Map Matching Method for GPS Based Real-Time Vehicle Location , 2004, Journal of Navigation.

[10]  Mohammed A. Quddus,et al.  High integrity map matching alogorithms for advanced transport telematics applications , 2007 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Louette R. Johnson Lutjens.  Research , 2006 .

[13]  S.S. Chawathe,et al.  Fair policies for travel on neighborhood streets , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[14]  Patrick R. Gartin,et al.  Hot Spots of Predatory Crime: Routine Activities and the Criminology of Place , 1989 .

[15]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[16]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.

[17]  Vijayalakshmi Atluri,et al.  Secure interoperation for effective data mining in border control and homeland security applications , 2004, DG.O.

[18]  W. Ochieng,et al.  Effects of Navigation Sensors and Digital Map Quality on Performance of Map-Matching Algorithms , 2006 .

[19]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Kun-Mao Chao,et al.  Finding a Length-Constrained Maximum-Density Path in a Tree , 2003, ISAAC.

[22]  Paul Jen-Hwa Hu,et al.  Technology implementation management in law enforcement: COPLINK system usability and user acceptance evaluations , 2003 .

[23]  Paul Jen-Hwa Hu,et al.  Technology Implementation Management in Law Enforcement , 2004, DG.O.

[24]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[25]  A. Kornhauser,et al.  An Introduction to Map Matching for Personal Navigation Assistants , 1998 .

[26]  Dieter Pfoser,et al.  On Map-Matching Vehicle Tracking Data , 2005, VLDB.

[27]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[28]  J. Greenfeld.  MATCHING GPS OBSERVATIONS TO LOCATIONS ON A DIGITAL MAP , 2002 .

[29]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[30]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[31]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[32]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.