Efficient City-Scale Patrolling Using Decomposition and Grafting
Pages 2259 - 2261
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.
References
[1]
Anthony A. Braga, Andrew V. Papachristos, and David M. Hureau. 2014. The Effects of Hot Spots Policing on Crime: An Updated Systematic Review and Meta-Analysis. Justice Quarterly, Vol. 31, 4 (2014), 633--663.
[2]
Jonathan Chase, Jiali Du, Na Fu, Truc Viet Le, and Hoong Chuin Lau. 2017. Law enforcement resource optimization with response time guarantees. In 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017, Honolulu, HI, USA, November 27 - Dec. 1, 2017. 1--7.
[3]
Cen Chen, Zachary B. Rubinstein, Stephen F. Smith, and Hoong Chuin Lau. 2017. Tackling Large-Scale Home Health Care Delivery Problem with Uncertainty. In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling(ICAPS'17), Pittsburgh, Pennsylvania, USA, June 18--23. 358--366.
[4]
Kevin M. Curtin, Karen Hayslett-McCall, and Fang Qiu. 2010. Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models. Networks and Spatial Economics, Vol. 10, 1 (2010), 125--145.
[5]
Maria Doyle, Louise Frogner, Henrik Andershed, and Anna-Karin Andershed. 2016. Feelings of Safety In The Presence Of the Police, Security Guards, and Police Volunteers. European Journal on Criminal Policy and Research, Vol. 22, 1 (2016), 19--40.
[6]
Yehuda Elmaliach, Noa Agmon, and Gal A. Kaminka. 2009. Multi-robot area patrol under frequency constraints. Annals of Mathematics and Artificial Intelligence, Vol. 57, 3 (01 Dec 2009), 293--320.
[7]
Supriyo Ghosh and Pradeep Varakantham. 2018. Dispatch Guided Allocation Optimization for Effective Emergency Response. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, February 2--7 .
[8]
Burcu B. Keskin, Shirley (Rong) Li, Dana Steil, and Sarah Spiller. 2012. Analysis of an integrated maximum covering and patrol routing problem. Transportation Research Part E: Logistics and Transportation Review, Vol. 48, 1 (2012), 215 -- 232.
[9]
Hoong Chuin Lau, Zhi Yuan, and Aldy Gunawan. 2016. Patrol scheduling in urban rail network. Annals of Operations Research, Vol. 239, 1 (2016), 317--342.
[10]
Ayan Mukhopadhyay, Yevgeniy Vorobeychik, Abhishek Dubey, and Gautam Biswas. 2017. Prioritized Allocation of Emergency Responders Based on a Continuous-Time Incident Prediction Model. In AAMAS'17. 168--177.
[11]
David Portugal and Rui P. Rocha. 2013. Distributed multi-robot patrol: A scalable and fault-tolerant framework. Robotics and Autonomous Systems, Vol. 61, 12 (2013), 1572 -- 1587.
[12]
Sandhya Saisubramanian, Pradeep Varakantham, and Hoong Chuin Lau. 2015. Risk Based Optimization for Improving Emergency Medical Systems. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25--30, 2015, Austin, Texas, USA. 702--708.
[13]
Já cint Szabó, Sebastien Blandin, and Charles Brett. 2017. Data-Driven Simulation and Optimization for Incident Response in Urban Railway Networks. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S a o Paulo, Brazil, May 8--12, 2017. 819--827.
[14]
Jordi Blanes Vidal and Tom Kirchmaier. 2017. The Effect of Police Response Time on Crime Clearance Rates. The Review of Economic Studies, Vol. 111, 45 (2017), 1--54.
[15]
David Weisburd and John E. Eck. 2004. What Can Police Do to Reduce Crime, Disorder, and Fear? The ANNALS of the American Academy of Political and Social Science, Vol. 593, 1 (2004), 42--65.
[16]
Yisong Yue, Lavanya Marla, and Ramayya Krishnan. 2012. An Efficient Simulation-Based Approach to Ambulance Fleet Allocation and Dynamic Redeployment. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22--26, 2012, Toronto, Ontario, Canada.
[17]
Yifeng Zeng, Xuefeng Chen, Xin Cao, Shengchao Qin, Marc Cavazza, and Yanping Xiang. 2015. Optimal Route Search with the Coverage of Users' Preferences. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25--31, 2015. 2118--2124.
[18]
Chao Zhang, Victor Bucarey, Ayan Mukhopadhyay, Arunesh Sinha, Yundi Qian, Yevgeniy Vorobeychik, and Milind Tambe. 2016. Using Abstractions to Solve Opportunistic Crime Security Games at Scale. In AAMAS '16. 196--204.
Index Terms
- Efficient City-Scale Patrolling Using Decomposition and Grafting
Recommendations
Approximate Sparse Recovery: Optimizing Time and Measurements
A Euclidean approximate sparse recovery system consists of parameters $k,N$, an $m$-by-$N$ measurement matrix, $\bm{\Phi}$, and a decoding algorithm, $\mathcal{D}$. Given a vector, ${\mathbf x}$, the system approximates ${\mathbf x}$ by $\widehat {\...
Some properties of a hypergeometric function which appear in an approximation problem
In this paper we consider properties and power expressions of the functions $$f:(-1,1)\rightarrow \mathbb{R }$$ and $$f_L:(-1,1)\rightarrow \mathbb{R }$$ , defined by $$\begin{aligned} f(x;\gamma )=\frac{1}{\pi }\int \limits _{-1}^1 \frac{(1+xt)^\gamma }{\sqrt{1-t^2}}\,\mathrm{d}t \quad \text{ and}\quad f_L(x;\gamma )=\frac{...
Moth flame optimization algorithm based on decomposition for placement of relay nodes in WSNs
AbstractMetaheuristic algorithms have popularly been used to solve a wide range of complex engineering optimization problems. In order to solve the problems with two or more objectives multi-objective algorithms (MOAs) are used. Application of MOAs to ...
Comments
Information & Contributors
Information
Published In
May 2019
2518 pages
ISBN:9781450363099
- General Chairs:
- Edith Elkind,
- Manuela Veloso,
- Program Chairs:
- Noa Agmon,
- Matthew E. Taylor
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 08 May 2019
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Natural Science Foundation of China
Conference
AAMAS '19
Sponsor:
AAMAS '19: International Conference on Autonomous Agents and Multiagent Systems
May 13 - 17, 2019
Montreal QC, Canada
Acceptance Rates
AAMAS '19 Paper Acceptance Rate 193 of 793 submissions, 24%;
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 73Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in