Quasi-Consensus of Time-Varying Multi-Agent Systems with External Inputs under Deception Attacks

Abstract

The quasi-consensus of a class of nonlinear time-varying multi-agent systems suffering from both external inputs and deception attacks is studied in this paper. This is different from a time-varying matrix, which is assumed to be bounded; further reasonable assumptions are supposed. In addition, impulsive deception attacks modeled with Bernoulli variables are considered. Sufficient conditions to achieve quasi-consensus are given, and the upper bounds of the error state related to the deception attacks is derived. Finally, a numerical simulation example is provided to show the validity of the obtained results.

1. Introduction

Systems with time-varying dynamics are more suitable to model objects in the real world compared with time-invariant systems. Owing to the time-varying parameters, the stability and stabilization of time-varying systems are more difficult to study even for linear systems. In recent years, results on the stability analysis of time-varying systems have been found in [1,2,3,4,5,6] and the references therein.

For example, a uniformly asymptotically stable function was proposed to study the asymptotic stability of linear time-varying systems in [5] and a nonlinear one in [6]. This approach was then extended to time-delayed systems [7], impulsive systems [8] and sampled-data systems [9]. Different from the method used in [5,6,7], the authors in [4] developed a novel lemma based on more general time-varying delayed systems.

Nevertheless, the consensus of time-varying multi-agent systems (MASs) has not been fully studied, as the analysis of time-varying systems is laborious. Moreover, time-varying dynamics in MASs mainly focus on the time delay and the communication topology [10,11,12].

For example, the uncertainty caused by unknown time-varying communication delays was considered in [10]; formation control with time-varying communication networks was studied in [12]. When studying systems with uncertain parameters, such as randomly occurring uncertainties and randomly occurring nonlinearities in [13,14,15], the norm of the time-varying term in the system matrix is always assumed to be less than one. Conservatively, this assumption is restrictive to adopt in practical works.

On the other hand, the consensus problems of MASs have been crucial issues over the past two decades [16]. The consensus of MASs means that all agents will reach the identical goal through exchanging information with neighbors [17],. It has been widely studied in practical applications, such as UAV irrigation and formation [18,19] and power grid energy distribution [20,21]. In practice, unexpected interferences, such as external inputs or cyber-attacks, may occur due to the complicated workspace. These unexpected interferences may lead to poor performance and even destroy the stability of systems. It is known that environment disturbances are inevitable and usually described by the Brownian motion.

Stochastic MASs modeled by $\mathrm{It}\widehat{o}$ differential equations have been widely investigated in recent years [22]. However, the definition of consensus is not applicable if systems are disturbed by external inputs, and to describe the consensus in this case, the concept of quasi-consensus is proposed. Particularly, an error bound as controllable error for bounded external inputs is introduced in the quasi-consensus [23,24].

Significantly, working in an open environment typically brings about security problems [25]. Cyber-attacks are common, and they can destroy the stability of systems and seriously affect the equipment [26]. Hence, cyber-attacks are important factors when studying the stability of MASs. Generally, cyber-attacks are divided into two categories: denial-of-service (DoS) attacks [27,28] and deception attacks [29,30,31,32,33].

DoS attacks block communication networks, which leads to packet drops or packet time delays. For instance, the problem of communication topologies interrupted by DoS attacks with a definite probability was considered in [28].

Deception attacks relate to the situation that malicious adversaries can find and manipulate the transmitting information and control signal. False data injection attacks mean that false information can be injected to the controller or the feedback channel of the controller [29]. Furthermore, deception attacks can be divided into different categories: data replacement attacks, false data injection attacks and so on [30]. In [32], the quasi-consensus of a class of discrete-time multi-agent systems was studied using recursive linear matrix inequality and the stochastic analysis method.

In [33], in order to avoid certain adverse effects caused by system instability, load shedding and false data injection attacks, the authors designed a load frequency controller to provide a constant and uniform frequency in different operation cases of microgrids. The consensus of MASs in a given finite horizon were studied when the systems suffered from false data injection attacks [34].

To describe the randomness of deception attacks, Bernoulli variables were introduced in an attack scenario in [35]. Nevertheless, most of the existing results are on time-invariant MASs subjected to continuous-time deception attacks [29,31,32,33], while it is more practical and challenging for time-varying multi-agent systems under impulsive deception attacks.

With the above analysis, a consensus of time-varying MASs subject to both external inputs and deception attacks is missing in the literature, and how to release the restrictive assumption on the time-varying system matrix is meaningful and challenging. This paper aims to deal with the above problems, and the main contributions of this paper are summarized as follows:

• (1). Compared with the traditional assumption on the time-varying system matrix of MASs, more general and practical conditions are considered in this paper versus the analysis approaches used in [5].

• (2). Both false data injection attacks modeled with Bernoulli variables and external inputs are considered in this paper. Moreover, sufficient conditions for achieving the quasi-consensus are derived, and the error upper bounds related to the external inputs and deception attacks are also obtained.

The rest of this article is organized as follows. Some preliminaries are given in Section 2. Sufficient conditions for the quasi-consensus are provided in Section 3. In Section 4, an illustrative example is provided to verify the effectiveness of the proposed results. Finally, our conclusions are drawn in Section 5.

Notation 1.

Throughout this article, the following notations are adopted. ${\lambda }_{max}(·)$ and ${\lambda }_{min}(·)$ are the maximum and minimum eigenvalues of any real and symmetrical matrix, respectively. $I_n$ and ${\mathbf{1}}_N$ denote the n-dimensional identity matrix and an N-dimensional column vector with all ones, respectively. $\mathbb{N}=\{1,2,\dots \}$, $\mathbb{N}[1,N]=\{1,2,\dots ,N\}$, where $N\in \mathbb{N}$. $\mathbb{R}=(-\infty ,+\infty )$, ${\mathbb{R}}^{+}=\left[0,+\infty )\right.$, ${\mathbb{R}}^n$ denotes an n-dimensional Euclidean space, and ${\mathbb{R}}^{n\times m}$ is the set of $n\times m$ real matrix. diag $\left\{\cdots \right\}$ denotes a block-diagonal matrix. $\mathbb{E}[·]$ is the operator of expectation, and $∥x∥=\sqrt{\sum {}_{i=1}^n{x}_i^2}$ denotes the Euclidean norm of vector $x\in {\mathbb{R}}^n$. $\mathcal{C}(X;Y)$ indicates the continuous mapping from X to Y. $D^{+}g\left(t\right)$ denotes the Dini derivative of the function $g:\mathbb{R}\to \mathbb{R}$, and it is defined as:

$\begin{array}{c}\hfill D^{+}g\left(t\right)=\underset{\mathrm{\Delta }\to 0^{+}}{lim}\frac{g\left(t+\mathrm{\Delta }\right)-g\left(t\right)}{\mathrm{\Delta }}.\end{array}$

2. Preliminaries

2.1. Graph Theory

In general, a weighted undirected graph can be represented by $\mathcal{G}=(\mathcal{V},\mathcal{E},\mathcal{A})$, where $\mathcal{V}=\{v_1,v_2,\dots ,v_N\}$, $\mathcal{E}\subseteq \mathcal{V}\times \mathcal{V}$ and $\mathcal{A}$ = ${\left[a_{ij}\right]}_{N\times N}\in {\mathbb{R}}^{N\times N}$, $v_i,v_j\in \mathcal{V}$ mean the set of vertexes, the set of edges and the adjacency matrix, respectively. When data can be transferred between agent i and j, $i\ne j$, $i,j\in \mathbb{N}[1,N]$, there exists an edge between $v_i$ and $v_j$, that is $(v_i,v_j)\in \mathcal{E}$, then $a_{ij}=1$ and $a_{ii}=0$, otherwise $a_{ij}=0$. L is Laplacian matrix of graph $\mathcal{G}$, which can be denoted $L={\left[l_{ij}\right]}_{N\times N}\in {\mathbb{R}}^{N\times N}$, and $l_{ij}=-a_{ij}$, $i\ne j$, $l_{ii}=\sum {}_{j=1,j\ne i}^N{a}_{ij}$.

2.2. The Model of MASs

Consider a class of nonlinear time-varying MASs composed of N agents with external disturbances. The dynamics of agent $i,i\in \mathbb{N}[1,N]$ can be described by

