OFFICERS: Operational Framework for Intelligent Crime-and-Emergency Response Scheduling

Jonathan Chase, Siong Thye Goh, T. Phong, H. Lau
{"title":"OFFICERS: Operational Framework for Intelligent Crime-and-Emergency Response Scheduling","authors":"Jonathan Chase, Siong Thye Goh, T. Phong, H. Lau","doi":"10.1609/icaps.v32i1.19830","DOIUrl":null,"url":null,"abstract":"In the quest to achieve better response times in dense urban environments, law enforcement agencies are seeking AI-driven planning systems to inform their patrol strategies. In this paper, we present a framework, OFFICERS, for deployment planning that learns from historical data to generate deployment schedules on a daily basis. We accurately predict incidents using ST-ResNet, a deep learning technique that captures wide-ranging spatio-temporal dependencies, and solve a large-scale optimization problem to schedule deployment, significantly improving its scalability through a simulated annealing solver. Methodologically, our approach outperforms our previous works where prediction was done using Generative Adversarial Networks, and optimization was performed with the CPLEX solver. Furthermore, we show that our proposed framework is designed to be readily transferable between use cases, handling a wide range of both criminal and non-criminal incidents, with the use of deep learning and a general-purpose efficient solver, reducing dependence on context-specific details. We demonstrate the value of our approach on a police patrol case study, and discuss both the ethical considerations, and operational requirements, for deployment of a lightweight and responsive planning system.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Automated Planning and Scheduling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/icaps.v32i1.19830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the quest to achieve better response times in dense urban environments, law enforcement agencies are seeking AI-driven planning systems to inform their patrol strategies. In this paper, we present a framework, OFFICERS, for deployment planning that learns from historical data to generate deployment schedules on a daily basis. We accurately predict incidents using ST-ResNet, a deep learning technique that captures wide-ranging spatio-temporal dependencies, and solve a large-scale optimization problem to schedule deployment, significantly improving its scalability through a simulated annealing solver. Methodologically, our approach outperforms our previous works where prediction was done using Generative Adversarial Networks, and optimization was performed with the CPLEX solver. Furthermore, we show that our proposed framework is designed to be readily transferable between use cases, handling a wide range of both criminal and non-criminal incidents, with the use of deep learning and a general-purpose efficient solver, reducing dependence on context-specific details. We demonstrate the value of our approach on a police patrol case study, and discuss both the ethical considerations, and operational requirements, for deployment of a lightweight and responsive planning system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
官员:智能犯罪和应急响应调度的操作框架
为了在密集的城市环境中实现更好的响应时间,执法机构正在寻求人工智能驱动的规划系统,以告知他们的巡逻策略。在本文中,我们提出了一个框架,军官,用于部署计划,它从历史数据中学习,每天生成部署计划。我们使用ST-ResNet准确预测事件,ST-ResNet是一种深度学习技术,可捕获广泛的时空依赖性,并解决大规模优化问题以调度部署,通过模拟退火求解器显着提高其可扩展性。在方法上,我们的方法优于我们以前使用生成对抗网络进行预测的工作,并使用CPLEX求解器进行优化。此外,我们表明,我们提出的框架被设计成易于在用例之间转移,处理广泛的刑事和非刑事事件,使用深度学习和通用高效求解器,减少对特定于上下文的细节的依赖。我们通过一个警察巡逻案例研究,展示了我们的方法的价值,并讨论了部署一个轻量级和反应迅速的规划系统的道德考虑和操作要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast and Robust Resource-Constrained Scheduling with Graph Neural Networks Solving the Multi-Choice Two Dimensional Shelf Strip Packing Problem with Time Windows Generalizing Action Justification and Causal Links to Policies Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1