2020
DOI: 10.1109/access.2020.3024979
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Transportation Dynamics at a City-Scale Using a Reinforcement Learning Framework

Abstract: Urban planners, authorities, and numerous additional players have to deal with challenges related to the rapid urbanization process and its effect on human mobility and transport dynamics. Hence, optimize transportation systems represents a unique occasion for municipalities. Indeed, the quality of transport is linked to economic growth, and by decreasing traffic congestion, the life quality of the inhabitants is drastically enhanced. Most state-of-the-art solutions optimize traffic in specific and small zones… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 34 publications
0
4
0
Order By: Relevance
“…Simulations are extensively used in a variety of fields such as urban planning [25], transportation [26]- [28], robotics [29], epidemiology [30], gaming [31], and others. Experiments in the real world are often costly, dangerous, and infeasible.…”
Section: Background a Simulations In Sumomentioning
confidence: 99%
“…Simulations are extensively used in a variety of fields such as urban planning [25], transportation [26]- [28], robotics [29], epidemiology [30], gaming [31], and others. Experiments in the real world are often costly, dangerous, and infeasible.…”
Section: Background a Simulations In Sumomentioning
confidence: 99%
“…Their experiments also show its strength in computing time, system efficiency, and robustness. To further enhance the generality, (Khaidem et al 2020) coped with the difficulty of gathering insights for an entire city through a Partially Observable Discrete Event Decision Process (PODEDP).…”
Section: Reinforcement Learning In Traffic and Transit Operationsmentioning
confidence: 99%
“…𝑖,𝑗 T 𝑖 𝑗 + 𝑖 𝑗 𝑇 𝑖 𝑗 (14) where T𝑖 𝑗 is the flow from region 𝑖 to region 𝑗 predicted by the model and 𝑇 𝑖 𝑗 is the actual flow from region 𝑖 to region 𝑗. CPC ranges between 0 and 1: if two adjacency matrices do not have any flows in common, CPC value is 0. CPC is 1 if the sets of flows are identical.…”
Section: Evaluation Metricsmentioning
confidence: 99%