setting [2]—is needed for the ADMM iterations. Each CF-LCC subsystem exchanges only temporary computing data
with its neighbours, contributing to V2V/V2X communication efficiency and local trajectory data privacy.
Finally, we carry out two different scales of traffic simulations to validate the performance of distributed DeeP-LCC.
The moderate-scale experiment (15 vehicles with 5CAVs) shows that distributed DeeP-LCC could cost much less
computing time than centralized DeeP-LCC, with a suboptimal performance in smoothing traffic flow. The exper-
iment on the large-scale mixed traffic system (100 vehicles with 5% −20% CAVs), where the computation time
for centralized DeeP-LCC is completely unacceptable, further verifies the capability and scalability of distributed
DeeP-LCC in real-time mitigating traffic waves, saving over 31.84% fuel consumption.
1.3. Paper Organization and Notations
The rest of this paper is organized as follows. Section 2presents the input/output data of mixed traffic flow,
and Section 3briefly reviews the previous results on centralized DeeP-LCC. Section 4presents the cooperative
DeeP-LCC formulation, and Section 5provides a tailored ADMM based distributed DeeP-LCC algorithm. Traffic
simulations are discussed in Section 6, and Section 7concludes this paper.
Notation: We denote Nas the set of all natural numbers, Nj
ias the set of natural numbers in the range of [i, j]
with i≤j,0nas a zero vector of size n,0m×nas a zero matrix of size m×n, and Inas an identity matrix of
size n×n. For a vector aand a symmetric positive definite matrix X,kak2
Xdenotes the quadratic form a>Xa.
Given vectors a1, a2, . . . , am, we denote col(a1, a2, . . . , am) = a>
1, a>
2, . . . , a>
m>. Given matrices of the same
column size A1, A2, . . . , Am, we denote col(A1, A2, . . . , Am) = A>
1, A>
2, . . . , A>
m>. Denote diag(x1, . . . , xm)as
a diagonal matrix with x1, . . . , xmon its diagonal entries, and diag(D1, . . . , Dm)as a block-diagonal matrix with
matrices D1, . . . , Dmon its diagonal blocks. Finally, ⊗represents the Kronecker product.
2. Input/Output Definition of Mixed Traffic Flow
Consider a general single-lane mixed traffic system shown in Fig. 1(b), where there exist one head vehicle, n
CAVs, and mHDVs. The head vehicle, indexed as vehicle 0, represents the vehicle immediately ahead of the first
CAV. The CAVs are indexed as 1,2, . . . , n from front to end. Behind CAV i(i∈Nn
1), there might exist mi(mi≥0,
Pn
i=1 mi=m) HDVs, and they are indexed as 1(i),2(i), . . . , m(i)
iin sequence. We introduce the following notations
for the set consisting of vehicle indices—Ω: all the vehicles; Nn
1: all the CAVs; F: all the HDVs; Fi: those HDVs
following behind CAV i. Precisely, we have
Fi={1(i),2(i), . . . , m(i)
i}, i ∈Nn
1;F=F1∪ F2∪ ··· ∪ Fn; Ω = Nn
1∪ F.
Note that HDV m(i)
i(if it exists) is the vehicle immediately ahead of CAV i+ 1,i∈Nn−1
1, and HDV m(n)
nrepresents
the last vehicle in this mixed traffic system. It is assumed in this paper that all the vehicles, including CAVs and HDVs,
are connected to the V2X communication network. Particularly, the velocity signal of the HDVs can be acquirable by
the cloud unit in the centralized framework, or the CAVs in the distributed framework. Nevertheless, all the results
can be generalized to the case where partial HDVs have connected capabilities, which will be discussed later.
2.1. Definition for Input, Output and State
We first specify the measurable output signals in the mixed traffic system. Denote the velocity and spacing of
vehicle i(i∈Ω) at time tas vi(t)and si(t), respectively. To achieve wave mitigation in mixed traffic, the CAVs
need to stabilize the traffic flow at a certain equilibrium state, where each vehicle moves with an identical equilibrium
velocity v∗,i.e.,vi(t) = v∗, i ∈Ω, whilst maintaining an equilibrium spacing s∗. Here for simplicity, we use a
homogeneous value s∗, but it could be varied for different vehicles.
Define the error states, including velocity errors ˜vi(t)and spacing errors ˜si(t)from the equilibrium, as follows
˜vi(t) = vi(t)−v∗,˜si(t) = si(t)−s∗, i ∈Ω,(1)
It is worth noting that in practice, not all the error states in (1) are directly measurable. The raw data from V2X
communications are mostly absolute position and velocity signals. To estimate the equilibrium velocity v∗and obtain
4