Vehicle platooning using connected and automated vehicles (CAVs) has attracted considerable attention. In this paper, we address the problem of optimal coordination of CAV platoons at a highway on-ramp merging scenario. We present a single-level constrained optimal control framework that optimizes the fuel economy and travel time of the platoons while satisfying the state, control, and safety constraints. We also explore the effect of delayed communication among the CAV platoons and propose a robust coordination framework to enforce lateral and rear-end collision avoidance constraints in the presence of bounded delays. We provide a closed-form analytical solution to the optimal control problem with safety guarantees that can be implemented in real time. Finally, we validate the effectiveness of the proposed control framework using a high-fidelity commercial simulation environment.
Citation: A M Ishtiaque Mahbub, Behdad Chalaki, Andreas A. Malikopoulos. A constrained optimal control framework for vehicle platoons with delayed communication[J]. Networks and Heterogeneous Media, 2023, 18(3): 982-1005. doi: 10.3934/nhm.2023043
[1] | Jingjing Li, Zhigang Huang . Radial distributions of Julia sets of difference operators of entire solutions of complex differential equations. AIMS Mathematics, 2022, 7(4): 5133-5145. doi: 10.3934/math.2022286 |
[2] | Hong Li, Keyu Zhang, Hongyan Xu . Solutions for systems of complex Fermat type partial differential-difference equations with two complex variables. AIMS Mathematics, 2021, 6(11): 11796-11814. doi: 10.3934/math.2021685 |
[3] | Nan Li, Jiachuan Geng, Lianzhong Yang . Some results on transcendental entire solutions to certain nonlinear differential-difference equations. AIMS Mathematics, 2021, 6(8): 8107-8126. doi: 10.3934/math.2021470 |
[4] | Yeyang Jiang, Zhihua Liao, Di Qiu . The existence of entire solutions of some systems of the Fermat type differential-difference equations. AIMS Mathematics, 2022, 7(10): 17685-17698. doi: 10.3934/math.2022974 |
[5] | Guowei Zhang . The exact transcendental entire solutions of complex equations with three quadratic terms. AIMS Mathematics, 2023, 8(11): 27414-27438. doi: 10.3934/math.20231403 |
[6] | Wenju Tang, Keyu Zhang, Hongyan Xu . Results on the solutions of several second order mixed type partial differential difference equations. AIMS Mathematics, 2022, 7(2): 1907-1924. doi: 10.3934/math.2022110 |
[7] | Fengrong Zhang, Linlin Wu, Jing Yang, Weiran Lü . On entire solutions of certain type of nonlinear differential equations. AIMS Mathematics, 2020, 5(6): 6124-6134. doi: 10.3934/math.2020393 |
[8] | Wenjie Hao, Qingcai Zhang . The growth of entire solutions of certain nonlinear differential-difference equations. AIMS Mathematics, 2022, 7(9): 15904-15916. doi: 10.3934/math.2022870 |
[9] | Minghui Zhang, Jianbin Xiao, Mingliang Fang . Entire solutions for several Fermat type differential difference equations. AIMS Mathematics, 2022, 7(7): 11597-11613. doi: 10.3934/math.2022646 |
[10] | Zhiying He, Jianbin Xiao, Mingliang Fang . Unicity of transcendental meromorphic functions concerning differential-difference polynomials. AIMS Mathematics, 2022, 7(5): 9232-9246. doi: 10.3934/math.2022511 |
Vehicle platooning using connected and automated vehicles (CAVs) has attracted considerable attention. In this paper, we address the problem of optimal coordination of CAV platoons at a highway on-ramp merging scenario. We present a single-level constrained optimal control framework that optimizes the fuel economy and travel time of the platoons while satisfying the state, control, and safety constraints. We also explore the effect of delayed communication among the CAV platoons and propose a robust coordination framework to enforce lateral and rear-end collision avoidance constraints in the presence of bounded delays. We provide a closed-form analytical solution to the optimal control problem with safety guarantees that can be implemented in real time. Finally, we validate the effectiveness of the proposed control framework using a high-fidelity commercial simulation environment.
In this paper, we investigate the common transcendental directions of derivatives, primitives and Jackson difference operators of f, which is a non-trivial solution of the linear differential equation
f(n)+An−1f(n−1)+...+A0f=0, | (1.1) |
where n(≥2) is an integer and Ai(z)(i=0,1,...,n−1) are entire functions of finite lower order.
To accurately describe and study our problems, we need some basic results on complex dynamics of transcendental meromorphic functions. Let f: C→C∪{∞} be a transcendental meromorphic function in the complex plane C, and fn(z)=f∘(fn−1)(z),n∈N denote the n-th iterate of f(z). The Fatou set of f is denoted by F(f), that is the set of points such that {fn}∞n=1 is defined and normal in a neighborhood of z and the Julia set J(f) is its complement. It is well-known that F(f) is open, J(f) is closed and non-empty. More basic knowledge of complex dynamics can be found in [3].
For a transcendental entire function f, Baker [2] first observed that J(f) cannot lie in finitely many rays emanating from the origin. In 1994, Qiao [11] introduced the limiting directions of a Julia set from a viewpoint of angular distribution.
Definition 1.1. [11] The ray argz=θ(θ∈[0,2π)) is said to be a limiting direction of J(f) if Ω(θ−ε,θ+ε)∩J(f) is unbounded for any ε>0, where Ω(θ−ε,θ+ε)={z∈Cc|argz∈(θ−ε,θ+ε)}.
The set of arguments of all limit directions of J(f) is denoted by
Δ(f)={θ∈[0,2π)|the ray argz=θis a limiting direction ofJ(f)}. |
It is known that Δ(f) is closed and measurable and we use mesΔ(f) stands for its linear measure. For brevity, we call a limiting direction of the Julia set of f a Julia limiting direction of f. The Nevanlinna theory is an important tool in this paper. In what follows, we use some standard notations such as proximity function m(r,f), counting function of poles N(r,f), Nevanlinna characteristic function T(r,f) and some basic results in [7]. The order ρ(f) and lower order μ(f) of f(z) are defined by
ρ(f)=lim supr→∞log+T(r,f)logr,μ(f)=lim infr→∞log+T(r,f)logr, |
respectively. The deficiency of the value a is denoted by δ(a,f), and if δ(a,f)>0, we say that a is a Nevanlinna deficient value of f(z).
Qiao[10] proved that if f(z) is a transcendental entire function of finite lower order, then mesΔ(f)≥min{2π,π/μ(f)}. Recall J(tanz)=R, then we know the conclusion fails for general meromorphic functions. But under some conditions, Qiao's result can be generalized. In [16], Zheng et al. proved that for a transcendental meromorphic function f(z) with μ(f)<∞ and δ(∞,f)>0, if J(f) has an unbounded component, then mesΔ(f)≥min{2π,4μ(f)arcsin√δ(∞,f)2}. In [12], Qiu and Wu showed that the conclusion is still valid without the assumption that J(f) has an unbounded component. Some new progress on Julia limiting directions can be found in [5,8,13,14,15,16]. Especially, in order to analyze the structure of the limit directions, Wang and Yao[15] introduced a new direction in which f grows faster than any polynomials is a limit direction of f.
Definition 1.2. [15] A value θ∈[0,2π) is said to be a transcendental direction of f if there exists an unbounded sequence of {zn} such that
limn→∞argzn=θandlimn→∞log|f(zn)|log|zn|=+∞. |
We use TD(f) to denote the union of all transcendental directions of f. Clearly, TD(f) is non-empty and closed.
It is known that the growth properties of the function can affect the geometry and topology of the Julia sets and we can find that even weak growth along some unbounded sequence could be closely related to Julia limiting directions. Indeed, Wang and Yao obtained the following.
Theorem A.[15] Let f be a transcendental meromorphic function. If either f has a direct tract or J(f)∪{∞} is uniformly perfect at some point in J(f). Then
TD(f)⊂Δ(f). |
Remark 1.1. Actually, every transcendental entire function has at least a direct, and if J(f) has an unbounded component, then J(f)∪{∞} is uniformly perfect at some point in J(f). Theorem A implies that many Julia limiting directions come from transcendental directions. Therefore, it is interesting to study the properties of transcendental directions since this may help us study the structure of Julia limiting direction. Although the concept of the transcendental direction is not introduced before, the idea to associate the Julia limiting directions with the growth rate of f in the directions has already appeared in Qiao[10] and Zheng-Wang-Huang[16]. Here, we give an example to illustrate the concepts of the transcendental direction and the Julia limiting direction.
Example 1.1. Let f(z)=λexpz(λ∈C∖{0}). Clearly, TD(f)=[−π2,π2]. When 0<λ≤1e, J(f) is contained in the half plane Re(z)≥1, so Δ(f)=TD(f), while Δ(expz)=[0,2π) since J(expz)=C. This also shows that TD(f)⊂Δ(f) may happen.
By the results in [10,12,16], the measure of Δ(f) has a lower bound for some transcendental meromorphic functions, then the relationship TD(f)⊂Δ(f) in Theorem A motivates us to pose a question : Can we estimate the lower bound of measure of TD(f)? In [15], Wang and Yao partially answered this question.
Theorem B.[15] Let f be a transcendental meromorphic function. If μ(f)<∞ and δ(∞,f)>0, then
mes(TD(f))≥min{2π,4μ(f)arcsin√δ(∞,f)2}. |
Remark 1.2. From Theorem B, a natural question arises: For meromorphic functions with infinite lower order, what is sufficient conditions for the existence of lower bound of the measure of TD(f)? Moreover, for entire functions and their derivatives, the difference between their local properties are astonishing. Then there exists another question: What is the relation between the transcendental directions of entire functions and that of their derivatives?
Inspired by Theorem B, we try to answer the two questions. Actually, if f is a transcendental meromorphic function of finite lower order, then it must have sequences of Pólya peaks (see Lemma 2.3). Therefore, we can estimate the lower bound of the measure of set of transcendental directions of transcendental meromorphic functions of finite lower order by using sequences of Pólya peaks. But for a transcendental meromorphic function f with infinite lower order, it is impossible to use sequences of Pólya peaks to consider the lower bound of the measure of TD(f) because Lemma 2.3 can only apply to a transcendental meromorphic function with finite lower order. Therefore, we need to seek a new method to study the transcendental directions of entire solutions with infinite lower order. Indeed, we shall show that the transcendental directions of f(z), its k-th derivatives and its k-th integral primitive have a large amount of common transcendental directions. Set I(f)=⋂k∈ZTD(f(k)), where f(k) denotes the k-th derivative of f(z) for k≥0 or k-th integral primitives of f(z) for k<0. Our result can be stated as follows.
Theorem 1.1. Let Ai(z)(i=0,1,...,n−1) be entire functions of finite lower order such that A0 is transcendental and m(r,Ai)=o(m(r,A0))(i=1,2,...,n−1) as r→∞. Then, every non-trivial solution f of Eq (1.1) satisfies mesI(f)≥min{2π,π/μ(A0)}.
Remark 1.3. It is easy to see that every non-trivial solution f of Eq (1.1) is an entire function with infinite lower order. Since A0(z) is entire and transcendental, then limr→∞m(r,A0)logr=∞. Applying the lemma of logarithmic derivatives to Eq (1.1) yields
m(r,A0)≤n∑i=1m(r,f(i)f)+n−1∑i=1m(r,Ai)+O(1)=O(logT(r,f)+logr)+o(m(r,A0)), |
outside of a possible exceptional set E of finite linear measure. Therefore, all non-trivial solutions of Eq (1.1) are entire functions with infinite lower order.
Remark 1.4. In [14], Wang and Chen proved mes(⋂k∈ZΔ(f(k)))≥min{2π,π/μ(A0)} under the conditions of Theorem 1.1. Clearly, in the case that μ(A0)<1/2, we know all Julia limiting directions of f come from its transcendental directions.
In [4], Cao et al. recalled the Jackson difference operator
Dqf(z)=f(qz)−f(z)qz−z,z∈C∖{0},q∈C∖{0,1}. |
For k∈N∪{0}, the Jackson k-th difference operator is denoted by
D0qf(z):=f(z),Dkqf(z):=Dq(Dk−1qf(z)). |
Clearly, if f is differentiable,
limq→1Dkqf(z)=f(k)(z). |
From Theorem 1.1, we know the set of transcendental directions of derivatives of every non-trivial solution f(z) of Eq (1.1) must have a definite range of measure with some additional conditions. Naturally, a question arise: Can we estimate the lower bound of measure of TD(Dkqf)? Furthermore, what is the relation between the transcendental directions of entire functions and those of their Jackson difference operators?
To answer these questions, we first need to figure out the growth of Dkqf(z). In 2020, Long et al. [9] considered the growth of q difference operator ˆDqf(z):=f(qz)−f(z) of the transcendental meromorphic function and obtained the following result.
Theorem C.[9] If f is a transcendental meromorphic function and |q|≠1, then ρ(ˆDqf)=ρ(f) and μ(ˆDqf)=μ(f).
Moreover, in the introduction of [9], the authors pointed out that this result also holds for Jackson difference operators. In fact, we know the set of transcendental directions of a transcendental entire function with finite lower order must have a definite range of measure from Theorem B. Hence, the left is the case of entire functions with infinite lower order. From Remark 1.3, we know that every non-trivial solution f of Eq (1.1) is an entire function with infinite lower order, and by [9], the k-th Jackson difference operator Dkqf of f is also of infinite lower order if f is a transcendental meromorphic with infinite lower order. Therefore, motivated by these facts, we try to study the common transcendental directions of solutions of Eq (1.1) and their Jackson difference operator. Here, we denote R(f)=⋂k∈N∪{0}TD(Dkqf), where q∈(0,+∞)∖{1}. Then we have the following result.
Theorem 1.2. Let Ai(z)(i=0,1,...,n−1) be entire functions of finite lower order such that A0 is transcendental and m(r,Ai)=o(m(r,A0))(i=1,2,...,n−1) as r→∞. Then, every non-trivial solution f of Eq (1.1) satisfies mesR(f)≥min{2π,π/μ(A0)} for all q∈(0,+∞)∖{1}.
Remark 1.5. Although limq→1Dkqf(z)=f(k)(z), it just means that the k-th derivative is the limit of a family of Jackson difference operator. In Theorem 1.1, our calculation of the integral primitives of f(z) depends on the lemma of logarithmic derivatives in the angular domain. At present, we only have the Jackson difference analogue of logarithmic derivative lemma for meromorphic functions with zero order in the whole plane, see [4]. Therefore, for k<0, we do not have sufficient conditions to estimate the lower bound of measure of TD(Dkqf). Thus, Theorem 1.1 still makes sense.
Usually, we cannot expect too much close relations of transcendental directions between ˆDqf and f. But Theorem C shows us that f and ˆDqf have both the same order and lower order. So we may also consider the measure of transcendental directions of k-th q difference operators of meromorphic functions with infinite lower order. Now, we denote the k-th q difference operator by
ˆD0qf(z):=f(z),ˆDkqf(z):=ˆDq(ˆDk−1qf(z)), |
where k∈N∪{0}. Here, we denote E(f)=⋂k∈N∪{0}TD(ˆDkqf), where q∈(0,+∞)∖{1}. Then we have the following result.
Theorem 1.3. Let Ai(z)(i=0,1,...,n−1) be entire functions of finite lower order such that A0 is transcendental and m(r,Ai)=o(m(r,A0))(i=1,2,...,n−1) as r→∞. Then, every non-trivial solution f(z) of Eq (1.1) satisfies mesE(f)≥min{2π,π/μ(A0)} for all q∈(0,+∞)∖{1}.
Before introducing lemmas, we recall the Nevanlinna characteristic in an angle, see[6,17]. Assuming 0<α<β<2π, we denote
Ω(α,β)={z∈C|argz∈(α,β)}, |
Ω(α,β,r)={z∈C|z∈Ω(α,β),|z|<r}, |
Ω(r,α,β)={z∈C|z∈Ω(α,β),|z|>r}, |
and use ¯Ω(α,β) to denote the closure of Ω(α,β).
Let g(z) be meromorphic on the angular ¯Ω(α,β), we define
Aα,β(r,g)=ωπ∫r1(1tω−tωr2ω){log+|g(teiα)|+log+|g(teiβ)|}dtt,Bα,β(r,g)=2ωπrω∫βαlog+|g(reiθ)|sinω(θ−α)dθ,Cα,β(r,g)=2∑1<|bn|<r(1|bn|ω−|bn|ωr2ω)sinω(βn−α), |
where ω=π/(β−α), and bn=|bn|eiβn are the poles of g(z) in ¯Ω(α,β) according to their multiplicities. The Nevanlinna angular characteristic is defined as follows:
Sα,β(r,g)=Aα,β(r,g)+Bα,β(r,g)+Cα,β(r,g). |
In particular, we use σα,β(g)=lim supr→∞logSα,β(r,g)logr to denote the order of Sα,β(r,g). The following lemmas play the key roles in proving our results.
Lemma 2.1. [17] Let f(z) be a meromorphic function on Ω(α−ε,β+ε) for ε>0 and 0<α<β<2π. Then
Aα,β(r,f′f)+Bα,β(r,f′f)≤K(log+Sα−ε,β+ε(r,f)+logr+1). |
Lemma 2.2. [8] Let z=rexp(iψ),r0+1<r and α≤ψ≤β, where 0<β−α≤2π. Suppose that n(≥2) is an integer, and that g(z) is analytic in Ω(r0,α,β) with σα,β<∞. Choose α<α1<β1<β, then, for every ε∈(0,βj−αj2)(j=1,2,...,n−1) outside a set of linear measure zero with
αj=α+j−1∑s=1εsandβj=β+j−1∑s=1εs,j=2,3,...,n−1, |
there exist K>0 and M>0 only depending g, ε1,...,εn−1 and Ω(αn−1,βn−1), and not depending on z such that
|g′(z)g(z)|≤KrM(sink(ψ−α))−2 |
and
|g(n)(z)g(z)|≤KrM(sink(ψ−α)n−1∏j=1sinkj(ψ−αj))−2 |
for all z∈Ω(αn−1,βn−1) outside an R-set D, where k=π/(β−α) and kεj=π/(βj−αj(j=1,2,...,n−1)).
To estimate the measure of TD(f), we need to find the directions in which f grows faster than any polynomial. For this we will use the following result of Baernstein.
Lemma 2.3. [1] Let f(z) be a transcendental meromorphic function of finite lower order μ, and have one deficient value a. Let Λ(r) be a positive function with Λ(r)=o(T(r,f)) as r→∞. Then for any fixed sequence of Pólya peaks {rn} of order μ, we have
lim infr→∞mesDΛ(rn,a)≥min{2π,4μarcsin√δ(a,f)2}, | (2.1) |
where DΛ(r,a) is defined by
DΛ(r,∞)={θ∈[−π,π):|f(reiθ)|>eΛ(r)}, |
and for finite a,
DΛ(r,a)={θ∈[−π,π):|f(reiθ)−a|<e−Λ(r)}. |
Proof of Theorem 1.1. The assertion mesI(f)≥σ:=min{2π,π/μ(A0)} would be obtained by reduction to absurdity. Suppose on the contrary that mesI(f)<σ:=min{2π,π/μ(A0}. Then t:=σ−mesI(f)>0. For every k∈Z, TD(f(k)) is closed, and so I(f) is a closed set. Denoted by S:=(0,2π)∖I(f) the complement of I(f). Then S is open, so it consists of at most countably many open intervals. We can choose finitely many open intervals Ii=(αi,βi)(i=1,2,...,m) in S such that
mes(S∖m⋃i=1Ii)<t4. | (3.1) |
For every θi∈Ii, argz=θi is not a transcendental direction of f(k) for some k∈Z. Then there exists an angular domain Ω(θi−ξθi,θi+ξθi) such that
(θi−ξθi,θi+ξθi)⊂IiandΩ(θi−ξθi,θi+ξθi)∩TD(f(k))=∅, | (3.2) |
where ξθi is a constant depending on θi. Hence, ⋃θi∈Ii(θi−ξθi,θi+ξθi) is an open covering of [αi+ε,βi−ε] with 0<ε<min{(βi−αi)/6,i=1,2,...,m}. By Heine-Borel theorem, we can choose finitely many θij, such that
[αi+ε,βi−ε]⊂si⋃j=1(θij−ξθij,θij+ξθij). |
From (3.2) and the definition of transcendental direction, we have
|f(k)(z)|=O(|z|d),z∈Ω(α∗ij,β∗ij), | (3.3) |
where d is a positive constant, α∗ij=θij−ξθij+ε and β∗ij=θij+ξθij−ε.
Case 1. Suppose k≥0. We note the fact that
f(k−1)(z)=∫z0f(k)(ζ)dζ+c, |
where c is a constant, and the integral path is the segment of a straight line from 0 to z. From this and (3.3), we can deduce f(k−1)(z)=O(|z|d+1) for z∈Ω(α∗ij,θ∗ij). Repeating the discussion k times, we can obtain
f(z)=O(|z|d+k),z∈Ω(α∗ij,β∗ij). |
It means that
Sα∗ij,β∗ij(r,f)=O(logr). | (3.4) |
Case 2. Suppose k<0. Clearly, for f(k)(z), there is not just one primitive, but a whole family. However, for any integral primitive f(k+1)(z), we have
Sα∗ij+ε′,β∗ij−ε′(r,f(k+1))≤Sα∗ij+ε′,β∗ij−ε′(r,f(k+1)f(k))+Sα∗ij+ε′,β∗ij−ε′(r,f(k)) |
for |k|ε′=ε.
By (3.3) and Lemma 2.1, we can obtain
Sα∗ij+ε′,β∗ij−ε′(r,f(k+1))=O(logr). |
Using the discussion |k| times, we have
Sα∗ij+ε,β∗ij−ε(r,f)=O(logr). | (3.5) |
It follows from (3.4) and (3.5) that whatever k is positive or not, we always have
Sα∗ij+ε,β∗ij−ε(r,f)=O(logr). | (3.6) |
Therefore, by Lemma 2.2, there exists two constants M>0 and K>0 such that
|f(s)(z)f(z)|≤KrM,(s=1,2,...,n) | (3.7) |
for all z∈⋃mi=1⋃sij=1Ω(θij−ξθij+3ε,θij+ξθij−3ε) outside a R-set H.
Next, we define
Λ(r)=max{√logr,√m(r,A1),...,√m(r,An−1)}√m(r,A0). |
It is clear that Λ(r)=o(m(r,A0)) and m(r,Ai)=o(Λ(r)),i=1,2,...,n. Since A0 is entire, ∞ is a deficient value of A0 and δ(∞,A0)=1. By Lemma 2.3, there exists an increasing and unbounded sequence {rk} such that
mesDΛ(rk)≥σ−t/4, | (3.8) |
where
DΛ(r):=DΛ(r,∞)={θ∈[−π,π):log|A0(reiθ)|>Λ(r)}, | (3.9) |
and all rk∉{|z|:z∈H}. Set
U:=∞⋂n=1EnwithEn:=∞⋃k=nDΛ(rk), | (3.10) |
one can see that
mes(U)=mes(∞⋂n=1En)=limn→∞mes(En). | (3.11) |
From (3.10), we know DΛ(rn)⊂En for each n. Then
limn→∞mes(En)≥lim infn→∞mes(DΛ(rn)). | (3.12) |
It follows from (3.8), (3.11) and (3.12) that
mes(U)≥lim infn→∞mes(DΛ(rn))≥σ−t/4. |
Clearly,
mes[(m⋃i=1Ii)∩U]=mes(S∩U)−mes[(S∖m⋃i=1Ii)∩U]≥mes(U)−mesI(f)−mes(S∖m⋃i=1Ii)≥σ−t4−mesI(f)−t4=t2. |
Let Jij=(θij−ξθij+3ε,θij+ξθij−3ε). Then
mes(m⋃i=1si⋃j=1Jij)≥mes(m⋃i=1Ii)−(3m+6ζ)ε, |
where ζ=∑mi=1si. Choosing ε small enough, we can deduce
mes[(m⋃i=1si⋃j=1Jij)∩U]≥t4. |
Thus there exists an open interval Ji0j0 such that
mes(Ji0j0∩U)>t4ζ>0. |
Let F=Ji0j0∩U, from (3.9), there exists a subsequence {rkj} of {rk} such that
∫Flog+|A0(rkjeiθ)|dθ≥t4ζΛ(rkj). | (3.13) |
On the other hand, coupling (1.1) and (3.7) leads to
∫Flog+|A0(rkjeiθ)|dθ≤∫F(n−1∑i=1log+|Ai(rkjeiθ)|)dθ+O(logrkj)≤n−1∑i=1m(rkj,Ai)+O(logrkj). | (3.14) |
(3.13) and (3.14) give out
t4ζΛ(rkj)≤n∑i=1m(rkj,Ai)+O(logrkj), | (3.15) |
which is impossible since m(r,Ai)=o(Λ(r))(i=1,...,n−1) as r→∞. Hence, we get
mesI(f)≥σ. |
Proof of Theorem 1.2. Firstly, we suppose that
mesR(f)<σ:=min{2π,π/μ(A0}. | (3.16) |
Then t:=σ−mesR(f)>0. Similarly as in the proof of Theorem 1.1, we have
|Dkqf(z)|=O(|z|d),z∈Ω(α∗ij,β∗ij), | (3.17) |
where d is a positive constant, α∗ij=θij−ξθij+ε and β∗ij=θij+ξθij−ε.
By the definition of Jackson k-th difference operator,
|Dkqf(z)|=|Dk−1qf(qz)−Dk−1qf(z)||qz−z|=O(|z|d),z∈Ω(α∗ij,β∗ij). | (3.18) |
Therefore,
|Dk−1qf(qz)−Dk−1qf(z)|=O(|z|d+1),z∈Ω(α∗ij,β∗ij). | (3.19) |
Thus, there exists a positive constants C such that
|Dk−1qf(qz)−Dk−1qf(z)|≤C(|z|d+1),z∈Ω(α∗ij,β∗ij). | (3.20) |
Case 1. Suppose q∈(0,1). Clearly, there exists a positive integer m such that (1q)m≤|z|≤(1q)m+1 for sufficiently large |z|. Therefore, 1≤|qmz|≤1q. Then there exists a positive constant M1 such that |Dk−1qf(qmz)|≤M1 for all z∈{z|1≤|qmz|≤1q}. Using inequality (3.20) repeatedly, we have
|Dk−1qf(z)−Dk−1qf(qz)|≤C(|z|d+1),|Dk−1qf(qz)−Dk−1qf(q2z)|≤C(|qz|d+1),...|Dk−1qf(qm−1z)−Dk−1qf(qmz)|≤C(|qm−1z|d+1). | (3.21) |
Taking the sum of all inequalities, we get
|Dk−1qf(z)|≤|Dk−1qf(z)−Dk−1qf(qz)|+|Dk−1qf(qz)−Dk−1qf(q2z)|+...+|Dk−1qf(qm−1z)−Dk−1qf(qmz)|+|Dk−1qf(qmz)|≤C(|z|d+1)+C(|qz|d+1)+...+C(|qm−1z|d+1)+M1≤mC(1+qd+1+...+q(m−1)(d+1))|z|d+1+M1=O(|z|d+1),z∈Ω(α∗ij,β∗ij). | (3.22) |
Therefore,
|Dk−1qf(z)|=O(|z|d+1),z∈Ω(α∗ij,β∗ij). | (3.23) |
Repeating the operations from (3.17) to (3.23), we have
|f(z)|=O(|z|d+k−1),z∈Ω(α∗ij,β∗ij). | (3.24) |
Case 2. Suppose q∈(1,+∞). If |z| is sufficiently large, there exists a positive integer n such that qn≤|z|≤qn+1. And this is exactly 1≤|zqn|≤q. Thus, there exists a positive constant M2 such that |Dk−1qf(zqn)|≤M2 for all z∈{z|1≤|zqn|≤q}. Using inequality (3.20) repeatedly, we have
|Dk−1qf(z)−Dk−1qf(zq)|≤C(|zq|d+1),|Dk−1qf(zq)−Dk−1qf(zq2)|≤C(|zq2|d+1),...|Dk−1qf(zqn−1)−Dk−1qf(zqn)|≤C(|zqn|d+1). | (3.25) |
Taking the sum of all inequalities, we get
|Dk−1qf(z)|≤|Dk−1qf(z)−Dk−1qf(zq)|+|Dk−1qf(zq)−Dk−1qf(zq2)|+...+|Dk−1qf(zqn−1)−Dk−1qf(zqn)|+|Dk−1qf(zqn)|≤C(|zq|d+1)+C(|zq2|d+1)+...+C(|zqn|d+1)+M2≤nC(1qd+1+1q2(d+1)+...+1qn(d+1))|z|d+1+M2=O(|z|d+1),z∈Ω(α∗ij,β∗ij). | (3.26) |
Therefore,
|Dk−1qf(z)|=O(|z|d+1),z∈Ω(α∗ij,β∗ij). | (3.27) |
Similarly as in (3.17)–(3.20), we have
|f(z)|=O(|z|d+k−1),z∈Ω(α∗ij,β∗ij). | (3.28) |
It means that
Sα∗ij,β∗ij(r,f)=O(logr). | (3.29) |
By the same reasoning as in (3.6) to (3.15), we can get a contradiction. Hence, we get
mesR(f)≥σ. |
This completes the proof of Theorem 1.2.
Proof of Theorem 1.3. Using ˆDkqf(z) instead of Dkqf(z) in the proof of Theorem 1.2 and by the definition of k-th q difference operator, we can prove Theorem 1.3 similarly.
In this article, we obtained the lower bound of the measure of the set of transcendental directions of a class of transcendental entire functions with infinite lower order, which are solutions of linear differential equations. We also discussed the case for the Jackson difference operators and q difference operators of such functions. Actually, we know the set of transcendental directions of a transcendental entire function with finite lower order must have a definite range of measure from Theorem B. Hence, the left is the case of entire functions with infinite lower order. Usually, it is difficult to estimate the lower bound of measure of the set of transcendental directions of a transcendental entire function with infinite lower order. However, our article obtained some results on the transcendental directions for a class of entire functions with infinite lower order. But for more general cases, we still need to find other ways to investigate the lower bound of the measure of the set of transcendental directions.
The work was supported by NNSF of China (No.11971344), Research and Practice Innovation Program for Postgraduates in Jiangsu Province (KYCX20\_2747).
The authors declare that they have no conflict of interest.
[1] | A. Al Alam, A. Gattami, K. H. Johansson, An experimental study on the fuel reduction potential of heavy duty vehicle platooning, 13th international IEEE conference on intelligent transportation systems, IEEE, Funchal, Portugal, (2010), 306–311. https://doi.org/10.1109/ITSC.2010.5625054 |
[2] |
J. Alam A. Martensson, K. H. Johansson, Experimental evaluation of decentralized cooperative cruise control for heavy-duty vehicle platooning, Control Eng. Pract., 38 (2015), 11–25. https://doi.org/10.1016/j.conengprac.2014.12.009 doi: 10.1016/j.conengprac.2014.12.009
![]() |
[3] |
J. Alonso, V. Milanés, J. Pérez, E. Onieva, C. González, T. de Pedro, Autonomous vehicle control systems for safe crossroads, Transp. Res. Part C Emerg. Technol., 19 (2011), 1095–1110. https://doi.org/10.1016/j.trc.2011.06.002 doi: 10.1016/j.trc.2011.06.002
![]() |
[4] | T. Ard, F. Ashtiani, A. Vahidi, H. Borhan, Optimizing gap tracking subject to dynamic losses via connected and anticipative mpc in truck platooning, American Control Conference (ACC), IEEE, Denver, CO, USA, (2020), 2300–2305. https://doi.org/10.23919/ACC45564.2020.9147849 |
[5] |
M. Athans, A unified approach to the vehicle-merging problem, Transp. Res., 3 (1969), 123–133. https://doi.org/10.1016/0041-1647(69)90109-9 doi: 10.1016/0041-1647(69)90109-9
![]() |
[6] | T. C. Au, P. Stone, Motion planning algorithms for autonomous intersection management, Bridging the gap between task and motion planning, AAAI press, (2010), 2–9. https://dl.acm.org/doi/abs/10.5555/2908515.2908516 |
[7] |
H. Bang, B. Chalaki, A. A. Malikopoulos, Combined optimal routing and coordination of connected and automated vehicles, IEEE Control Syst. Lett., 6 (2022), 2749–2754. https://doi.org/10.1109/LCSYS.2022.3176594 doi: 10.1109/LCSYS.2022.3176594
![]() |
[8] |
L. E. Beaver, B. Chalaki, A. M. Mahbub, L. Zhao, R. Zayas, A. A. Malikopoulos, Demonstration of a time-efficient mobility system using a scaled smart city, Veh. Syst. Dyn., 58 (2020), 787–804. https://doi.org/10.1080/00423114.2020.1730412 doi: 10.1080/00423114.2020.1730412
![]() |
[9] |
L. E. Beaver, A. A. Malikopoulos, Constraint-driven optimal control of multi-agent systems: A highway platooning case study, IEEE Control Syst. Lett., 6 (2022), 1754–1759. https://doi.org/10.1109/LCSYS.2021.3133801 doi: 10.1109/LCSYS.2021.3133801
![]() |
[10] | C. Bergenhem, S. Shladover, E. Coelingh, C. Englund, S. Tsugawa, Overview of platooning systems, Proceedings of the 19th ITS World Congress, Vienna, Austria, 2012. |
[11] |
B. Besselink, K. H. Johansson, String stability and a delay-based spacing policy for vehicle platoons subject to disturbances, IEEE Trans. Autom. Control, 62 (2017), 4376–4391. https://doi.org/10.1109/TAC.2017.2682421 doi: 10.1109/TAC.2017.2682421
![]() |
[12] |
A. K. Bhoopalam, N. Agatz, R. Zuidwijk, Planning of truck platoons: A literature review and directions for future research, Transp. Res. Part B Methodol., 107 (2018), 212–228. https://doi.org/10.1016/j.trb.2017.10.016 doi: 10.1016/j.trb.2017.10.016
![]() |
[13] | A. E. Bryson, Y. C. Ho, Applied optimal control: optimization, estimation and control, CRC Press, 1975. |
[14] |
B. Chalaki, L. E. Beaver, A. M. I. Mahbub, H. Bang, A. A. Malikopoulos, A research and educational robotic testbed for real-time control of emerging mobility systems: From theory to scaled experiments, IEEE Control Syst. Mag., 42 (2022), 20–34. https://doi.org/10.1109/MCS.2022.3209056 doi: 10.1109/MCS.2022.3209056
![]() |
[15] | B. Chalaki, L. E. Beaver, A. A. Malikopoulos, Experimental validation of a real-time optimal controller for coordination of cavs in a multi-lane roundabout, 2020 IEEE Intelligent Vehicles Symposium (IV), IEEE, Las Vegas, NV, USA, (2020), 775–780. https://doi.org/10.1109/IV47402.2020.9304531 |
[16] |
B. Chalaki, A. A. Malikopoulos, Time-optimal coordination for connected and automated vehicles at adjacent intersections, IEEE Trans. Intell. Transp. Syst., 23 (2022), 13330–13345. https://doi.org/10.1109/TITS.2021.3123479 doi: 10.1109/TITS.2021.3123479
![]() |
[17] |
B. Chalaki, A. A. Malikopoulos, Optimal control of connected and automated vehicles at multiple adjacent intersections, IEEE Trans. Control Syst. Technol., 30 (2022), 972–984. https://doi.org/10.1109/TCST.2021.3082306 doi: 10.1109/TCST.2021.3082306
![]() |
[18] |
B. Chalaki, A. A. Malikopoulos, A priority-aware replanning and resequencing framework for coordination of connected and automated vehicles, IEEE Control Syst. Lett., 6 (2022), 1772–1777. https://doi.org/10.1109/LCSYS.2021.3133416 doi: 10.1109/LCSYS.2021.3133416
![]() |
[19] | B. Chalaki, A. A. Malikopoulos, Robust learning-based trajectory planning for emerging mobility systems, 2022 American Control Conference (ACC), IEEE, Atlanta, GA, USA, (2022), 2154–2159. https://doi.org/10.23919/ACC53348.2022.9867265 |
[20] |
X. Chang, H. Li, J. Rong, X. Zhao, A. Li, Analysis on traffic stability and capacity for mixed traffic flow with platoons of intelligent connected vehicles, Physica A, 557 (2020), 124829. https://doi.org/10.1016/j.physa.2020.124829 doi: 10.1016/j.physa.2020.124829
![]() |
[21] | A. de La Fortelle, Analysis of reservation algorithms for cooperative planning at intersections, 13th International IEEE Conference on Intelligent Transportation Systems, IEEE, Funchal, Portugal, (2010), 445–449. https://doi.org/10.1109/ITSC.2010.5624978 |
[22] | K. Dresner, P. Stone, Multiagent traffic management: A reservation-based intersection control mechanism, in Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagents Systems, IEEE Computer Society, (2004), 530–537. https://dl.acm.org/doi/10.5555/1018410.1018799 |
[23] |
K. Dresner, P. Stone, A multiagent approach to autonomous intersection management, J. Artif. Intell. Res., 31 (2008), 591–656. https://doi.org/10.1613/jair.2502 doi: 10.1613/jair.2502
![]() |
[24] |
D. J. Fagnant, K. M. Kockelman, The travel and environmental implications of shared autonomous vehicles, using agent-based model scenarios, Transp. Res. Part C Emerg. Technol., 40 (2014), 1–13. https://doi.org/10.1016/j.trc.2013.12.001 doi: 10.1016/j.trc.2013.12.001
![]() |
[25] | M. Fellendorf, P. Vortisch, Microscopic traffic flow simulator vissim, Fundamentals of Traffic Simulation, International Series in Operations Research and Management Science, Springer, New York, NY, 145 (2010), 63–93. |
[26] |
S. Feng, Y. Zhang, S. E. Li, Z. Cao, H. X. Liu, L. Li, String stability for vehicular platoon control: Definitions and analysis methods, Annu. Rev. Control, 47 (2019), 81–97. https://doi.org/10.1016/j.arcontrol.2019.03.001 doi: 10.1016/j.arcontrol.2019.03.001
![]() |
[27] | A. Ferrara, S. Sacone, S. Siri, Freeway Traffic Modeling and Control, Springer, Berlin, 2018. https://doi.org/10.1007/978-3-319-75961-6 |
[28] |
J. Guanetti, Y. Kim, F. Borrelli, Control of connected and automated vehicles: State of the art and future challenges, Annu. Rev. Control, 45 (2018), 18–40. https://doi.org/10.1016/j.arcontrol.2018.04.011 doi: 10.1016/j.arcontrol.2018.04.011
![]() |
[29] |
S. V. D. Hoef, J. Mårtensson, D. V. Dimarogonas, K. H. Johansson, A predictive framework for dynamic heavy-duty vehicle platoon coordination, ACM Trans. Cyber-Phys. Syst., 4 (2019), 1–25. https://doi.org/10.1145/3299110 doi: 10.1145/3299110
![]() |
[30] |
S. Huang, A. Sadek, Y. Zhao, Assessing the mobility and environmental benefits of reservation-based intelligent intersections using an integrated simulator, IEEE Trans. Intell. Transp. Syst., 13 (2012), 1201–1214. https://doi.org/10.1109/TITS.2012.2186442 doi: 10.1109/TITS.2012.2186442
![]() |
[31] | A. Johansson, E. Nekouei, K. H. Johansson, J. Mårtensson, Multi-fleet platoon matching: A game-theoretic approach, 2018 21st International Conference on Intelligent Transportation Systems (ITSC), IEEE, Maui, HI, USA, 2018, 2980–2985. https://doi.org/10.1109/ITSC.2018.8569379 |
[32] |
M. Kamal, M. Mukai, J. Murata, T. Kawabe, Model predictive control of vehicles on urban roads for improved fuel economy, IEEE Trans. Control Syst. Technol., 21 (2013), 831–841. https://doi.org/10.1109/TCST.2012.2198478 doi: 10.1109/TCST.2012.2198478
![]() |
[33] |
S. Karbalaieali, O. A. Osman, S. Ishak, A dynamic adaptive algorithm for merging into platoons in connected automated environments, IEEE Trans. Intell. Transp. Syst., 21 (2019), 4111–4122. https://doi.org/10.1109/TITS.2019.2938728 doi: 10.1109/TITS.2019.2938728
![]() |
[34] | P. Kavathekar, Y. Chen, Vehicle platooning: A brief survey and categorization, International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Washington, DC, USA, (2011), 829–845. https://doi.org/10.1115/DETC2011-47861 |
[35] | V. L. Knoop, H. J. Van Zuylen, S. P. Hoogendoorn, Microscopic traffic behaviour near accidents, Transportation and Traffic Theory 2009: Golden Jubilee, Springer, Boston, MA, 2009. |
[36] | S. Kumaravel, A. A. Malikopoulos, R. Ayyagari, Decentralized cooperative merging of platoons of connected and automated vehicles at highway on-ramps, in 2021 American Control Conference (ACC), IEEE, New Orleans, LA, USA, (2021), 2055–2060. https://doi.org/10.23919/ACC50511.2021.9483390 |
[37] |
S. Kumaravel, A. A. Malikopoulos, R. Ayyagari, Optimal coordination of platoons of connected and automated vehicles at signal-free intersections, IEEE Trans. Intell. Veh., 7 (2022), 186–197. https://doi.org/10.1109/TIV.2021.3096993 doi: 10.1109/TIV.2021.3096993
![]() |
[38] |
J. Larson, K. Y. Liang, K. H. Johansson, A distributed framework for coordinated heavy-duty vehicle platooning, IEEE Trans. Intell. Transp. Syst., 16 (2015), 419–429. https://doi.org/10.1109/TITS.2014.2320133 doi: 10.1109/TITS.2014.2320133
![]() |
[39] |
W. Levine, M. Athans, On the optimal error regulation of a string of moving vehicles, IEEE Trans. Autom. Control, 11 (1966), 355–361. https://doi.org/10.1109/TAC.1966.1098376 doi: 10.1109/TAC.1966.1098376
![]() |
[40] |
J. Lioris, R. Pedarsani, F. Y. Tascikaraoglu, P. Varaiya, Platoons of connected vehicles can double throughput in urban roads, Transp. Res. Part C Emerging Technol., 77 (2017), 292–305. https://doi.org/10.1016/j.trc.2017.01.023 doi: 10.1016/j.trc.2017.01.023
![]() |
[41] | A. M. I. Mahbub, V. Karri, D. Parikh, S. Jade, A. A. Malikopoulos, A decentralized time- and energy-optimal control framework for connected automated vehicles: From simulation to field test, arXiv preprint, 2020. https://doi.org/10.48550/arXiv.1911.01380 |
[42] | A. M. I. Mahbub, V. A. Le, A. A. Malikopoulos, A safety-prioritized receding horizon control framework for platoon formation in a mixed traffic environment, arXiv preprint. https://doi.org/10.48550/arXiv.2205.10673 |
[43] |
A. M. I. Mahbub, V. A. Le, A. A. Malikopoulos, Safety-aware and data-driven predictive control for connected automated vehicles at a mixed traffic signalized intersection, IFAC-PapersOnLine, 24 (2022), 51–56. https://doi.org/10.1016/j.ifacol.2022.10.261 doi: 10.1016/j.ifacol.2022.10.261
![]() |
[44] | A. M. I. Mahbub, A. A. Malikopoulos, Concurrent optimization of vehicle dynamics and powertrain operation using connectivity and automation, arXiv preprint, 2019. https://doi.org/10.48550/arXiv.1911.03475 |
[45] | A. M. I. Mahbub, A. A. Malikopoulos, Conditions for state and control constraint activation in coordination of connected and automated vehicles, 2020 American Control Conference (ACC), IEEE, Denver, CO, USA, (2020), 436–441. https://doi.org/10.23919/ACC45564.2020.9147842 |
[46] |
A. M. I. Mahbub, A. A. Malikopoulos, A platoon formation framework in a mixed traffic environment, IEEE Control Syst. Lett., 6 (2021), 1370–1375. https://doi.org/10.1109/LCSYS.2021.3092188 doi: 10.1109/LCSYS.2021.3092188
![]() |
[47] |
A. M. I. Mahbub, A. A. Malikopoulos, Conditions to provable system-wide optimal coordination of connected and automated vehicles, Automatica, 131 (2021), 109751. https://doi.org/10.1016/j.automatica.2021.109751 doi: 10.1016/j.automatica.2021.109751
![]() |
[48] | A. M. I. Mahbub, A. A. Malikopoulos, Platoon formation in a mixed traffic environment: A model-agnostic optimal control approach, 2022 American Control Conference (ACC), IEEE, Atlanta, GA, USA, (2022), 4746–4751. https://doi.org/10.23919/ACC53348.2022.9867168 |
[49] | A. M. I. Mahbub, L. Zhao, D. Assanis, A. A. Malikopoulos, Energy-optimal coordination of connected and automated vehicles at multiple intersections, 2019 American Control Conference (ACC), IEEE, Philadelphia, PA, USA, (2019), 2664–2669. https://doi.org/10.23919/ACC.2019.8814877 |
[50] |
A. I. Mahbub, A. A. Malikopoulos, L. Zhao, Decentralized optimal coordination of connected and automated vehicles for multiple traffic scenarios, Automatica, 117 (2020), 108958. https://doi.org/10.1016/j.automatica.2020.108958 doi: 10.1016/j.automatica.2020.108958
![]() |
[51] |
A. A. Malikopoulos, A duality framework for stochastic optimal control of complex systems, IEEE Trans. Autom. Control, 18 (2016), 780–789. https://doi.org/10.1109/TAC.2015.2504518 doi: 10.1109/TAC.2015.2504518
![]() |
[52] |
A. A. Malikopoulos, L. E. Beaver, I. V. Chremos, Optimal time trajectory and coordination for connected and automated vehicles, Automatica, 125 (2021), 109469. https://doi.org/10.1016/j.automatica.2020.109469 doi: 10.1016/j.automatica.2020.109469
![]() |
[53] |
A. A. Malikopoulos, C. G. Cassandras, Y. J. Zhang, A decentralized energy-optimal control framework for connected automated vehicles at signal-free intersections, Automatica, 93 (2018), 244–256. https://doi.org/10.1016/j.automatica.2018.03.056 doi: 10.1016/j.automatica.2018.03.056
![]() |
[54] | A. A. Malikopoulos, L. Zhao, A closed-form analytical solution for optimal coordination of connected and automated vehicles, 2019 American Control Conference (ACC), IEEE, Philadelphia, PA, USA, (2019), 3599–3604. https://doi.org/10.23919/ACC.2019.8814759 |
[55] | A. A. Malikopoulos, L. Zhao, Optimal path planning for connected and automated vehicles at urban intersections, 2019 IEEE 58th Conference on Decision and Control (CDC), IEEE, Nice, France, (2019), 1261–1266. https://doi.org/10.1109/CDC40024.2019.9030093 |
[56] | R. Margiotta, D. Snyder, An agency guide on how to establish localized congestion mitigation programs, Technical report, U.S. Department of Transportation, Federal Highway Administration, 2011. |
[57] | F. Morbidi, P. Colaneri, T. Stanger, Decentralized optimal control of a car platoon with guaranteed string stability, 2013 European Control Conference (ECC), IEEE, Zurich, Switzerland, (2013), 3494–3499. https://doi.org/10.23919/ECC.2013.6669336 |
[58] |
G. J. Naus, R. P. Vugts, J. Ploeg, M. J. van De Molengraft, M. Steinbuch, String-stable cacc design and experimental validation: A frequency-domain approach, IEEE Trans. Veh. Technol., 59 (2010), 4268–4279. https://doi.org/10.1109/TVT.2010.2076320 doi: 10.1109/TVT.2010.2076320
![]() |
[59] |
I. A. Ntousakis, I. K. Nikolos, M. Papageorgiou, Optimal vehicle trajectory planning in the context of cooperative merging on highways, Transp. Res. Part C Emerging Technol., 71 (2016), 464–488. https://doi.org/10.1016/j.trc.2016.08.007 doi: 10.1016/j.trc.2016.08.007
![]() |
[60] |
M. Papageorgiou, A. Kotsialos, Freeway ramp metering: An overview, IEEE Trans. Intell. Transp. Syst., 3 (2002), 271–281. https://doi.org/10.1109/TITS.2002.806803 doi: 10.1109/TITS.2002.806803
![]() |
[61] |
H. Pei, S. Feng, Y. Zhang, D. Yao, A cooperative driving strategy for merging at on-ramps based on dynamic programming, IEEE Trans. Veh. Technol., 68 (2019), 11646–11656. https://doi.org/10.1109/TVT.2019.2947192 doi: 10.1109/TVT.2019.2947192
![]() |
[62] | N. Pourmohammad Zia, F. Schulte, R. R. Negenborn, Platform-based platooning to connect two autonomous vehicle areas, 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), IEEE, Rhodes, Greece, (2020), 1–6. https://doi.org/10.1109/ITSC45102.2020.9294689 |
[63] |
R. Rajamani, H. S. Tan, B. K. Law, W. B. Zhang, Demonstration of integrated longitudinal and lateral control for the operation of automated vehicles in platoons, IEEE Trans. Control Syst. Technol., 8 (2000), 695–708. https://doi.org/10.1109/87.852914 doi: 10.1109/87.852914
![]() |
[64] |
J. Rios-Torres, A. A. Malikopoulos, A survey on coordination of connected and automated vehicles at intersections and merging at highway on-ramps, IEEE Trans. Intell. Transp. Syst., 18 (2017), 1066–1077. https://doi.org/10.1109/TITS.2016.2600504 doi: 10.1109/TITS.2016.2600504
![]() |
[65] |
J. Rios-Torres, A. A. Malikopoulos, Automated and cooperative vehicle merging at highway on-ramps, IEEE Trans. Intell. Transp. Syst., 18 (2017), 780–789. https://doi.org/10.1109/TITS.2016.2587582 doi: 10.1109/TITS.2016.2587582
![]() |
[66] | B. Schrank, B. Eisele, T. Lomax, 2019 Urban Mobility Scorecard, Technical report, Texas A and M Transportation Institute, 2019. |
[67] | M. Shida, T. Doi, Y. Nemoto, K. Tadakuma, A short-distance vehicle platooning system: 2nd report, evaluation of fuel savings by the developed cooperative control, in Proceedings of the 10th International Symposium on Advanced Vehicle Control (AVEC), KTH Royal Institute of Technology Loughborough, United Kingdom, (2010), 719–723. |
[68] |
S. E. Shladover, C. A. Desoer, J. K. Hedrick, M. Tomizuka, J. Walrand, W. B. Zhang, et al., Automated vehicle control developments in the PATH program, IEEE Trans. Veh. Technol., 40 (1991), 114–130. https://doi.org/10.1109/25.69979 doi: 10.1109/25.69979
![]() |
[69] | S. Singh, Critical reasons for crashes investigated in the National Motor Vehicle Crash Causation Survey. (Traffic Safety Facts Crash Stats.), Technical Report, 2018. |
[70] | K. Spieser, K. Treleaven, R. Zhang, E. Frazzoli, D. Morton, M. Pavone, Toward a systematic approach to the design and evaluation of automated mobility-on-demand systems: A case study in singapore, Road vehicle automation, Springer, Cham, (2014), 229–245. |
[71] | S. S. Stanković, M. J. Stanojević, D. D. Šiljak, Decentralized suboptimal lqg control of platoon of vehicles, Proc. 8th IFAC/IFIP/IFORS Symp. Transp. Syst., 1 (1997) 83–88. |
[72] | C. Tang, Y. Li, Consensus-based platoon control for non-lane-discipline connected autonomous vehicles considering time delays, 2018 37th Chinese Control Conference (CCC), IEEE, Wuhan, (2018), 7713–7718. https://doi.org/10.23919/ChiCC.2018.8484016 |
[73] |
S. Tsugawa, An overview on an automated truck platoon within the energy its project, IFAC Proc. Volumes, 46 (2013), 41–46. https://doi.org/10.3182/20130904-4-JP-2042.00110 doi: 10.3182/20130904-4-JP-2042.00110
![]() |
[74] |
A. Tuchner, J. Haddad, Vehicle platoon formation using interpolating control, IFAC-PapersOnLine, 48 (2015), 414–419. https://doi.org/10.1016/j.ifacol.2015.09.492 doi: 10.1016/j.ifacol.2015.09.492
![]() |
[75] | A. Valencia, A. M. I. Mahbub, A. A. Malikopoulos, Performance analysis of optimally coordinated connected automated vehicles in a mixed traffic environment, 2022 30th Mediterranean Conference on Control and Automation (MED), IEEE, Vouliagmeni, Greece, (2022), 1053–1058. https://doi.org/10.1109/MED54222.2022.9837281 |
[76] |
S. Van De Hoef, K. H. Johansson, D. V. Dimarogonas, Fuel-efficient en route formation of truck platoons, IEEE Trans. Intell. Transp. Syst., 19 (2017), 102–112. https://doi.org/10.1109/TITS.2017.2700021 doi: 10.1109/TITS.2017.2700021
![]() |
[77] |
P. Varaiya, Smart cars on smart roads: Problems of control, IEEE Trans. Autom. Control, 38 (1993), 195–207. https://doi.org/10.1109/9.250509 doi: 10.1109/9.250509
![]() |
[78] |
Z. Wadud, D. MacKenzie, P. Leiby, Help or hindrance? the travel, energy and carbon impacts of highly automated vehicles, Transp. Res. Part A Policy Pract., 86 (2016), 1–18. https://doi.org/10.1016/j.tra.2015.12.001 doi: 10.1016/j.tra.2015.12.001
![]() |
[79] | Z. Wang, G. Wu, P. Hao, K. Boriboonsomsin, M. Barth, Developing a platoon-wide eco-cooperative adaptive cruise control (cacc) system, 2017 ieee intelligent vehicles symposium (iv), IEEE, Los Angeles, CA, USA, (2017), 1256–1261. https://doi.org/10.1109/IVS.2017.7995884 |
[80] | R. Wiedemann, Simulation des Strassenverkehrsflusses, PhD thesis, Universität Karlsruhe, Karlsruhe, 1974. |
[81] |
W. Xiao, C. G. Cassandras, Decentralized optimal merging control for connected and automated vehicles with safety constraint guarantees, Automatica, 123 (2021), 109333. https://doi.org/10.1016/j.automatica.2020.109333 doi: 10.1016/j.automatica.2020.109333
![]() |
[82] | X. Xiong, E. Xiao, L. Jin, Analysis of a stochastic model for coordinated platooning of heavy-duty vehicles, 2019 IEEE 58th Conference on Decision and Control (CDC), IEEE, Nice, France, (2019), 3170–3175. https://doi.org/10.1109/CDC40024.2019.9029179 |
[83] | F. Xu, T. Shen, Decentralized optimal merging control with optimization of energy consumption for connected hybrid electric vehicles, IEEE Trans. Intell. Transp. Syst.. https://doi.org/10.1109/TITS.2021.3054903 |
[84] |
L. Xu, W. Zhuang, G. Yin, C. Bian, H. Wu, Modeling and robust control of heterogeneous vehicle platoons on curved roads subject to disturbances and delays, IEEE Trans. Veh. Technol., 68 (2019), 11551–11564. https://doi.org/10.1109/TVT.2019.2941396 doi: 10.1109/TVT.2019.2941396
![]() |
[85] | S. Yao, B. Friedrich, Managing connected and automated vehicles in mixed traffic by human-leading platooning strategy: A simulation study, in 2019 IEEE Intelligent Transportation Systems Conference (ITSC), IEEE, Auckland, New Zealand, (2019), 3224–3229. https://doi.org/10.1109/ITSC.2019.8917007 |
[86] |
L. Zhang, F. Chen, X. Ma, X. Pan, Fuel economy in truck platooning: A literature overview and directions for future research, J. Adv. Transp., 2020 (2020). https://doi.org/10.1155/2020/2604012 doi: 10.1155/2020/2604012
![]() |
[87] |
Y. Zhang, C. G. Cassandras, Decentralized optimal control of connected automated vehicles at signal-free intersections including comfort-constrained turns and safety guarantees, Automatica, 109 (2019), 108563. https://doi.org/10.1016/j.automatica.2019.108563 doi: 10.1016/j.automatica.2019.108563
![]() |