(1)$\left\{\begin{array}{c}{\dot{x}}_i=A\left(t\right)x_i\left(t\right)+\beta \left(t\right)f\left(t,x_i\left(t\right)),{\omega }_i\left(t\right)\right)+u_i\left(t\right),t\ge t_0,\hfill \\ x_i\left(t_0\right)={\zeta }_i.\hfill \end{array}\right.$

where $x_i\left(t\right)\in {\mathbb{R}}^n$, $u_i\left(t\right)\in {\mathbb{R}}^n$ and ${\omega }_i\left(t\right)\in {\mathbb{R}}^n$ represent the state, the control input and external disturbances of agent i, respectively. $A\left(t\right)=A+\alpha \left(t\right)TB\left(t\right)Q$ is a time-varying matrix, where A, T, and Q are constant matrices with suitable dimensions, and $B\left(t\right)$ is a time-varying matrix. $f(·)\in \mathcal{C}\left({\mathbb{R}}^{+}\times {\mathbb{R}}^n\times {\mathbb{R}}^n;{\mathbb{R}}^n\right)$ is a nonlinear function, represents intrinsic dynamics of the agent. Assume that the initial time $t_0\ge 0$, the initial state of agent i is ${\zeta }_i$ and $\widehat{\zeta }={({\zeta }_1^T,{\zeta }_2^T,\dots ,{\zeta }_N^T)}^T$.

The system considered in this article may be linear or non-linear, which mainly depends on the value of $\beta \left(t\right)$. Clearly, while $\beta \left(t\right)\equiv 0$, (1) is a linear system.

Assumption 1.

Assume that the random variables $\alpha \left(t\right)$ and $\beta \left(t\right)$ in system (1) both obey the Bernoulli distribution with the value 0 or 1. Their probabilities are set as follows:

