Distributed Real-Time Vehicle Control for Emergency Vehicle Transit: A Scalable Cooperative Method
Authors: WenXi Wang, JunQi Zhang
Organizations: School of Computer Science and Technology, Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China
Rapid transit of emergency vehicles is critical for saving lives and reducing property loss but often relies on surrounding ordinary vehicles to cooperatively adjust their driving behaviors. It is important to ensure rapid transit of emergency vehicles while minimizing the impact on ordinary vehicles. Centralized mathematical solver and reinforcement learning are the state-of-the-art methods. The former obtains optimal solutions but is only practical for small-scale scenarios. The latter implicitly learns through extensive centralized training but the trained model exhibits limited scalability to different traffic conditions. Hence, existing methods suffer from two fundamental limitations: high computational cost and lack of scalability. To overcome above limitations, this work proposes a scalable distributed vehicle control method, where vehicles adjust their driving behaviors in a distributed manner online using only local instead of global information. We proved that the proposed distributed method using only local information is approximately equivalent to the one using global information, which enables vehicles to evaluate their candidate states and make approximately optimal decisions in real time without pre-training and with natural adaptability to varying traffic conditions. Then, a distributed conflict resolution mechanism is further proposed to guarantee vehicles' safety by avoiding their decision conflicts, which eliminates the single-point-of-failure risk of centralized methods and provides deterministic safety guarantees that learned methods cannot offer. Compared with existing methods, simulation experiments based on real-world traffic datasets demonstrate that the proposed method achieves faster decision-making, less impact on ordinary vehicles, and maintains much stronger scalability across different traffic densities and road configurations.
Figures & tables
Paper
Optimization Objective
Solution Method
Case Size
Algorithm Usage Condition
Control Paradigm
Training Time
Max Lane Count
Murray-Tuite et al.
EMV speed
Genetic algorithm
A segment with 20 OVs
None
Centralized
0
3
Hannoun et al.
EMV speed
CPLEX
A segment with 15 OVs
None
Centralized
0
3
Wu et al.
EMV speed, lane clearance cost
A* algorithm & commercial solvers
A segment with 54 OVs
None
Centralized
0
3
Lin et al.
EMV efficiency; state-change count
Customized algorithm & Gurobi
3 segments with 144 OVs
None
Centralized
0
3
Yang et al.
EMV efficiency; state-change count
Graph conv. soft actor-critic (GSAC)
A long segment with 80 OVs
Within 100 m ahead of EMV
Distributed
10–15 h
3
This paper
EMV efficiency; state-change count
Distributed real-time vehicle control
3 long segments with 436 OVs
None
Distributed
0
5
TABLE I: Comparison of Methods Based on Road Segment Vehicle Control Strategy
Fig. 1: Discretization of the considered roadway network.
Level
Speed (cells/s)
Speed (m/s)
0
0
0
1
1
6
2
2
12
3
3
18
4
4
24
5
5
30
TABLE II: SPEED LOOKUP TABLE FOR EMVs AND OVs
Fig. 2: Illustration of prediction horizon Fj,n .
Fig. 3: Illustration of a platoon. Vehicles in the platoon share the same lane and speed with consecutive positions. OV n needs to check whether the platoon’s head ( nk ) or tail ( n1 ) conflicts with other vehicles.
Fig. 4: Sensitivity analysis of weight parameters. (a) Mean total lane changes. (b) Mean versus standard deviation. The blue star indicates the optimal configuration.
Name
Type
Dimension
Domain
TH
Integer variable
1
[3, 12]
△
Integer variable
1
[1, TH )
int
Integer variable
(TH,∣N∣)
[1, I ]
ant
Integer variable
(TH−1,∣N∣)
[0, 1]
bnt
Integer variable
(TH−1,∣N∣)
[0, 1]
lnt
Integer variable
(TH,∣N∣)
[1, 3]
TABLE III: MAIN PARAMETERS USED IN COMPARISON ALGORITHMS
Parameter
Value
GSAC Training Environment
Number of lanes
3
Traffic density
110 veh/km
Average initial OV speed VˉOV
2
GSAC Network Architecture
FCN Encoder
2 layers, 32 units each
TABLE IV: PARAMETER SETTINGS OF GSAC_IDM
Case
The value of f′
Total planning time ( s )
Collision Rate (%)
SDVC
GSAC_IDM
CRHA
CRHA_1
CRHA_2
SDVC
GSAC_IDM
CRHA
CRHA_1
CRHA_2
SDVC
GSAC_IDM
CRHA
CRHA_1
CRHA_2
30_14_5
16
27
13 /22.38/145
13 /16.17/59
13 /15.60/30
0.036
0.01
1.07/7.92/14.88
0.52/4.39/8.90
0.49/4.10/10.28
0
0
0
0
0
35_18_4
25
51
27/83.45/205
25 /31.00/88
25 /29.11/68
0.046
0.01
1.24/12.85/22.12
0.92/11.30/20.07
0.58/9.79/20.05
0
0
0
0
0
43_15_5
28
58
27 /96.89/253
28/52.81/133
28/36.59/49
0.036
0.01
2.04/12.71/18.13
1.38/11.52/20.05
0.82/10.56/18.09
0
0
0
0
0
47_18_4
25
61
28/100.67/292
32/54.91/175
31/51.70/152
0.043
0.01
2.46/13.91/20.92
2.15/12.03/16.49
1.19/11.71/20.08
0
6
0
0
0
54_24_3
14
24
14 /28.67/233
14 /19.82/55
14 /18.82/27
0.061
0.02
2.65/15.85/24.81
1.51/9.61/17.55
1.48/8.68/15.38
0
0
0
0
0
TABLE V: COMPARISON OF DIFFERENT ALGORITHMS
Fig. 5: Vehicle trajectories under the proposed SDVC in case 54_24_3.
Density (veh/km)
∣N∣
Δv
f′↓
Collision Rate (%) ↓
Decision Time (ms) ↓
SDVC
GSAC_IDM
SDVC
GSAC_IDM
SDVC
GSAC_IDM
64
81
1
27
34
0
0
2.5
0.75
76
96
1
56
71
0
0
2.5
0.75
2
60
90
0
1
2.4
0.75
88
111
1
61
126
0
2
2.4
0.75
2
66
178
0
4
2.5
0.75
TABLE VI: Performance Comparison Under Varying Traffic Density and Speed Heterogeneity
Fig. 6: Variation trends of f′ under different traffic densities and speed heterogeneity levels.
Lane Count
∣N∣
f′↓
Collision Rate (%) ↓
Decision Time (ms) ↓
SDVC
GSAC_IDM
SDVC
GSAC_IDM
SDVC
GSAC_IDM
3
141
125
245
0
6
2.7
0.75
4
192
156
304
0
7
2.7
0.75
5
248
150
288
0
4
2.7
0.75
TABLE VII: Performance Comparison Under Varying Lane Configurations