Efficient City-Scale Patrolling Using Decomposition and Grafting

Open Webpage

Wanyuan Wang, Zichen Dong, Bo An, Yichuan Jiang

Published: 2019, Last Modified: 25 Jan 2025AAMAS 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: This paper uses an integer program (IP) to formulate the city-scale patrolling (CSP) problem, with the objective of maximizing the police visibility rate (PVR) and the constraint of incident response time guarantee. We decompose the original CSP into two subproblems: minimizing police problem (MinP) and maximizing PVR (MaxP) problem. A polynomial time approximation algorithm is proposed for MinP, and a polynomial time optimal algorithm is proposed for MaxP. We conduct experiments to demonstrate the efficiency of the proposed algorithm.