(2) $\left\{\begin{array}{c}Pr\left(\alpha \left(t\right)=1\right)=\alpha ,Pr\left(\alpha \left(t\right)=0\right)=1-\alpha ,\hfill \\ Pr\left(\beta \left(t\right)=1\right)=\beta ,Pr\left(\beta \left(t\right)=0\right)=1-\beta .\hfill \end{array}\right.$

where α, β$\in [0,1]$ are known constants. In addition, $\alpha \left(t\right)$ and $\beta \left(t\right)$ are independent of each other.

Based on the above conditions, the following equations are established:

(3)$\mathbb{E}\left[\alpha \left(t\right)-\alpha \right]=0,\mathbb{E}\left[\beta \left(t\right)-\beta \right]=0.$

In this article, a controller that suffers from false data injection attacks is considered, and it is designed as follows:

(4)$\begin{array}{cc}\hfill u_i\left(t\right)=& \sum _{k=1}^{\infty }[U_k\sum _{j=1}^N{a}_{ij}\left(x_i\left(t\right)-x_j\left(t\right)\right)+{\psi }_i\left(t\right)d_k{\xi }_i\left(t\right)]\delta (t-t_k),\forall i\in \mathbb{N}[1,N],\hfill \end{array}$

where $\delta \left(·\right)$ is the Dirac function, ${\xi }_i\left(t\right)$ denotes the attack signal of the agent i, and $d_k$ means the strength of attack signal at the kth impulsive moment. $U_k\in \mathbb{R}$ is the impulsive control gain. ${\left\{t_k\right\}}_{k=1}^{+\infty }$ is the impulsive time sequence and satisfies $0\le t_0<t_1<\cdots <t_k<\cdots$, ${lim}_{k\to +\infty }{t}_k=+\infty$. Let ${\tau }_{sup}={sup}_{k\in \mathbb{N}}\{t_{k+1}-t_k\}$ and ${\tau }_{inf}={inf}_{k\in \mathbb{N}}\{t_{k+1}-t_k\}>0$. ${\psi }_i\left(t\right)$ is a Bernoulli variable related to agent i, which is introduced to denote the occurrence of an achievable attack. Hence, one finds:

$Pr\left({\psi }_i\left(t\right)=1\right)={\overline{\psi }}_i,Pr\left({\psi }_i\left(t\right)=0\right)=1-{\overline{\psi }}_i.$

where ${\overline{\psi }}_i\in [0,1]$ are known constants.

Assumption 2.

The stochastic variables ${\psi }_i\left(t_k\right)$, $i\in \mathbb{N}[1,N]$ are mutually independent.

Remark 1.

The configuration of MAS with external inputs under deception attacks in this paper is shown in Figure 1. Deception attacks occur on the channel from sensor to controller, and the attackers inject false data to control signal at discrete-time instants, thus, reducing the accuracy of the system data.

According to the controller (4), MASs (1) suffering from false data injection attacks can be described as:

(5)$\left\{\begin{array}{c}{\dot{x}}_i=A\left(t\right)x_i\left(t\right)+\beta \left(t\right)f\left(t,x_i\left(t\right),{\omega }_i\left(t\right)\right),t\ge t_0,t\ne t_k,\hfill \\ \mathrm{\Delta }{x}_i\left(t_k\right)=U_k\sum _{j=1}^N{a}_{ij}\left(x_i\left(t_k\right)-x_j\left(t_k\right)\right)+{\psi }_i\left(t_k\right)d_k{\xi }_i\left(t_k\right),t=t_k.\hfill \end{array}\right.$

where $\mathrm{\Delta }{x}_i\left(t_k\right)=x_i\left(t_k^{+}\right)-x_i\left(t_k^{-}\right)$. Throughout the article, assume that $x_i\left(t\right)$ is right-hand continuous at $t=t_k$, $x_i\left(t_k\right)=x_i\left(t_k^{+}\right)={lim}_{c\to 0^{+}}{x}_i(t_k+c)$ and $x_i\left(t_k^{-}\right)={lim}_{c\to 0^{-}}{x}_i(t_k+c)$.

Notice that the stabilization problem of an error system is equal to the consensus of MASs. Therefore, define the error state $e_i\left(t\right):=x_i\left(t\right)-\overline{x}\left(t\right)=x_i\left(t\right)-\frac{1}{N}{\displaystyle \sum _{i=1}^N}{x}_i\left(t\right)$ and ${\overline{\omega }}_i\left(t\right):={\omega }_i\left(t\right)-\frac{1}{N}{\displaystyle \sum _{i=1}^N}{\omega }_i\left(t\right)$. With the help of a Kronecker product, one yields $e\left(t\right)=(E\otimes I_n)x\left(t\right)=\left((I_N-\frac{1}{N}{\mathbf{1}}_N{\mathbf{1}}_N^T)\otimes I_n\right)x\left(t\right)$ and $\overline{\omega }\left(t\right)=(E\otimes I_n)\omega \left(t\right)=\left((I_N-\frac{1}{N}{\mathbf{1}}_N{\mathbf{1}}_N^T)\otimes I_n\right)\omega \left(t\right)$, where $x\left(t\right)={[x_1^T\left(t\right),x_2^T\left(t\right),\dots ,x_N^T\left(t\right)]}^T$, $e\left(t\right)={[e_1^T\left(t\right),e_2^T\left(t\right),\dots ,e_N^T\left(t\right)]}^T$, $\omega \left(t\right)={[{\omega }_1^T\left(t\right),{\omega }_2^T\left(t\right),\dots ,{\omega }_N^T\left(t\right)]}^T$ and $\overline{\omega }\left(t\right)={[{\overline{\omega }}_1^T\left(t\right),{\overline{\omega }}_2^T\left(t\right),\dots ,{\overline{\omega }}_N^T\left(t\right)]}^T$.

Then, the compact form error system under the false data injection attacks can be described as:

(6)$\left\{\begin{array}{c}\dot{e}\left(t\right)=\left(I_N\otimes A\left(t\right)\right)e\left(t\right)+\beta \left(t\right)F(t,e\left(t\right),\overline{\omega }\left(t\right)),t\ge t_0,t\ne t_k,\hfill \\ \mathrm{\Delta }e\left(t_k\right)=e\left(t_k^{+}\right)-e\left(t_k^{-}\right)=(U_{k}L\otimes I_n)e\left(t_k^{-}\right)+d_k\left(E\mathrm{\Psi }\left(t_k\right)\otimes I_n\right)\xi \left(t_k\right),t=t_k.\hfill \end{array}\right.$

where $\mathrm{\Psi }\left(t_k\right)=\mathrm{diag}\left\{{\psi }_1\left(t_k\right),{\psi }_2\left(t_k\right),\dots ,{\psi }_N\left(t_k\right)\right\}$ is a diagonal matrix, $\xi \left(t_k\right)={\left[{\xi }_1^T\left(t_k\right),{\xi }_2^T\left(t_k\right),\dots ,{\xi }_N^T\left(t_k\right)\right]}^T$ as well as $F(t,e\left(t\right),\overline{\omega }\left(t\right))=(E\otimes I_n)f(t,x\left(t\right),\omega \left(t\right))$, where $f(t,x\left(t\right),\omega \left(t\right))={[f^T(t,x_1\left(t\right),{\omega }_1\left(t\right)),\dots ,f^T(t,x_N\left(t\right),{\omega }_N\left(t\right))]}^T$.

Assumption 3.

The attack signal $\xi \left(t_k\right)$, $k\in \mathbb{N}$, is bound: ${∥\xi \left(t_k\right)∥}^2<\overline{\xi }$, and $\overline{\xi }$ is a known positive constant.

Assumption 4.

For the nonlinear function f in system (1), there exist constants ${\kappa }_1$, ${\kappa }_2\ge 0$ that satisfy

$\begin{array}{cc}\hfill |f^T(t,x_1\left(t\right),y_1\left(t\right))-& f^T(t,x_2\left(t\right),y_2\left(t\right))|\times |f(t,x_1\left(t\right),y_1\left(t\right))-f(t,x_2\left(t\right),y_2\left(t\right))|\hfill \\ \hfill & \le {\kappa }_1{\left|x_1\left(t\right)-x_2\left(t\right)\right|}^2+{\kappa }_2{\left|y_1\left(t\right)-y_2\left(t\right)\right|}^2.\hfill \end{array}$

Assumption 5.

Assume that the external disturbance $\overline{\omega }\left(t\right)$ is bounded and there exists a positive constant $\widehat{\omega }$ that satisfies

$\begin{array}{c}\hfill \underset{t\ge t_0}{sup}∥\overline{\omega }\left(t\right)∥\le \widehat{\omega },\end{array}$

Lemma 1.

Ref. [36] Assume that $\iota \in \mathbb{R},\mathrm{\Gamma },\mathrm{{\rm Y}},\mathrm{Z}\mathrm{a}\mathrm{n}\mathrm{d}\mathrm{\Lambda }$ are matrices with proper dimensions. Therefore, the Kronecker product has the properties

$\begin{array}{c}\left(1\right){(\mathrm{\Gamma }\otimes \mathrm{{\rm Y}})}^T={\mathrm{\Gamma }}^T\otimes {\mathrm{{\rm Y}}}^T;\hfill \\ \left(2\right)\left(\iota \mathrm{\Gamma }\right)\otimes \mathrm{{\rm Y}}=\mathrm{\Gamma }\otimes \left(\iota \mathrm{{\rm Y}}\right);\hfill \\ \left(3\right)(\mathrm{\Gamma }+\mathrm{Z})\otimes \mathrm{{\rm Y}}=\mathrm{\Gamma }\otimes \mathrm{{\rm Y}}+\mathrm{Z}\otimes \mathrm{{\rm Y}};\hfill \\ \left(4\right)(\mathrm{\Gamma }\otimes \mathrm{Z})(\mathrm{{\rm Y}}\otimes \mathrm{\Lambda })=\left(\mathrm{\Gamma }\mathrm{{\rm Y}}\right)\otimes \mathrm{Z}\mathrm{\Lambda }.\hfill \end{array}$

Definition 1.

Ref. [37] For any given initial value of the system $\widehat{\zeta }$, if there exists a compact set $\widehat{\partial }$ and a constant ϑ such that as $t\to +\infty$, the error state $e\left(t\right)$ converges to

(7) $\widehat{\partial }=\left\{e\in {\mathbb{R}}^{nN}|\mathbb{E}\left[∥e∥\right]\le \vartheta \right\},$

and then the MASs (1) is said to achieve quasi-consensus; ϑ is the upper bound of error; and if $\vartheta =0$, MASs (1) is said to achieve consensus.

Definition 2.

Ref. [8] Given an impulsive sequence ${\tau }^{\prime }={\left\{t_k\right\}}_{k=1}^{+\infty },k\in \mathbb{N}$, let $N_{{\tau }^{\prime }}(t,s)$ denotes the number of impulsive times in the interval $(s,t]$, exists two constants $N_0\in \mathbb{N}$ and ${\tau }_{ave}>0$, such that

(8) $N_{{\tau }^{\prime }}(t,s)\le \frac{t-s}{{\tau }_{ave}}+N_0.$

${\tau }_{ave}$ and $N_0$ are called the average impulsive interval and the elasticity number, respectively.

3. Main Results

Theorem 1.

Suppose that Assumptions 1–5 hold, if there exists a positive definite matrix P and positive scalars ${\epsilon }_1$, ${\epsilon }_2$, ${\epsilon }_3$, γ, ${\kappa }_1$, ${\kappa }_2$ and ${\gamma }_0\ge 0$, such that

(9) ${\int }_s^{t}H\left(v\right)dv\le \gamma (t-s)+{\gamma }_0,0\le s<t,$

(10) $\theta =\frac{ln\left({\mathrm{Z}}_{sup}\sigma \right)}{{\tau }_{sup}}+\gamma <0,$

(11) $0<\sigma <1,$

where $\overline{\mathrm{\Lambda }}\left(t\right)=P(I_N\otimes A)+{(I_N\otimes A)}^{T}P+\alpha [P(I_N\otimes TB\left(t\right)Q)+{(I_N\otimes TB\left(t\right)Q)}^{T}P]+\beta {\epsilon }_{1}PP+\beta {\kappa }^2{\epsilon }_1^{-1}({\epsilon }_2+1)I_{nN}$, $b={\lambda }_{min}\left(P\right)$, $q={\lambda }_{max}\left(P\right)$, $H\left(t\right)=b^{-1}{\lambda }_{max}\left(\overline{\mathrm{\Lambda }}\left(t\right)\right)$, $\eta ={\widehat{d}}^2\overline{\xi }\overline{\psi }q({\epsilon }_3^{-1}+1)$, $\sigma =d^2({\epsilon }_{3}q{b}^{-1}+1)$, $\rho =\beta {\kappa }^2{\epsilon }_1^{-1}({\epsilon }_2^{-1}+1)$, $\overline{\psi }={max}_{i\in \mathbb{N}[1,N]}{\overline{\psi }}_i$, $\widehat{d}={max}_{k\in \mathbb{N}}{d}_k$, $G=(I_N+U_{k}L)\otimes I_n$, $d={\lambda }_{max}\left(G\right)$, ${\mathrm{Z}}_{sup}=e^{\gamma {\tau }_{sup}+{\gamma }_0}$ and $\kappa =max\{{\kappa }_1,{\kappa }_2\}$.

Then, the time-varying multi-agent system (1) with external inputs and deception attacks can achieve quasi-consensus under the control protocol (4), and the upper bound of error can be estimated as

$\vartheta =\frac{\rho {\sigma }^{N_0}{e}^{{\gamma }_0}{\widehat{\omega }}^2}{b\left|\theta \right|}+\frac{\eta {\mathrm{Z}}_{sup}}{b(1-\sigma {\mathrm{Z}}_{sup})}+b^{-1}\rho {\mathrm{Z}}_{sup}{\widehat{\omega }}^2{\tau }_{sup},$

where ${\mathrm{Z}}_{sup}=e^{\gamma {\tau }_{sup}+{\gamma }_0}$.

Proof. 

Consider the following Lyapunov function:

(12)$V(t,e\left(t\right))=e^T\left(t\right)Pe\left(t\right).$

For $t\in [t_k,t_{k+1})$, $k\in \mathbb{N}$, taking the Dini derivative of (12) gives:

(13)$\begin{array}{c}\hfill D^{+}V\left(t,e\left(t\right)\right)=2e^T\left(t\right)P[(I_N\otimes A\left(t\right))e\left(t\right)+\beta \left(t\right)F(t,e\left(t\right),\overline{\omega }\left(t\right))].\end{array}$

According to Assumption 1, one has:

(14)$\begin{array}{cc}\hfill 2e^T\left(t\right)P(I_N\otimes A\left(t\right))e\left(t\right)=& e^T\left(t\right)(P(I_N\otimes A)+{(I_N\otimes A)}^{T}P)e\left(t\right)+\alpha e^T\left(t\right)(P(I_N\otimes TB\left(t\right)Q)\hfill \\ \hfill & +{(I_N\otimes TB\left(t\right)Q)}^{T}P)e\left(t\right)+(\alpha \left(t\right)-\alpha )e^T\left(t\right)(P(I_N\otimes TB\left(t\right)Q)\hfill \\ \hfill & +{(I_N\otimes TB\left(t\right)Q)}^{T}P)e\left(t\right).\hfill \end{array}$

(15)$\begin{array}{cc}\hfill 2e^T\left(t\right)P\beta \left(t\right)F(t,e\left(t\right),\overline{\omega }\left(t\right))=& \beta [e^T\left(t\right)PF(t,e\left(t\right),\overline{\omega }\left(t\right))+F^T(t,e\left(t\right),\overline{\omega }\left(t\right))Pe\left(t\right)]\hfill \\ \hfill & +2(\beta \left(t\right)-\beta )e^T\left(t\right)PF(t,e\left(t\right),\overline{\omega }\left(t\right)).\hfill \end{array}$

Based on Assumption 4, it can be found that:

(16)$\begin{array}{cc}\hfill F^T(t,e\left(t\right),\overline{\omega }\left(t\right))& F(t,e\left(t\right),\overline{\omega }\left(t\right))=f^T(t,x\left(t\right),\omega \left(t\right))(E\otimes I_n{)}^T(E\otimes I_n)f(t,x\left(t\right),\omega \left(t\right))\hfill \\ \hfill & \le [{\kappa }_1{x}^T\left(t\right)+{\kappa }_2{\omega }^T\left(t\right)](E\otimes I_n)(E\otimes I_n)[{\kappa }_{1}x\left(t\right)+{\kappa }_2\omega \left(t\right)]\hfill \\ \hfill & ={\kappa }_1^2{e}^T\left(t\right)e\left(t\right)+{\kappa }_1{\kappa }_2[{\overline{\omega }}^T\left(t\right)e\left(t\right)+e^T\left(t\right)\overline{\omega }\left(t\right)]+{\kappa }_2^2{\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right)\hfill \\ \hfill & \le ({\kappa }_1^2+{\kappa }_1{\kappa }_2{\epsilon }_2)e^T\left(t\right)e\left(t\right)+({\kappa }_2^2+{\kappa }_1{\kappa }_2{\epsilon }_2^{-1}){\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right),\hfill \end{array}$

(17)$\begin{array}{cc}\hfill \beta [e^T\left(t\right)PF(t,e\left(t\right),\overline{\omega }\left(t\right))& +F^T(t,e\left(t\right),\overline{\omega }\left(t\right))Pe\left(t\right)].\hfill \\ \hfill & \le \beta [{\epsilon }_1{e}^T\left(t\right)PPe\left(t\right)+{\epsilon }_1^{-1}{F}^T(t,e\left(t\right),\overline{\omega }\left(t\right))F(t,e\left(t\right),\overline{\omega }\left(t\right))]\hfill \\ \hfill & \le \beta [{\epsilon }_1{e}^T\left(t\right)PPe\left(t\right)+({\kappa }_1^2{\epsilon }_1^{-1}+{\kappa }_1{\kappa }_2{\epsilon }_2{\epsilon }_1^{-1})e^T\left(t\right)e\left(t\right)\hfill \\ \hfill & +({\kappa }_2^2{\epsilon }_1^{-1}+{\kappa }_1{\kappa }_2{\epsilon }_2^{-1}{\epsilon }_1^{-1}){\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right)].\hfill \end{array}$

Substituting (14)–(17) into (13) and taking the mathematical expectation operation gives:

(18)$\begin{array}{cc}\hfill \mathbb{E}[D^{+}& V(t,e\left(t\right))]\le \mathbb{E}\{e^T\left(t\right)(P(I_N\otimes A)+{(I_N\otimes A)}^{T}P)e\left(t\right)+\alpha e^T\left(t\right)[P(I_N\otimes TB\left(t\right)Q)\hfill \\ \hfill & +{(I_N\otimes TB\left(t\right)Q)}^{T}P]e\left(t\right)+\beta {\epsilon }_1{e}^T\left(t\right)PPe\left(t\right)+(\beta {\kappa }_1^2{\epsilon }_1^{-1}+\beta {\kappa }_1{\kappa }_2{\epsilon }_2{\epsilon }_1^{-1})e^T\left(t\right)e\left(t\right)\hfill \\ \hfill & +(\beta {\kappa }_2^2{\epsilon }_1^{-1}+\beta {\kappa }_1{\kappa }_2{\epsilon }_2^{-1}{\epsilon }_1^{-1}){\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right)\}.\hfill \end{array}$

Therefore, combining the above conditions with (18), we have:

(19)$\begin{array}{c}\hfill \mathbb{E}\left[D^{+}V(t,e\left(t\right))\right]\le H\left(t\right)\mathbb{E}\left[V(t,e\left(t\right))\right]+\rho {\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right),\end{array}$

where $\overline{\mathrm{\Lambda }}\left(t\right)=P(I_N\otimes A)+{(I_N\otimes A)}^{T}P+\alpha [P(I_N\otimes TB\left(t\right)Q)+{(I_N\otimes TB\left(t\right)Q)}^{T}P]+\beta {\epsilon }_{1}PP$ + $\beta {\kappa }^2{\epsilon }_1^{-1}({\epsilon }_2+1)I_{nN}$, $b={\lambda }_{min}\left(P\right)$, $H\left(t\right)=b^{-1}{\lambda }_{max}\left(\overline{\mathrm{\Lambda }}\left(t\right)\right)$, $\rho =\beta {\kappa }^2{\epsilon }_1^{-1}({\epsilon }_2^{-1}+1)$ and $\kappa =max\{{\kappa }_1,{\kappa }_2\}$.

For $t\in [t_k,t_{k+1})$, $k\in \mathbb{N}$ and any positive number S, we establish a comparative differential equation as follows:

(20)$\left\{\begin{array}{c}\dot{y}\left(t\right)=H\left(t\right)y\left(t\right)+\rho {\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right)+S,\hfill \\ y\left(t_k\right)={\mathrm{\Phi }}_k\hfill \end{array}\right.$

where ${\mathrm{\Phi }}_k=\mathbb{E}\left[V(t_k,e\left(t_k\right))\right]+S$ By solving and comparing the solutions of the differential equations, the following result is obtained:

$\begin{array}{cc}\hfill \mathbb{E}\left[V_S(t,e\left(t\right))\right]\le & {\mathrm{\Phi }}_k{e}^{{\int }_{t_k}^{t}H\left(v\right)dv}+\rho {\int }_{t_k}^t({\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)+S)e^{{\int }_u^{t}H\left(v\right)dv}du.\hfill \end{array}$

For $t\in [t_k,t_{k+1})$, $k\in \mathbb{N}$, setting $S\to 0$, one has:

(21)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]\le & \mathbb{E}\left[V(t_k,e\left(t_k\right))\right]e^{{\int }_{t_k}^{t}H\left(v\right)dv}+\rho {\int }_{t_k}^t{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du.\hfill \end{array}$

For $t=t_k$, $k\in \mathbb{N}$, according to (6), we obtain:

(22)$\begin{array}{cc}\hfill \mathbb{E}\left[V(t_k^{+},e\left(t_k^{+}\right))\right]& =\mathbb{E}\left[e^T\left(t_k^{+}\right)Pe\left(t_k^{+}\right)\right]=\mathbb{E}[(e^T\left(t_k^{-}\right)G^T+W^T\left(t_k\right))\times P(Ge\left(t_k^{-}\right)+W\left(t_k\right))]\hfill \\ \hfill & =\mathbb{E}[e^T\left(t_k^{-}\right)G^{T}PGe\left(t_k^{-}\right)+e^T\left(t_k^{-}\right)G^{T}PW\left(t_k\right)+W^T\left(t_k\right)PGe\left(t_k^{-}\right)\hfill \\ \hfill & +W^T\left(t_k\right)PW\left(t_k\right)],\hfill \end{array}$

where $W\left(t_k\right)=d_k(E\mathrm{\Psi }\left(t_k\right)\otimes I_n)\xi \left(t_k\right)$. As for the first term in (22), has:

(23)$\begin{array}{cc}\hfill \mathbb{E}\left[e^T\left(t_k^{-}\right)G^{T}PGe\left(t_k^{-}\right)\right]=& \mathbb{E}\{e^T\left(t_k^{-}\right)[(I_N+U_k{L}^T)\otimes I_n]P[(I_N+U_{k}L)\otimes I_n]e\left(t_k^{-}\right)\}\hfill \\ \hfill \le & d^2\mathbb{E}\left[V(t_k^{-},e\left(t_k^{-}\right))\right].\hfill \end{array}$

Then, we have:

(24)$\begin{array}{cc}\hfill \mathbb{E}[e^T\left(t_k^{-}\right)G^{T}PW\left(t_k\right)+& W^T\left(t_k\right)PGe\left(t_k^{-}\right)]\le q\mathbb{E}[e^T\left(t_k^{-}\right)G^{T}W\left(t_k\right)+W^T\left(t_k\right)Ge\left(t_k^{-}\right)]\hfill \\ \hfill \le & q\mathbb{E}[{\epsilon }_3{e}^T\left(t_k^{-}\right)G^{T}Ge\left(t_k^{-}\right)+{\epsilon }_3^{-1}{W}^T\left(t_k\right)W\left(t_k\right)]\hfill \\ \hfill \le & {\epsilon }_3{d}^{2}q{b}^{-1}\mathbb{E}\left[V(t_k^{-},e\left(t_k^{-}\right))\right]+{\epsilon }_3^{-1}{\widehat{d}}^2\overline{\xi }\overline{\psi }q.\hfill \end{array}$

For the fourth term, we obtain:

(25)$\begin{array}{cc}\hfill \mathbb{E}\left[W^T\left(t_k\right)PW\left(t_k\right)\right]=& \mathbb{E}\left[d_k^2{\xi }^T\left(t_k\right){(E\mathrm{\Psi }\left(t_k\right)\otimes I_n)}^{T}P(E\mathrm{\Psi }\left(t_k\right)\otimes I_n)\xi \left(t_k\right)\right]\le {\widehat{d}}^2\overline{\xi }\overline{\psi }q.\hfill \end{array}$

In summary, through (23)–(25), we reach the following conclusion:

(26)$\begin{array}{cc}\hfill \mathbb{E}\left[V(t_k^{+},e\left(t_k^{+}\right))\right]\le & d^2({\epsilon }_{3}q{b}^{-1}+1)\mathbb{E}[V(t_k^{-},e\left(t_k^{-}\right))+{\widehat{d}}^2\overline{\xi }\overline{\psi }q({\epsilon }_3^{-1}+1)\hfill \\ \hfill \le & \sigma \mathbb{E}\left[V(t_k^{-},e\left(t_k^{-}\right))\right]+\eta ,\hfill \end{array}$

where $\sigma =d^2({\epsilon }_{3}q{b}^{-1}+1)$ and $\eta ={\widehat{d}}^2\overline{\xi }\overline{\psi }q({\epsilon }_3^{-1}+1)$.

In this part, the mathematical induction method will be used to obtain the overall evolution process of the system, based on (21), which is proven as follows:

For $t\in [t_0,t_1)$, we have

(27)$\begin{array}{c}\hfill \mathbb{E}\left[V(t,e\left(t\right))\right]\le \mathbb{E}\left[V(t_0,e\left(t_0\right))\right]e^{{\int }_{t_0}^{t}H\left(v\right)dv}+\rho {\int }_{t_0}^t{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du.\end{array}$

According to (21) and (26), for any $t\in [t_{m-1},t_m)$, $m\in \mathbb{N}$, suppose that the following inequality holds:

(28)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]& \le {\sigma }^{m-1}\mathbb{E}\left[V(t_0,e\left(t_0\right))\right]e^{{\int }_{t_0}^{t}H\left(v\right)dv}+\sum _{i=0}^{m-2}({\sigma }^{m-i-1}\rho {\int }_{t_i}^{t_{i+1}}{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)\hfill \\ \hfill & \times e^{{\int }_u^{t}H\left(v\right)dv}du+{\sigma }^i\eta e^{{\int }_{t_{m-i-1}}^{t}H\left(v\right)dv})+\rho {\int }_{t_{m-1}}^t{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du.\hfill \end{array}$

For $t\in [t_m,t_{m+1})$, $m\in \mathbb{N}$, a comparative differential equation similar to (20) is established as follows:

(29)$\left\{\begin{array}{c}\dot{y}\left(t\right)=H\left(t\right)y\left(t\right)+\rho {\overline{\omega }}^T\left(t\right)\overline{\omega }\left(t\right)+S,\hfill \\ y\left(t_m\right)={\mathrm{\Phi }}_m.\hfill \end{array}\right.$

where ${\mathrm{\Phi }}_m=\sigma \mathbb{E}\left[V(t_m,e\left(t_m\right))\right]+S$. By solving and comparing the solutions of the differential equations and $S\to 0$, the following result is obtained:

(30)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]& \le \sigma \mathbb{E}\left[V(t_m,e\left(t_m\right))\right]e^{{\int }_{t_m}^{t}H\left(v\right)dv}+\rho {\int }_{t_m}^t{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du\hfill \\ \hfill & \le {\sigma }^m\mathbb{E}\left[V(t_0,e\left(t_0\right))\right]e^{{\int }_{t_0}^{t}H\left(v\right)dv}+\sum _{i=0}^{m-1}({\sigma }^{m-i}\rho {\int }_{t_i}^{t_{i+1}}{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)\hfill \\ \hfill & \times e^{{\int }_u^{t}H\left(v\right)dv}du+{\sigma }^i\eta e^{{\int }_{t_{m-i}}^{t}H\left(v\right)dv})+\rho {\int }_{t_m}^t{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du.\hfill \end{array}$

Based on the definition of $N_{{\tau }^{\prime }}(t,s)$ in Definition 2, Assumption 5 and (30), for any $t\ge t_0$, one finds:

(31)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]\le & {\sigma }^{N_{{\tau }^{\prime }}(t,t_0)}\mathbb{E}\left[V(t_0,e\left(t_0\right))\right]e^{{\int }_{t_0}^{t}H\left(v\right)dv}+\rho {\int }_{t_0}^t{\sigma }^{N_{{\tau }^{\prime }}(t,u)}{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du\hfill \\ \hfill & +\eta {\mathrm{Z}}_{sup}\frac{1-{\left(\sigma {\mathrm{Z}}_{inf}\right)}^{N_{{\tau }^{\prime }}(t,t_0)}}{1-\sigma {\mathrm{Z}}_{sup}}+\rho {\mathrm{Z}}_{sup}{\widehat{\omega }}^2{\tau }_{sup},\hfill \end{array}$

where ${\mathrm{Z}}_{sup}=e^{\gamma {\tau }_{sup}+{\gamma }_0}$ and ${\mathrm{Z}}_{inf}=e^{\gamma {\tau }_{inf}+{\gamma }_0}$. Then, set $\theta =\frac{ln\left({\mathrm{Z}}_{sup}\sigma \right)}{{\tau }_{ave}}+\gamma <0$, and one has:

(32)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]\le & {\sigma }^{\frac{t-t_0}{{\tau }_{ave}}+N_0}{e}^{\gamma (t-t_0)+{\gamma }_0}\mathbb{E}\left[V(t_0,e\left(t_0\right))\right]+\rho {\int }_{t_0}^t{\sigma }^{\frac{t-u}{{\tau }_{ave}}+N_0}{e}^{\gamma (t-u)+{\gamma }_0}{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)du\hfill \\ \hfill & +\eta {\mathrm{Z}}_{sup}\frac{1-{\left(\sigma {\mathrm{Z}}_{inf}\right)}^{\frac{t-t_0}{{\tau }_{ave}}+N_0}}{1-\sigma {\mathrm{Z}}_{sup}}+\rho {\mathrm{Z}}_{sup}{\widehat{\omega }}^2{\tau }_{sup}\hfill \\ \hfill \le & {\sigma }^{N_0}{e}^{{\gamma }_0}{e}^{\theta (t-t_0)}\mathbb{E}\left[V(t_0,e\left(t_0\right))\right]+\rho {\sigma }^{N_0}{e}^{{\gamma }_0}{\int }_{t_0}^t{e}^{\theta (t-u)}{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)du\hfill \\ \hfill & +\eta {\mathrm{Z}}_{sup}\frac{1-{\left(\sigma {\mathrm{Z}}_{inf}\right)}^{\frac{t-t_0}{{\tau }_{ave}}+N_0}}{1-\sigma {\mathrm{Z}}_{sup}}+\rho {\mathrm{Z}}_{sup}{\widehat{\omega }}^2{\tau }_{sup}.\hfill \end{array}$

It follows from (32) that:

(33)$\begin{array}{c}\hfill \underset{t\to +\infty }{lim}\mathbb{E}\left[V(t,e\left(t\right))\right]\le \frac{\rho {\sigma }^{N_0}{e}^{{\gamma }_0}{\widehat{\omega }}^2}{\left|\theta \right|}+\frac{\eta {\mathrm{Z}}_{sup}}{1-\sigma {\mathrm{Z}}_{sup}}+\rho {\mathrm{Z}}_{sup}{\widehat{\omega }}^2{\tau }_{sup}.\end{array}$

As

$\begin{array}{c}\hfill \mathbb{E}\left[{∥e\left(t\right)∥}^2\right]⩽\frac{1}{b}\mathbb{E}\left[V(t,e\left(t\right))\right].\end{array}$

In conclusion, the nonlinear time-varying multi-agent systems with external inputs under deception attacks can achieve quasi-consensus under impulsive protocol (4), and they have the upper bound of error:

$\vartheta =\frac{\rho {\sigma }^{N_0}{e}^{{\gamma }_0}{\widehat{\omega }}^2}{b\left|\theta \right|}+\frac{\eta {\mathrm{Z}}_{sup}}{b(1-\sigma {\mathrm{Z}}_{sup})}+b^{-1}\rho {\mathrm{Z}}_{sup}{\widehat{\omega }}^2{\tau }_{sup}.$

□

Remark 2.

Different from the works [31,32,35], the deception attacks in this paper mainly focus on the false data injection attacks in impulsive form. Note that the time-varying matrix in [37] assumes that $B^T\left(t\right)B\left(t\right)\le K{I}_n$ with $0<K<+\infty$, and this bounded condition is removed here. In [35], the quasi-consensus problem of time-invariant systems under deception attacks is considered. Compare with [35], this paper takes into account external inputs, deception attacks and time-varying dynamics, which have greater significance in practice.

Remark 3.

Based on the continuous time evolution characteristics of the system, a reasonable assumption is constructed as (9). In addition, it can be seen from (21) that the system is always unstable without a control protocol. If the system is stable, then (9) can be changed to:

(34) ${\int }_s^{t}H\left(v\right)dv\le -\gamma (t-s)-{\gamma }_0,0\le s<t.$

Corollary 1.

Under Assumptions 1–5, if there exists a positive definite matrix P and positive scalars ${\epsilon }_1$, ${\epsilon }_2$, ${\epsilon }_3$, γ, ${\kappa }_1$, ${\kappa }_2$ and ${\gamma }_0\ge 0$, the condition (34), and the following condition is satisfied:

(35) $\tilde{\theta }=\frac{ln\left({\mathrm{Z}}_{nd}\sigma \right)}{{\tau }_{ave}}-\gamma <0,$

where ${\mathrm{Z}}_{nd}=e^{-\gamma {\tau }_{inf}-{\gamma }_0}$. Then, the nonlinear time-varying multi-agent system (1) with external inputs and deception attacks can achieve quasi-consensus under the control protocol (4), and the upper bound of error can be estimated as:

(36) ${\vartheta }^{{}^{\prime }}=\frac{\rho {\sigma }^{N_0}{e}^{-{\gamma }_0}{\widehat{\omega }}^2}{b\left|\tilde{\theta }\right|}+\frac{\eta {\mathrm{Z}}_{nd}}{b(1-\sigma {\mathrm{Z}}_{nd})}+b^{-1}\rho {\mathrm{Z}}_{nd}{\widehat{\omega }}^2{\tau }_{sup}.$

Proof. 

As this inference only involves the assumption of continuous time evolution characteristics of the system, it only needs to prove the first part and the third part according to Theorem 1. According to the solution of (19) and comparison function (20), for $t\in [t_k,t_{k+1})$, $k\in \mathbb{N}$, setting $S\to 0$, one can find:

(37)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]\le & \mathbb{E}\left[V(t_k,e\left(t_k\right))\right]e^{{\int }_{t_k}^{t}H\left(v\right)dv}+\rho {\int }_{t_k}^t{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)e^{{\int }_u^{t}H\left(v\right)dv}du.\hfill \end{array}$

Similarly, we find that, as $S\to 0$

(38)$\begin{array}{cc}\hfill \mathbb{E}\left[V\right(t,e\left(t\right)\left)\right]\le & {\sigma }^{N_0}{e}^{-{\gamma }_0}{e}^{\tilde{\theta }(t-t_0)}\mathbb{E}\left[V(t_0,e\left(t_0\right))\right]+\rho {\sigma }^{N_0}{e}^{-{\gamma }_0}{\int }_{t_0}^t{e}^{\tilde{\theta }(t-u)}{\overline{\omega }}^T\left(u\right)\overline{\omega }\left(u\right)du\hfill \\ \hfill & +\eta {\mathrm{Z}}_{nd}\frac{1-{\left(\sigma {\mathrm{Z}}_{inf}^{{}^{\prime }}\right)}^{\frac{t-t_0}{{\tau }_{ave}}+N_0}}{1-\sigma {\mathrm{Z}}_{nd}}+\rho {\mathrm{Z}}_{nd}{\widehat{\omega }}^2{\tau }_{sup},\hfill \end{array}$

where $Z_{inf}^{{}^{\prime }}=e^{-\gamma {\tau }_{sup}-{\gamma }_0}$. When $t\to +\infty$, we have:

(39)$\begin{array}{cc}\hfill \underset{t\to +\infty }{lim}\mathbb{E}[V(t,e\left(t\right))& ]\le \frac{\rho {\sigma }^{N_0}{e}^{-{\gamma }_0}{\widehat{\omega }}^2}{\left|\tilde{\theta }\right|}+\frac{\eta {\mathrm{Z}}_{nd}}{1-\sigma {\mathrm{Z}}_{nd}}+\rho {\mathrm{Z}}_{nd}{\widehat{\omega }}^2{\tau }_{sup}.\hfill \end{array}$

Hence, the nonlinear time-varying multi-agent system with external inputs and deception attacks can achieve quasi-consensus under control protocol (4), and

${\vartheta }^{{}^{\prime }}=\frac{\rho {\sigma }^{N_0}{e}^{-{\gamma }_0}{\widehat{\omega }}^2}{b\left|\tilde{\theta }\right|}+\frac{\eta {\mathrm{Z}}_{nd}}{b(1-\sigma {\mathrm{Z}}_{nd})}+b^{-1}\rho {\mathrm{Z}}_{nd}{\widehat{\omega }}^2{\tau }_{sup}.$

□

4. Numerical Examples

In this section, a numerical example is provided to verify the applicability of theoretical results. The undirected communication graph of time-varying MASs (1) is shown as Figure 2. From this, we know that

$L=\left[\begin{array}{cccc}2& -1& -1& 0\\ -1& 3& -1& -1\\ -1& -1& 2& 0\\ 0& -1& 0& 1\end{array}\right].$

We consider 3-dimensional time-varying MASs with four agents, i.e., $x_i\left(t\right)=[x_{i1}\left(t\right),$$x_{i2}\left(t\right),x_{i3}{\left(t\right)]}^T$ and $i\in \mathbb{N}[1,4]$. Setting ${\omega }_i\left(t\right)={[0.15cos\left(t\right),-0.2sin\left(t\right),0.3cos\left(t\right)]}^T$, $t_0=0$ and

$\begin{array}{c}\hfill \widehat{\zeta }={({\zeta }_1^T,{\zeta }_2^T,\dots ,{\zeta }_4^T)}^T={\left[\begin{array}{cccc}0.7& -0.2& 1.3& -0.3\\ 0.2& -2.4& 2.5& 0.7\\ 1.6& 0.4& -0.4& 1.4\end{array}\right]}^T.\end{array}$

In addition, let $f(t,x_i\left(t\right),{\omega }_i\left(t\right))={[\mathrm{sat}\left(x_{i1}\left(t\right)\right)+\mathrm{sat}\left({\omega }_{i1}\left(t\right)\right),0,0]}^T$, where $\mathrm{sat}\left(y\left(t\right)\right)=0.5(\left|y\left(t\right)+1\right|-\left|y\left(t\right)-1\right|)$. According to the control protocol designed in (4), Figure 3 describes an impulsive sequence with attack strength $\widehat{d}=0.34$ and impulsive control gain $U_k=-0.35$. On the one hand, we assume that $\widehat{\omega }=1.2$, $P=I_{12}$, ${\xi }_i\left(t\right)={[{\xi }_{i1}\left(t\right),{\xi }_{i2}\left(t\right),{\xi }_{i3}\left(t\right)]}^T$ and ${\xi }_i\left(t\right)={[0.15cos\left(t\right),-0.2sin\left(t\right),0.3cos\left(t\right)]}^T$, then $\overline{\xi }=0.53$.

Considering the influence of an impulsive attack sequence, we adopt a distinctive impulsive signal ${\left\{t_k\right\}}_{k=1}^{+\infty }$, which satisfies (8) and is described as follows:

(40)$\begin{array}{c}\hfill t_k-t_{k-1}=\left\{\begin{array}{c}\tilde{\chi },\mathrm{if}\mathrm{mod}(k,N_0)\ne 0,\hfill \\ N_0({\tau }_{ave}-\tilde{\chi })+\tilde{\chi },\mathrm{if}\mathrm{mod}(k,N_0)=0.\hfill \end{array}\right.\end{array}$

where $\tilde{\chi }$ and ${\tau }_{ave}$ are positive numbers that satisfy $\tilde{\chi }\le {\tau }_{ave}$, $N_0\in \mathbb{N}$. Hence, we find ${\tau }_{inf}={inf}_{k\in \mathbb{N}}\{t_{k+1}-t_k\}=\tilde{\chi }$ and ${\tau }_{sup}={sup}_{k\in \mathbb{N}}\{t_{k+1}-t_k\}=N_0({\tau }_{ave}-\tilde{\chi })+\tilde{\chi }$. We choose $\tilde{\chi }=0.2,N_0=3,{\tau }_{ave}=0.4$, according to (40), and we find that ${\tau }_{inf}=0.2$, ${\tau }_{sup}=0.8$. Choose that ${\kappa }_1={\kappa }_2=0.5,{\epsilon }_1={\epsilon }_2={\epsilon }_3=1$, then $\kappa =0.5$. The parameters of system are set as follows:

$A=\left[\begin{array}{ccc}-1.55& 1.74& 0\\ 1& -1& 1\\ 0.1& -1.8& 0.1\end{array}\right],$

with parameters $T=\mathrm{diag}\{0.4,0.3,0.3\}$, $Q=\mathrm{diag}\{0.6,0.2,0.5\}$ and $B\left(t\right)=\mathrm{diag}\left\{0.2\cos \right(t),-1.5\cos (t),0.4\cos (t\left)\right\}$. In addition, let $\mathbb{E}\left[\alpha \right(t\left)\right]=\alpha =0.5$, $\mathbb{E}\left[\beta \right(t\left)\right]=\beta =0.3$ and $\overline{\psi }=0.5$.

Based on the designed parameters and in consideration of ${\int }_s^{t}H\left(v\right)dv\le 0.1(t-s)+0.65$, then $\gamma =0.1$, ${\gamma }_0=0.65$. $\sigma =d^2({\epsilon }_{3}q{b}^{-1}+1)=0.2$, $\theta =\frac{ln\left({\mathrm{Z}}_{sup}\sigma \right)}{{\tau }_{sup}}+\gamma =-1.037<0$.

As shown in Figure 4, the green curve represents the modulus of the average states of the agents of the time-varying MASs. According to the parameters selected above, the upper bound of error can be calculated $\vartheta =0.5$, which is shown as Figure 5. When $t\to +\infty$, the trajectories of states coincide and the MASs achieves consensus. It can be seen from Figure 5 that, when system (1) disturbed by both external disturbances and impulse deception attacks, the quasi-consensus can be achieved under the control protocol (4), and the error is kept within the error bound. If there is no external disturbances or impulse deception attacks, the consensus of the system can be obtained as shown in Figure 6.

5. Conclusions

In this paper, we studied the quasi-consensus of a class of time-varying MASs suffering from both external inputs and deception attacks. By utilizing the analysis method from [5], we relaxed the restrictive assumption on time-varying matrices. To describe the success of deception attacks, a stochastic variable that obeys a Bernoulli distribution was adopted. By employing the comparison principle, sufficient conditions to ensure quasi-consensus were derived. Finally, a simulation example was given to verify the theoretical results.

Author Contributions

Conceptualization, Z.Z.; methodology, Z.Z. and S.P.; software, Z.Z. and W.F.; validation, Z.Z., S.P. and W.F.; resources, Z.Z.; data curation, Z.Z.; writing—original draft preparation, Z.Z.; writing—review and editing, Z.Z., S.P. and W.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the National Natural Science Foundation of China under Grant 61973092, and in part by the Guangdong Basic and Applied Basic Research Foundation under Grant 2019A1515012104.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:

MASs	Multi-agent systems
DoS	Denial-of-service

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Figures

Figure 1. Configuration of time-varying MASs with external inputs under deception attacks.

Figure 2. Undirected communication graph of time-varying MASs (1).

Figure 3. Impulsive sequence for [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.].

Figure 4. State of four agents.

Figure 5. Trajectories of system errors under external inputs and impulse deception attacks.

Figure 6. Trajectories of system errors without external inputs or impulse deception attacks.

References

1. Xu, S.; Lam, J.; Zou, Y.; Li, J. Robust admissibility of time-varying singular systems with commensurate time delays. Automatica; 2009; 45, pp. 2714-2717. [DOI: https://dx.doi.org/10.1016/j.automatica.2009.07.014]

2. Mazenc, F.; Malisoff, M.; Niculescu, S.I. Reduction model approach for linear time-varying systems with delays. IEEE Trans. Autom. Control; 2014; 59, pp. 2068-2082. [DOI: https://dx.doi.org/10.1109/TAC.2014.2320308]

3. Chen, G.; Yang, Y. Relaxed conditions for the input-to-state stability of switched nonlinear time-varying systems. IEEE Trans. Autom. Control; 2016; 62, pp. 4706-4712. [DOI: https://dx.doi.org/10.1109/TAC.2016.2625979]

4. Hu, W.; Zhu, Q.; Karimi, H.R. Some improved Razumikhin stability criteria for impulsive stochastic delay differential systems. IEEE Trans. Autom. Control; 2019; 64, pp. 5207-5213. [DOI: https://dx.doi.org/10.1109/TAC.2019.2911182]

5. Zhou, B. On asymptotic stability of linear time-varying systems. Automatica; 2016; 68, pp. 266-276. [DOI: https://dx.doi.org/10.1016/j.automatica.2015.12.030]

6. Zhou, B. Stability analysis of non-linear time-varying systems by Lyapunov functions with indefinite derivatives. IET Control Theory Appl.; 2017; 11, pp. 1434-1442. [DOI: https://dx.doi.org/10.1049/iet-cta.2016.1538]

7. Zhou, B.; Egorov, A.V. Razumikhin and Krasovskii stability theorems for time-varying time-delay systems. Automatica; 2016; 71, pp. 281-291. [DOI: https://dx.doi.org/10.1016/j.automatica.2016.04.048]

8. Peng, S.; Deng, F. New criteria on p th moment input-to-state stability of impulsive stochastic delayed differential systems. IEEE Trans. Autom. Control; 2017; 62, pp. 3573-3579. [DOI: https://dx.doi.org/10.1109/TAC.2017.2660066]

9. Zhang, W.; Han, Q.L.; Tang, Y.; Liu, Y. Sampled-data control for a class of linear time-varying systems. Automatica; 2019; 103, pp. 126-134. [DOI: https://dx.doi.org/10.1016/j.automatica.2019.01.027]

10. Yang, J. A Consensus Control for a Multi-Agent System With Unknown Time-Varying Communication Delays. IEEE Access; 2021; 9, pp. 55844-55852. [DOI: https://dx.doi.org/10.1109/ACCESS.2021.3070388]

11. Li, X.; Zhu, J. Event-triggered Weighted Average Consensus in Networks of Dynamic Agents with Time-varying Delay. IFAC-PapersOnLine; 2021; 54, pp. 127-132. [DOI: https://dx.doi.org/10.1016/j.ifacol.2021.11.127]

12. Xu, S.; Wang, B. Noisy Information Based Formation Control of Multi-Agent Systems in Time-Varying Communication Networks. IEEE Access; 2021; 9, pp. 70313-70321. [DOI: https://dx.doi.org/10.1109/ACCESS.2021.3078173]

13. Hu, J.; Wang, Z.; Gao, H.; Stergioulas, L.K. Robust sliding mode control for discrete stochastic systems with mixed time delays, randomly occurring uncertainties, and randomly occurring nonlinearities. IEEE Trans. Ind. Electron.; 2011; 59, pp. 3008-3015. [DOI: https://dx.doi.org/10.1109/TIE.2011.2168791]

14. Duan, Z.; Xiang, Z.; Karimi, H.R. Robust stabilisation of 2D state-delayed stochastic systems with randomly occurring uncertainties and nonlinearities. Int. J. Syst. Sci.; 2014; 45, pp. 1402-1415. [DOI: https://dx.doi.org/10.1080/00207721.2013.835004]

15. Zhang, Z.; Peng, S.; Liu, D.; Wang, Y.; Chen, T. Leader-Following Mean-Square Consensus of Stochastic Multiagent Systems With ROUs and RONs via Distributed Event-Triggered Impulsive Control. IEEE Trans. Cybern.; 2020; [DOI: https://dx.doi.org/10.1109/TCYB.2020.2999359]

16. Almeida, R.; Girejko, E.; Hristova, S.; Malinowska, A. On leader-following consensus in multi-agent systems with discrete updates at random times. Entropy; 2020; 22, 650. [DOI: https://dx.doi.org/10.3390/e22060650]

17. Zhao, C.; Liu, X.; Zhong, S.; Shi, K.; Liao, D.; Zhong, Q. Secure consensus of multi-agent systems with redundant signal and communication interference via distributed dynamic event-triggered control. ISA Trans.; 2021; 112, pp. 89-98. [DOI: https://dx.doi.org/10.1016/j.isatra.2020.11.030]

18. Ahirwar, S.; Swarnkar, R.; Bhukya, S.; Namwade, G. Application of drone in agriculture. Int. J. Curr. Microbiol. Appl. Sci.; 2019; 8, pp. 2500-2505. [DOI: https://dx.doi.org/10.20546/ijcmas.2019.801.264]

19. Du, H.; Zhu, W.; Wen, G.; Duan, Z.; Lü, J. Distributed formation control of multiple quadrotor aircraft based on nonsmooth consensus algorithms. IEEE Trans. Cybern.; 2017; 49, pp. 342-353. [DOI: https://dx.doi.org/10.1109/TCYB.2017.2777463]

20. Chen, J.; Yan, S.; Yang, T.; Tan, S.C.; Hui, S.Y. Practical evaluation of droop and consensus control of distributed electric springs for both voltage and frequency regulation in microgrid. IEEE Trans. Power Electron.; 2018; 34, pp. 6947-6959. [DOI: https://dx.doi.org/10.1109/TPEL.2018.2874495]

21. Rahbari-Asr, N.; Zhang, Y.; Chow, M.Y. Consensus-based distributed scheduling for cooperative operation of distributed energy resources and storage devices in smart grids. IET Gener. Transm. Distrib.; 2016; 10, pp. 1268-1277. [DOI: https://dx.doi.org/10.1049/iet-gtd.2015.0159]

22. Yu, J.; Yu, S.; Yan, Y. Fixed-time stability of stochastic nonlinear systems and its application into stochastic multi-agent systems. IET Control Theory Appl.; 2021; 15, pp. 126-135. [DOI: https://dx.doi.org/10.1049/cth2.12040]

23. Zhang, W.; Ho, D.W.; Tang, Y.; Liu, Y. Quasi-consensus of heterogeneous-switched nonlinear multiagent systems. IEEE Trans. Cybern.; 2019; 50, pp. 3136-3146. [DOI: https://dx.doi.org/10.1109/TCYB.2018.2882191]

24. Zhang, W.; Tang, Y.; Han, Q.L.; Liu, Y. Sampled-Data Consensus of Linear Time-Varying Multiagent Networks With Time-Varying Topologies. IEEE Trans. Cybern.; 2020; [DOI: https://dx.doi.org/10.1109/TCYB.2020.2977720]

25. Luo, H.; Wang, Y.; Zhan, R.; Zhang, X.; Wen, H.; Yang, S. Cluster-Delay Mean Square Consensus of Stochastic Multi-Agent Systems with Impulse Time Windows. Entropy; 2021; 23, 1033. [DOI: https://dx.doi.org/10.3390/e23081033]

26. Zhang, X.; Wang, S. Admissible consensus for descriptor multi-agent systems with exogenous disturbances. Entropy; 2018; 20, 276. [DOI: https://dx.doi.org/10.3390/e20040276]

27. Xu, Y.; Fang, M.; Pan, Y.J.; Shi, K.; Wu, Z.G. Event-triggered output synchronization for nonhomogeneous agent systems with periodic denial-of-service attacks. Int. J. Robust Nonlinear Control; 2021; 31, pp. 1851-1865. [DOI: https://dx.doi.org/10.1002/rnc.5223]

28. Zhang, T.Y.; Ye, D. Distributed event-triggered control for multi-agent systems under intermittently random denial-of-service attacks. Inf. Sci.; 2021; 542, pp. 380-390. [DOI: https://dx.doi.org/10.1016/j.ins.2020.06.070]

29. Pang, Z.H.; Fan, L.Z.; Sun, J.; Liu, K.; Liu, G.P. Detection of stealthy false data injection attacks against networked control systems via active data modification. Inf. Sci.; 2021; 546, pp. 192-205. [DOI: https://dx.doi.org/10.1016/j.ins.2020.06.074]

30. He, W.; Qian, F.; Han, Q.L.; Chen, G. Almost sure stability of nonlinear systems under random and impulsive sequential attacks. IEEE Trans. Autom. Control; 2020; 65, pp. 3879-3886. [DOI: https://dx.doi.org/10.1109/TAC.2020.2972220]

31. Shen, Z.; Yang, F.; Chen, J.; Zhang, J.; Hu, A.; Hu, M. Adaptive Event-Triggered Synchronization of Uncertain Fractional Order Neural Networks with Double Deception Attacks and Time-Varying Delay. Entropy; 2021; 23, 1291. [DOI: https://dx.doi.org/10.3390/e23101291] [PubMed: https://www.ncbi.nlm.nih.gov/pubmed/34682015]

32. Liu, L.; Sun, H.; Ma, L.; Zhang, J.; Bo, Y. Quasi-consensus control for a class of time-varying stochastic nonlinear time-delay multiagent systems subject to deception attacks. IEEE Trans. Syst. Man Cybern. Syst.; 2020; 51, pp. 6863-6873. [DOI: https://dx.doi.org/10.1109/TSMC.2020.2964826]

33. Javanmardi, H.; Dehghani, M.; Mohammadi, M.; Siamak, S.; Hesamzadeh, M.R. BMI-based load frequency control in microgrids under false data injection attacks. IEEE Syst. J.; 2021; [DOI: https://dx.doi.org/10.1109/JSYST.2021.3054947]

34. Li, X.M.; Zhou, Q.; Li, P.; Li, H.; Lu, R. Event-triggered consensus control for multi-agent systems against false data-injection attacks. IEEE Trans. Cybern.; 2019; 50, pp. 1856-1866. [DOI: https://dx.doi.org/10.1109/TCYB.2019.2937951]

35. He, W.; Mo, Z.; Han, Q.L.; Qian, F. Secure impulsive synchronization in Lipschitz-type multi-agent systems subject to deception attacks. IEEE/CAA J. Autom. Sin.; 2020; 7, pp. 1326-1334. [DOI: https://dx.doi.org/10.1109/JAS.2020.1003297]

36. Wang, Q.; Wang, J.L.; Wu, H.N.; Huang, T. Consensus and H_∞ Consensus of Nonlinear Second-Order Multi-Agent Systems. IEEE Trans. Netw. Sci. Eng.; 2020; 7, pp. 1251-1264. [DOI: https://dx.doi.org/10.1109/TNSE.2019.2917287]

37. Wen, G.; Zhai, X.; Peng, Z.; Rahmani, A. Fault-tolerant secure consensus tracking of delayed nonlinear multi-agent systems with deception attacks and uncertain parameters via impulsive control. Commun. Nonlinear Sci. Numer. Simul.; 2020; 82, 105043. [DOI: https://dx.doi.org/10.1016/j.cnsns.2019.105043]