paper-with-me

홈 › Papers

Cooperative Patrol Routing: Optimizing Urban Crime Surveillance through Multi-Agent Reinforcement Learning

2025-01-14 · Juan Palma-Borda, Eduardo Guzmán, María-Victoria Belmonte

The effective design of patrol strategies is a difficult and complex problem, especially in medium and large areas. The objective is to plan, in a coordinated manner, the optimal routes for a set of patrols in a given area, in order to achieve maximum coverage of the area, while also trying to minimize the number of patrols. In this paper, we propose a multi-agent reinforcement learning (MARL) model, based on a decentralized partially observable Markov decision process, to plan unpredictable patrol routes within an urban environment represented as an undirected graph. The model attempts to maximize a target function that characterizes the environment within a given time frame. Our model has been tested to optimize police patrol routes in three medium-sized districts of the city of Malaga. The aim was to maximize surveillance coverage of the most crime-prone areas, based on actual crime data in the city. To address this problem, several MARL algorithms have been studied, and among these the Value Decomposition Proximal Policy Optimization (VDPPO) algorithm exhibited the best performance. We also introduce a novel metric, the coverage index, for the evaluation of the coverage performance of the routes generated by our model. This metric is inspired by the predictive accuracy index (PAI), which is commonly used in criminology to detect hotspots. Using this metric, we have evaluated the model under various scenarios in which the number of agents (or patrols), their starting positions, and the level of information they can observe in the environment have been modified. Results show that the coordinated routes generated by our model achieve a coverage of more than $90\%$ of the $3\%$ of graph nodes with the highest crime incidence, and $65\%$ for $20\%$ of these nodes; $3\%$ and $20\%$ represent the coverage standards for police resource allocation.

📄 PDF Abstract BibTeX arXiv:2501.08020

Code (1)

iacomlab/marl-patrol-routing 공식 구현

Tasks

Multi-agent Reinforcement Learning

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Multi-officer Routing for Patrolling High Risk Areas Jointly Learned from Check-ins, Crime and Incident Response Data

2020-07-31 · Shakila Khan Rumi, Kyle K. Qin, Flora D. Salim

A well-crafted police patrol route design is vital in providing community safety and security in the society. Previous works have largely focused on predicting crime events with historical crime data. The usage of large-…

point of interests

Traffic Adaptive Moving-window Service Patrolling for Real-time Incident Management during High-impact Events

2025-04-15 · Haozhe Lei, Ya-Ting Yang, Tao Li, Zilin Bian 외

This paper presents the Traffic Adaptive Moving-window Patrolling Algorithm (TAMPA), designed to improve real-time incident management during major events like sports tournaments and concerts. Such events significantly s…

Management

Policing Chronic and Temporary Hot Spots of Violent Crime: A Controlled Field Experiment

2020-11-11 · Dylan J. Fitzpatrick, Wilpen L. Gorr, Daniel B. Neill

Hot-spot-based policing programs aim to deter crime through increased proactive patrols at high-crime locations. While most hot spot programs target easily identified chronic hot spots, we introduce models for predicting…

A Stochastic Surveillance Stackelberg Game: Co-Optimizing Defense Placement and Patrol Strategy

2023-08-28 · Yohan John, Gilberto Diaz-Garcia, Xiaoming Duan, Jason R. Marden 외

Stochastic patrol routing is known to be advantageous in adversarial settings; however, the optimal choice of stochastic routing strategy is dependent on a model of the adversary. We adopt a worst-case omniscient adversa…

Predictive Hotspot Mapping for Data-driven Crime Prediction

2026-02-27 · Karthik Sriram, Ankur Sinha, Suvashis Choudhary arxiv

Predictive hotspot mapping is an important problem in crime prediction and control. An accurate hotspot mapping helps in appropriately targeting the available resources to manage crime in cities. With an aim to make data…