Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
A journal of IEEE and CAA , publishes high-quality papers in English on original theoretical/experimental research and development in all areas of automation
M. Xie, D. Ding, X. Ge, Q.-L. Han, H. Dong, and Y. Song, “Distributed platooning control of automated vehicles subject to replay attacks based on proportional integral observers,” IEEE/CAA J. Autom. Sinica, vol. 11, no. 9, pp. 1954–1966, Sept. 2024. doi: 10.1109/JAS.2022.105941
Citation: M. Xie, D. Ding, X. Ge, Q.-L. Han, H. Dong, and Y. Song, “Distributed platooning control of automated vehicles subject to replay attacks based on proportional integral observers,” IEEE/CAA J. Autom. Sinica, vol. 11, no. 9, pp. 1954–1966, Sept. 2024. doi: 10.1109/JAS.2022.105941

Distributed Platooning Control of Automated Vehicles Subject to Replay Attacks Based on Proportional Integral Observers

doi: 10.1109/JAS.2022.105941
Funds:  This work was supported in part by the National Natural Science Foundation of China (61973219, U21A2019, 61873058) and the Hainan Province Science and Technology Special Fund (ZDYF2022SHFZ105)
More Information
  • Secure platooning control plays an important role in enhancing the cooperative driving safety of automated vehicles subject to various security vulnerabilities. This paper focuses on the distributed secure control issue of automated vehicles affected by replay attacks. A proportional-integral-observer (PIO) with predetermined forgetting parameters is first constructed to acquire the dynamical information of vehicles. Then, a time-varying parameter and two positive scalars are employed to describe the temporal behavior of replay attacks. In light of such a scheme and the common properties of Laplace matrices, the closed-loop system with PIO-based controllers is transformed into a switched and time-delayed one. Furthermore, some sufficient conditions are derived to achieve the desired platooning performance by the view of the Lyapunov stability theory. The controller gains are analytically determined by resorting to the solution of certain matrix inequalities only dependent on maximum and minimum eigenvalues of communication topologies. Finally, a simulation example is provided to illustrate the effectiveness of the proposed control strategy.

     

  • THE volume of traffic has been ever-increasing due mainly to the rapid development of urban transportation networks and highway systems. While providing the convenience of economic and social development, vehicles give rise to many considerable social problems, such as frequent traffic accidents, increasingly severe traffic congestion as well as increasingly energy cost [1]–[3]. Platooning control, as one effective means, has been developed to overcome such impressive issues by ensuring that vehicles run on roads as a team with the desired spacing and the same speed [4]–[7]. This kind of model not only guarantees the safety of vehicles but also increases transportation efficiency and hence has been attracted a great deal of attention from scholars. There is no doubt that platooning control is essentially formation control of multi-agent systems, for which the related approaches can be utilized to generate the desired platoon strategies. In the past few years, some interesting results have been reported in the literature, see [8] and the references therein. Compared with traditional multi-agent systems, the spacing strategy has to be prioritized in platooning control. Typical strategies include, but are not limited to, constant spacing [9], constant time headway [10], as well as variable time headway [11].

    It should be mentioned that state-feedback control strategies can realize better platooning performance than output-feedback ones. However, in practical scenarios, the whole motion information on mobile vehicles cannot be easily measured directly. Therefore, it is necessary to propose an observer to estimate the motion information of vehicles in real time. Proportional-integral observers (PIOs) have been developed recently when the influence of accumulated estimate errors is a concern [12]. PIO is an extension of the Luenberger observer. Compared with the traditional Luenberger observer, the structure of PIOs involves an additional integral term, which makes it more robust and has better steady-state accuracy [13]–[15]. For instance, PIOs with gain variations have been developed in [14] in the framework of H filtering. The state-of-charge estimation based on RC battery models has been utilized in [16] to verify the superiority of proposed PIOs. The technique of unknown input proportional multiple-integral observer has been proposed in [17] to estimate the lumped disturbance of heterogeneous vehicle platoons subject to disturbances and modeling errors, and a novel PIO-based fault-tolerant tracking controller has been developed in [18] for automobile active suspensions encountered with actuator faults and parameter uncertainties. Recently, a PIO-based output tracking control scheme has been developed in [19] for time-delayed Markov jump systems, where equivalent input disturbance approaches have been utilized to improve the rejection performances. To the authors’ knowledge, the research of PIO-based control is still in the primary stage, and the corresponding platooning control is still open, which is the motivation of our current research.

    Automated vehicles will improve traffic safety and efficiency thanks to information can be exchanged wirelessly between vehicle-to-vehicle (V2V) or vehicle-to-infrastructure (V2I). However, under dense deployment scenarios, and with the introduction of connected automated vehicles that the requirements for communication bandwidth will also be higher, so V2V communication will also face challenges in terms of reliability and communication bandwidth. 5G is the latest generation of communication technology. The 5G technology ensures the network speed, reliability and time delay of communication. The application of 5G communication technology to the Internet of Vehicles can optimize the communication system of current autonomous driving technology and improve the data transmission rate. The 5G technology plays an important role in vehicle delay processing. It can improve the response speed of vehicles, take vehicle instructions in time, adjust vehicle driving information, and improve system safety. It is indispensable to guarantee the information exchange among vehicles in the task of platooning control via open V2V or V2I networks [20]–[22]. Due mainly to the network vulnerability, attacks could have the capability of invading communication networks and generate great impacts on the driving safety of vehicles and even cause fatal accidents. Generally speaking, common attacks can be divided into deception attacks [23]–[27], denial of service attacks [28]–[31] and replay attacks [32], [33]. Among several feasible attack mechanisms, replay attacks have been evaluated as being particularly dangerous. The replay attack is to replay the recorded historical data to the vehicle. Since the replayed data information is outdated, the system performance is degraded, and even the stability of the platooning is endangered. In the past few years, some preliminary results, focusing on secure platooning control, have been reported in the literature. For instance, an adaptive control scheme by means of neural networks has been proposed in [34] to achieve secure platooning control under deception attacks, and a resilient control protocol has been developed in [35] to realize the internal stability of vehicular physical systems under denial of service attacks. Furthermore, an adaptive control algorithm by considering the attack mitigation has been proposed in [36] to copy with a platoon formation undergoing cyber threats. In addition, a robust reset controller combined with a delay-robust speed synchronization controller have been designed in [37] to satisfy energy-to-peak performance of a connected vehicle subject to replay attacks, and a long short-term memory neural-network-based model has been proposed in [38] for detecting replay attack and amplitude-shift attack. It is worth pointing out that the influence of replay attacks has received less research attention in theoretical analysis, not to mention that the platooning control of automated vehicles is a concern.

    Replay attacks have some typical characteristics a) an uncertain instant of their occurrence; b) an uncertain instant of historical data stored in caches; and c) the uncertain duration. Currently reported mathematical models cannot be easily embedded in the process of performance analysis, which results in enormous difficulties in security control. Furthermore, in the context of distributed platooning control, the following three fundamental challenges are identified: 1) how to provide a new approach to describe replay attacks; 2) how to establish a unified analysis framework under PIO-based controllers and replay attacks; and 3) how to develop a control scheme whose computation burden is insensitive to the number of vehicles. As such, this paper devotes itself to providing satisfactory answers about these three identified challenges, and the corresponding contributions are highlighted as follows: 1) A time-varying parameter and two positive scalars are introduced to deal with the temporal behavior of replay attacks, under which the discussed system is transformed into a switched and time-delayed one; 2) A sufficient condition dependent on the duration and the active ratio of replay attacks is received via the Lyapunov stability theory; 3) The desired gains of PIO-based controllers are designed by resorting to the solution of certain matrix inequalities only dependent on maximum and minimum eigenvalues of communication topologies.

    The remaining sections of this paper are structured as follows. Section II formulates the PIO-based control problem for automated vehicles subject to replay attacks. Then, the stability analysis and the gain design of desired controllers are presented in Section III. In Section IV, an illustrative example is given to show the effectiveness of the proposed scheme. The conclusions are provided in Section V.

    This paper focuses on a homogeneous platoon of N+1 vehicles driving on a straight highway. Such a platoon includes a leading vehicle indexed by 0 and N following vehicles indexed from 1 to N. Vehicles share their status information through the V2V communication protocol, such as the absolute position, the speed as well as the acceleration. The objective of platooning control is to ensure that the entire platoon moves at the same speed and meanwhile maintains a constant distance between the front and rear vehicles.

    Vehicles in a homogeneous platoon communicate with their neighbors via V2V channels. The V2V communication topology is described by a triple G=(V,E,L) with the set V={1,2,,N} for N following vehicles, the set EV×V for edges indicating the information exchange among following vehicles, and the associated adjacency matrix L=[lij]Rn×n representing the weights of V2V communication. Specifically lij0 if (i,j)E, otherwise lij=0. Furthermore, the self-loop (i,i) is excluded in the graph, that is, lii=0,iV. The following vehicle j is called as a neighbor of the following vehicle i if its information can be accessed by the vehicle i and the corresponding neighboring set is denoted by Ni={jVlij0}. The Laplacian matrix induced by L is described as H=[hij]N×N with hij=lij for ij and hij= jNilij for i=j. Considering the role of the leader, introduce a pinning matrix Q=diag{q1,q2,,qN} with qi=1 or qi=0. The following vehicle i can receive the command of the leader via V2V channels only when qi=1.

    Assumption 1: The graph G associated with N following vehicles is undirected, and there exists at least one following vehicle to accept the command of the leader.

    In light of the linearized third-order model adopted in literature [15], [39], [40], [41], the longitudinal dynamics of the i-th vehicle are described by

    πpi(t)+¨pi(t)=ui(t) (1)

    where pi(t)R, ˙pi(t)=vi(t)R and ¨pi(t)=ai(t)R denote, respectively, the absolute position, velocity and acceleration; π represents the time delay in the powertrain systems; ui(t)R is the desired control input imposed on the i-th vehicle.

    For convenience, select the stacked state vector xi(t)=[pi(t),vi(t),ai(t)]T and then obtain the following dynamical model of the i-th vehicle:

    ˙xi(t)=Axi(t)+Bui(t) (2)

    where

    A=[010001001/π],B=[001/π].

    Furthermore, discretizing the above system with the sampling period h results in

    xi(k+1)=Axi(k)+Bui(k) (3)

    where

    A=[1h001h00ehπ],B=[001ehπ].

    Benefiting from the development of information technologies, vehicles are usually embedded with some onboard sensors capable of sensing partial motion information and could also transmit this information to related neighbors through V2V communication networks to realize safe driving. The measurement output yi(k)Rny of sensors in the i-th vehicle is described by

    yi(k)=Cxi(k) (4)

    where C is a known matrix of compatible dimensions.

    Assumption 2: The phenomena of time delays or packet loss do not occurred for V2V communication.

    It should be pointed out that whole motion information of a moving following vehicle could be unavailable in most practical scenarios. As such, the following onboard observer is constructed to estimate the specific information of positions, velocities, and accelerations

    {ˆxi(k+1)=Aˆxi(k)+Bui(k)+L1(yi(k)Cˆxi(k))+L2ξi(k)ξi(k+1)=ξi(k)+(yi(k)Cˆxi(k)) (5)

    where ˆxi(k)=[ˆpi(k),ˆvi(k),ˆai(k)]T is the estimate of vehicle state xi(k), and ξi(k) refers to the accumulation (i.e., integral for continuous cases) of the estimated output errors. L1 and L2 are the observer gain matrices to be designed, and is a predetermined forgetting parameter. In comparison with traditional ones, the constructed observer involves an accumulation loop and hence is essentially a PIO with a forgetting parameter. The introduced accumulation loop can effectively reduce the accumulated errors and improves the estimation performance. On the other hand, the matrix B is of full-column ranks and, therefore, can be decomposed to

    EBF=[E1E2]BF=[Δ0] (6)

    where E=[ET1ET2]T and F are two orthogonal matrices and is the nonzero singular value of B.

    For the purpose of achieving the platooning control objective, the ideal PIO-based control signal ˜ui(k) of the i-th following vehicle is designed as follows:

    ˜ui(k)=K(jNilij(ˆxi(k)ˆxj(k)ˉdij)+qi(ˆxi(k)x0(k)ˉdi0)) (7)

    with the predetermined vector ˉdij=[dij,0,0]T, where K=[kp,kv,ka] is the desired controller gain to be designed. Here, dij=di0dj0 in the vector ˉdij represents a prescribed constant spacing [9] between the vehicle i and the vehicle j. Such a spacing reflects the physical safety.

    Due to the vulnerability of communication channels, the actual control signal could suffer from replay attacks. Under this kind of attack, attackers want to destroy the platoon performance via recording and covering the historically transmitted data. In this situation, the actual control law is modeled by

    ui(k)=δk˜ui(k)+(1δk)˜ui(p) (8)

    where p is a unknown positive scalar reflecting the recording instant of attackers, and δk is an indicator function used to describe whether the attacker launches a replay attack. Specifically, one has

    δk={0,replayattackslaunched1,otherwise. (9)

    The replay attack should last a certain duration to realize the destroyed aim. In other words, the running duration can be divided into the attack-active duration and attack-silent one. As such, let us denote kr as the attack launched instant, and Lr=[kr,kr+ˉτr) as the rth attack time interval, where ˉτr is the duration of the rth replay attack. As such, the time interval [ka,kb) can be divided into two subintervals Ω(ka,kb) and Λ(ka,kb) with Ω(ka,kb)Λ(ka,kb)=[ka,kb) and Ω(ka,kb)Λ(ka,kb)= where Ω(ka,kb)=rNLr[ka,kb) and Λ(ka,kb)=[ka,kb)Ω(ka,kb), under which the replay attacks are active and silent, respectively. Furthermore, the corresponding duration lengths are denoted as |Ω(ka,kb)| and |Λ(ka,kb)|.

    To facilitate the performance analysis, define the estimate error and the platoon tracking errors as follows:

    {˜xi(k)=xi(k)ˆxi(k)epi(k)=pi(k)p0(k)di,0evi(k)=vi(k)v0(k)eai(k)=ai(k)a0(k). (10)

    It is not difficult to obtain from (3) and (5) that

    {˜xk+1=(INA)˜xk(INL1C)˜xk(INL2)ξkξk+1=(INIny)ξk+(INC)˜xk (11)

    with

    ˜xk=[˜xT1(k)˜xT2(k)˜xTN(k)]Tξk=[ξT1(k)ξT2(k)ξTN(k)]T.

    In what follows, let us introduce a time-varying parameter τk and two positive scalars m and s to deal with the temporal behavior of replay attacks. Specifically, one denotes τk=kp satisfying 0<sτkm, and then transforms the addressed platoon system into a class of time-varying delayed systems, where the scalar ˉτr=ms+1 reflects the maximum duration of continuous replay attacks. Subsequently, denote ˜ei(k)= [epi(k),evi(k),eai(k)]T, and obtain the platoon tracking error dynamics from (3) and (8) as follows:

    ˜ei(k+1)={A˜ei(k)+BK(jNilij(˜ei(k)˜ej(k)˜xi(k)+˜xj(k))+qi(˜ei(k)˜xi(k)))+Aˉdi,0ˉdi,0,δk=1A˜ei(k)+BK(jNilij(˜ei(kτk)˜ej(kτk)˜xi(kτk)+˜xj(kτk))+qi(˜ei(kτk)˜xi(kτk)))+Aˉdi,0ˉdi,0,δk=0.

    For the purpose of notational simplicity, denote

    ˜ek=[˜eT1(k)˜eT2(k)˜eTN(k)]Tˉd=[ˉdT1,0ˉdT2,0ˉdTN,0]T.

    Then, the compact form of the platoon tracking error can be written as

    ˜ek+1={(INA)˜ek+W(BK)˜ekW(BK)˜xk+(INA)ˉdˉd,δk=1(INA)˜ek+W(BK)˜ekτkW(BK)˜xkτk+(INA)ˉdˉd,δk=0 (12)

    with W=H+Q. Furthermore, taking (INA)ˉdˉd=0 into consideration, one has

    ˜ek+1={(INA)˜ek+W(BK)˜ekW(BK)˜xk,δk=1(INA)˜ek+W(BK)˜ekτkW(BK)˜xkτk,δk=0. (13)

    The platoon performance is related with the matrix W disclosed the complex coupled nature. Because W is a symmetric real matrix, applying the spectral decomposition results in

    W=VΘVT (14)

    where the matrices Θ=diag{λ1,λ2,,λN} and V are composed of the eigenvalues λi (i=1,2,,N) with λ1λ2λN and corresponding eigenvectors of W. Then, denoting ek=(VTI)˜ek, ˉxk=(VTI)˜xk and ˉξk=(VTI)ξk, one has

    ek+1={(INA)ek+Θ(BK)ekΘ(BK)ˉxk,δk=1(INA)ek+Θ(BK)ekτkΘ(BK)ˉxkτk,δk=0. (15)

    Define ηk=[ˉxTkˉξTkeTk]T. Then, it follows from (11) and (15) that the augmented closed-loop system is:

    ηk+1={A1ηk,δk=1A2ηk+Bηkτk,δk=0 (16)

    where

    A111=INAINL1CA331=INA+ΘBKA112=INAINL1CA1=[A111(INL2)03N×3NINC(INIny)0Nny×3NΘ(BK)03N×NnyA331]A2=[A112(INL2)03N×3NINC(INIny)0Nny×3N03N×3N03N×NnyINA]B=[03N×3N03N×Nny03N×3N0Nny×3N0Nny×Nny0Nny×3NΘ(BK)03N×NnyΘ(BK)].

    Remark 1: In this paper, two variables τk and δk are employed to transform the system suffering from replay attacks into a switched time-delayed one. Such a method is an effective and novel attempt to deal with the challenges of this kind of attack. Furthermore, it is not difficult to understand that the system performance is affected by both the maximum duration of continuous replay attacks and the ratio between duration lengths of active and silent attacks.

    Before further discussion, we introduce the following definition, which will be used in the future analysis.

    Definition 1: The homogeneous vehicle platoon system (3) with an attacked control protocol (8) under a given undirected communication graph G is said to achieve the desired platooning control objective with a prescribed constant spacing, if its platoon tracking error dynamics (13) satisfies

    lim (17)

    or equivalently

    \begin{equation} \lim\limits_{k\rightarrow \infty}\|{e}_{k}\|=0,\; \; \; \forall i,j\in{\cal{V}} \end{equation} (18)

    for its transformed dynamics (15).

    In summary, the objective of this paper is to design a PIO-based control protocol (7) under replay attacks such that the vehicle platoon (1) with V2V communication topologies satisfying Assumption 1 achieves the formation with given constant inter-vehicle spacing. In other words, the resulting platoon tracking error dynamics (13) satisfies (17) by designing suitable matrix parameters {\cal{K}} , {\cal{L}}_1 and {\cal{L}}_2 .

    In this section, the platoon performance is analyzed for a class of homogeneous automated vehicles subject to replay attacks with the help of switched system theories and then the desired PIO-based controller gains are achieved via the solution of certain matrix inequalities. Now, the following lemma is first put forward to the controller design.

    Lemma 1 [42]: For the matrix {\cal{B}} , there exists a nonsingular matrix N guaranteeing {\cal{B}}N=P{\cal{B}} if the matrix P can be decomposed as

    \begin{align*} P=E^{T}\left[\begin{array}{cccc} P_1 & 0 \\ 0 & P_2 \end{array} \right]E=E^{T}_1P_1E_1+E^{T}_2P_2E_2 \end{align*}

    where P_1>0 and P_2>0 .

    Assumption 3 [43]: For any k_1<k_2\in N , the number of off/on replay attacks occurring on the interval [k_1, k_2] is denoted by N(k_1,k_2) . There exist the chatter bound N_0\geq0 and the average dwell time (ADT) \epsilon_a such that

    \begin{equation} N(k_1,k_2)\leq N_0+\frac{k_2-k_1}{\epsilon_a}. \end{equation} (19)

    Without loss of generality, we choose N_0=0 in this paper.

    Assumption 4: For any k_1<k_2\in N , the proportion \varrho_a\in (0,1] of attack active on the interval [k_1, k_2] satisfies

    \begin{equation} \varrho_a>\frac{|\Omega(k_1,k_2)|}{|\Omega(k_1,k_2)|+|\Lambda(k_{1}, k_{2})|}. \end{equation} (20)

    This subsection will provide a sufficient condition to ensure that the augmented closed-loop system (16) is stable via the famous Lyapunov stability theory.

    Theorem 1: Consider the vehicle platoon (1) with V2V communication topologies satisfying Assumption 1. Assume that the gain matrices {\cal{L}}_1 , {\cal{L}}_2 and {\cal{K}} in a PIO-based control protocol (7) are predetermined. The vehicles subject to replay attacks achieve the formation with given constant inter-vehicle spacing if there are two positive definite matrices {\cal{P}} and {\cal{R}} , and positive scalars \mu>1 , 0<\alpha_0<\mu\alpha_1 , 0<\alpha_1<\mu\alpha_0 , 0<\kappa<1 and \gamma > 1 satisfying the following matrix inequalities:

    \begin{equation} \alpha_1{\bf{A}}^{T}_1{\cal{P}}{\bf{A}}_1-\alpha_1(1-\kappa){\cal{P}}+(m-s+1){\cal{R}}<0 \end{equation} (21)
    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}\Pi_{11} &\Pi_{12} \\ \Pi_{21} &\Pi_{22} \end{array} \right]<0 \end{aligned} \end{equation} (22)

    and the ADT \epsilon_a and the proportion of attack active \varrho_a satisfy

    \begin{equation} \epsilon_a>\epsilon^{*}_a=\frac{-\ln\mu}{(1-\varrho_a)\ln(1-\kappa)+\varrho_a\ln(1+\gamma)} \end{equation} (23)

    where

    \begin{equation*} \begin{aligned} \Pi_{11}=&\; \alpha_0{\bf{A}}^{T}_2{\cal{P}}{\bf{A}}_2-\alpha_0(1+\gamma){\cal{P}}+(m-s+1){\cal{R}}\nonumber\\ \Pi_{12}=&\; \alpha_0{\bf{A}}^{T}_2{\cal{P}}{\bf{B}},\;\;\Pi_{21}=\alpha_0{\bf{B}}^{T}{\cal{P}}{\bf{A}}_2\nonumber\\ \Pi_{22}=&\; \alpha_0{\bf{B}}^{T}{\cal{P}}{\bf{B}}-(1+\gamma){\cal{R}}. \end{aligned} \end{equation*}

    Proof: According to the discussion in the problem formulation, the addressed platoon analysis is transformed into the stability analysis of the augmented closed-loop system (16). To this end, let us employ the Lyapunov function

    \begin{equation} V_{\delta_k,k}=\alpha_{\delta_k}\eta^{T}_{k}{\cal{P}}\eta_{k}+V_{2 k}+V_{3k} \end{equation} (24)

    with

    \begin{align*} V_{2k}=&\; \sum^{k-1}_{r=k-\tau_k}\eta^{T}_{r}{\cal{R}}\eta_{r},\; V_{3k}=\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} \end{align*}

    where {\cal{P}} and {\cal{R}} are two positive definite matrices. Due to the effect from replay attacks, the system (16) is a switching one, and hence the difference of V_{k} along with such a system has two cases, which will be handled separately.

    Case I: The instants k,\;k+1\in\Lambda(k_{a}, k_{b}) , that is, \delta_k=1 and \delta_{k+1}=1 .

    Calculating the difference of \alpha_1\eta^{T}_{k}{\cal{P}}\eta_{k} leads to

    \begin{split} &\; \alpha_1\eta^{T}_{k+1}{\cal{P}}\eta_{k+1}-\alpha_1\eta^{T}_{k}{\cal{P}}\eta_{k} \\ =&\; \alpha_1\big\{\eta^{T}_{k+1}{\cal{P}}\eta_{k+1}-\kappa\eta^{T}_{k}{\cal{P}}\eta_{k}-(1-\kappa)\eta^{T}_{k}{\cal{P}}\eta_{k} \big\} \\ =&\; \alpha_1\big\{\big({\bf{A}}_1\eta_{k}\big)^{T}{\cal{P}}\big({\bf{A}}_1\eta_{k}\big)-\kappa\eta^{T}_{k}{\cal{P}}\eta_{k}-(1-\kappa)\eta^{T}_{k}{\cal{P}}\eta_{k} \big\} \\ =&\; \eta^{T}_{k}(\alpha_1{\bf{A}}^{T}_1{\cal{P}}{\bf{A}}_1-\alpha_1(1-\kappa){\cal{P}})\eta_{k}-\kappa\alpha_1\eta^{T}_{k}{\cal{P}}\eta_{k}. \end{split} (25)

    Meanwhile, one can obtain the difference of its second and third items

    \begin{split} \Delta V_{2k} =&\; V_{2,k+1}-V_{2k} \\ =&\; \sum^{k}_{r=k-\tau_{k+1}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} -(1-\kappa)\sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; -\kappa\sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ =&\; \eta^{T}_{k}{\cal{R}}\eta_{k} +\sum^{k-1}_{r=k-\tau_{k+1}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; -(1-\kappa)\sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} -\kappa \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ =&\; \eta^{T}_{k}{\cal{R}}\eta_{k} -(1-\kappa)\eta^{T}_{k-\tau_{k}}{\cal{R}}\eta_{k-\tau_{k}} \\ &\; -(1-\kappa)\sum^{k-1}_{r=k-\tau_{k}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; +\sum^{k-1}_{r=k-\tau_{k+1}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} -\kappa \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ =&\; \eta^{T}_{k}{\cal{R}}\eta_{k} -(1-\kappa)\eta^{T}_{k-\tau_{k}}{\cal{R}}\eta_{k-\tau_{k}} \end{split}
    \begin{split} &\; +\sum^{k-1}_{r=k-s+1}\eta^{T}_{r}{\cal{R}}\eta_{r} +\sum^{k-s}_{r=k-\tau_{k+1}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; -(1-\kappa)\sum^{k-1}_{r=k-\tau_{k}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} -\kappa \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ \leq &\; \eta^{T}_{k}{\cal{R}}\eta_{k}-(1-\kappa)\eta^{T}_{k-\tau_{k}}{\cal{R}}\eta_{k-\tau_{k}} \\ &\; +\sum^{k-s}_{r=k-m+1}\eta^{T}_{r}{\cal{R}}\eta_{r} -\kappa \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \end{split} (26)

    and

    \begin{split} \Delta V_{3k} =&\; V_{3,k+1}-V_{3k} \\ =&\; \sum^{k-s+1}_{l=k-m+2}\sum^{k}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} -(1-\kappa)\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; -\kappa\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ =&\; \sum^{k-s}_{l=k-m+1}\sum^{k}_{r=l+1}\eta^{T}_{r}{\cal{R}}\eta_{r} -(1-\kappa)\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; -\kappa\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ =&\; \sum^{k-s}_{l=k-m+1}(\eta^{T}_{k}{\cal{R}}\eta_{k} -\eta^{T}_{l}{\cal{R}}\eta_{l}+\kappa\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}) \\ &\; -\kappa\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ \leq&\; (m-s)\eta^{T}_{k}{\cal{R}}\eta_{k}-\sum^{k-s}_{r=k-m+1}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ &\; -\kappa\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}. \end{split} (27)

    Synthesizing (25)−(27), one has

    \begin{split} \Delta V_{1,k}\leq&\; \eta^{T}_{k}(\alpha_1{\bf{A}}^{T}_1{\cal{P}}{\bf{A}}_1 -\alpha_1(1-\kappa){\cal{P}})\eta_{k} \\ &\; +(m-s+1)\eta^{T}_{k}{\cal{R}}\eta_{k} \\ &\; -(1-\kappa)\eta^{T}_{k-\tau_{k}}{\cal{R}}\eta_{k-\tau_{k}}-\kappa\alpha_1\eta^{T}_{k}{\cal{P}}\eta_{k} \\ &\; -\kappa \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} -\kappa\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ =&\; \eta^{T}_{k}(\alpha_1{\bf{A}}^{T}_1{\cal{P}}{\bf{A}}_1-\alpha_1(1-\kappa){\cal{P}}+(m-s+1){\cal{R}})\eta_{k}\\ &\; -(1-\kappa)\eta^{T}_{k-\tau_k}{\cal{R}}\eta_{k-\tau_k} -\kappa V_{1,k} \end{split} (28)

    which means

    \begin{split} V_{1,k+1}\leq&\; (1-\kappa)V_{1,k}. \end{split} (29)

    Case II: The instants k,\;k+1\in\Omega(k_{a}, k_{b}) , that is, \delta_k=0 and \delta_{k+1}=0 .

    Similarly, taking the difference of the first item in V_{\delta_k,k} along with the system (16) results in

    \begin{split} &\; \alpha_0\eta^{T}_{k+1}{\cal{P}}\eta_{k+1}-\alpha_0\eta^{T}_{k}{\cal{P}}\eta_{k} \\ =&\; \alpha_0\big\{\big({\bf{A}}_2\eta_{k}+{\bf{B}}\eta_{k-\tau_k}\big)^{T}{\cal{P}}\big({\bf{A}}_2\eta_{k} +{\bf{B}}\eta_{k-\tau_k}\big) \\ &\; +\gamma\eta^{T}_{k}{\cal{P}}\eta_{k}-(1+\gamma)\eta^{T}_{k}{\cal{P}}\eta_{k}\big\} \\ =&\; \alpha_0\big\{\eta^{T}_{k}{\bf{A}}^{T}_2{\cal{P}}{\bf{A}}_2\eta_{k} +\eta^{T}_{k}{\bf{A}}^{T}_2{\cal{P}}{\bf{B}}\eta_{k-\tau_k} \\ &\; +\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{A}}_2\eta_{k} +\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{B}}\eta_{k-\tau_k} \\ &\; +\gamma\eta^{T}_{k}{\cal{P}}\eta_{k}-(1+\gamma)\eta^{T}_{k}{\cal{P}}\eta_{k}\big\} \\ =&\; \eta^{T}_{k}(\alpha_0{\bf{A}}^{T}_2{\cal{P}}{\bf{A}}_2-\alpha_0(1+\gamma){\cal{P}})\eta_{k} +\alpha_0\eta^{T}_{k}{\bf{A}}^{T}_2{\cal{P}}{\bf{B}}\eta_{k-\tau_k} \\ &\; +\alpha_0\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{A}}_2\eta_{k} +\alpha_0\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{B}}\eta_{k-\tau_k}\\ &\; +\gamma\alpha_0\eta^{T}_{k}{\cal{P}}\eta_{k}. \end{split} (30)

    Meanwhile, one can obtain the difference of its second and third items

    \begin{split} \Delta V_{2k} =&\; \sum^{k}_{r=k-\tau_{k+1}+1}\eta^{T}_{r}{\cal{R}}\eta_{r} -(1+\gamma)\sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; +\gamma\sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ \leq &\; \eta^{T}_{k}{\cal{R}}\eta_{k}-(1+\gamma)\eta^{T}_{k-\tau_{k}}{\cal{R}}\eta_{k-\tau_{k}} \\ &\; +\sum^{k-s}_{r=k-m+1}\eta^{T}_{r}{\cal{R}}\eta_{r} +\gamma \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r}. \end{split} (31)

    and

    \begin{split} \Delta V_{3k} =&\; \sum^{k-s+1}_{l=k-m+2}\sum^{k}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} -(1+\gamma)\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ &\; +\gamma\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r} \\ \leq&\; (m-s)\eta^{T}_{k}{\cal{R}}\eta_{k}-\sum^{k-s}_{r=k-m+1}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ &\; +\gamma\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}. \end{split} (32)

    Synthesizing (30)−(32), one has

    \begin{split} \Delta V_{0,k} \leq&\; \eta^{T}_{k}(\alpha_0{\bf{A}}^{T}_2{\cal{P}}{\bf{A}}_2-\alpha_0(1+\gamma){\cal{P}})\eta_{k} +\alpha_0\eta^{T}_{k}{\bf{A}}^{T}_2{\cal{P}}{\bf{B}}\eta_{k-\tau_k} \\ &\; +\alpha_0\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{A}}_2\eta_{k} +\alpha_0\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{B}}\eta_{k-\tau_k} \\ &\; +\eta^{T}_{k}{\cal{R}}\eta_{k}-(1+\gamma)\eta^{T}_{k-\tau_{k}}{\cal{R}}\eta_{k-\tau_{k}} \\ &\; +\sum^{k-s}_{r=k-m+1}\eta^{T}_{r}{\cal{R}}\eta_{r} +(m-s)\eta^{T}_{k}{\cal{R}}\eta_{k} \\ &\; -\sum^{k-s}_{r=k-m+1}\eta^{T}_{r}{\cal{R}}\eta_{r}+\gamma\eta^{T}_{k}{\cal{P}}\eta_{k} \end{split}
    \begin{split} &\; +\gamma \sum^{k-1}_{r=k-\tau_{k}}\eta^{T}_{r}{\cal{R}}\eta_{r} +\gamma\sum^{k-s}_{l=k-m+1}\sum^{k-1}_{r=l}\eta^{T}_{r}{\cal{R}}\eta_{r}\\ =&\; \eta^{T}_{k}(\alpha_0{\bf{A}}^{T}_2{\cal{P}}{\bf{A}}_2-\alpha_0(1+\gamma){\cal{P}}+(m-s+1){\cal{R}})\eta_{k}\\ &\; +\eta^{T}_{k-\tau_k}(\alpha_0{\bf{B}}^{T}{\cal{P}}{\bf{B}}-(1+\gamma){\cal{R}})\eta_{k-\tau_k} \\ &\; +\alpha_0\eta^{T}_{k}{\bf{A}}^{T}_2{\cal{P}}{\bf{B}}\eta_{k-\tau_k}+\alpha_0\eta^{T}_{k-\tau_k}{\bf{B}}^{T}{\cal{P}}{\bf{A}}_2\eta_{k}+\gamma V_{0,k} \\ =&\; \zeta^{T}_{k}\Pi\zeta_{k}+\gamma V_{0,k} \end{split} (33)

    where

    \begin{equation*} \begin{aligned} \zeta_{t}=&\; [\begin{array}{ccccccc}\eta^{T}_{k} &\eta^{T}_{k-\tau_k} \end{array}]^{T}\\ \Pi=&\; \left[\begin{array}{ccccccc}\Pi_{11} &\Pi_{12} \\ \Pi_{21} &\Pi_{22} \end{array} \right].\\ \end{aligned} \end{equation*}

    Furthermore, it follows from the above inequality that:

    \begin{split} V_{0,k+1} \leq&\; (1+\gamma)V_{0,k}. \end{split} (34)

    In what follows, let us investigate the stability of the augmented closed-loop system (16). Without loss of generality, we assume that the switching instants are k_a<k_0< k_1< k_2<\cdots <k_{l-1}<k_l<k<k_b in \Omega(k_{a}, k_{b})\cup\Lambda(k_{a}, k_{b}) . If \delta_k=0 , it is easy from (29) and (34) to deduce that

    \begin{split} V_{0,k}\leq&\; (1+\gamma)^{k-k_l}V_{0,k_l}\\ \leq&\; \mu(1+\gamma)^{k-k_l}V_{1,k_l}\\ \leq&\; \mu^2(1+\gamma)^{k-k_l}(1-\kappa)^{k_l-k_{l-1}}V_{1,k_{l-1}}\\ \leq&\; \cdots\\ \leq&\; \mu^{N(k_a,k)}(1+\gamma)^{|\Omega(k_{a}, k)|}(1-\kappa)^{|\Lambda(k_{a}, k)|}V_{\delta_{ka},k_{a}}. \end{split} (35)

    Similarly, if \delta_k=1 , one has

    \begin{split} V_{1,k}\leq&\; (1-\kappa)^{k-k_l}V_{1,k_l}\\ \leq&\; \mu(1-\kappa)^{k-k_l}V_{0,k_l}\\ \leq&\; \mu^2(1-\kappa)^{k-k_l}(1+\gamma)^{k_l-k_{l-1}}V_{0,k_{l-1}}\\ \leq&\; \cdots\\ \leq&\; \mu^{N(k_a,k)}(1-\kappa)^{|\Lambda(k_{a}, k)|}(1+\gamma)^{|\Omega(k_{a}, k)|}V_{\delta_{ka},k_{a}}. \end{split} (36)

    After that, synthesizing (35) and (36) results in

    \begin{align*} V_{\delta_k,k}\leq\;&\; \mu^{N(k_a,k)}(1-\kappa)^{|\Lambda(k_{a}, k)|}\nonumber\\ &\; \times(1+\gamma)^{|\Omega(k_{a}, k)|}V_{\delta_{ka},k_{a}}. \end{align*}

    In order to guarantee the stability of the closed-loop system (16), the following condition is needed:

    \begin{align*} \mu^{N(k_a,k)}(1-\kappa)^{|\Lambda(k_{a}, k)|}(1+\gamma)^{|\Omega(k_{a}, k)|}<1 \end{align*}

    which means

    \begin{align*} \mu^{\frac{|\Lambda(k_{a}, k)|}{\epsilon_a}}(1-\kappa)^{|\Lambda(k_{a}, k)|}\mu^{\frac{|\Omega(k_{a}, k)|}{\epsilon_a}}(1+\gamma)^{|\Omega(k_{a}, k)|} <1. \end{align*}

    Noting the definition of the ADT \epsilon_a and the proportion \varrho_a , we have

    \begin{align*} V_{\delta_k,k}\leq&\; (\mu^{1/\epsilon_a}(1-\kappa))^{|\Lambda(k_{a}, k)|}(\mu^{1/\epsilon_a}(1+\gamma))^{|\Omega(k_{a}, k)|}V_{\delta_{ka},k_{a}}\\ &< V_{\delta_{ka},k_{a}} \end{align*}

    if

    \frac{|\Omega(k_{a}, k)|}{|\Lambda(k_{a}, k)|}<\frac{\varrho_a}{1-\varrho_a}<-\frac{1/\epsilon_a\ln\mu+\ln(1-\kappa)}{1/\epsilon_a\ln\mu+\ln(1+\gamma)} .

    Finally, considering the ADT and the relationship between the closed-loop system (16) and the platoon tracking error dynamics (13), one has that the desired platoon performance is achieved, which completes the proof.

    It is worth noting that the PIO-based control scheme (7) proposed in this paper is quite general. Specifically, if {\cal{L}}_2=0 , the proposed controller will be degenerated into a traditional observer-based one. As such, a corollary about Theorem 1 is provided as follows.

    Corollary 1: Consider the vehicle platoon (1) with V2V communication topologies satisfying Assumption 1. When {\cal{L}}_2=0 , assume that the gain matrices {\cal{L}}_1 and {\cal{K}} in an observer-based control protocol (7) are predetermined. The vehicles subject to replay attacks achieve the formation with given constant inter-vehicle spacing if there are two positive definite matrices \tilde{{\cal{P}}} and \tilde{{\cal{R}}} , and positive scalars \mu>1 , 0<\alpha_0<\mu\alpha_1 , 0<\alpha_1<\mu\alpha_0 , 0<\kappa<1 and \gamma > 1 satisfying the following matrix inequalities:

    \begin{equation} \alpha_1{\bf{A}}^{T}_3\tilde{{\cal{P}}}{\bf{A}}_3-\alpha_1(1-\kappa)\tilde{{\cal{P}}}+(m-s+1)\tilde{{\cal{R}}}<0 \end{equation} (37)
    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}\Upsilon_{11} &\Upsilon_{12} \\ \Upsilon_{21} &\Upsilon_{22} \end{array} \right]<0 \end{aligned} \end{equation} (38)

    and the ADT \epsilon_a and the proportion of attack active \varrho_a satisfy

    \begin{equation*} \epsilon_a>\epsilon^{*}_a=\frac{-\ln\mu}{(1-\varrho_a)\ln(1-\kappa)+\varrho_a\ln(1+\gamma)} \end{equation*}

    where

    \begin{equation*} \begin{aligned} \Upsilon_{11}=&\; \alpha_0{\bf{A}}^{T}_4\tilde{{\cal{P}}}{\bf{A}}_4-\alpha_0(1+\gamma)\tilde{{\cal{P}}}+(m-s+1)\tilde{{\cal{R}}}\nonumber\\ \Upsilon_{12}=&\; \alpha_0{\bf{A}}^{T}_4\tilde{{\cal{P}}}\tilde{{\bf{B}}},\;\;\Pi_{21}=\alpha_0\tilde{{\bf{B}}}^{T}\tilde{{\cal{P}}}{\bf{A}}_4\nonumber\\ \Upsilon_{22}=&\; \alpha_0\tilde{{\bf{B}}}^{T}\tilde{{\cal{P}}}\tilde{{\bf{B}}}-(1+\gamma)\tilde{{\cal{R}}}\nonumber\\ {\bf{A}}_3=&\; \left[\begin{array}{cccc} I_{N}\otimes {\cal{A}}-I_{N}\otimes {\cal{L}}_1{\cal{C}} & 0_{3N\times3N}\\ -\Theta\otimes ({\cal{B}}{\cal{K}})& I_{N}\otimes {\cal{A}}+\Theta\otimes {\cal{B}}{\cal{K}} \end{array} \right] \\ {\bf{A}}_4=&\; \left[\begin{array}{cccc} I_{N}\otimes {\cal{A}}-I_{N}\otimes {\cal{L}}_1{\cal{C}} & 0_{3N\times3N}\\ 0_{3N\times3N} & I_{N}\otimes{\cal{A}} \end{array} \right] \\ \tilde{{\bf{{B}}}}=&\; \left[\begin{array}{cccc} 0_{3N\times3N} & 0_{3N\times3N}\\ -\Theta\otimes ({\cal{B}}{\cal{K}}) &\Theta\otimes ({\cal{B}}{\cal{K}})\end{array} \right]. \end{aligned} \end{equation*}

    In the above subsection, a sufficient condition has been developed to guarantee the desired platoon performance. In this subsection, a set of solvable conditions will be proposed to obtain the PIO-based controller gains.

    Theorem 2: Consider the vehicle platoon (1) with V2V communication topologies satisfying Assumption 1. If there are five positive definite matrices P_1 , P_2 , P_{31} , P_{32} and R, three matrices \bar{{\cal{L}}}_1 , \bar{{\cal{L}}}_2 and \bar{{\cal{K}}} , positive scalars \mu>1 , 0<\alpha_0<\mu\alpha_1 , 0<\alpha_1<\mu\alpha_0 , 0<\kappa<1 and \gamma > 1 such that, for i\in\{1, N\} , the following matrix inequalities:

    \begin{equation} \begin{aligned} \Xi_{1i}=\left[\begin{array}{ccccccc}-\alpha_1(1-\kappa)P+(m-s+1)R & \ast \\ \Psi_{i} &-\alpha_1P \end{array} \right]<0 \end{aligned} \end{equation} (39)

    and

    \begin{equation} \begin{aligned} \Xi_{2i}=\left[\begin{array}{ccccccc}\bar{\Pi}_{11}&\ast& \ast\\ 0 &-(1+\gamma)R&\ast\\ \bar{\Pi}_{31} &\bar{\Pi}_{32i}&-\alpha_0P \end{array} \right]<0 \end{aligned} \end{equation} (40)

    hold, where

    \begin{equation*} \begin{aligned} &\; P=\mathrm{diag}\{P_{1},P_{2},P_{3}\},\; P_3=E^{T}_1P_{31}E_1+E^{T}_2P_{32}E_2\nonumber\\ &\; \Psi_{i}=\alpha_1\left[\begin{array}{cccc} P_1{\cal{A}}-\bar{{\cal{L}}}_1{\cal{C}}& -\bar{{\cal{L}}}_2 & 0 \\P_2{\cal{C}} & \hbar P_2&0\\ -\lambda_i{\cal{B}}\bar{{\cal{K}}}&0& P_3{\cal{A}}+\lambda_i{\cal{B}}\bar{{\cal{K}}} \end{array} \right] \\ &\; \bar{\Pi}_{11}=-\alpha_0(1+\gamma)P+(m-s+1)R\nonumber\\ &\; \bar{\Pi}_{31} =\alpha_0\left[\begin{array}{cccc} P_1{\cal{A}}-\bar{{\cal{L}}}_1{\cal{C}}& -\bar{{\cal{L}}}_2 & 0\\P_2{\cal{C}} & \hbar P_2 &0\\0&0 & P_3{\cal{A}} \end{array} \right] \\ &\; \bar{\Pi}_{32i}=\alpha_0\left[\begin{array}{cccc} 0 & 0&0\\0& 0&0\\ -\lambda_i{\cal{B}}\bar{{\cal{K}}}&0&\lambda_i{\cal{B}}\bar{{\cal{K}}}\end{array} \right] \end{aligned} \end{equation*}

    then the vehicles with a PIO-based control protocol (7) with the gains given by {\cal{L}}_1=P^{-1}_1\bar{{\cal{L}}}_1 , {\cal{L}}_2=P^{-1}_1\bar{{\cal{L}}}_2 , and {\cal{K}}= F\Delta^{-1} P^{-1}_{31}\Delta F^{T} \bar{{\cal{K}}} achieve the formation with given constant inter-vehicle spacing. Furthermore, and the ADT \epsilon_a and the proportion of attack active \varrho_a satisfy

    \begin{equation*} \epsilon_a>\epsilon^{*}_a=\frac{-\ln\mu}{(1-\varrho_a)\ln(1-\kappa)+\varrho_a\ln(1+\gamma)}. \end{equation*}

    Proof: Note that the matrices in (21) and (22) are block diagonal if selecting {{\cal{P}}}= {\rm{diag}}\{I\otimes P_1, I\otimes P_2, I\otimes P_3\} and {{\cal{R}}}=I\otimes R , and thus such two inequalities can be reorganized as follows:

    \begin{equation} \alpha_1{\bf{A}}^{T}_{1i}P{\bf{A}}_{1i}-\alpha_1(1-\kappa)P+(m-s+1)R<0 \end{equation} (41)

    and

    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}\Pi_{11} &\Pi_{12i} \\ \Pi_{21i} &\Pi_{22i} \end{array} \right]<0 \end{aligned} \end{equation} (42)

    for i=1,2,\ldots,N , where

    \begin{equation*} \begin{aligned} {\bf{A}}_{1i}=&\; \left[\begin{array}{cccc} {\cal{A}}-{\cal{L}}_1{\cal{C}}& -{\cal{L}}_2 & 0 \\{\cal{C}} & \hbar I&0\\ -\lambda_i{\cal{B}}{\cal{K}}&0& {\cal{A}}+\lambda_i{\cal{B}}{\cal{K}} \end{array} \right] \\ {\bf{A}}_{2}=&\; \left[\begin{array}{cccc} {\cal{A}}-{\cal{L}}_1{\cal{C}}& -{\cal{L}}_2 & 0 \\{\cal{C}} & \hbar I&0\\ 0&0& {\cal{A}} \end{array} \right] \\ {\bf{B}}_{i}=&\; \left[\begin{array}{cccc} 0&0 & 0 \\0& 0&0\\ -\lambda_i{\cal{B}}{\cal{K}}&0& \lambda_i{\cal{B}}{\cal{K}} \end{array} \right] \\ \Pi_{11}=&\; \alpha_0{\bf{A}}^{T}_{2}P{\bf{A}}_{2}-\alpha_0(1+\gamma)P+(m-s+1)R\nonumber\\ \Pi_{12i}=&\; \alpha_0{\bf{A}}^{T}_{2}P{\bf{B}}_i,\;\;\Pi_{21i}=\alpha_0{\bf{B}}^{T}_{i}P{\bf{A}}_{2}\nonumber\\ \Pi_{22i}=&\; \alpha_0{\bf{B}}^{T}_{i}P{\bf{B}}_{i}-(1+\gamma)R. \end{aligned} \end{equation*}

    By resorting to the Schur complement lemma, the above inequalities are true if and only if

    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}-\alpha_1(1-\kappa)P+(m-s+1)R & \ast \\ {\bf{A}}_{1i} &-(\alpha_1P)^{-1} \end{array} \right]<0 \end{aligned} \end{equation} (43)

    and

    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}\bar{\Pi}_{11}&0& \ast\\ 0 &-(1+\gamma)R&\ast\\ {\bf{A}}_{2} &{\bf{B}}_{i}&-(\alpha_0 P)^{-1} \end{array} \right]<0 \end{aligned} \end{equation} (44)

    where

    \begin{equation*} \bar{\Pi}_{11}=-\alpha_0(1+\gamma)P+(m-s+1)R. \end{equation*}

    In what follows, by pre-multiplying and post-multiplying (43) and (44) by {\rm{diag}}\{I,\alpha_1P\} and {\rm{diag}}\{I,I,\alpha_0P\} and their transpose, one cannot difficultly obtain:

    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}-\alpha_1(1-\kappa)P+(m-s+1)R & \ast \\ \alpha_1P{\bf{A}}_{1i} &-\alpha_1P \end{array} \right]<0 \end{aligned} \end{equation} (45)

    and

    \begin{equation} \begin{aligned} \left[\begin{array}{ccccccc}\bar{\Pi}_{11}&0& \ast\\ 0 &-(1+\gamma)R&\ast\\ \alpha_0P{\bf{A}}_{2} &\alpha_0P{\bf{B}}_{i}&-\alpha_0P \end{array} \right]<0. \end{aligned} \end{equation} (46)

    To obtain the desired gains, we first choose the structure P=\mathrm{diag}\{P_{1},P_{2},P_{3}\} and then have

    \begin{equation*} \begin{aligned} P{\bf{A}}_{1i}=&\; \left[\begin{array}{cccc} P_1{\cal{A}}-P_1{\cal{L}}_1{\cal{C}}& -P_1{\cal{L}}_2 & 0 \\P_2{\cal{C}} & \hbar P_2&0\\ -\lambda_iP_3{\cal{B}}{\cal{K}}&0& P_3{\cal{A}}+\lambda_iP_3{\cal{B}}{\cal{K}} \end{array} \right] \\ P{\bf{B}}_{i}=&\; \left[\begin{array}{cccc} 0&0 & 0 \\0& 0&0\\ -\lambda_iP_3{\cal{B}}{\cal{K}}&0& \lambda_iP_3{\cal{B}}{\cal{K}} \end{array} \right]. \end{aligned} \end{equation*}

    It should be pointed out that both P{\bf{A}}_{1i} and P{\bf{B}}_{i} in the above two inequalities contain the nonlinear term P_3{\cal{B}}{\cal{K}} , which makes it difficult to be solved and obtain controller parameters. Since {\cal{B}} is of column full ranks, by means of Lemma 1, one has that there exist two matrices P_{31}>0 and P_{32}>0 and a nonsingular matrix \aleph such that P_3=E^{T}_1P_{31}E_1+E^{T}_2P_{32}E_2 , and P_3{\cal{B}}={\cal{B}}\aleph .

    Letting \aleph{\cal{K}}=\bar{{\cal{K}}} , P_1{\cal{L}}_1=\bar{{\cal{L}}}_1 and P_1{\cal{L}}_2=\bar{{\cal{L}}}_2 , one has that (45) and (46) are true if (39) and (40) hold for i=1,2,\ldots,N . In what follows, due to \lambda_1\leq \lambda_i\leq\lambda_N , there exists a scalar \varsigma_i\in [0,1] such that \lambda_i=\varsigma_i\lambda_1+(1-\varsigma_i)\lambda_N . Furthermore, one has

    \begin{equation*} \begin{aligned} \Xi_{1i}=\varsigma_i\Xi_{11}+(1-\varsigma_i)\Xi_{1N}\nonumber\\ \Xi_{2i}=\varsigma_i\Xi_{21}+(1-\varsigma_i)\Xi_{2N}. \end{aligned} \end{equation*}

    Hence, it can be deduced from \Xi_{11}<0 , \Xi_{1N}<0 , \Xi_{21}<0 and \Xi_{2N}<0 that (45) and (46) are also true.

    Finally, further considering the relationship P_3{\cal{B}}{\cal{K}}={\cal{B}}\aleph{\cal{K}} , that is,

    \begin{equation} \begin{aligned} P_3E^{T}\left[\begin{array}{cccc} \Delta \\0 \end{array} \right]F^{T}{\cal{K}}=E^{T}\left[\begin{array}{cccc} \Delta \\0 \end{array} \right]F^{T}\aleph{\cal{K}} \end{aligned} \end{equation} (47)

    one has P_{31}\Delta F^{T}{\cal{K}} =\Delta F^{T}\aleph{\cal{K}}= \Delta F^{T} \bar{{\cal{K}}} , which means {\cal{K}} = F\Delta^{-1} P^{-1}_{31}\Delta F^{T} \bar{{\cal{K}}} .

    Corresponding to the analysis result in Corollary 1, one has the following design condition about the desired gains.

    Corollary 2: Consider the vehicle platoon (1) with V2V communication topologies satisfying Assumption 1. When {\cal{L}}_2=0 , if there are four positive definite matrices \tilde{P}_1 , \tilde{P}_{31} , \tilde{P}_{32} and \tilde{R} , two matrices \tilde{{\cal{L}}}_1 and \tilde{{\cal{K}}} , positive scalars \mu>1 , 0<\alpha_0<\mu\alpha_1 , 0<\alpha_1<\mu\alpha_0 , 0<\kappa<1 and \gamma > 1 such that, for i\in\{1, N\} , the following matrix inequalities:

    \begin{equation} \begin{aligned} \Xi_{3i}=\left[\begin{array}{ccccccc}-\alpha_1(1-\kappa)\tilde{P}+(m-s+1)\tilde{{\cal{R}}} & \ast \\ \tilde{ \Psi}_{i} &-\alpha_1\tilde{P} \end{array} \right]<0 \end{aligned} \end{equation} (48)

    and

    \begin{equation} \begin{aligned} \Xi_{4i}=\left[\begin{array}{ccccccc}\bar{\Upsilon}_{11}&\ast& \ast\\ 0 &-(1+\gamma)\tilde{R}&\ast\\ \bar{\Upsilon}_{31} &\bar{\Upsilon}_{32i}&-\alpha_0\tilde{P} \end{array} \right]<0 \end{aligned} \end{equation} (49)

    hold, where

    \begin{equation*} \begin{aligned} &\; \tilde{P}=\mathrm{diag}\{\tilde{P}_{1},\tilde{P}_{3}\},\;\tilde{P}_3=E^{T}_1\tilde{P}_{31}E_1+E^{T}_2\tilde{P}_{32}E_2\nonumber\\ &\; \tilde{\Psi}_{i}=\alpha_1\left[\begin{array}{cccc} \tilde{P}_1{\cal{A}}-\tilde{{\cal{L}}}_1{\cal{C}} & 0 \\ -\lambda_i{\cal{B}}\tilde{{\cal{K}}}& \tilde{P}_3{\cal{A}}+\lambda_i{\cal{B}}\tilde{{\cal{K}}} \end{array} \right] \\ &\; \bar{\Upsilon}_{11}=-\alpha_0(1+\gamma)\tilde{P}+(m-s+1)\tilde{R}\nonumber\\ &\; \bar{\Upsilon}_{31} =\alpha_0\left[\begin{array}{cccc} \tilde{P}_1{\cal{A}}-\tilde{{\cal{L}}}_1{\cal{C}} & 0\\0 & \tilde{P}_3{\cal{A}} \end{array} \right] \\ &\; \bar{\Upsilon}_{32i}=\alpha_0\left[\begin{array}{cccc} 0 &0\\-\lambda_i{\cal{B}}\tilde{{\cal{K}}}&\lambda_i{\cal{B}}\tilde{{\cal{K}}}\end{array} \right] \end{aligned} \end{equation*}

    then the vehicles with an observer-based control protocol (7) with the gains given by {\cal{L}}_1=\tilde{P}^{-1}_1\tilde{{\cal{L}}}_1 and {\cal{K}}=F\Delta^{-1} \tilde{P}^{-1}_{31}\Delta F^{T} \tilde{{\cal{K}}} achieve the formation with given constant inter-vehicle spacing. Furthermore, and the ADT \epsilon_a and the proportion of attack active \varrho_a satisfy

    \begin{equation*} \epsilon_a>\epsilon^{*}_a=\frac{-\ln\mu}{(1-\varrho_a)\ln(1-\kappa)+\varrho_a\ln(1+\gamma)}. \end{equation*}

    Remark 2: From the defenders’ perspective, the designed controller should defend against continuous attacks with a longer duration, in other words, the security of controlled systems is high. As discussed in the problem formulation, the influence of replay attacks is disclosed by a time-delayed signal \tau_k , and the maximum duration of continuous replay attacks is the same with the induced duration occurring time-delays. Generally speaking, the actual upper bound of replay attacks is unknown, and cannot be accurately obtained by defenders. As such, the developed approach is conservative and robust. From the viewpoint of defenders, the defender with the designed controller can receive a tolerable worst attack cases by optimizing the value of m-s and m, corresponding to the attack duration and the delay of recorded historical data. As such, one has the following multi-objective optimization problem with the priority \varpi_1 and \varpi_2 solvable:

    \begin{align*} &\; \max\; \varpi_1(m-s)+\varpi_2 m\\ &\; \mathrm{s.t.} \;\; (39),\;(40). \end{align*}

    Finally, it is not difficult to see from Theorem 1 that the solvability of matrix inequalities is dependent on the time interval of the attack-active duration “ m-s+1 ”. Particularly, the larger the time interval, the smaller the solvability.

    Remark 3: So far, we have established a distributed PIO-based control scheme for a class of connected automated vehicles subject to replay attacks. The feasibility of the vehicles’ platoon has been transformed into the solvability of a set of matrix inequalities only related to the minimum and maximum eigenvalues of communication topologies. As such, the developed result is independent of the number of vehicles and hence satisfies the scalability requirement.

    In this section, a vehicle platoon composed of one leader (labeled as 0) and three followers (labeled as 1, 2, 3) is presented to validate the effectiveness of the proposed PIO-based control protocol. The simulation duration is set as 100 s, and the desired spacing between front and rear vehicles during platoon driving is set as 10 m.

    The configuration of the vehicle platoon is shown in Fig. 1. The time-delayed parameter π in the powertrain systems is assumed to be 0.5 . The Laplacian matrix H related to the V2V communication topology among three following vehicles is chosen as:

    Figure  1.  Vehicle platoon configuration
    \begin{align*} H=\left[\begin{array}{rrrrrrrrr} 0.5 & -0.5 & 0 \\ -0.5 & 1 & -0.5 \\ 0 & -0.5 & 0.5 \end{array}\right] \end{align*}

    and the pinning matrix is Q= {\rm{diag}}\{ 1,0,1\} . Finally, the measurement matrix is C=[1 \;\; -1 \;\; 0 ].

    In what follows, the sampling period h, forgetting parameter \hbar , and the positive constants κ, γ, \alpha_0 and \alpha_1 are taken as 1s , 0.8 , 0.005 , 5 , 0.01 and 1.3 , respectively. With the help of the MATLAB software with Sedumi toolboxes, the satisfied gains of PIO-based controllers are as follows:

    \begin{align*} {\cal{L}}_1=&\; \left[\begin{array}{ccccccccccccc} 1.7127 & 0.3557 & -0.0018 \end{array} \right]^T\\ {\cal{L}}_2=&\; \left[\begin{array}{ccccccccccc} -0.0047 & -0.0016 & 0.0008 \end{array} \right]^T\\ {\cal{K}}=&\; \left[\begin{array}{ccccccccccc} -0.1134 & -0.4675 & -0.1862 \end{array} \right]. \end{align*}

    In this simulation, the initial states of the leader vehicle and three following vehicles are set as x_0=[\; 50\;\;5\;\;0\; ]^{T} , x_1= [\; 20\;\;5.8\;\;0\; ]^{T} , x_2=[\; 10\;\;6.4\;\;0\; ]^{T} and x_3=[\; 0\;\;7.8\;\;0\; ]^{T} , respectively. Furthermore, the replay attacks is continuously occurred from 15s to 21s , and the duration of each replay attack is 7s (that is m=7 and s=1 ).

    The simulation results are deployed in Figs. 2-4. Specifically, Fig. 2 shows the state trajectories of x_i ( i= 0,1,2,3 ) with the PIO-based controller and Fig. 3 shows the trajectories of open-loop cases. Compared to these figures, we cannot difficultly see that the position spacing of each vehicle can be guaranteed, and the velocity of each vehicle converges to the leader’s velocity v_0=5\;{\rm{m/s}}. As such, the formation with the given safety spacing can be achieved, which demonstrates the effectiveness of the proposed control scheme. Fig. 4(a) plots the spacing errors among vehicles, that satisfy the space requirement (i.e., no more than 10 m) within the initial adjustment stage. This further verifies the safety of all vehicles when at the wheel. Fig. 4(b) provides the velocity errors among vehicles, which will converge to zero.

    Figure  2.  State trajectories of the closed-loop system: (a) Vehicles’ positions; (b) Vehicles’ relative positions to the leader; (c) Vehicles’ velocities.
    Figure  3.  State trajectories without controllers: (a) Vehicles’ positions; (b) Vehicles’ relative positions to the leader; (c) Vehicles’ velocities.
    Figure  4.  The error trajectories for vehicle platoon system under the proposed controller.

    In this paper, we have investigated the PIO-based platooning control for homogeneous connected automated vehicles subject to replay attacks. First, a PIO has been developed to estimate the desired state of vehicles. Then, the closed-loop system based on the PIO has been transformed into a switched and time-delayed one for the convenience of performance analysis and parameter design. In the framework of Lyapunov stability, some sufficient conditions have been derived and the desired controller gains have been formulated via the solutions of certain matrix inequalities only dependent on maximum and minimum eigenvalues of communication topologies. Further research topics include the extension of the developed results to other cyber physical systems [44], [45] or further, disclosing the influence of replay attacks.

  • [1]
    Y. Li, C. Tang, S. Peeta, and Y. Wang, “Integral-sliding-mode braking control for a connected vehicle platoon: Theory and application,” IEEE Trans. Industrial Electronics, vol. 66, no. 6, pp. 4618–4628, 2019. doi: 10.1109/TIE.2018.2864708
    [2]
    S. Wen and G. Guo, “Observer-based control of vehicle platoons with random network access,” Robotics and Autonomous Systems, vol. 115, pp. 28–39, 2019. doi: 10.1016/j.robot.2019.02.006
    [3]
    Y. Ju, D. Ding, X. He, Q.-L. Han, and G. Wei, “Consensus control of multi-agent systems using fault-estimation-in-the-loop: Dynamic event-triggered case,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 8, pp. 1440–1451, Aug. 2022. doi: 10.1109/JAS.2021.1004386
    [4]
    K.-Y. Liang, J. Mårtensson, and K. H. Johansson, “Heavy-duty vehicle platoon formation for fuel efficiency,” IEEE Trans. Intelligent Transportation Systems, vol. 17, no. 4, pp. 1051–1061, 2016. doi: 10.1109/TITS.2015.2492243
    [5]
    H. Liu, W. Qian, W. Xing, and Z. Zhao, “Further results on delay-dependent robust H control for uncertain systems with interval time-varying delays,” Systems Science &Control Engineering, vol. 9, no. s1, pp. 30–40, 2021.
    [6]
    D. Zhao and H. Wang, “Longitudinal influence of autonomous vehicles and vehicular communication on post-accident traffic,” IEEE Intelligent Transportation Systems Magazine, vol. 13, no. 4, pp. 164–178, 2021.
    [7]
    Y. Zu, C. liu, and R. Dai, “Distributed traffic speed control for improving vehicle throughput,” IEEE Intelligent Transportation Systems Magazine, vol. 11, no. 3, pp. 56–68, 2019. doi: 10.1109/MITS.2019.2919621
    [8]
    G. Guo and D. Li, “Adaptive sliding mode control of vehicular platoons with prescribed tracking performance,” IEEE Trans. Vehicular Technology, vol. 68, no. 8, pp. 1786–1797, 2019.
    [9]
    S. Wen, G. Guo, B. Chen, and X. Gao, “Cooperative adaptive cruise control of vehicles using a resource-efficient communication mechanism,” IEEE Trans. Intelligent Vehicles, vol. 4, no. 1, pp. 127–150, 2019. doi: 10.1109/TIV.2018.2886676
    [10]
    H. Chehardoli and M. R. Homaeinezhad, “Third-order safe consensus of heterogeneous vehicular platoons with MPF network topology: Constant time headway strategy,” Proc. the Institution of Mechanical Engineers,Part D: Journal of Automobile Engineering, vol. 232, no. 3, pp. 285–298, 2018.
    [11]
    J. Chen, H. Liang, J. Li, and Z. Lv, “Connected automated vehicle platoon control with input saturation and variable time headway strategy,” IEEE Trans. Intelligent Transportation Systems, vol. 22, no. 8, pp. 4929–4940, 2021. doi: 10.1109/TITS.2020.2983468
    [12]
    J.-L. Chang, “Applying discrete-time proportional integral observers for state and disturbance estimations,” IEEE Trans. Automatic Control, vol. 51, no. 5, pp. 814–818, 2006. doi: 10.1109/TAC.2006.875019
    [13]
    D. Koenig, “Unknown input proportional multiple-integral observer design for linear descriptor systems: Application to state and fault estimation,” IEEE Trans. Automatic Control, vol. 50, no. 2, pp. 212–217, 2005. doi: 10.1109/TAC.2004.841889
    [14]
    D. Zhao, Z. Wang, G. Wei, and X. Liu, “Nonfragile H state estimation for recurrent neural networks with time-varying delays: On proportional-integral observer design,” IEEE Trans. Neural Networks and Learning Systems, vol. 32, no. 8, pp. 3553–3565, 2021.
    [15]
    J. Hu, Bhowmick, F. Arvin, A. Lanzon, and B. Lennox, “Cooperative control of heterogeneous connected vehicle platoons: An adaptive leader-following approach,” IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 977–984, 2020. doi: 10.1109/LRA.2020.2966412
    [16]
    J. Xu, C. Mi, B. Cao, J. Deng, Z. Chen, and S. Li, “The state of charge estimation of lithium-ion batteries based on a proportional-integral observer,” IEEE Trans. Vehicular Technology, vol. 63, no. 4, pp. 1614–1621, May 2014. doi: 10.1109/TVT.2013.2287375
    [17]
    Q. Luo, A.-T. Nguyen, J. Fleming, and H. Zhang, “Unknown input observer based approach for distributed tube-based model predictive control of heterogeneous vehicle platoons,” IEEE Trans. Vehicular Technology, vol. 70, no. 4, pp. 2930–2944, 2021. doi: 10.1109/TVT.2021.3064680
    [18]
    J. Luo, H. Pang, M. Wang, and R. Yao, “PI observer-based fault-tolerant tracking controller for automobile active suspensions,” IEEE Access, vol. 10, pp. 47203–47218, 2022. doi: 10.1109/ACCESS.2022.3171580
    [19]
    M. Vijayakumar, R. Sakthivel, A. Mohammadzadeh, S. A. Karthick, and S. M. Anthoni, “Proportional integral observer based tracking control design for Markov jump systems,” Applied Mathematics and Computation, vol. 410, art no. 126467, 2021.
    [20]
    X. Wang, D. Ding, H. Dong, and X.-M. Zhang, “Neural-network-based control for discrete-time nonlinear systems with input saturation under stochastic communication protocol,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 4, pp. 766–778, Apr. 2021. doi: 10.1109/JAS.2021.1003922
    [21]
    J. Hu, H. Zhang, H. Liu, and X. Yu, “A survey on sliding mode control for networked control systems,” Int. Journal of Systems Science, vol. 52, no. 6, pp. 1129–1147, 2021. doi: 10.1080/00207721.2021.1885082
    [22]
    K. Zhu, J. Hu, Y. Liu, N. D. Alotaibi, and F. E. Alsaadi, “On \ell_{2}-\ell_{\infty} output-feedback control scheduled by stochastic communication protocol for two-dimensional switched systems,” Int. Journal of Systems Science, vol. 52, no. 14, pp. 2961–2976, 2021. doi: 10.1080/00207721.2021.1914768
    [23]
    L. Liu, L. Ma, J. Zhang, and Y. Bo, “Distributed non-fragile set-membership filtering for nonlinear systems under fading channels and bias injection attacks,” Int. Journal of Systems Science, vol. 52, no. 6, pp. 1192–1205, 2021. doi: 10.1080/00207721.2021.1872118
    [24]
    L. Ma, Z. Wang, Y. Chen, and X. Yi, “Probability-guaranteed distributed filtering for nonlinear systems with innovation constraints over sensor networks,” IEEE Trans. Control of Network Systems, vol. 8, no. 2, pp. 951–963, 2021. doi: 10.1109/TCNS.2021.3049361
    [25]
    Y. Pang, H. Xia, and M. J. Grimble, “Resilient nonlinear control for attacked cyber-physical systems,” IEEE Trans. Systems,Man,and Cybernetics: Systems, vol. 50, no. 6, pp. 2129–2138, 2018.
    [26]
    B. Shen, Z. Wang, D. Wang, and Q. Li, “State-saturated recursive filter design for stochastic time-varying nonlinear complex networks under deception attacks,” IEEE Trans. Neural Networks and Learning Systems, vol. 31, no. 10, pp. 3788–3800, 2020. doi: 10.1109/TNNLS.2019.2946290
    [27]
    J. Zhang, J. Song, J. Li, F. Han, and H. Zhang, “Observer-based non-fragile H-consensus control for multi-agent systems under deception attacks,” Int. Journal of Systems Science, vol. 52, no. 6, pp. 1223–1236, 2021. doi: 10.1080/00207721.2021.1884917
    [28]
    H. Geng, H. Liu, L. Ma, and X. Yi, “Multi-sensor filtering fusion meets censored measurements under a constrained network environment: advances, challenges and prospects,” Int. Journal of Systems Science, vol. 52, no. 16, pp. 3410–3436, 2021. doi: 10.1080/00207721.2021.2005178
    [29]
    Y. Ju, X. Tian, H. Liu, and L. Ma, “Fault detection of networked dynamical systems: A survey of trends and techniques,” Int. Journal of Systems Science, vol. 52, no. 16, pp. 3390–3409, 2021. doi: 10.1080/00207721.2021.1998722
    [30]
    J. Qin, M. Li, L. Shi, and X. Yu, “Optimal denial-of-service attack scheduling with energy constraint over packet-dropping networks,” IEEE Trans. Automatic Control, vol. 63, no. 6, pp. 1648–1663, 2018. doi: 10.1109/TAC.2017.2756259
    [31]
    E. Xu, K. Ma, and Y. Chen, “H control for a hyperchaotic finance system with external disturbance based on the quadratic system theory,” Systems Science &Control Engineering, vol. 9, no. s1, pp. 41–49, Apr. 2021.
    [32]
    B. Chen, D. W. Ho, G. Hu, and L. Yu, “Secure fusion estimation for bandwidth constrained cyber-physical systems under replay attacks,” IEEE Trans. Cybernetics, vol. 48, no. 6, pp. 1862–1876, 2017.
    [33]
    M. Zhu and S. Martinez, “On the performance analysis of resilient networked control systems under replay attacks,” IEEE Trans. Automatic Control, vol. 59, no. 3, pp. 804–808, 2013.
    [34]
    S. Xiao, X. Ge, Q.-L. Han, and Y. Zhang, “Secure distributed adaptive platooning control of automated vehicles over vehicular ad-hoc networks under denial-of-service attacks,” IEEE Trans. Cybernetics, vol. 52, no. 11, pp. 12003–12015, 2022.
    [35]
    Y. Zhao, Z. Liu, and W. S. Wong, “Resilient platoon control of vehicular cyber physical systems under DoS attacks and multiple disturbances,” IEEE Trans. Intelligent Transportation Systems, vol. 23, no. 8, pp. 10945–10956, 2022.
    [36]
    A. Petrillo, A. Pescapé, and S. Santini, “A secure adaptive control for cooperative driving of autonomous connected vehicles in the presence of heterogeneous communication delays and cyberattacks,” IEEE Trans. Cybernetics, vol. 51, no. 3, pp. 1134–1149, 2021. doi: 10.1109/TCYB.2019.2962601
    [37]
    X. Xu, X. Li, Do ng, Y. Liu, and H. Zhang, “Robust reset speed synchronization control for an integrated motor-transmission powertrain system of a connected vehicle under a replay attack,” IEEE Trans. Vehicular Technology, vol. 70, no. 6, pp. 5524–5536, 2021. doi: 10.1109/TVT.2020.3020845
    [38]
    Z. Khan, M. Chowdhury, M. Islam, C. Huang, and M. Rahman, “Long short-term memory neural network-based attack detection model for in-vehicle network security,” IEEE Sensors Letters, vol. 4, no. 6, pp. 1–4, 2020.
    [39]
    G. Fiengo, D. G. Lui, A. Petrillo, S. Santini, and M. Tufo, “Distributed robust PID control for leader tracking in uncertain connected ground vehicles with V2V communication delay,” IEEE/ASME Trans. Mechatronics, vol. 24, no. 3, pp. 1153–1165, 2019. doi: 10.1109/TMECH.2019.2907053
    [40]
    Y. Zhu, D. Zhao, and Z. Zhong, “Adaptive optimal control of heterogeneous CACC system with uncertain dynamics,” IEEE Trans. Control Systems Technology, vol. 27, no. 4, pp. 1772–1779, 2019. doi: 10.1109/TCST.2018.2811376
    [41]
    J. Mao, X. Meng, and D. Ding, “Fuzzy set-membership filtering for discrete-time nonlinear systems,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 6, pp. 1026–1036, Jun. 2022. doi: 10.1109/JAS.2022.105416
    [42]
    F. Yang, Z. Wang, Y. S. Hung, and M. Gani, “H control for networked systems with random communication delays,” IEEE Trans. Automatic Control, vol. 51, no. 3, pp. 511–518, 2006. doi: 10.1109/TAC.2005.864207
    [43]
    X. Wang, D. Ding, X. Ge, and Q.-L. Han, “Neural-network-based control for discrete-time nonlinear systems with denial-of-service attack: The adaptive event-triggered case,” Int. Journal of Robust and Nonlinear Control, vol. 32, no. 5, pp. 2760–2779, 2020.
    [44]
    Y. Shen, Z. Wang, B. Shen, and H. Dong, “Outlier-resistant recursive filtering for multisensor multirate networked systems under weighted try-once-discard protocol,” IEEE Trans. Cybernetics, vol. 51, no. 10, pp. 4897–4908, Oct. 2021. doi: 10.1109/TCYB.2020.3021194
    [45]
    L. Zou, Z. Wang, J. Hu, and H. Dong, “Ultimately bounded filtering subject to impulsive measurement outliers,” IEEE Trans. Automatic Control, vol. 67, no. 7, pp. 304–319, Jan. 2022.
  • Related Articles

    [1]Yanxia Tan, Zhenkun Huang. Synchronization of Drive-Response Networks With Delays on Time Scales[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(4): 1063-1065. doi: 10.1109/JAS.2016.7510043
    [2]Honghai Wang, Qing-Long Han. Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(4): 878-892. doi: 10.1109/JAS.2024.124308
    [3]Xuerao Wang, Qingling Wang, Yanxu Su, Yuncheng Ouyang, Changyin Sun. Adaptive Sensor-Fault Tolerant Control of Unmanned Underwater Vehicles With Input Saturation[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(4): 907-918. doi: 10.1109/JAS.2023.123837
    [4]Li-Ying Hao, Gege Dong, Tieshan Li, Zhouhua Peng. Path-Following Control With Obstacle Avoidance of Autonomous Surface Vehicles Subject to Actuator Faults[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(4): 956-964. doi: 10.1109/JAS.2023.123675
    [5]Shengnan Gao, Zhouhua Peng, Haoliang Wang, Lu Liu, Dan Wang. Long Duration Coverage Control of Multiple Robotic Surface Vehicles Under Battery Energy Constraints[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(7): 1695-1698. doi: 10.1109/JAS.2023.123438
    [6]Xiaohua Ge, Qing-Long Han, Xian-Ming Zhang, Derui Ding. Communication Resource-Efficient Vehicle Platooning Control With Various Spacing Policies[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(2): 362-376. doi: 10.1109/JAS.2023.123507
    [7]Haihua Guo, Min Meng, Gang Feng. Lyapunov-Based Output Containment Control of Heterogeneous Multi-Agent Systems With Markovian Switching Topologies and Distributed Delays[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(6): 1421-1433. doi: 10.1109/JAS.2023.123198
    [8]Ning Zhao, Xudong Zhao, Ning Xu, Liang Zhang. Resilient Event-Triggered Control of Connected Automated Vehicles Under Cyber Attacks[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(12): 2300-2302. doi: 10.1109/JAS.2023.123483
    [9]Chuanjian Li, Xiaofeng Zong. Group Hybrid Coordination Control of Multi-Agent Systems With Time-Delays and Additive Noises[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(3): 737-748. doi: 10.1109/JAS.2022.105917
    [10]Xiaohua Ge, Qing-Long Han, Qing Wu, Xian-Ming Zhang. Resilient and Safe Platooning Control of Connected Automated Vehicles Against Intermittent Denial-of-Service Attacks[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(5): 1234-1251. doi: 10.1109/JAS.2022.105845
    [11]Xiaohua Ge, Shunyuan Xiao, Qing-Long Han, Xian-Ming Zhang, Derui Ding. Dynamic Event-Triggered Scheduling and Platooning Control Co-Design for Automated Vehicles Over Vehicular Ad-Hoc Networks[J]. IEEE/CAA Journal of Automatica Sinica, 2022, 9(1): 31-46. doi: 10.1109/JAS.2021.1004060
    [12]Giuseppe Franzè, Francesco Tedesco, Domenico Famularo. Resilience Against Replay Attacks: A Distributed Model Predictive Control Scheme for Networked Multi-Agent Systems[J]. IEEE/CAA Journal of Automatica Sinica, 2021, 8(3): 628-640. doi: 10.1109/JAS.2020.1003542
    [13]Mei Yu, Chuan Yan, Dongmei Xie, Guangming Xie. Event-triggered Tracking Consensus with Packet Losses and Time-varying Delays[J]. IEEE/CAA Journal of Automatica Sinica, 2016, 3(2): 165-173.
    [14]Lu Wang, Jianbo Su. Trajectory Tracking of Vertical Take-off and Landing Unmanned Aerial Vehicles Based on Disturbance Rejection Control[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(1): 65-73.
    [15]Zhaolei Wang, Qing Wang, Chaoyang Dong. Asynchronous H Control for Unmanned Aerial Vehicles: Switched Polytopic System Approach[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(2): 207-216.
    [16]Derong Liu, Changyin Sun, Bin Xian. Guest Editorial for Special Issue on Autonomous Control of Unmanned Aerial Vehicles[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(1): 1-1.
    [17]Chaoxu Mu, Qun Zong, Bailing Tian, Wei Xu. Continuous Sliding Mode Controller with Disturbance Observer for Hypersonic Vehicles[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(1): 45-55.
    [18]Ruimin Zhang, Lu Dong, Changyin Sun. Adaptive Nonsingular Terminal Sliding Mode Control Design for Near Space Hypersonic Vehicles[J]. IEEE/CAA Journal of Automatica Sinica, 2014, 1(2): 155-161.
    [19]Jianming Wei, Yunan Hu, Meimei Sun. Adaptive Iterative Learning Control for a Class of Nonlinear Time-varying Systems with Unknown Delays and Input Dead-zone[J]. IEEE/CAA Journal of Automatica Sinica, 2014, 1(3): 302-314.
    [20]Wenhui Liu, Feiqi Deng, Jiarong Liang, Haijun Liu. Distributed Average Consensus in Multi-agent Networks with Limited Bandwidth and Time-delays[J]. IEEE/CAA Journal of Automatica Sinica, 2014, 1(2): 193-203.

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(4)

    Article Metrics

    Article views (410) PDF downloads(131) Cited by()

    Highlights

    • A time-varying parameter and two positive scalars are introduced to describe the temporal behavior of replay attacks
    • A sufficient condition dependent on the duration and the active ratio of replay attacks is received
    • The desired gains of PIO-based controllers are designed by resorting to the solution of certain matrix inequalities only dependent on maximum and minimum eigenvalues of communication topologies

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return