In this paper, we address the problem of planning police patrol routes to regularly cover street segments of high crime density (hotspots) with limited police forces. A good patrolling strategy is required to minimise the average time lag between two consecutive visits to hotspots, as well as coordinating multiple patrollers and imparting unpredictability in patrol routes. Previous studies have designed different police patrol strategies for routing police patrol, but these strategies have difficulty in generalising to real patrolling and meeting various requirements. In this research we develop a new police patrolling strategy based on Bayesian method and ant colony algorithm. In this strategy, virtual marker (pheromone) is laid to mark the visiting history of each crime hotspot, and patrollers continuously decide which hotspot to patrol next based on pheromone level and other variables. Simulation results using real data testifies the effective, scalable, unpredictable and extensible nature of this strategy.
Designing Daily Patrol Routes For Policing Based On Ant Colony Algorithm
2015-01-01
In: Yang, C and Clarke, K and Yuan, M and Yu, M and Li, M and Guan, W and Sun, M and Huang, B, (eds.) ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences. (pp. pp. 103-109). Copernicus Gesellschaft mbH: Göttingen, Germany. (2015)
Paper
Electronic Resource
English
DDC: | 629 |
Police Patrol Routes Optimization: A Literature Review
IEEE | 2023
|A patrol system for autonomous vehicles that change routes
European Patent Office | 2023
|Two types of patrol ships: solution trees for pre-designing and concept designing
Online Contents | 2012
|Two types of patrol ships: ‘solution trees’ for pre-designing and concept designing
Taylor & Francis Verlag | 2012
|