Multi-officer Routing for Patrolling High Risk Areas Jointly Learned from Check-ins, Crime and Incident Response Data
원문 초록
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-scale mobility data collected from Location-Based Social Network, or check-ins, and Point of Interests (POI) data for designing an effective police patrol is largely understudied. Given that there are multiple police officers being on duty in a real-life situation, this makes the problem more complex to solve. In this paper, we formulate the dynamic crime patrol planning problem for multiple police officers using check-ins, crime, incident response data, and POI information. We propose a joint learning and non-random optimisation method for the representation of possible solutions where multiple police officers patrol the high crime risk areas simultaneously first rather than the low crime risk areas. Later, meta-heuristic Genetic Algorithm (GA) and Cuckoo Search (CS) are implemented to find the optimal routes. The performance of the proposed solution is verified and compared with several state-of-art methods using real-world datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
HGAMN: Heterogeneous Graph Attention Matching Network for Multilingual POI Retrieval at Baidu Maps
Learning Time Slot Preferences via Mobility Tree for Next POI Recommendation
STAN: Spatio-Temporal Attention Network for Next Location Recommendation
Out-of-Town Recommendation with Travel Intention Modeling
Online Location Planning for AI-Defined Vehicles: Optimizing Joint Tasks of Order Serving and Spatio-Temporal Heterogeneous Model Fine-Tuning
Enhanced Urban Region Profiling with Adversarial Self-Supervised Learning for Robust Forecasting and Security
토론
이 논문과 연결된 포럼 글이 아직 없습니다.