
This paper proposes a distributed collision-free control scheme for connected and automated vehicles (CAVs) at a non-signalized intersection. We first divide an intersection area into three sections, i.e., the free zone, the platoon zone, and the control zone. In order to enable the following vehicles to track the trajectory of their leading vehicle in the platoon zone and the control zone, as well as to guarantee the desired distance between any two adjacent vehicles, the distributed platoon controllers are designed. In the control zone, each vehicular platoon is taken as a whole to be coordinated via an intersection coordination unit (ICU). To avoid collision between each pair of the conflicting platoons approaching from different directions, a platoon-based coordination strategy is designed by scheduling the arrival time of each leading vehicle of different platoons. Specially, considering traffic efficiency and fuel economy, the optimal control problem of the leading vehicle is formulated subject to the constraint of allowable minimum arrival time, which is derived from coordination with other approaching platoons. The Pontryagin Minimum Principle (PMP) and phase-plane method are applied to find the optimal control sequences. Numerical simulations show the effectiveness of this scheme.
Citation: Jian Gong, Yuan Zhao, Jinde Cao, Wei Huang. Platoon-based collision-free control for connected and automated vehicles at non-signalized intersections[J]. Electronic Research Archive, 2023, 31(4): 2149-2174. doi: 10.3934/era.2023111
[1] | Fei Hou, Bin Chen . On triple correlation sums of Fourier coefficients of cusp forms. AIMS Mathematics, 2022, 7(10): 19359-19371. doi: 10.3934/math.20221063 |
[2] | Qiuxia Hu, Bilal Khan, Serkan Araci, Mehmet Acikgoz . New double-sum expansions for certain Mock theta functions. AIMS Mathematics, 2022, 7(9): 17225-17235. doi: 10.3934/math.2022948 |
[3] | Guangwei Hu, Huixue Lao, Huimin Pan . High power sums of Fourier coefficients of holomorphic cusp forms and their applications. AIMS Mathematics, 2024, 9(9): 25166-25183. doi: 10.3934/math.20241227 |
[4] | Zhichao Tang, Xiang Fan . Ternary cyclotomic numbers and ternary Jacobi sums. AIMS Mathematics, 2024, 9(10): 26557-26578. doi: 10.3934/math.20241292 |
[5] | Kwang-Wu Chen, Fu-Yao Yang . Infinite series involving harmonic numbers and reciprocal of binomial coefficients. AIMS Mathematics, 2024, 9(7): 16885-16900. doi: 10.3934/math.2024820 |
[6] | S. Akansha, Aditya Subramaniam . Exploring Chebyshev polynomial approximations: Error estimates for functions of bounded variation. AIMS Mathematics, 2025, 10(4): 8688-8706. doi: 10.3934/math.2025398 |
[7] | Lijun Hao . New proofs for three identities of seventh order mock theta functions. AIMS Mathematics, 2023, 8(2): 4806-4813. doi: 10.3934/math.2023238 |
[8] | Hasanen A. Hammad, Manuel De la Sen . Tripled fixed point techniques for solving system of tripled-fractional differential equations. AIMS Mathematics, 2021, 6(3): 2330-2343. doi: 10.3934/math.2021141 |
[9] | Jinliang Wang, Fang Wang, Songbo Hu . On asymptotic correlation coefficient for some order statistics. AIMS Mathematics, 2023, 8(3): 6763-6776. doi: 10.3934/math.2023344 |
[10] | Xiuhai Fei, Zhonghua Wang, Cuixian Lu, Haifang Zhang . Higher Jordan triple derivations on $ * $-type trivial extension algebras. AIMS Mathematics, 2024, 9(3): 6933-6950. doi: 10.3934/math.2024338 |
This paper proposes a distributed collision-free control scheme for connected and automated vehicles (CAVs) at a non-signalized intersection. We first divide an intersection area into three sections, i.e., the free zone, the platoon zone, and the control zone. In order to enable the following vehicles to track the trajectory of their leading vehicle in the platoon zone and the control zone, as well as to guarantee the desired distance between any two adjacent vehicles, the distributed platoon controllers are designed. In the control zone, each vehicular platoon is taken as a whole to be coordinated via an intersection coordination unit (ICU). To avoid collision between each pair of the conflicting platoons approaching from different directions, a platoon-based coordination strategy is designed by scheduling the arrival time of each leading vehicle of different platoons. Specially, considering traffic efficiency and fuel economy, the optimal control problem of the leading vehicle is formulated subject to the constraint of allowable minimum arrival time, which is derived from coordination with other approaching platoons. The Pontryagin Minimum Principle (PMP) and phase-plane method are applied to find the optimal control sequences. Numerical simulations show the effectiveness of this scheme.
In today's world of industrial pollution, toxicants are pervading the air, ecological problems have become increasingly prominent, and environmental pollution has become a major problem. When human activities expose in the wild, they may come into contact with wild animals. In the process, wild animals can easily transmit viruses they carry to humans. In fact, most new infectious diseases come from wild animals [1]. SARS, Ebola virus, AIV, H1N1 influenza, and COVID-19 are threatening the ecological balance as well as the survival of human beings and other creatures. A large amount of toxic and harmful substances are discharged into the atmosphere, and seriously affect the environmental quality. It is necessary to study the effects of toxicants on the ecosystem. Hallam et al. proposed using a dynamic methodology to examine ecotoxicology in [2,3,4]. They established a model of the interaction between toxicants and population, and provided sufficient conditions for the persistence and extinction of a population stressed by a toxicant. Researchers have been studying ecotoxicology since the 1980s, and a large amount of literature has been devoted to problems in the area [5,6,7,8,9,10,11,12]. However, size-structured factor has not been considered in these models. Size here refers to some continuous indices related to individuals in the given population, such as volume, maturity, diameter, length, mass, or other quantities that show its physiological or statistical characteristics.
The effects of environmental pollution on biological population, the dynamical behavioral analysis of ecosystem models, and the control problem have attracted the attention of many scholars [13,14,15]. For many populations, size structure is more appropriate to describe the dynamical evolution than age structure, especially for plants and fishes [16,17]. Population models with age structure have been extensively investigated by many authors as seen in [13] and the references therein. On the other hand, the control problem with size structure has achieved remarkable results through theoretical analysis, numerical calculations, and experimental methods, such as in [14,15,18,19,20,21,22,23,24,25,26]. However, most of these studies have focused on a single species, and only a few have examined interactions among species. Among them, the optimal birth problem has also discussed in detail in [14]. In addition, Hritonenko et al. [15] have established a sized-structured forest system, where the objective function includes the net benefits from timber production and carbon sequestration. Liu et al. [18] have studied the least cost-size problem and the least cost-derivation problem for a nonlinear size-structured vermin population model with separable mortality rate, which takes fertility rate as the control variable. We also mention that Li et al. [21] have considered the optimal harvesting for a size-stage-structured population model. For other types of optimal harvesting problems, refer to [15,22,24,25]. Moreover, the influence of seasonal changes and other factors, the living environment of populations often undergoes periodic changes. Research on optimal harvesting problems dependent on the model of individual size in a periodic environment has been reported in [26,27]. In [27], Zhang et al. have discussed the optimal harvesting in a periodic food chain model by using the size structure of predators. To the best of our knowledge, few studies to date have examined optimal control problems of size-dependent population models and periodic effects in a polluted environment. Inspired by the above work, this paper discusses optimal harvesting for a periodic, competing system that is dependent on size structure in a polluted environment.
The remainder of this paper is organized as follows: In Section 2, we describe a population model with size structure in a polluted environment and its well-posedness is proved in Section 3. The optimality conditions are established in Section 4. The existence of a unique optimal control pair is obtained in Section 5. Some numerical results are presented in Section 6. At the end of this paper, some brief conclusions are provided.
In [2,3,4], Hallam et al. proposed the following dynamic population model with toxicant effects:
{dxdt=x[r0−r1C0−fx],dC0dt=kCE−gC0−mC0,dCEdt=−k1CEx+g1C0x−hCE+u, | (2.1) |
where x=x(t) is the population biomass at time t; C0=C0(t) is the concentration of toxicants in the organism at time t; CE=CE(t) is the concentration of toxicants in the environment of the population at time t. The exogenous rate of input of toxicants into the environment was represented by u. They investigated the persistence and extinction of a population in a polluted environment.
Luo et al. [28] studied optimal harvesting control problem for the following age-dependent competing system of n species:
{∂pi∂t+∂pi∂a=fi(a,t)−μi(a,t)pi−n∑k=1,k≠iλik(a,t)Pk(t)pi−ui(a,t)pi,,pi(0,t)=βi(t)∫a2a1mi(a,t)pi(a,t)da,pi(a,0)=pi0(a),Pi(t)=∫a+0pi(a,t)da,i=1,2,…,n,(a,t)∈Q, | (2.2) |
where Q=(0,a+)×(0,+∞), [a1,a2] is the fertility interval. pi(a,t) represents the density of ith population of age a at time t, and a+ is the life expectancy of individuals; pi0 is the initial age distribution of ith population; ui(x,t) is the harvesting effort function, which is the control variable in the model. The existence of an optimal control, the necessary conditions of optimality for the control problem have been derived.
By combining (2.1) and (2.2), we consider the following periodic, competing system with size structure in a polluted environment:
{∂pi∂t+∂(Vi(x,t)pi)∂x=fi(x,t)−μi(x,ci0(t))pi−3∑i,k=1,k≠iλik(x,t)Pk(t)pi−ui(x,t)pi,dci0dt=k1ce(t)−g1ci0(t)−mci0(t),dcedt=−k2ce(t)3∑i=1Pi(t)+g23∑i=1ci0(t)Pi(t)−hce(t)+v(t),Vi(0,t)pi(0,t)=∫l0βi(x,ci0(t))pi(x,t)dx,0≤ci0(0)≤1,0≤ce(0)≤1,pi(x,t)=pi(x,t+T),Pi(t)=∫l0pi(x,t)dx,i=1,2,3,(x,t)∈Q, | (2.3) |
where Q=(0,l)×R+,l∈R+ is the maximal size of an individual in the population, T∈R+ is the period of habitat evolution of the populations. k1,g1,m,k2,g2, and h are nonnegative constants. The meaning of the variables and functional traits are as follows: pi(x,t): the density of the ith population of size x at time t; ci0(t): the concentration of toxicants in the ith population; ce(t): the concentration of toxicants in the environment; Vi(x,t): the average rate of growth for the ith population, that is, dxdt=Vi(x,t) (see [29]); μi(x,ci0(t)),βi(x,ci0(t)): the mortality and fertility rates of the ith population, respectively; v(t): the input rate of exogenous toxicants; Pi(t): total number of individuals in the ith population; fi(x,t): the immigration rate of the ith population; λik(x,t): the interaction coefficient; ui(x,t): function of the harvesting efforts of the ith population of size x harvested at time t; k1ce(t): the organism's net uptake of toxicant from the environment; −g1ci0(t) and −mci0(t): the egestion and depuration rates of the toxicant in the ith population, respectively. The units of k1,g1 and m are in terms of mem−10t−1,t−1, and t−1, respectively. −k2ce(t)3∑i=1Pi(t): the loss of the toxicant in the environment that is due to the uptake of toxicant by the total population. g23∑i=1ci0(t)Pi(t): the increase in the toxicant in the environment coming from the egestion of the total population. −hce(t): the toxicant loss from the environment itself by volatilization and so on. The unit of k2 is in terms of m−10t−1; g2 is in terms of m−1et−1; and h is in terms of t−1, where me and m0 denote the units of mass of the environment and in the ith population, respectively. The toxicant-population model with size structure is established under the condition of small toxicant capacity in the environment.
The aim of this paper is to seek the maximum of the following objective functional J(u,v), that is
Maximize{J(u,v):u=(u1(x,t),…,u3(x,t)),v=v(t),(u,v)∈Ω}, | (2.4) |
where
J(u,v)=3∑i=1∫T0∫l0wi(x,t)ui(x,t)pi(x,t)dxdt−123∑i=1∫T0∫l0ciu2i(x,t)dxdt−12∫T0c4v2(t)dt, |
wi(x,t) is the selling price of an individual belonging to the ith population. The positive constants ci and c4 are the cost factors of the ith harvested population and the curbing environmental pollution, respectively. J(u,v) represents the total profit from the harvested populations during period T. The admissible control set Ω is as follows:
Ω={(u,v)∈[L∞T(Q)]3×L∞T(R+):0≤ui(x,t)≤Nia.e.(x,t)∈Q,0≤v0≤v(t)≤v1a.e.t∈R+}, |
where
L∞T(Q)={η∈L∞(Q):η(x,t)=η(x,t+T)a.e.(x,t)∈Q}, |
L∞T(R+)={η∈L∞(R+):η(t)=η(t+T)a.e.t∈R+}. |
This paper makes the following assumptions:
(A1)Vi:[0,l)×R+→R+ are bounded continuous functions, Vi(x,t)>0 and Vi(x,t)=Vi(x,t+T) for (x,t)∈Q, limx↑lVi(x,t)=0, and Vi(0,t)=1 for t∈R+. There are Lipschitz constants LVi such that
|Vi(x1,t)−Vi(x2,t)|≤LVi|x1−x2|forx1,x2∈[0,l],t∈R+. |
(A2)0≤βi(x,ci0(t))=βi(x,ci0(t+T))≤¯βi, ¯βi are constants.
(A3){μi(x,ci0(t))=μi0(x)+¯μi(x,ci0(t))a.e.(x,t)∈Q,whereμi0∈L1loc([0,l)),μi0(s)≥0a.e.x∈[0,l),∫l0μi0(s)ds→+∞,¯μi∈L∞(Q),¯μi(x,ci0(t))≥0,¯μi(x,ci0(t))=¯μi(x,ci0(t+T))a.e.(x,t)∈Q.
(A4)fi∈L∞(Q),0≤fi(x,t)=fi(x,t+T).0≤λik(x,t)≤¯λi,0≤wi(x,t)≤wi(x,t+T)≤¯wi,¯λi and ¯wi are constants.
(A5) There exist constants Lβ>0,Lμ>0such that|βi(x,c1i0(t))−βi(x,c2i0(t))|≤Lβ|c1i0(t)−c2i0(t)|, |μi(x,c1i0(t))−μi(x,c2i0(t))|≤Lμ|c1i0(t)−c2i0(t)|.
(A6)g1≤k1≤g1+m,v1≤h. (see [30])
Definition 3.1. For i=1,2,3, the unique solution x=φi(t;t0,xi0) of the initial value problem x′(t)=Vi(x,t),x(t0)=xi0 is said to be a characteristic curve of the hybrid system (2.3) through (t0,xi0). Let zi(t):=φi(t;0,0) denote the characteristic curve through (0,0) in the x−t plane.
For any point (x,t)∈[0,l)×[0,T] such that x≤zi(t), define the initial time τ:=τ(t,x), in order that φi(t;τ,0)=x⇔φi(τ;t,x)=0. The solution of (2.3) is
pi(x,t)=pi(0,t−z−1i(x))Πi(x;x,t)+∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Πi(x;x,t)Πi(r;x,t)dr, | (3.1) |
where
Πi(s;x,t)=exp{−∫s0μi(r,ci0(φ−1i(r;t,x)))Vi(r,φ−1i(r;t,x))+3∑i,k=1,k≠iλik(r,φ−1i(r;t,x))Pk(φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))=+ui(r,φ−1i(r;t,x))+Vix(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))dr}. |
ci0(t)=ci0(0)exp{−(g1+m)t}+k1∫t0ce(s)exp{(s−t)(g1+m)}ds. | (3.2) |
ce(t)=ce(0)exp{−∫t0[k23∑i=1Pi(τ)+h]dτ}+∫t0[g23∑i=1ci0(s)Pi(s)+v(s)]⋅exp{∫st[k23∑i=1Pi(τ)+h]dτ}ds. | (3.3) |
By assumption (A1), we have Vi(0,t)=1. Let bi(t)=pi(0,t). Then, by noting that φ−1i(0;t,x)=τ=t−z−1i(x), we have
bi(t)=Fi(t)+∫l0Ki(t,x)bi(t−z−1i(x))dx, | (3.4) |
where
Ki(t,x)=βi(x,ci0(t))Πi(x;x,t), | (3.5) |
Fi(t)=∫l0βi(x,ci0(t))∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Πi(x;x,t)Πi(r;x,t)drdx. | (3.6) |
Define the linear and bounded operator Ai:L∞T(R+)→L∞T(R+) given by
(Aiq)(t)=∫l0Ki(t,x)qi(t−z−1i(x))dx. | (3.7) |
As a consequence (3.4) can be written in L∞T(R+) as the following abstract equation
bi=Aibi+Fi, | (3.8) |
with Fi∈L∞T(R+) defined by (3.6). We denote by r(Ai) the spectral radius of the operator Ai. If r(Ai)<1, then (3.8) has unique solution in L∞T(R+).
Remark 3.1. If we denote by
ˆβi(x)=esssupt∈R+βi(x,ci0(t))a.e.x∈[0,l), |
then (A2) and (3.7) allow us to conclude that
r(Ai)≤∫l0ˆβi(x)dx. |
Theorem 3.1. Assume that (A1)−(A6) hold. Then, the hybrid system (2.3) has a nonnegative and unique solution (p1(x,t),…,p3(x,t),c10(t),…,c30(t),ce(t)), such that
(i)(pi(x,t),ci0(t),ce(t))∈L∞(Q)×L∞(0,T)×L∞(0,T).
(ii)0≤ci0(t)≤1,0≤ce(t)≤1,∀t∈(0,T),0≤pi(x,t),∫l0pi(x,t)dx≤M,∀(x,t)∈Q,i=1,2,3.
where M=M2l+‖fi(⋅,⋅)‖L∞(Q).
Proof. Without loss of generality, we assume that ui(x,t)≡0. p(x,t)=(p1(x,t),…,p3(x,t)),c0(t)=(c10(t),…,c30(t)). When t is so large that t>z−1i(l), from (3.5) it follows that
|K1i(t,x)−K2i(t,x)|=|βi(x,c1i0(t))Π1i(x;x,t)−βi(x,c2i0(t))Π2i(x;x,t)|≤|βi(x,c1i0(t))−βi(x,c2i0(t))|+|βi(x,c2i0(t))||Π1i(x;x,t)−Π2i(x;x,t)|≤Lβ|c1i0(t)−c2i0(t)|+¯βi∫x0|μi(r,c1i0(φ−1i(r;t,x)))−μi(r,c2i0(φ−1i(r;t,x)))|Vi(r,φ−1i(r;t,x))dr+¯βi∫x03∑i,k=1,k≠iλik(r,φ−1i(r;t,x))|P1k(φ−1i(r;t,x))−P2k(φ−1i(r;t,x))|Vi(r,φ−1i(r;t,x))dr≤Lβ|c1i0(t)−c2i0(t)|+¯βi∫tφ−1i(0;t,x)|μi(φi(σ;t,x),c1i0(σ))−μi(φi(σ;t,x),c2i0(σ))|dσ+¯βi∫tφ−1i(0;t,x)3∑i,k=1,k≠iλik(φi(σ;t,x),σ)|P1k(σ)−P2k(σ)|dσ≤Lβ|c1i0(t)−c2i0(t)|+¯βiLμ∫t0|c1i0(σ)−c2i0(σ)|dσ+¯βi¯λik∫l0∫t03∑i,k=1,k≠i|p1k(x,σ)−p2k(x,σ)|dσdx. |
Let
M1=max{Lβ,¯βiLμ,¯βi¯λik}, |
W(t)=|c1i0(t)−c2i0(t)|+∫t0|c1i0(σ)−c2i0(σ)|dσ+∫l0∫t03∑i,k=1,k≠i|p1k(x,σ)−p2k(x,σ)|dσdx. |
Then, we can obtain
|K1i(t,x)−K2i(t,x)|≤M1W(t). | (3.9) |
By (3.6) and a similar procedure, we have
|F1i(t)−F2i(t)|=|∫l0βi(x,c1i0(t))∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Π1i(x;x,t)Π1i(r;x,t)drdx−∫l0βi(x,c2i0(t))∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Π2i(x;x,t)Π2i(r;x,t)drdx|≤∫l0|βi(x,c1i0(t))−βi(x,c2i0(t))|∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))drdx+∫l0βi(x,c2i0(t))∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))⋅∫xr(|μi(δ,c1i0(φ−1i(δ;t,x)))−μi(δ,c2i0(φ−1i(δ;t,x)))|Vi(δ,φ−1i(δ;t,x))+3∑i,k=1,k≠iλik(δ,φ−1i(δ;t,x))|P1k(φ−1i(δ;t,x))−P2k(φ−1i(δ;t,x))|Vi(δ,φ−1i(δ;t,x)))dδdrdx≤Lβ∫l0|c1i0(t)−c2i0(t)|∫t0fi(φi(σ;t,x),σ)dσdx+¯βi∫l0∫t0fi(φi(σ;t,x),σ)⋅(Lμ∫t0|c1i0(σ)−c2i0(σ)|dσ+¯λik∫l0∫t03∑i,k=1,k≠i|p1k(x,σ)−p2k(x,σ)|dσdx)dσdx≤‖fi(⋅,⋅)‖L1(Q)(Lβ|c1i0(t)−c2i0(t)|+¯βiLμ∫t0|c1i0(σ)−c2i0(σ)|dσ+¯βi¯λik∫l0∫t03∑i,k=1,k≠i|p1k(x,σ)−p2k(x,σ)|dσdx). |
Consequently,
|F1i(t)−F2i(t)|≤‖fi(⋅,⋅)‖L1(Q)M1W(t). | (3.10) |
Since
exp{−∫x0(Vi)x(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))dr}=1Vi(x,t), |
and thanks to the periodicity of bi(t), we need only to consider the case t∈[z−1i(l),z−1i(l)+T]. By (3.4)–(3.6), we have
bi(t)=Fi(t)+∫l0Ki(t,x)bi(t−z−1i(x))dx=∫l0βi(x,ci0(t))∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Πi(x;x,t)Πi(r;x,t)drdx+∫l0βi(x,ci0(t))Πi(x;x,t)bi(t−z−1i(x))dx≤∫l0βi(x,ci0(t))∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))drdx+∫l0βi(x,ci0(t))Vi(x,t)bi(t−z−1i(x))dx≤∫l0βi(x,ci0(t))∫tφ−1i(0;t,x)fi(φi(s;t,x),s)dsdx+¯βi∫l0bi(t−z−1i(x))Vi(x,t)dx≤∫l0βi(x,ci0(t))∫t0fi(φi(s;t,x),s)dsdx+¯βi∫tt−z−1i(l)b(s)ds≤¯βi‖fi(⋅,⋅)‖L1(Q)+¯βi∫t0b(s)ds. |
From Bellman's lemma, we have
bi(t)≤¯βi‖f(⋅,⋅)‖L1(Q)exp{∫t0¯βidr}≤¯βi‖f(⋅,⋅)‖L1(Q)exp{¯βi(T+z−1i(l))}=:M2. |
From (3.4), we get
|b1i(t)−b2i(t)|≤|F1i(t)−F2i(t)|+∫l0|K1i(t,x)b1i(t−z−1i)−K2i(t,x)b2i(t−z−1i)|≤|F1i(t)−F2i(t)|+∫l0|K1i(t,x)−K2i(t,x)|b1i(t−z−1i)dx+∫l0K2i(t,x)|b1i(t−z−1i)−b2i(t−z−1i)|dx≤‖fi(⋅,⋅)‖L1(Q)M1W(t)+M2∫l0M1W(t)dx+¯βi∫t0|b1i(s)−b2i(s)|ds≤M3W(t)+¯βi∫t0|b1i(s)−b2i(s)|ds, |
where M3=M1(‖fi(⋅,⋅)‖L1(Q)+M2l). It follows from generalized Gronwall Bellman inequality that
|b1i(t)−b2i(t)|≤M3W(t)+¯βiexp{¯βiT}M3∫t0W(s)ds≤M4W(t), |
where M4 is a positive constant independent of pi(x,t).
Denote X=[L∞T(R+,L1(0,l))]3×[L∞(R+)]4, then we define the state space
Y={(p,c0,ce)∈X∣pi(x,t)≥0a.e.(x,t)∈Q,∫l0pi(x,t)dx≤M,0≤ci0(t)≤1,0≤ce(t)≤1}. |
Define a mapping
G:Y→X,G(p,c0,ce)=(G1(p,c0,ce),G2(p,c0,ce),…,G7(p,c0,ce)), |
where
Gi(p,c0,ce)(x,t)=pi(0,t−z−1i(x))Πi(x;x,t)+∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Πi(x;x,t)Πi(r;x,t)dr,i=1,2,3. | (3.11) |
Gj(p,c0,ce)(t)=cj0(0)exp{−(g1+m)t}+k1∫t0ce(s)exp{(s−t)(g1+m)}ds,j=4,5,6. | (3.12) |
G7(p,c0,ce)(t)=ce(0)exp{−∫t0[k23∑i=1Pi(τ)+h]dτ}+∫t0[g23∑i=1ci0(s)Pi(s)+v(s)]⋅exp{∫st[k23∑i=1Pi(τ)+h]dτ}ds. | (3.13) |
Then, we have
∫l0|Gi(p,c0,ce)|dx=∫l0bi(t−z−1i(x))Πi(x;x,t)dx+∫l0∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))Πi(x;x,t)Πi(r;x,t)drdx≤∫l0bi(t−z−1i(x))dx+∫l0∫t0fi(φi(s;t,x),s)dsdx≤M2l+‖fi(⋅,⋅)‖L∞(Q)=M. |
It is trivial to show that G(p,c0,ce)∈Y. We now discuss the compressibility of G. By (3.11), we have
∫l0|Gi(p1,c10,c1e)−Gi(p2,c20,c2e)|dx(i=1,2,3)≤∫l0b1i(t−z−1i(x))|Π1i(x;x,t)−Π2i(x;x,t)|dx+∫l0|b1i(t−z−1i(x))−b2i(t−z−1i(x))|Π2i(x;x,t)dx+∫l0∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))|Π1i(x;x,t)Π1i(r;x,t)−Π2i(x;x,t)Π2i(r;x,t)|drdx≤M2∫l0∫x0(|μi(r,c1i0(φ−1i(r;t,x)))−μi(r,c2i0(φ−1i(r;t,x)))|Vi(r,φ−1i(r;t,x))+3∑i,k=1,k≠iλik(r,φ−1i(r;t,x))|P1k(φ−1i(r;t,x))−P2k(φ−1i(r;t,x))|Vi(r,φ−1i(r;t,x)))drdx+∫l0|b1i(t−z−1i(x))−b2i(t−z−1i(x))|Vi(x,t)dx+∫l0∫x0fi(r,φ−1i(r;t,x))Vi(r,φ−1i(r;t,x))∫xr(|μi(δ,c1i0(φ−1i(δ;t,x)))−μi(δ,c2i0(φ−1i(δ;t,x)))|Vi(δ,φ−1i(δ;t,x))+3∑i,k=1,k≠iλik(δ,φ−1i(δ;t,x))|P1k(φ−1i(δ;t,x))−P2k(φ−1i(δ;t,x))|Vi(δ,φ−1i(δ;t,x)))dδdrdx≤M2∫l0∫t0(Lμ|c1i0(s)−c2i0(s)|+¯λik∫l03∑i,k=1,k≠i|p1k(x,s)−p2k(x,s)|dx)dsdx+‖fi(⋅,⋅)‖L1(Q)∫t0(Lμ|c1i0(s)−c2i0(s)|+¯λik∫l03∑i,k=1,k≠i|p1k(x,s)−p2k(x,s)|dx)ds+M4∫t0(|c1i0(s)−c2i0(s)|+(z−1i(l)+T)|c1i0(s)−c2i0(s)|)ds+M4(z−1i(l)+T)∫l0∫t03∑i,k=1,k≠i|p1k(x,s)−p2k(x,s)|dsdx≤M5(∫t0|c1i0(s)−c2i0(s)|ds+∫l0∫t03∑i,k=1,k≠i|p1k(x,s)−p2k(x,s)|dsdx), |
where M5=max{M2lLμ+‖fi(⋅,⋅)‖L1(Q)Lμ+M4(1+z−1i(l)+T),M2¯λikl+‖fi(⋅,⋅)‖L1(Q)¯λik+M4(z−1i(l)+T)}.
By (3.12)–(3.13), we have
|Gj(p1,c10,c1e)−Gj(p2,c20,c2e)|(t)(j=4,5,6)≤M6∫t0|c1e(s)−c2e(s)|ds, |
where M6=k1.
![]() |
where M7=max{k2+g2+k2hT+k2g2MT,g2M}.
We now use the Banach fixed point theorem to demonstrate that the mapping G has only one fixed point. Due to the periodicity of elements in the set Y, we consider the case t∈[0,T] only. Define a new norm in L∞(0,T) by
‖(p,c0,ce)‖∗=esssupt∈[0,T]e−λt{3∑i=1∫l0|pi(x,t)|dx+3∑i=1|ci0(t)|+|ce(t)|}, |
where λ>0 is large enough. Then, we have
![]() |
where M8=max{M5,M6,M7}. Thus, choosing λ>M8 yields that G is a strict contraction on (Y,‖⋅‖∗). The unique fixed point (p,c0,ce) of G must be solution to (2.3).
Theorem 3.2. If T is small enough, then there are constants Kj(T) with limT→0Kj(T)>0,j=1,2, such that
3∑i=1‖p1i−p2i‖L∞(0,T;L1(0,l))+3∑i=1‖c1i0−c2i0‖L∞(0,T)+‖c1e−c2e‖L∞(0,T)≤K1(T)T(3∑i=1‖u1i−u2i‖L∞(0,T;L1(0,l))+‖v1−v2‖L∞(0,T)). | (3.14) |
3∑i=1‖p1i−p2i‖L1(Q)+3∑i=1‖c1i0−c2i0‖L1(0,T)+‖c1e−c2e‖L1(0,T)≤K2(T)T(3∑i=1‖u1i−u2i‖L1(Q)+‖v1−v2‖L1(0,T)). | (3.15) |
This proof process of Theorem 3.2 is similar to that of Theorem 4.1 in [27], and is omitted here.
In this section, we employ tangent-normal cone techniques in nonlinear functional analysis to deduct the necessary conditions for the optimal control pair.
Theorem 4.1. If (u∗,v∗) is an optimal control pair and (p∗,c∗0,c∗e) is the corresponding optimal state, then
u∗i(x,t)=Fi([wi(x,t)−ξi(x,t)]p∗i(x,t)ci),i=1,2,3,a.e.(x,t)∈Q, | (4.1) |
v∗(t)=F4(ξ7(t)c4)a.e.t∈(0,T), | (4.2) |
in which the truncated mappings Fj are given by
Fj(η)={0,η<0,η,0≤η≤Nj,j=1,2,3,4,Nj,η>Nj, | (4.3) |
and (ξ1,ξ2,…,ξ7) is the solution of the following adjoint system corresponding to (u∗,v∗):
{∂ξi∂t+Vi∂ξi∂x=[μi(x,c∗i0(t))+3∑i,k=1,k≠iλikP∗k(t)+u∗i]ξi+[k2c∗e(t)−g2c∗i0(t)]ξ7−ξi(0,t)βi(x,c∗i0(t))+wiu∗i,dξi+3dt=∫l0∂μi(x,c∗i0(t))∂ci0p∗iξidx+(g1+m)ξi+3−g2P∗i(t)ξ7−ξi(0,t)∫l0∂βi(x,c∗i0(t))∂ci0p∗idx,dξ7dt=−k13∑i=1ξi+3+[k23∑i=1P∗i(t)+h]ξ7,ξi(l,t)=0,ξi(x,t)=ξi(x,t+T),i=1,2,3,ξj(T)=0,j=4,…,7. | (4.4) |
Proof. The existence of a unique, bounded solution to the adjoint system (4.4) can be treated in the same manner as the state system (2.3). For any given (ν1,ν2)∈TΩ(u∗,v∗) (the tangent cone of Ω at (u∗,v∗)), u∗=(u∗1,…,u∗3),ν1=(ν11,…,ν31), (u∗+εν1,v∗+εν2)∈Ω provided that ε is small enough. Then, from J(u∗+εν1,v∗+εν2)≤J(u∗,v∗), we derive
3∑i=1∫T0∫l0wi(u∗i+ενi1)pεidxdt−123∑i=1∫T0∫l0ci(u∗i+ενi1)2dxdt−12∫T0c4(v∗+εν2)2dt≤3∑i=1∫T0∫l0wiu∗ip∗idxdt−123∑i=1∫T0∫l0ciu∗2idxdt−12∫T0c4v∗2dt, |
and then deduce that
3∑i=1∫T0∫l0wi(u∗izi+νi1p∗i)dxdt−3∑i=1∫T0∫l0ciu∗iνi1dxdt−∫T0c4v∗ν2dt≤0, | (4.5) |
where 1ε(pεi−p∗i)→zi,1ε(cεi0−c∗i0)→zi+3,1ε(cεe−c∗e)→z7,asε→0. By Theorem 3.2, we get the existence of z1,z2,…,z7. (pε,cε0,cεe) is the state corresponding to (u∗+εν1,v∗+εν2). It follows from the state system (2.3) that (z1,z2,…,z7) satisfies
{∂zi∂t+Vi∂zi∂x=−[μi(x,c∗i0(t))+3∑i,k=1,k≠iλikP∗k(t)+Vix+u∗i]zi−3∑i,k=1,k≠iλikZk(t)p∗i−∂μi(x,c∗i0(t))∂ci0p∗izi+3−vi1p∗i,dzi+3dt=k1z7−g1zi+3−mzi+3,dz7dt=−k2c∗e(t)3∑i=1Zi(t)+g23∑i=1[c∗i0Zi(t)+zi+3P∗i(t)]−[k23∑i=1P∗i(t)+h1]z7+ν2,Vi(0,t)zi(0,t)=∫l0βi(x,c∗i0(t))zidx+∫l0∂βi(a,c∗i0(t))∂ci0p∗izi+3dx,zi(x,t)=zi(x,t+T),zi+3(0)=z7(0)=0,P∗i(t)=∫l0p∗i(x,t)dx,Zi(t)=∫l0zi(x,t)dx,i=1,2,3. | (4.6) |
We multiply the first three equations in (4.6) by ξ1,ξ2,…,ξ7, respectively, and integrate on Q and (0,T). By using (4.4), we have
3∑i=1∫T0∫l0wiu∗izidxdt=−3∑i=1∫T0∫l0νi1ξip∗idxdt+∫T0ν2ξ7dt. | (4.7) |
Substituting (4.7) into (4.5) gives
3∑i=1∫T0∫l0[(wi−ξi)p∗i−ciu∗i]νi1dxdt+∫T0(−c4v∗+ξ7)ν2dt≤0, |
for any (ν1,ν2)∈TΩ(u∗,v∗). Consequently, the structure of normal cone tells us that ((wi−ξi)p∗i−ciu∗i,−c4v∗+ξ7)∈NΩ(u∗,v∗) (the normal cone of Ω at (u∗,v∗)), which gives the desired result.
Theorem 4.2. If T is small enough, then there is a constant K3, such that
3∑i=1‖ξ1i−ξ2i‖L∞(Q)+3∑i=1‖ξ1i+3−ξ2i+3‖L∞(0,T)+‖ξ17−ξ27‖L∞(0,T)≤K3T(3∑i=1‖u1i−u2i‖L∞(Q)+‖v1−v2‖L∞(0,T)). | (4.8) |
The proof process of Theorem 4.2 is similar to that of Theorem 3.2, and is omitted here.
In order to show that there exists a unique optimal control pair by means of the Ekeland variational principle, we embed the functional ˜J(u,v) into [L1(Q)]3×L1(0,T). We define
˜J(u,v)={J(u,v),(u,v)∈Ω,−∞,otherwise. |
Lemma 5.1. ˜J(u,v) is upper semi-continuous with respect to (u,v) in [L1(Q)]3×L1(0,T).
Proof. Let (un,vn)→(u,v) as n→∞, (pn,cn0,cne) and (p,c0,ce) be the states of (2.3) corresponding to (un,vn) and (u,v), respectively. By Riesz theorem, there is a subsequence, denoted still by (un,vn) such that
[un(x,t)]2→u2(x,t)a.e.(x,t)∈Q,[vn(t)]2→v2(t)a.e.t∈(0,T),asn→∞. |
Thus, from the Lebesgue's dominated convergence theorem yields
limn→∞∫T0∫l0[uni(x,t)]2dxdt=∫T0∫l0u2i(x,t)dxdt,limn→∞∫T0[vn(t)]2dt=∫T0v2(t)dt. |
On the other hand, it follows from (3.15) that
|∫T0∫l0wi(x,t)uni(x,t)pni(x,t)dxdt−∫T0∫l0wi(x,t)ui(x,t)pi(x,t)dxdt|≤∫T0∫l0wi(x,t)pni(x,t)|uni(x,t)−ui(x,t)|dxdt+∫T0∫l0wi(x,t)ui(x,t)|pni(x,t)−pi(x,t)|dxdt≤M¯wi‖uni−ui‖L1(Q)+Ni¯wi‖pni−pi‖L1(Q)≤M¯wi‖uni−ui‖L1(Q)+Ni¯wiK2(T)T(‖uni−ui‖L1(Q)+‖v1−v2‖L1(0,T)). |
Therefore,
limn→∞∫T0∫l0wi(x,t)uni(x,t)pni(x,t)dxdt=∫T0∫l0wi(x,t)ui(x,t)pi(x,t)dxdt. |
In a word, we have proved that lim supn→∞˜J(un,vn)≤˜J(u,v).
Theorem 5.1. If T is sufficiently small, there exists one and only one optimal control pair (u∗,v∗), which is in feedback and is determined by (4.1)–(4.4) and (2.3), where C1 and C2 are the supremum of |pi| and |ξj|,i=1,2,3,j=1,2,…,7, respectively.
Proof. Define the mapping L:Ω→Ω as follows:
L(u,v)=F((w1−ξ1)p1c1,…,(w3−ξ3)p3c3,ξ7c4)=(F1((w1−ξ1)p1c1),…,F3((w3−ξ3)p3c3),F4(ξ7c4)), |
where (p,c0,ce) and (ξ1,ξ1,…,ξ7) are the state and adjoint state, respectively, corresponding to the control (u,v). We show that L admits a unique fixed point, which maximizes the functional L.
From Lemma 5.1 and the Ekeland variational principle, for any given ε>0, there exists (uε,vε)∈Ω such that
˜J(uε,vε)≥sup(u,v)∈Ω˜J(u,v)−ε, | (5.1) |
˜J(uε,vε)≥sup(u,v)∈Ω{˜J(u,v)−√ε(3∑i=1‖uεi−ui‖L1(Q)+‖vε−v‖L1(0,T))}. | (5.2) |
Thus, the perturbed functional
˜Jε(u,v)=˜J(u,v)−√ε(3∑i=1‖uεi−ui‖L1(Q)+‖vε−v‖L1(0,T)), |
attains its supremum at (uε,vε). Then, we argue as in Theorem 4.1:
(uε,vε)=L(uε,vε)=(F1((w1−ξε1)pε1+√εθε1c1),…,F3((w3−ξε3)pε3+√εθε3c3),F4(ξε7+√εθε4c4)), | (5.3) |
where (pε,cε0,cεe) and (ξε1,ξε2,…,ξε7) are the state and adjoint state, respectively, corresponding to the control (uε,vε), θε1,…,θε3∈L∞(Q),θε4∈L∞(0,T), and with |θεi|≤1,i=1,2,3,4.
First, we show that L has only one fixed point. Let (pj,cj0,cje) and (ξj1,ξj2,…,ξj7) be the state and adjoint state corresponding to the control (uj,vj),j=1,2. By (3.14) and (4.8), we have
‖L(u1,v1)−L(u2,v2)‖∞=3∑i=1‖Fi((wi−ξ1i)p1ici)−Fi((wi−ξ2i)p2ici)‖L∞(Q)+‖F4(ξ17c4)−F4(ξ27c4)‖L∞(0,T)≤3∑i=1‖(wi−ξ1i)p1ici−(wi−ξ2i)p2ici‖L∞(Q)+‖ξ17c4−ξ27c4‖L∞(0,T)≤3∑i=1‖wi(p1i−p2i)ci+|ξ1i|(p1i−p2i)ci+|p2i|(ξ1i−ξ2i)ci‖L∞(Q)+‖ξ17−ξ27c4‖L∞(0,T)≤T(3∑i=11ci(¯wiK1+C2K1+C1K3)+K3)⋅(3∑i=1‖u1i−u2i‖L∞(Q)+‖v1−v2‖L∞(0,T)). |
Clearly, L is a contraction if T is sufficiently small. Hence, L has a unique fixed point (u∗,v∗).
Next, we prove (uε,vε)→(u∗,v∗) as ε→0+. The relations (4.1), (4.2) and (5.3) lead to
![]() |
it is easy to derive that
‖(u∗,v∗)−(uε,vε)‖∞≤‖L(u∗,v∗)−L(uε,vε)‖∞+‖L(uε,vε)−(uε,vε)‖∞≤T(3∑i=11ci(¯wiK1+C2K1+C1K3)+K3)⋅(3∑i=1‖u∗i−uεi‖L∞(Q)+‖v∗−vε‖L∞(0,T))+√ε4∑i=11ci. |
So, if T is small enough, the following result holds:
3∑i=1‖u∗i−uεi‖L∞(Q)+‖v∗−vε‖L∞(0,T)≤√ε4∑i=11ci1−T(3∑i=11ci(¯wiK1+C2K1+C1K3)+K3), |
which gives the desired result.
Finally, passing to the limit ε→0+ in the inequality of (5.2) and using Lemma 5.1 yield ˜J(u∗,v∗)≥lim sup(u,v)∈Ω˜J(u,v), which finishes the proof.
In this section, our goal is to obtain a numerical approximation for the nonnegative T-periodic solution of the system (2.3). We numerically study the evolution of a single species in a polluted environment as a simplification of the complete model (2.3). If the harvest effort term and the summation term are considered, it will be transformed into the optimization problem (2.3)–(2.4), which is complex.
Suppose the computational domain ˜Q=[0,l]×[0,˜T] is divided into an J×N mesh with the spacial step size h=lJ=0.01 in the x direction and time step size τ=˜TN=0.02. The grid points (xj,tn) are defined by
xj=jh,j=0,1,2,…,J; |
tn=nτ,n=0,1,2,…,N, |
where J and N are two integers. The pnj and fnj terms denote the solution p(jh,nτ) and source term f(jh,nτ) of the finite difference equation, respectively.
Based on the state system (2.3), the finite difference scheme can be written as follows:
pnj−pn−1jτ+Vpnj−pnj−1h+Vxpnj+μpnj−fnj=0, | (6.1) |
where j=1,2,…,J;n=1,2,…,N. It follows from (6.1) that
−dVpnj−1+[1+dV+τ(Vx+μ)]pnj=pn−1j+τfnj, | (6.2) |
where d=τh.
Since V(0,t)=1, then the boundary condition p(0,t)=∫l0β(x,c0(t))p(x,t)dx and initial condition p(x,0)=p0(x) can be discretized as
{p0j=p0j,pn0=J∑j=1βjpnjh. | (6.3) |
From (6.2) and (6.3), we have the matrix associated with the system of linear equations of the finite difference method
APn=Pn−1+τF, | (6.4) |
where
A=[1+dV+τ(Vx+μ)−dVβh−dVβh…−dVβh−dVβh−dV1+dV+τ(Vx+μ)…00⋱⋱⋱00…−dV1+dV+τ(Vx+μ)00…0−dV], |
Pn=(pn1,pn2,…,pnJ)T,F=(fn1,fn2,…,fnJ)T. |
Note that A is an upper triangular matrix, so the nonlinear algebraic equations (6.4) have solutions. In this paper, we choose the following parameters:
{β(x,c0(t))=100x2(1−x)(1+sin(πx))|sin2πc0(t)T|,μ(x,c0(t))=e−4x(1−x)−1.4(2+cos2πc0(t)T),V(x,t)=1−x,f(x,t)=2+(1+x)sin(2πtT),p0(x)=ex,u(x,t)=0,x=1,T=13,˜T=6T. |
In this paper, we used the backward difference scheme and chasing method, and (6.4) was solved through programming. The fertility rate, mortality rate, and immigration rate were T-periodic and were all greater than zero, which is consistent with the assumptions. We considered T=13. Their graphs are given in Figures 1–3, respectively. The fertility rate was the highest when the size was half and the mortality rate was the highest when the size was the maximum, which conformed to the empirical situation. Therefore, the selection of parameters β, μ, and f was reasonable.
The graphic of the numerical solution p is given in Figure 4. Over time, solution p showed T-periodic changes. We take the numerical solution of (2.3), corresponding to an arbitrary positive initial datum p0, on some interval [kT,(k+1)T], where k is large enough. On such an interval, the solution p was already stable. We can then get the periodic solution of (2.3) by extending the numerical solution p. During computation we found that any positive initial datum p0 was appropriate for use.
The study of time periodic models is of great importance due to the fact that the vital rates and the inflow are often time periodic. In the foregoing, we have established the existence and uniqueness of a nonnegative solution of the hybrid system (2.3). The necessary conditions for optimal controls were provided. The existence of the unique optimal control pair was investigated. Some numerical results were finally presented. The results implied that the solution of (2.3) always maintains the pattern of increasing periodically, and any positive initial datum p0 is appropriate. Over time, the density of the population increased first and then decreased in a cycle. The bang-bang structure of solutions is much more common in optimal population management.
Furthermore, if Vi(x,t)=1 for Q=(0,l)×R+,i=1,2,3, the state system degenerates into an age-structured model, and our results cover the corresponding results [5,6,7]. Note that the individual price factor wi(x,t) plays an important role in the structure of the optimal controller (4.1). However, as we do not have a clear biological meaning for the solutions ξi(i=1,2,…,7) of the adjoint system (4.4), it is difficult to give a precise explanation of the threshold conditions (4.1) and (4.2). In specific applications, the optimal population density and optimal policy are calculated by combining the state system and the adjoint system. This is a challenging problem, and future work in the area should address it.
The authors thank the referees for their valuable comments and suggestions on the original manuscript that helped improve its quality. The work was supported by the National Natural Science Foundation of China under grant 11561041.
None of the authors has a conflict of interest in the publication of this paper.
[1] | B. Jeremy, T. Pete, K. Alan, B. Laurie, Y. George, E. Petros, et al., Traffic safety basic facts 2012: junctions, 2013. Available from: https://roderic.uv.es/handle/10550/30218. |
[2] | NHTSA, Fatality Analysis Reporting System (FARS). Available from: http://www.nhtsa.gov/FARS. |
[3] | P. B. Hunt, D. I. Robertson, R. D. Bretherton, R. I. Winton, SCOOT-a traffic responsive method of coordinating signals, 1981. Available from: https://trid.trb.org/view/179439. |
[4] |
A. G. Sims, K. W. Dobinson, The Sydney coordinated adaptive traffic (SCAT) system philosophy and benefits, IEEE Trans. Veh. Technol., 29 (1980), 130–137. https://doi.org/10.1109/T-VT.1980.23833 doi: 10.1109/T-VT.1980.23833
![]() |
[5] |
S. C. Wong, W. T. Wong, C. M. Leung, C. O. Tong, Group-based optimization of a time-dependent TRANSYT traffic model for area traffic control, Abbreviation Title Transp. Res. Part B Methodol., 36 (2002), 291–312. https://doi.org/10.1016/S0191-2615(01)00004-2 doi: 10.1016/S0191-2615(01)00004-2
![]() |
[6] |
L. Chen, C. Englund, Cooperative intersection management: a survey, IEEE Trans. Intell. Transp. Syst., 17 (2015), 570–586. https://doi.org/10.1109/TITS.2015.2471812 doi: 10.1109/TITS.2015.2471812
![]() |
[7] |
S. El-Tantawy, B. Abdulhai, H. Abdelgawad, Multiagent reinforcement learning for integrated network of adaptive traffic signal controllers (MARLIN-ATSC): methodology and large-scale application on downtown Toronto, IEEE Trans. Intell. Transp. Syst., 14 (2013), 1140–1150. https://doi.org/10.1109/TITS.2013.2255286 doi: 10.1109/TITS.2013.2255286
![]() |
[8] |
A. Zaidi, B. Kulcsár, H. Wymeersch, Back-pressure traffic signal control with fixed and adaptive routing for urban vehicular networks, IEEE Trans. Intell. Transp. Syst., 17 (2016), 2134–2143. https://doi.org/10.1109/TITS.2016.2521424 doi: 10.1109/TITS.2016.2521424
![]() |
[9] | 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 Multiagent Systems, (2005), 471–477. https://doi.org/10.1145/1082473.1082545 |
[10] |
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
![]() |
[11] |
M. Ahmane, A. Abbas-Turki, F. Perronnet, J. Wu, A. E. Moudni, J. Buisson, et al., Modeling and controlling an isolated urban intersection based on cooperative vehicles, Transp. Res. Part C Emerging Technol., 28 (2013), 44–62. https://doi.org/10.1016/j.trc.2012.11.004 doi: 10.1016/j.trc.2012.11.004
![]() |
[12] |
L. Li, F. Wang, Cooperative driving at blind crossings using intervehicle communication, IEEE Trans. Veh. Technol., 55 (2006), 1712–1724. https://doi.org/10.1109/TVT.2006.878730 doi: 10.1109/TVT.2006.878730
![]() |
[13] |
J. Lee, B. Park, Development and evaluation of a cooperative vehicle intersection control algorithm under the connected vehicles environment, IEEE Trans. Intell. Transp. Syst., 13 (2012), 81–90. https://doi.org/10.1109/TITS.2011.2178836 doi: 10.1109/TITS.2011.2178836
![]() |
[14] |
M. A. S. Kamal, J. Imura, T. Hayakawa, A. Ohata, K. Aihara, A vehicle-intersection coordination scheme for smooth flows of traffic without using traffic lights, IEEE Trans. Intell. Transp. Syst., 16 (2014), 1136–1147. https://doi.org/10.1109/TITS.2014.2354380 doi: 10.1109/TITS.2014.2354380
![]() |
[15] |
P. Dai, K. Liu, Q. Zhuge, E. H. Sha, V. C. S. Lee, S. H. Son, Quality-of-experience-oriented autonomous intersection control in vehicular networks, IEEE Trans. Intell. Transp. Syst., 17 (2016), 1956–1967. https://doi.org/10.1109/TITS.2016.2514271 doi: 10.1109/TITS.2016.2514271
![]() |
[16] | S. E. Li, Y. Zheng, K. Li, J. Wang, An overview of vehicular platoon control under the four-component framework, in 2015 IEEE Intelligent Vehicles Symposium (IV), (2015), 286–291. https://doi.org/10.1109/IVS.2015.7225700 |
[17] |
L. Xiao, F. Gao, Practical string stability of platoon of adaptive cruise control vehicles, IEEE Trans. Intell. Transp. Syst., 12 (2011), 1184–1194. https://doi.org/10.1109/TITS.2011.2143407 doi: 10.1109/TITS.2011.2143407
![]() |
[18] |
S. Darbha, S. Konduri, P. Pagilla, Benefits of V2V communication for autonomous and connected vehicles, IEEE Trans. Intell. Transp. Syst., 20 (2018), 1954–1963. https://doi.org/10.1109/TITS.2018.2859765 doi: 10.1109/TITS.2018.2859765
![]() |
[19] |
Y. Zheng, S. E. Li, J. Wang, D. Cao, K. Li, Stability and scalability of homogeneous vehicular platoon: study on the influence of information flow topologies, IEEE Trans. Intell. Transp. Syst., 17 (2015), 14–26. https://doi.org/10.1109/TITS.2015.2402153 doi: 10.1109/TITS.2015.2402153
![]() |
[20] |
S. E. Li, Y. Zheng, K. Li, Y. Wu, J. K. Hedrick, F. Gao, et al., Dynamical modeling and distributed control of connected and automated vehicles: challenges and opportunities, IEEE Intell. Transp. Syst. Mag., 9 (2017), 46–58. https://doi.org/10.1109/MITS.2017.2709781 doi: 10.1109/MITS.2017.2709781
![]() |
[21] |
M. Bernardo, P. Falcone, A. Salvi, S. Santini, Design, analysis, and experimental validation of a distributed protocol for platooning in the presence of time-varying heterogeneous delays, IEEE Trans. Control Syst. Technol., 24 (2015), 413–427. https://doi.org/10.1109/TCST.2015.2437336 doi: 10.1109/TCST.2015.2437336
![]() |
[22] |
S. Stüdli, M. Seron, R. H. Middleton, Vehicular platoons in cyclic interconnections, Automatica, 94 (2018), 283–293. https://doi.org/10.1016/j.automatica.2018.04.033 doi: 10.1016/j.automatica.2018.04.033
![]() |
[23] |
F. Gao, X. Hu, S. E. Li, K. Li, Q. Sun, Distributed adaptive sliding mode control of vehicular platoon with uncertain interaction topology, IEEE Trans. Ind. Electron., 65 (2018), 6352–6361. https://doi.org/10.1109/TIE.2017.2787574 doi: 10.1109/TIE.2017.2787574
![]() |
[24] |
F. Gao, S. E. Li, Y. Zheng, D. Kum, Robust control of heterogeneous vehicular platoon with uncertain dynamics and communication delay, IET Intell. Transp. Syst., 10 (2016), 503–513. https://doi.org/10.1049/iet-its.2015.0205 doi: 10.1049/iet-its.2015.0205
![]() |
[25] |
P. Liu, A. Kurt, U. Ozguner, Distributed model predictive control for cooperative and flexible vehicle platooning, IEEE Trans. Control Syst. Technol., 27 (2018), 1115–1128. https://doi.org/10.1109/TCST.2018.2808911 doi: 10.1109/TCST.2018.2808911
![]() |
[26] |
A. I. M. Medina, N. V. D. Wouw, H. Nijmeijer, Cooperative intersection control based on virtual platooning, IEEE Trans. Intell. Transp. Syst., 19 (2017), 1727–1740. https://doi.org/10.1109/TITS.2017.2735628 doi: 10.1109/TITS.2017.2735628
![]() |
[27] |
B. Xu, S. E. Li, Y. Bian, S. Li, X. J. Ban, J. Wang, et al., Distributed conflict-free cooperation for multiple connected vehicles at unsignalized intersections, Transp. Res. Part C Emerging Technol., 93 (2018), 322–334. https://doi.org/10.1016/j.trc.2018.06.004 doi: 10.1016/j.trc.2018.06.004
![]() |
[28] |
Y. Zhou, M. E. Cholette, A. Bhaskar, E. Chung, Optimal vehicle trajectory planning with control constraints and recursive implementation for automated on-ramp merging, IEEE Trans. Intell. Transp. Syst., 20 (2018), 3409–3420. https://doi.org/10.1109/TITS.2018.2874234 doi: 10.1109/TITS.2018.2874234
![]() |
[29] |
I. Flugge-Lotz, H. Marbach, The optimal control of some attitude control systems for different performance criteria, J. Fluids Eng., 85 (1963), 165–175. https://doi.org/10.1115/1.3656552 doi: 10.1115/1.3656552
![]() |
[30] |
P. Wang, Y. Jiang, L. Xiao, Y. Zhao, Y. Li, A joint control model for connected vehicle platoon and arterial signal coordination, J. Intell. Transp. Syst., 24 (2020), 81–92. https://doi.org/10.1080/15472450.2019.1579093 doi: 10.1080/15472450.2019.1579093
![]() |
[31] |
J. Gong, J. Cao, Y. Zhao, Y. Wei, J. Guo, W. Huang, Sampling-based cooperative adaptive cruise control subject to communication delays and actuator lags, Math. Comput. Simul., 171 (2020), 13–25. https://doi.org/10.1016/j.matcom.2019.10.012 doi: 10.1016/j.matcom.2019.10.012
![]() |
[32] |
Y. Zhao, G. Guo, Distributed tracking control of mobile sensor networks with intermittent communications, J. Franklin Inst., 354 (2017), 3634–3647. https://doi.org/10.1016/j.jfranklin.2017.03.003 doi: 10.1016/j.jfranklin.2017.03.003
![]() |
[33] |
M. A. S. Kamal, M. Mukai, J. Murata, T. Kawabe, Ecological vehicle control on roads with up-down slopes, IEEE Trans. Intell. Transp. Syst., 12 (2011), 783–794. https://doi.org/10.1109/TITS.2011.2112648 doi: 10.1109/TITS.2011.2112648
![]() |
[34] |
B. Paden, S. Sastry, A calculus for computing Filippov's differential inclusion with application to the variable structure control of robot manipulators, IEEE Trans. Circuits Syst., 34 (1987), 73–82. https://doi.org/10.1109/TCS.1987.1086038 doi: 10.1109/TCS.1987.1086038
![]() |
[35] |
S. Li, X. Qin, Y. Zheng, J. Wang, K. Li, H. Zhang, Distributed platoon control under topologies with complex eigenvalues: stability analysis and controller synthesis, IEEE Trans. Control Syst. Technol., 27 (2017), 206–220. https://doi.org/10.1109/TCST.2017.2768041 doi: 10.1109/TCST.2017.2768041
![]() |
1. | Bin Feng, Chengbo Ai, Haofei Zhang, Fusion of Infrared and Visible Light Images Based on Improved Adaptive Dual-Channel Pulse Coupled Neural Network, 2024, 13, 2079-9292, 2337, 10.3390/electronics13122337 |