A Dynamic Risk-aware Routing Recommendation Using Deep Reinforcement Learning

Crime risks in urban environments vary over time and space, making it challenging to find a safe and efficient route. Previous solutions to this problem were too simplistic and static, relying on exhaustive searches that were not practical. In this paper, we present a new approach using deep reinforcement learning for dynamic risk-aware path planning. Our method evaluates crime risks and distances to suggest optimal routes that adapt to changing conditions. We have designed a reward system that considers road length, risk levels, and the decay of risks over time. This innovative approach allows our model to make decisions that balance distance and crime risk. Through extensive experiments, we demonstrate the effectiveness of our model compared to traditional path-planning methods, especially as the road network grows in size.

Authors

Institutions

Publication Details

Published
2024-08-19
DOI
https://doi.org/10.1109/ithings-greencom-cpscom-smartdata-cybermatics62450.2024.00058
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Dynamic Risk-aware Routing Recommendation Using Deep Reinforcement Learning

Binbin Zhou, Anchen Lin, Difeng Zhu, Hang Zhou
1 citations
Complex Network Analysis Techniques
0.28
article

A Dynamic Risk-aware Routing Recommendation Using Deep Reinforcement Learning

Binbin Zhou, Anchen Lin, Difeng Zhu, Hang Zhou
article en
1 citations

Abstract

Crime risks in urban environments vary over time and space, making it challenging to find a safe and efficient route. Previous solutions to this problem were too simplistic and static, relying on exhaustive searches that were not practical. In this paper, we present a new approach using deep reinforcement learning for dynamic risk-aware path planning. Our method evaluates crime risks and distances to suggest optimal routes that adapt to changing conditions. We have designed a reward system that considers road length, risk levels, and the decay of risks over time. This innovative approach allows our model to make decisions that balance distance and crime risk. Through extensive experiments, we demonstrate the effectiveness of our model compared to traditional path-planning methods, especially as the road network grows in size.

Zhejiang University of Science and Technology (CN), Hangzhou City University, City University of Macau (MO)
National Natural Science Foundation of China
Openalex Percentile: Top 44%
Complex Network Analysis Techniques
0.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.