Organizations: Thrust of Urban Governance and Design, Society Hub, The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, 511453, China · Thrust of Intelligent Transportation, Systems Hub, The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, 511453, China · School of Geography and Planning, Sun Yat-sen University, Guangzhou, 510006, China · School of Intelligent Systems Engineering, Sun Yat-sen University, Guangzhou, 510006, China · Department of Urban Planning and Design, The University of Hong Kong, 8/F Knowles Building, Pokfulam Road, Hong Kong
Mega events can generate concentrated travel demand, intensifying congestion around venues and increasing travelers' environmental exposure. Existing traffic management strategies focus on travel efficiency, with limited attention to exposure risks. Taking mega-event travel as a short-term high-demand scenario, this study develops an exposure-aware multi-agent routing framework integrating road-network conditions, event-induced demand, background traffic, and environmental data within a unified simulation environment. Motorized travelers optimize travel efficiency, whereas micro-mobility travelers consider travel time and dynamic exposure to traffic-related PM2.5 and noise. We compare the framework with shortest-distance, congestion-aware, and exposure-aware routing baselines. Results show that, under high demand, the SARSA-based framework reduces vehicle travel time by 34.59% and cumulative environmental exposure by 58.65%, while micro-mobility travel time remains nearly unchanged. Exposure reduction is jointly driven by vehicle-side congestion mitigation and low-exposure routing. The framework provides quantitative support for vehicle diversion, low-exposure route guidance, and health-oriented traffic management in short-term high-demand scenarios.
Figures & tables
Figure 1: Research framework.
Method
Vehicle routing
Micro-mobility routing
Shortest-distance
Shortest road-graph distance
Shortest road-graph distance
Congestion-aware
Current congestion-dependent travel time
Static exposure-aware
Fixed background exposure-weighted cost
Dynamic exposure-aware
Current exposure-weighted cost; replanned after each crossing
Minimum-exposure
Fixed background exposure-priority cost
Table 1: Nonlearning baseline routing strategies.
Figure 2: SARSA training rewards on the 250 m grid. Lines and shaded bands represent five-seed means and 95% confidence intervals, respectively.
Figure 3: Routing-strategy performance on the 250 m grid, including vehicle travel time, micro-mobility travel time, and environmental exposure. Points represent five-seed means, with five matched tests per seed.
N
Method
Tveh mean [95% CI]
ΔTveh (%)
Tmic mean [95% CI]
ΔTmic (%)
EIΔ mean [95% CI]
ΔEIΔ (%)
40,000
Shortest-distance
76.0 [75.8, 76.2]
–
1173.4 [1173.4, 1173.4]
–
2.6 [2.6, 2.6]
–
Congestion-aware
68.1 [68.1, 68.1]
-10.33
1173.4 [1173.4, 1173.4]
+0.00
1.6 [1.6, 1.6]
-36.98
Static exposure-aware
68.1 [68.1, 68.1]
-10.32
1188.4 [1188.4, 1188.4]
+1.28
1.4 [1.4, 1.4]
-45.33
Dynamic exposure-aware
68.1 [68.1, 68.1]
-10.33
1173.4 [1173.4, 1173.4]
+0.00
1.5 [1.5, 1.5]
-43.77
Minimum-exposure
68.1 [68.1, 68.1]
-10.32
1717.0 [1717.0, 1717.0]
+46.34
0.9 [0.9, 0.9]
-65.92
MAPPO
71.5 [68.6, 74.4]
-5.89
1173.4 [1173.4, 1173.4]
+0.00
1.5 [1.4, 1.6]
-43.59
Table 2: Routing-strategy performance on the 250 m grid. Values are five-seed means [95% confidence intervals], with five tests per seed. Time: ×103 min; exposure: ×103 index-min. Changes are relative to shortest-distance routing; totals include incomplete trips.
Figure 4: Spatial patterns from the first frozen-policy test at N=80,000 for seed 42 under shortest-distance routing, dynamic exposure-aware routing, and SARSA. Columns show vehicle traffic load, micro-mobility traffic load, and congestion-induced exposure.
η
Tmic mean [95% CI]
ΔTmic mean (%)
EIΔ mean [95% CI]
ΔEIΔ mean (%)
0.0
2341.8 [2341.8, 2341.8]
–
6.5 [6.2, 6.7]
–
1.0
2341.8 [2341.8, 2341.8]
+0.00
3.9 [3.9, 4.0]
-38.77
3.0
2341.8 [2341.8, 2341.8]
+0.00
3.9 [3.8, 4.0]
-39.73
5.0
2341.8 [2341.8, 2341.8]
+0.00
3.9 [3.8, 4.0]
-39.77
7.0
2341.8 [2341.8, 2341.8]
+0.00
3.8 [3.8, 3.9]
-40.48
Table 3: SARSA exposure-weight sensitivity at N=80,000 on the 250 m grid. Values are five-seed means [95% confidence intervals], with five tests per seed. Time: ×103 min; exposure: ×103 index-min. Changes are relative to η=0 .
Target obedience (%)
Realized obedience vehicle/micro (%)
Tveh mean [95% CI]
Tmic mean [95% CI]
EIΔ mean [95% CI]
ΔEIΔ mean (%)
0
0.00/0.00
151.8 [151.8, 151.8]
2341.8 [2341.8, 2341.8]
6.6 [6.6, 6.6]
-29.49
25
25.08/25.02
143.2 [142.5, 143.8]
2341.8 [2341.8, 2341.8]
6.4 [6.4, 6.5]
-31.47
50
50.10/49.98
138.3 [137.5, 139.0]
2341.8 [2341.8, 2341.8]
6.0 [5.9, 6.1]
-36.32
75
75.21/74.98
136.6 [136.4, 136.8]
2341.8 [2341.8, 2341.8]
5.3 [5.2, 5.3]
-43.79
100
100.00/100.00
136.7 [136.7, 136.8]
2341.8 [2341.8, 2341.8]
3.9 [3.8, 4.0]
-58.65
Table 4: SARSA obedience sensitivity at N=80,000 on the 250 m grid. Values are five-seed means [95% confidence intervals], with five tests per seed. Time: ×103 min; exposure: ×103 index-min. Exposure changes are relative to shortest-distance routing; realized rates denote vehicle/micro-mobility obedience.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 5: Study area.
Figure 6: MAPPO training rewards on the 250 m grid. Lines and shaded bands show five-seed means and 95% confidence intervals.
250 m
Multiscale
Coefficient
Main / exposure-weight
100 m
150 m
200 m
Vehicle time wveh
1
5
5
5
Micro-mobility time wmic
0.005
0.005
0.005
0.005
Exposure η
3a
3
3
3
Vehicle progress wpveh
0.1
2.5
10/3
1.25
Additional vehicle progress β
0
0
500/36
0
Appendix
Table 5: SARSA reward coefficients.
Grid (m)
Method
Tveh mean [95% CI]
ΔTveh (%)
Tmic mean [95% CI]
ΔTmic (%)
EIΔ mean [95% CI]
ΔEIΔ (%)
100
Shortest-distance
470.2 [468.7, 471.7]
–
2762.7 [2761.7, 2763.7]
–
34.2 [34.2, 34.3]
–
Congestion-aware
402.6 [401.8, 403.3]
-14.38
2762.7 [2761.7, 2763.7]
+0.00
30.8 [30.6, 31.0]
-10.18
Static exposure-aware
404.0 [402.3, 405.8]
-14.07
2782.3 [2781.2, 2783.4]
+0.71
19.6 [19.5, 19.7]
-42.77
Dynamic exposure-aware
402.6 [401.8, 403.3]
-14.38
2762.9 [2761.9, 2763.9]
+0.00
22.3 [22.1, 22.5]
-34.83
Minimum-exposure
403.9 [402.3, 405.6]
-14.09
4105.4 [4102.2, 4108.6]
+48.60
8.7 [8.7, 8.7]
-74.67
SARSA
335.5 [321.9, 349.1]
-28.65
2762.7 [2761.7, 2763.7]
+0.00
12.4 [10.5, 14.3]
-63.82
Appendix
Table 6: Grid-resolution sensitivity at N=80,000 . Values are five-seed means [95% confidence intervals], with five matched tests per seed. Time: ×103 min; exposure: ×103 index-min. Changes are relative to shortest-distance routing; totals include incomplete trips.
Figure 7: Test spatial patterns for the four additional routing strategies, using the same columns, conditions, and scales as Figure 4 .
As modern cities face increasingly severe traffic congestion, connected and autonomous vehicles (CAVs) have emerged as a crucial enabling technology for next-generation intelligent traffic management. However, fully realizing this potential is hindered by the limitations of current paradigms. Existing approaches typically optimize localized interactions rather than system-wide efficiency, incur severe communication overhead, or lack the deterministic guarantees required for safe kinematic execution. Furthermore, current multi-agent adaptations are frequently restricted to small predefined scenarios, failing to scale across large and complex urban networks. To bridge this gap, this paper introduces VeloCity, a decentralized multi-agent spatio-temporal mobility profile planning framework designed for CAVs operating in arbitrary urban areas. To minimize vehicles' travel times, VeloCity distributes mobility profile optimization directly to individual CAVs. Vehicles query a localized traffic coordinator for a reservation table, independently compute their fastest conflict-free mobility profile, and reserve their requested space-time slots back with the coordinator. By natively adapting to any arbitrary road topology, the framework manages highly irregular urban areas without requiring scenario-specific tuning, all while guaranteeing collision-free and physically executable vehicle trajectories. Extensive simulations across four large-scale real-world urban maps (Tokyo, Manhattan, Rome, and Bologna) demonstrate the framework's scalability. Compared to established state-of-the-art models, VeloCity yields drastically lower travel times, tightly bounds delay variance, and successfully prevents congestion gridlocks even under extremely high vehicular densities.
Lorenzo Mario Amorosa, Lorenzo Farina, Vittorio Todisco +1
Department of Electrical, Electronic and Information Engineering (DEI), “Guglielmo Marconi”, University of Bologna & WiLab - National Wireless Communications Laboratory of CNIT, Bologna, Italy.
During large-scale evacuations, concentrated electric vehicle (EV) charging demand can overload fixed charging stations (FCSs), leading to prolonged waiting time and increased risk exposure. To address this challenge, this study proposes dynamically deploying mobile charging trucks (MCTs) to complement FCSs, and develops an Adaptive Risk-aware MCT Deployment (ARMD) framework for real-time operation. It divides the MCT deployment into two problems: risk-aware allocation of MCTs among FCSs and dynamic routing of MCTs to the assigned FCSs, and solves them under an offline-to-online paradigm. The resource allocation problem is formulated as a decentralized partially observable Markov decision process, and a multi-agent proximal policy optimization (MAPPO)-based policy is developed to coordinate multiple MCTs under decentralized observations. The policy is pre-trained offline in an evacuation simulator and adaptively refined online according to current evacuation context. For routing, a spatio-temporal travel time predictor is developed to support rolling-horizon route updates. The proposed framework is evaluated in a simulated hurricane evacuation environment built using real-world data from Hillsborough County, Florida. Experiments show that ARMD consistently outperforms offline optimization, online heuristic dispatch, and rolling-horizon optimization in reducing risk exposure. For demand perturbation scenarios, ARMD reduces average risk exposure by up to 71.1%, relative to the baseline without MCTs. In the case of fixed e-vehicle charging infrastructure or road link failures, ARMD achieves 39.3% to 60.5% reduction in average risk exposure, with its advantages becoming more pronounced as the severity of disruption increases. These results demonstrate the effectiveness and robustness of ARMD in enhancing mobile charging operations for realistic scenarios of uncertain evacuation conditions.
Rui Ma, Zilin Bian, Kaan Ozbay
New York University · Rochester Institute of Technology
Traffic management has traditionally focused on toll-based and road pricing solutions. However, road pricing often raises concerns about accessibility and public dissatisfaction, leading to its prohibition in some places, such as Finland. This study optimises the dynamic allocation of incentives to drivers, encouraging them to reroute onto alternative (potentially longer) paths to achieve greater societal benefit, reduced total travel time (TTT) and total emissions in the transportation network, contributing to sustainable urban mobility. We employ a multi-agent reinforcement learning approach to dynamically assign incentives to drivers to reduce both TTT and emissions, with travel times estimated using traffic simulation software. We demonstrate that, with an unlimited budget and an objective of minimising travel time, the incentive scheme reduces TTT by 16%, compared to the dynamic User-Equilibrium (UE) with a budget equivalent to about 11% of the UE total time. When the goal is to minimise emissions, a 9% reduction in CO2 emissions is observed under an unlimited budget. We demonstrate a critical trade-off: minimising TTT leads to an increase in emissions, while prioritising emission reductions raises TTT. However, with the right combination of weights in the multi-objective function, both TTT and total emissions are improved beyond the baseline.
Germán Pardo-González, Shaghayegh Vosough, Katerina Papadaki +1
Dept. of Mathematics, London School of Economics and Political Science, London, UK · Dept. of Built Environment, Aalto University, Espoo, Finland · Centre for Industrial Management/Traffic and Infrastructure, KU Leuven, Leuven, Belgium