932
Views
7
CrossRef citations to date
0
Altmetric
Research Article

Joint state and fault estimation for nonlinear complex networks with mixed time-delays and uncertain inner coupling: non-fragile recursive method

, , &
Pages 603-615 | Received 09 May 2022, Accepted 01 Jun 2022, Published online: 09 Jun 2022

Abstract

In this paper, the non-fragile joint state and fault estimation problem is investigated for a class of nonlinear time-varying complex networks (NTVCNs) with uncertain inner coupling and mixed time-delays. Compared with the constant inner coupling strength in the existing literature, the inner coupling strength is permitted to vary within certain intervals. A new non-fragile model is adopted to describe the parameter perturbations of the estimator gain matrix which is described by zero-mean multiplicative noises. The attention of this paper is focussed on the design of a locally optimal estimation method, which can estimate both the state and the fault at the same time. Then, by reasonably designing the estimator gain matrix, the minimized upper bound of the state estimation error covariance matrix (SEECM) can be obtained. In addition, the boundedness analysis is taken into account, and a sufficient condition is provided to ensure the boundedness of the upper bound of the SEECM by using the mathematical induction. Lastly, a simulation example is provided to testify the feasibility of the joint state and fault estimation scheme.

This article is part of the following collections:
Autonomous and Networked Technologies

1. Introduction

The complex networks (CNs) with complicated coupling structure have been developed rapidly. From then on, the CNs have been widely used to model a lot of practical systems, such as social network, biological network, and electrical power grids. However, it is almost impossible to obtain all node states in practical applications due to the technique and cost constraints. Consequently, it is significant to estimate the states of CNs by resorting to valid state estimation strategy based on the accessible measurement output (Hou et al., Citation2022; Hu et al., Citation2021; Shen et al., Citation2020Citation2022; Zou, Wang, Han, et al., Citation2021). In recent years, the design of state estimation strategy for CNs has received a great deal of research attention (Chen et al., Citation2021; Duan et al., Citation2020; Li et al., Citation2021; Liu, Wang, Liu, et al., Citation2021; Tan et al., Citation2021). Specifically, the variance-constrained recursive state estimation (VCRSE) problem has been investigated in Liu, Wang, Liu, et al. (Citation2021) for a class of stochastic CNs with disordered packet and round-robin-based communication schedule. In addition, a theoretical analysis is given to ensure that the estimation error is bounded in the minimum mean-square error sense. On the other hand, the fault estimation for CNs has stirred some research attention. For example, a joint state and fault issue has been handled in Liu et al. (Citation2022) for a class of nonlinear time-varying coupling CNs subject to saturated measurements, where a sufficient condition has been presented to clarify the boundedness of the error dynamics.

Generally, the analysis and synthesis of the CNs are based on an underlying assumption that the coupling strengths are modelled by known constants. Nevertheless, the coupling strengths may be fluctuated in practical applications due to the noise disturbances or channel congestion (Dong et al., Citation2020; Huang et al., Citation2021; Li & Xu, Citation2021; Luo et al., Citation2021; Sheng et al., Citation2018; Wang et al., Citation2021). Accordingly, some researchers have dedicated to concerning on the CNs with uncertain coupling parameters. For example, in the framework of Kalman-like state estimation, the VCRSE methods have been developed in Gao et al. (Citation2021) and Jia et al. (Citation2020) for nonlinear uncertain coupling CNs, where the bounded coupling parameters have been employed to describe the uncertain coupling perturbations. In addition, Jia et al. (Citation2020) has also introduced a random sequence with known statistical characteristics to embody the random uncertain topologies. Different with the descriptions mentioned above, Wang (Citation2019) has adopted an unknown parameter described by norm bounded uncertainty to model inner coupling parameter perturbation. More generally, the inner coupling matrix may vary in a given interval (Hu et al., Citation2020). Specifically, the VCRSE strategy has been proposed for a class of CNs with uncertain inner coupling structure and a sufficient condition is given to ensure that the error dynamic is mean-square exponentially bounded.

On another frontier of research, the time-delays have gained the tremendous research interest (Gao et al., Citation2020; Geng et al., Citation2021; Ju et al., Citation2021; Li et al., Citation2022Citation2019; Liu et al., Citation2020; Ma et al., Citation2019; Mao et al., Citation2021; Peng et al., Citation2018; Shen et al., Citation2017; Zhang et al., Citation2017; Zou et al., Citation2017; Zou, Wang, Hu, et al., Citation2021), which may give rise to the divergence or oscillation of the networked systems. As everyone knows, the common time-delays mainly include constant time-delays, infinite distributed time-delays, time-varying delays, and so on. Obviously, the analysis and design of state estimation strategy for delayed CNs are more complicated than the delay-free case. Recently, the delay-dependent state estimation issues for CNs have been widely discussed and investigated. For example, a partial-node-based state estimation method against intermittent measurement outliers has been developed in Zou et al. (Citation2022) for a class of delayed CNs, where a sufficient principle regarding the exponentially ultimate boundedness of estimation error has been clarified. By considering the measurable partial-node information, Yu et al. (Citation2021) has investigated the state estimation algorithm design problem for a class of CNs subject to time-varying delays and intermittent dynamic event-triggered schedule, where a sufficient condition to guarantee the exponential stability of error dynamics has been provided. In addition, some authors have gradually paid more attention to the problem of state estimation for CNs with mixed delays and some important results have been published, see e.g. Liu, Shen, et al. (Citation2021) and Wang et al. (Citation2016) for more details. However, it should be pointed out that there are relatively few papers to discuss the VCRSE issue for a class of time-varying CNs with mixed time-delays and fault, which motivates us to carry out such an estimation topic.

In view of the previous analyses, the purpose of this paper is devoted to solving joint state and fault estimation problem for nonlinear time-varying CNs (NTVCNs) with mixed time-delays and uncertain inner coupling. The main three difficulties and challenges encountered are emphasized as: (1) How to deal with the mixed time-delays, uncertain coupling and gain perturbation by means of recursive estimation scheme? (2) How to design the desired estimator gain in the sense of minimum mean-square error at each sampling instant? (3) How to evaluate the algorithm performance based on some certain assumption conditions? Compared with the existing literature, the contributions of this paper can be listed as follows: (i) A novel joint state and fault estimator is constructed in the simultaneous presence of uncertain coupling and gain perturbation; (ii) the estimator gain is parameterized for the purpose of minimizing the trace of the upper bound of SEECM; and (iii) a sufficient condition is given to ensure the uniform boundedness of the developed recursive joint estimation strategy.

Notations. The notations used here are standard. Rn denotes the n dimensional Euclidean space. tr(X) means the trace of the matrix X. The notation X>Y(XY) stands for XY is positive definite (positive semi-definite) for symmetric matrices X and Y. I represents the identity matrix with compatible dimension. For a matrix X, XT and X1 denote the transpose and inverse of the matrix X, respectively. E{} stands for the expectation of a random variable. is the Euclidean norm in Rn.

2. Problem formulation and preliminaries

Consider the following NTVCNs with N network nodes: (1) x~i,h+1=A~i,hx~i,h+g~(x~i,h)+j=1NωijΓ~x~j,hτ1+F~i,hfi,h+D~i,hwi,h,(1) (2) y~i,h=αi,hH~i,hx~i,h+(1αi,h)H~i,hx~i,hτ2+νi,h,(2) where x~i,hRn with initial state x~i,0 denotes the state vector of the ith node at step h, y~i,hRm denotes measurement vector of the ith node, and fi,hRf is the fault vector of the ith node satisfying fi,h+1=fi,h. g~(x~i,h) is a known nonlinear function. τ1 and τ2 represent the known constant time-delays. W=[ωij]N×N is the coupling configuration matrix. The process noise wi,h and the measurement noise νi,h are assumed to be mutually independent zero-mean white Gaussian noises whose covariance matrices are Qi,h>0 and Ri,h>0, respectively. A~i,h, D~i,h and H~i,h are known matrices with appropriate dimensions. The random variable αi,h obeying the Bernoulli distribution satisfies Prob{αi,h=1}=E{αi,h}=α¯i,h,Prob{αi,h=0}=1α¯i,h. In (Equation1), Γ~=diag{γ~1,γ~2,,γ~n} is the inner-couplingmatrix. The following case that the unknown coupling strength γ~i(i=1,2,,N) belongs to a certain range[γ_i,γ¯i] is considered, where γ_i and γ¯i are known with γ_i<γ¯i. Let (3) Γ~1=diag{γ_1+γ¯12,γ_2+γ¯22,,γ_N+γ¯N2},(3) (4) Γ~2=diag{γ_1γ¯12,γ_2γ¯22,,γ_Nγ¯N2},(4) then Γ~ can be written as Γ~=Γ~1+Γ with Γ[Γ~2,Γ~2]. Whereafter Γ~ can be rewritten as (5) Γ~=Γ~1+FΓ~2,FFTI(5) where F=ΓΓ~21.

Setting xi,h=[x~i,hTfi,hT]T, we can get (6) xi,h+1=Ai,hxi,h+g(xi,h)+j=1NωijΓxj,hτ1+Di,hwi,h,(6) (7) yi,h=αi,hHi,hxi,h+(1αi,h)Hi,hxi,hτ2+νi,h,(7) where Ai,h=[A~i,hF~i,h0I],Γ=[Γ~000],g(xi,h)=[g~(x~i,h)0],Di,h=[D~i,h0],Hi,h=[H~i,h0],yi,h=y~i,h.

Assumption 2.1

The nonlinear function g~(x~i,h) is known and satisfies the following Lipschitz condition: g~(ς)g~(ϕ)l(ςϕ), where l is a known constant.

For the augmented NTVCNs, we construct the joint estimator as follows: (8) xˆi,h+1|h=Ai,hxˆi,h|h+g(xˆi,h|h)+j=1NωijΓ1xˆj,hτ1|hτ1,(8) (9) xˆi,h+1|h+1=xˆi,h+1|h+(Ki,h+1+δi,h+1K¯i,h+1)×[yi,h+1α¯i,h+1Hi,h+1xˆi,h+1|h(1α¯i,h+1)Hi,h+1xˆi,hτ2+1|hτ2+1],(9) where Γ1=diag{Γ~1,0}, xˆi,h+1|h and xˆi,h+1|h+1 denote one-step prediction and state estimation, respectively. Ki,h+1 is the estimator gain to be designed at time h + 1. K¯i,h+1 is a known matrix to describe the gain perturbation case. δi,h+1R is a multiplicative noise satisfying E{δi,h+1}=0 and E{δi,h+12}=1. Without loss of generality, assume that x~i,0, wi,h, νi,h and δi,h are mutually independent.

Remark 2.1

In recent years, the delay-dependentKalman-like state estimation problem has been discussed and investigated increasingly. More generally, the mixed time-delays (constant delay and random occurrence delay) have been addressed in this paper. Obviously, the information including the constant delay and random occurrence delay is utilized to construct the joint state estimator (Equation8)–(Equation9), which may deteriorate the joint estimation accuracy without effective handling manner. This paper makes great effort to develop the joint state and fault estimation method against mixed time-delays based on the Kalman-like estimation strategy.

For node i, the one-step prediction error and the estimation error are defined as follows: (10) ei,h+1|h=xi,h+1xˆi,h+1|h,(10) (11) ei,h+1|h+1=xi,h+1xˆi,h+1|h+1,(11) and the corresponding covariance matrices are defined as: (12) Pi,h+1|h=E{ei,h+1|hei,h+1|hT},(12) (13) Pi,h+1|h+1=E{ei,h+1|h+1ei,h+1|h+1T}.(13) According to (Equation6) and (Equation8), the one-step prediction error can be given as: (14) ei,h+1|h=Ai,hei,h|h+g(xi,h)g(xˆi,h|h)+j=1NωijΓ¯xj,hτ1+j=1NωijΓ1ej,hτ1|hτ1+Di,hwi,h,(14) where Γ¯=diag{Γ,0}. Similarly, the estimation error is derived as: (15) ei,h+1|h+1=[Iα¯i,h+1(Ki,h+1+δi,h+1K¯i,h+1)Hi,h+1]ei,h+1|hα~i,h+1(Ki,h+1+δi,h+1K¯i,h+1)Hi,h+1×(xi,h+1xi,hτ2+1)(1α¯i,h+1)×(Ki,h+1+δi,h+1K¯i,h+1)Hi,h+1ei,hτ2+1|hτ2+1(Ki,h+1+δi,h+1K¯i,h+1)νi,h+1,(15) where α~i,h+1=αi,h+1α¯i,h+1.

3. Main results

In this section, the covariance matrices about the one-step prediction error and state estimation error will be calculated and the upper bound of the SEECM will be acquired. Then, the explicit form of the estimator gain will be obtained by solving two Riccati-like difference equations and the upper bound of SEECM is minimized at each sampling moment based on the parameterized gain matrix. To accomplish this section, we introduce the following lemma, which will be very important in the derivations.

Lemma 3.1

Jia et al., Citation2020

For two real vectors x and y with identical dimensions, the following inequality xyT+yxTϵxxT+ϵ1yyT holds, where ϵ>0 is a scalar.

According to the covariance definition, Pi,h+1|h and Pi,h+1|h+1 are presented in the following lemma.

Lemma 3.2

The recursions of the covariance matrices of the one-step prediction error and state estimation error are given by (16) Pi,h+1|h=Ai,hPi,h|hAi,hT+E{[g(xi,h)g(xˆi,h|h)]×[g(xi,h)g(xˆi,h|kh)]T}+j=1Nl=1NωijωilΓ¯×E{xj,hτ1xl,hτ1T}Γ¯T+j=1Nl=1NωijωilΓ1×E{ej,hτ1|hτ1el,hτ1|hτ1T}Γ1T+Di,hQi,hDi,hT+m=16(Ym+YmT)(16) and (17) Pi,h+1|h+1=(Iα¯i,h+1Ki,h+1Hi,h+1)Pi,h+1|h(Iα¯i,h+1Ki,h+1×Hi,h+1)T+α¯i,h+12K¯i,h+1Hi,h+1Pi,h+1|hHi,h+1TK¯i,h+1T+α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1E{xi,h+1xi,h+1T+xi,hτ2+1xi,hτ2+1T}Hi,h+1TKi,h+1T+α¯i,h+1(1α¯i,h+1)×K¯i,h+1Hi,h+1E{xi,h+1xi,h+1T+xi,hτ2+1xi,hτ2+1T}×Hi,h+1TK¯i,h+1T+(1α¯i,h+1)2[Ki,h+1Hi,h+1×Pi,hτ2+1|hτ2+1Hi,h+1TKi,h+1T+K¯i,h+1Hi,h+1×Pi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T]+Ki,h+1Ri,h+1Ki,h+1T+K¯i,h+1Ri,h+1K¯i,h+1T+m1=14(Zm1+Zm1T),(17) where Y1=Ai,hE{ei,h|h[g(xi,h)g(xˆi,h|h)]T},Y2=j=1NωijAi,hE{ei,h|hxj,hτ1T}Γ¯T,Y3=j=1NωijAi,hE{ei,h|hej,hτ1|hτ1T}Γ1T,Y4=j=1NωijE{[g(xi,h)g(xˆi,h|h)]xj,hτ1T}Γ¯T,Y5=j=1NωijE{[g(xi,h)g(xˆi,h|h)]ej,hτ1|kτ1T}Γ1T,Y6=j=1Nl=1NωijωilΓ¯E{xj,hτ1el,hτ1|hτ1T}Γ1T,Z1=(1α¯i,h+1)[Iα¯i,h+1Ki,h+1Hi,h+1]×E{ei,h+1|hei,hτ2+1|hτ2+1T}Hi,h+1TKi,h+1T,Z2=α¯i,h+1(1α¯i,h+1)K¯i,h+1Hi,h+1×E{ei,h+1|hei,hτ2+1|hτ2+1T}Hi,h+1TK¯i,h+1T,Z3=α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1×E{xi,h+1xi,hτ2+1T}Hi,h+1TKi,h+1T,Z4=α¯i,h+1(1α¯i,h+1)K¯i,h+1Hi,h+1×E{xi,h+1xi,hτ2+1T}Hi,h+1TK¯i,h+1T.

Proof.

The proof of this lemma is omitted for brevity.

Subsequently, the following theorem gives the upper bound of SEECM and designs the estimator parameter to optimize the obtained upper bound.

Theorem 3.1

For the augmented NTVCNs described by (Equation6)–(Equation7) and joint estimator designed by (Equation8)–(Equation9), let ϵi>0 (i=1,,13) be known scalars. Under the initial condition 0<Pi,0|0Σi,0|0, if the following two matrix equations (18) Σi,h+1|h=θ1Ai,hΣi,h|hAi,hT+θ2l2tr{Σi,h|h}I+θ3ωij=1Nωij×tr{Γ2Ψj,hτ1|hτ1Γ2T}I+Di,hQi,hDi,hT+θ4ωij=1NωijΓ1Σj,hτ1|hτ1Γ1T,(18) (19) Σi,h+1|h+1=(1+ϵ8)(Iα¯i,h+1Ki,h+1Hi,h+1)Σi,h+1|h×(Iα¯i,h+1Ki,h+1Hi,h+1)T+(1+ϵ9)α¯i,h+12×K¯i,h+1Hi,h+1Σi,h+1|hHi,h+1TK¯i,h+1T+α¯i,h+1×(1α¯i,h+1)Ki,h+1Hi,h+1[(1+ϵ10)Δi,h+1|h+(1+ϵ101)Ξi,hτ2+1|hτ2+1]Hi,h+1TKi,h+1T+α¯i,h+1×(1α¯i,h+1)K¯i,h+1Hi,h+1[(1+ϵ11)Δi,h+1|h+(1+ϵ111)Ξi,hτ2+1|hτ2+1]Hi,h+1TK¯i,h+1T+(1α¯i,h+1)2[(1+ϵ81)Ki,h+1Hi,h+1×Σi,hτ2+1|hτ2+1Hi,h+1TKi,h+1T+(1+ϵ91)K¯i,h+1×Hi,h+1Σi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T]+Ki,h+1×Ri,h+1Ki,h+1T+K¯i,h+1Ri,h+1K¯i,h+1T,(19) where (20) ωi=j=1Nωij,Γ2=diag{Γ~2, 0},θ1=1+ϵ1+ϵ2+ϵ3,θ2=1+ϵ11+ϵ4+ϵ5,θ3=1+ϵ21+ϵ41+ϵ6,θ4=1+ϵ31+ϵ51+ϵ61,Ψj,kτ1|hτ1=(1+ϵ7)xˆj,hτ1|hτ1xˆj,hτ1|hτ1T+(1+ϵ7)Σj,hτ1|kτ1,Δi,h+1|h=(1+ϵ12)Σi,h+1|h+(1+ϵ121)xˆi,h+1|hxˆi,h+1|hT,Ξi,hτ2+1|hτ2+1=(1+ϵ131)xˆi,hτ2+1|hτ2+1×xˆi,hτ2+1|hτ2+1T+(1+ϵ13)Σi,hτ2+1|hτ2+1,(20) have positive-define solutions Σi,h+1|h and Σi,h+1|h+1 at each sampling instant, then one has Pi,h+1|h+1Σi,h+1|h+1. In addition, if the estimator parameter is given as follows: (21) Ki,h+1=(1+ϵ8)α¯i,h+1Σi,h+1|hHi,h+1T×(Σi,h+1H+Ri,h+1)1,(21) where Σi,h+1H=(1+ϵ8)α¯i,h+12Hi,h+1Σi,h+1|hHi,h+1T+α¯i,h+1(1α¯i,h+1)Hi,h+1[(1+ϵ10)Δi,h+1|h+(1+ϵ101)Ξi,hτ2+1|hτ2+1]Hi,h+1T+(1α¯i,h+1)2×(1+ϵ81)Hi,h+1Σi,hτ2+1|hτ2+1Hi,h+1T, then tr(Σi,h+1|h+1) can be minimized at each sampling instant.

Proof.

This theorem is proved by means of the mathematical induction approach. Under the initial condition 0<Pi,0|0Σi,0|0, assuming Pi,h|hΣi,h|h, Pi,h+1|h+1Σi,h+1|h+1 will be furthered verified. Firstly, we aim to seek a matrix Σi,h+1|h satisfying Pi,h+1|hΣi,h+1|h. Based on Lemma 3.1, we have (22) Y1+Y1Tϵ1Ai,hPi,h|hAi,hT+ϵ11E{[g(xi,h)g(xˆi,h|h)]×[g(xi,h)g(xˆi,h|h)]T},(22) (23) Y2+Y2Tϵ21j=1Nl=1NωijωilΓ¯E{xj,hτ1xl,hτ1T}Γ¯T+ϵ2Ai,hPi,h|hAi,hT,(23) (24) Y3+Y3Tϵ31j=1Nl=1NωijωilΓ1E{ej,hτ1|hτ1el,hτ1|hτ1T}Γ1T+ϵ3Ai,hPi,h|hAi,hT,(24) (25) Y4+Y4Tϵ41j=1Nl=1NωijωilΓ¯E{xj,hτ1xl,hτ1T}Γ¯T+ϵ4×E{[g(xi,h)g(xˆi,h|h)][g(xi,h)g(xˆi,h|h)]T},(25) (26) Y5+Y5Tϵ5E{[g(xi,h)g(xˆi,h|h)][g(xi,h)g(xˆi,h|h)]T}+ϵ51j=1Nl=1NωijωilΓ1E{ej,hτ1|hτ1el,hτ1|hτ1T}Γ1T,(26) (27) Y6+Y6Tϵ6j=1Nl=1NωijωilΓ¯E{xj,hτ1xl,hτ1T}Γ¯T+ϵ61j=1Nl=1N×ωijωilΓ1E{ej,hτ1|hτ1el,hτ1|hτ1T}Γ1T.(27) where ϵi>0 (i=1,2,,6) are known scalars. Substituting (Equation22)–(Equation27) into (Equation16) leads to (28) Pi,h+1|hθ1Ai,hPi,h|hAi,hT+θ3j=1Nl=1NωijωilΓ¯E{xj,hτ1xl,hτ1T}×Γ¯T+Di,hQi,hDi,hT+θ2E{[g(xi,h)g(xˆi,h|h)]×[g(xi,h)g(xˆi,h|h)]T}+θ4j=1Nl=1Nωijωil×Γ1E{ej,hτ1|hτ1el,hτ1|hτ1T}Γ1T,(28) where θ1, θ2, θ3, and θ4 are defined in (Equation20). Utilizing Lemma 3.1 yields (29) E{xj,hτ1xj,hτ1T}(1+ϵ7)Pj,hτ1|hτ1+(1+ϵ71)×xˆj,hτ1|hτ1xˆj,hτ1|hτ1T:=Ψj,hτ1|hτ1,(29) where ϵ7 is a positive scalars. Next, let us calculate the second term in (Equation28) (30) j=1Nl=1NωijωilΓ¯E{xj,hτ1xl,hτ1T}Γ¯T12j=1Nl=1NωijωilΓ¯E{xj,hτ1xj,hτ1T+xl,hτ1xl,hτ1T}Γ¯T=ωij=1NωijΓ¯E{xj,hτ1xj,hτ1T}Γ¯Tωij=1Nωijtr{Γ2Ψj,hτ1|hτ1Γ2T}I,(30) where ωi=j=1Nωij and Γ2=diag{Γ~2, 0}. Then, we deal with the fourth term in (Equation28). In view of Assumption 2.1, we obtain (31) E{[g(xi,h)g(xˆi,h|h)][g(xi,h)g(xˆi,h|h)]T}l2tr{Pi,h|h}I.(31) Subsequently, with regard to the fifth term in (Equation28), we have (32) j=1Nl=1NωijωilΓ1E{ej,hτ1|hτ1el,hτ1|hτ1T}Γ1T12j=1Nl=1NωijωilΓ1E{ej,hτ1|hτ1ej,hτ1|hτ1T+el,hτ1|hτ1el,hτ1|hτ1T}Γ1T=ωij=1NωijΓ1Pj,hτ1|hτ1Γ1T,(32) Substituting (Equation29)–(Equation32) into (Equation28), we can obtain (33) Pi,h+1|hθ1Ai,hPi,h|hAi,hT+θ2l2tr{Pi,h|h}I+θ3ωij=1Nωijtr{Γ2Ψj,hτ1|hτ1Γ2T}I+Di,hQi,hDi,hT+θ4ωij=1NωijΓ1Pj,hτ1|hτ1Γ1Tθ1Ai,hΣi,h|hAi,hT+θ2l2tr{Σi,h|h}I+θ3ωij=1Nωijtr{Γ2Ψj,hτ1|hτ1Γ2T}I+Di,hQi,hDi,hT+θ4ωij=1NωijΓ1Σj,hτ1|hτ1Γ1T=Σi,h+1|h,(33) where Ψj,hτ1|hτ1 is defined in (Equation20).

In what follows, we deal with unknown terms in (Equation17). It follows from Lemma 3.1 that (34) Z1+Z1Tϵ8[Iα¯i,h+1Ki,h+1Hi,h+1]Pi,h+1|h[Iα¯i,h+1Ki,h+1×Hi,h+1]T+ϵ81(1α¯i,h+1)2Ki,h+1Hi,h+1×Pi,hτ2+1|hτ2+1Hi,h+1TKi,h+1T,(34) (35) Z2+Z2Tϵ9α¯i,h+12K¯i,h+1Hi,h+1Pi,h+1|hHi,h+1TK¯i,h+1T+ϵ91(1α¯i,h+1)2K¯i,h+1Hi,h+1×Pi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T,(35) (36) Z3+Z3Tϵ10α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1E{xi,h+1xi,h+1T}+ϵ101α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1Hi,h+1TKi,h+1T×E{xi,hτ2+1xi,hτ2+1T}Hi,h+1TKi,h+1T,(36) (37) Z4+Z4Tϵ11α¯i,h+1(1α¯i,h+1)K¯i,h+1Hi,h+1E{xi,h+1xi,h+1T}×Hi,h+1TK¯i,h+1T+ϵ111α¯i,h+1(1α¯i,h+1)K¯i,h+1Hi,h+1×E{xi,hτ2+1xi,hτ2+1T}Hi,h+1TK¯i,h+1T,(37) where ϵ8, ϵ9, ϵ10 and ϵ11 are all positive scalars. Substituting (Equation34)–(Equation37) into (Equation17) yields (38) Pi,h+1|h+1(1+ϵ8)(Iα¯i,h+1Ki,h+1Hi,h+1)Pi,h+1|h(Iα¯i,h+1×Ki,h+1Hi,h+1)T+(1+ϵ9)α¯i,h+12K¯i,h+1Hi,h+1Pi,h+1|h×Hi,h+1TK¯i,h+1T+α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1×E{(1+ϵ10)xi,h+1xi,h+1T+(1+ϵ101)xi,hτ2+1×xi,hτ2+1T}Hi,h+1TKi,h+1T+α¯i,h+1(1α¯i,h+1)K¯i,h+1×Hi,h+1E{(1+ϵ11)xi,h+1xi,h+1T+(1+ϵ111)xi,hτ2+1×xi,hτ2+1T}Hi,h+1TK¯i,h+1T+(1α¯i,h+1)2×[(1+ϵ81)×Ki,h+1Hi,h+1Pi,hτ2+1|hτ2+1Hi,h+1TKi,h+1T+(1+ϵ91)K¯i,h+1Hi,h+1Pi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T]+Ki,h+1Ri,h+1Ki,h+1T+K¯i,h+1Ri,h+1K¯i,h+1T.(38) Similarly, it is easy to know (39) E{xi,h+1xi,h+1T}(1+ϵ12)Pi,h+1|h+(1+ϵ121)xˆi,h+1|hxˆi,h+1|hT:=Δi,h+1|h,(39) (40) E{xi,hτ2+1xi,hτ2+1T}(1+ϵ13)Pi,hτ2+1|hτ2+1+(1+ϵ131)×xˆi,hτ2+1|hτ2+1xˆi,hτ2+1|hτ2+1T:=Ξi,hτ2+1|hτ2+1,(40) where ϵ12 and ϵ13 are positive scalars. Further, considering (Equation39)–(Equation40) and Pi,h+1|hΣi,h+1|h, we can derive (41) Pi,h+1|h+1(1+ϵ8)(Iα¯i,h+1Ki,h+1Hi,h+1)Pi,h+1|h(Iα¯i,h+1×Ki,h+1Hi,h+1)T+(1+ϵ9)α¯i,h+12K¯i,h+1Hi,h+1Pi,h+1|h×Hi,h+1TK¯i,h+1T+α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1×[(1+ϵ10)Δi,h+1|h+(1+ϵ101)Ξi,hτ2+1|hτ2+1]×Hi,h+1TKi,h+1T+α¯i,h+1(1α¯i,h+1)K¯i,h+1Hi,h+1×[(1+ϵ11)Δi,h+1|h+(1+ϵ111)Ξi,hτ2+1|hτ2+1]×Hi,h+1TK¯i,h+1T+(1α¯i,h+1)2[(1+ϵ81)Ki,h+1×Hi,h+1Pi,hτ2+1|hτ2+1Hi,h+1TKi,h+1T+(1+ϵ91)×K¯i,h+1Hi,h+1Pi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T]+Ki,h+1Ri,h+1Ki,h+1T+K¯i,h+1Ri,h+1K¯i,h+1T(1+ϵ8)(Iα¯i,h+1Ki,h+1Hi,h+1)Σi,h+1|h×(Iα¯i,h+1Ki,h+1Hi,h+1)T+(1+ϵ9)α¯i,h+12K¯i,h+1×Hi,h+1Σi,h+1|hHi,h+1TK¯i,h+1T+α¯i,h+1(1α¯i,h+1)×Ki,h+1Hi,h+1[(1+ϵ10)Δi,h+1|h+(1+ϵ101)×Ξi,hτ2+1|hτ2+1]Hi,h+1TKi,h+1T+α¯i,h+1×(1α¯i,h+1)K¯i,h+1Hi,h+1[(1+ϵ11)Δi,h+1|h+(1+ϵ111)Ξi,hτ2+1|hτ2+1]Hi,h+1TK¯i,h+1T+(1α¯i,h+1)2[(1+ϵ81)Ki,h+1Hi,h+1×Σi,hτ2+1|hτ2+1Hi,h+1TKi,h+1T+(1+ϵ91)×K¯i,h+1Hi,h+1Σi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T]+Ki,h+1Ri,h+1Ki,h+1T+K¯i,h+1Ri,h+1K¯i,h+1T:=Σi,h+1|h+1,(41) where Δi,h+1|h and Ξi,hτ2+1|hτ2+1 are defined in (Equation20).

Lastly, we are dedicated to designing the estimator parameter by minimizing tr(Σi,h+1|h+1). Specifically, taking the partial derivation of tr(Σi,h+1|h+1) with respect to Ki,h+1 and setting the partial derivation be zero, we have tr(Σi,h+1|h+1)Ki,h+1=2(1+ϵ8)α¯i,h+1(Iα¯i,h+1Ki,h+1Hi,h+1)Σi,h+1|h×Hi,h+1T+2α¯i,h+1(1α¯i,h+1)Ki,h+1Hi,h+1×[(1+ϵ10)Δi,h+1|h+(1+ϵ101)Ξi,hτ2+1|hτ2+1]×Hi,h+1T+2(1α¯i,h+1)2(1+ϵ81)Ki,h+1Hi,h+1×Σi,hτ2+1|hτ2+1Hi,h+1T+2Ki,h+1Ri,h+1=0. It is evident that Ki,h+1=(1+ϵ8)α¯i,h+1Σi,h+1|hHi,h+1T(Σi,h+1H+Ri,h+1)1, where Σi,h+1H is defined in (Equation21). So far, the theorem is proved. In order to illustrate the practicability of the developed non-fragile joint state and fault estimation algorithm subject to mixed time-delays and uncertain inner coupling for NTVCNs, the following implementation of algorithm is given step by step.

Remark 3.1

The non-fragile joint state and fault estimation algorithm has been proposed in Theorem 3.1 for NTVCNs, which can be recursively carried out based on the initial values and given scaling parameters ϵi (i=1,2,,13). The scaling parameters can be adjusted to improve the feasibility of the developed estimation strategy. A proper selection principle of these parameters is to ensure that the trace of the upper bound of SEECM can be minimized as much as possible. In other words, the estimation performance can be guaranteed by comprehensively adjusting each scale parameter.

Remark 3.2

Recently, the joint state and fault estimation problem has attracted the research attention, as involved in Liu et al. (Citation2022). It should be emphasized that the proposed estimation method pays more attention to the consideration of uncertain network environment, which is mainly reflected in the descriptions of mixed time-delays (constant delay and random occurrence delay), gain perturbation and uncertain coupling. Compared with the existing literature, the investigation can deal with the mixed time-delays and uncertain parameters in the framework of Kalman-like estimation approach.

4. Boundedness analysis

In this part, a sufficient criterion is presented to ensure the boundedness of Σi,h+1|h+1. To proceed, the following assumption is introduced for further derivation.

Assumption 4.1

There exist positive real scalars a_, a¯, d_, d¯, t_1, t¯1, t_2, t¯2, r_, r¯, ψ_1, ψ1 k¯, h_, h¯, δ¯, ξ¯, q_ and q¯ such that a_IAi,hAi,hTa¯I,d_IDi,hDi,hTd¯I,t_1Γ1Γ1Tt¯1I,t_2Γ2Γ2Tt¯2I,r_IRi,hr¯I,K¯i,hK¯i,hTk¯I,ψ_1IΨi,hτ1|kτ1tr{Ψ¯i,hτ1|kτ1}Iψ1I,h_IHi,hHi,hTh¯I,Δi,h+1δ¯I,Ξi,hτ2+1|hτ2+1ξ¯I,q_IQi,hq¯I, are established for each h, τ1 and τ2.

Theorem 4.1

Consider the augmented NTVCNs (Equation6)–(Equation7) with the joint estimator (Equation9)–(Equation10). Based on Assumption 4.1 and p_1IΣi,h|hp¯1I with p_1 and p¯1I being positive scalars, if there exist positive scalars ϵi (i=1,,13) satisfying γp¯2+πp¯1, where (42) γ=2(1+ϵ8)+h¯p¯2(3+ϵ8)h_p_2+(1+ϵ8)2α¯i,h+12h¯r_p¯2,π={(1+ϵ9)α¯i,h+12p¯2h¯+α¯i,h+1(1α¯i,h+1)h¯[(1+ϵ11)δ¯+(1+ϵ111)ξ¯]+(1α¯i,h+1)2(1+ϵ91)k¯p¯1h¯+r¯}k¯,p_2=θ1a_p_1+θ2(n+f)l2p_1+θ3(n+f)ωij=1Nωijt_2ψ_1+θ4(n+f)ωij=1Nωijt_1p_1+d_q_,(42) then Σi,h+1|h+1p¯1I still holds.

Proof.

Based on (Equation18), we get p_2IΣi,h+1|hp¯2I, where p¯2 and p_2 are defined in (Equation42). It is not difficult to obtain that (43) (Iα¯i,h+1Ki,h+1Hi,h+1)Σi,h+1|h×(Iα¯i,h+1Ki,h+1Hi,h+1)T2α¯i,h+12Ki,h+1Hi,h+1Σi,h+1|hHi,h+1TKi,h+1T+2Σi,h+1|h,(43) Substituting (Equation43) into (Equation19) leads to (44) Σi,h+1|h+12(1+ϵ8)Σi,h+1|h+K¯i,h+1Λi,h+1K¯i,h+1T+Ki,h+1×Σi,h+1HKi,h+1T+Ki,h+1Ri,h+1Ki,h+1T,(44) where Σi,h+1H=Σi,h+1H+2α¯i,h+12Hi,h+1Σi,h+1|hHi,h+1T,Λi,h+1=(1+ϵ9)α¯i,h+12Hi,h+1Σi,h+1|hHi,h+1T+(1α¯i,h+1)×α¯i,h+1Hi,h+1[(1+ϵ11)Δi,h+1|h+(1+ϵ111)×Ξi,hτ2+1|hτ2+1]Hi,h+1T+(1α¯i,h+1)2(1+ϵ91)×K¯i,h+1Hi,h+1Σi,hτ2+1|hτ2+1Hi,h+1TK¯i,h+1T+Ri,h+1. Notice that (45) Ki,h+1Σi,h+1HKi,h+1T=(1+ϵ8)2α¯i,h+12Σi,h+1|hHi,h+1T(Σi,h+1H+Ri,h+1)1×Σi,h+1H(Σi,h+1H+Ri,h+1)1Hi,h+1Σi,h+1|h(1+ϵ8)2α¯i,h+12Σi,h+1|hHi,h+1T(Σi,h+1H)1×Hi,h+1Σi,h+1|h(45) and (46) Ki,h+1[2α¯i,h+12Hi,h+1Σi,h+1|hHi,h+1T]Ki,h+1T=(1+ϵ8)2α¯i,h+12Σi,h+1|hHi,h+1T(Σi,h+1H+Ri,h+1)1×[2α¯i,h+12Hi,h+1Σi,h+1|hHi,h+1T]×(Σi,h+1H+Ri,h+1)1Hi,h+1Σi,h+1|h=2(1+ϵ8)α¯i,h+12Σi,h+1|hHi,h+1T(Gi,h+1+Υi,h+1)1×Gi,h+1(Gi,h+1+Υi,h+1)1Hi,h+1Σi,h+1|h2(1+ϵ8)α¯i,h+12Σi,h+1|hHi,h+1TGi,h+11Hi,h+1×Σi,h+1|h,(46) where Gi,h+1=(1+ϵ8)α¯i,h+12Hi,h+1Σi,h+1|hHi,h+1T,Υi,h+1=α¯i,h+1(1α¯i,h+1)Hi,h+1[(1+ϵ10)Δi,h+1|h+(1+ϵ101)Ξi,hτ2+1|hτ2+1]Hi,h+1T+(1α¯i,h+1)2×(1+ϵ81)Hi,h+1Σi,hτ2+1|hτ2+1Hi,h+1T+Ri,h+1. According to Assumption 4.1 and (Equation45)–(Equation46), it is obvious that (47) Ki,h+1Σi,h+1HKi,h+1T(1+ϵ8)α¯i,h+12Σi,h+1|hHi,h+1T[(1+ϵ8)(Σi,h+1H)1+2Gi,h+11]Hi,h+1Σi,h+1|hh¯p¯2(3+ϵ8)h_p_2Σi,h+1|h.(47) Similarly, we can derive (48) Ki,h+1Ri,h+1Ki,h+1T=(1+ϵ8)2α¯i,h+12Σi,h+1|hHi,h+1T(Σi,h+1H+Ri,h+1)1×Ri,h+1(Σi,h+1H+Ri,h+1)1Hi,h+1Σi,h+1|h(1+ϵ8)2α¯i,h+12Σi,h+1|hHi,h+1TRi,h+11Hi,h+1Σi,h+1|h(1+ϵ8)2α¯i,h+12h¯r_p¯2Σi,h+1|h.(48) On the other hand, we have (49) K¯i,h+1Λi,h+1K¯i,h+1T{(1+ϵ9)α¯i,h+12p¯2h¯+α¯i,h+1(1α¯i,h+1)h¯[(1+ϵ11)δ¯+(1+ϵ111)ξ¯]+(1α¯i,h+1)2(1+ϵ91)k¯p¯1h¯+r¯}k¯I.(49) Substituting (Equation47)–(Equation49) into (Equation44), one has (50) Σi,h+1|h+1[2(1+ϵ8)+h¯p¯2(3+ϵ8)h_p_2+(1+ϵ8)2α¯i,h+12h¯r_p¯2]×Σi,h+1|h+{(1+ϵ9)α¯i,h+12p¯2h¯+α¯i,h+1(1α¯i,h+1)×h¯[(1+ϵ11)δ¯+(1+ϵ111)ξ¯]+(1α¯i,h+1)2×(1+ϵ91)k¯p¯1h¯+r¯}k¯I:=γΣi,h+1|h+πI,(50) where γ and π are defined in (Equation42). In terms of condition γp¯2+πp¯1, we can conclude that Σi,h+1|h+1p¯1I and the proof is complete.

Remark 4.1

In terms of the constraint conditions in Assumption 4.1, the sufficient condition with respect to the uniform boundedness is elaborated. In engineering, the Assumption 4.1 can be established due to the energy-limited physical process, which is acceptable and close to the practical requirement.

5. An illustrative example

In this section, we provide the following numerical simulation to verify the effectiveness and validity of the proposed method.

The system matrices are given with the form of A~1,h=[0.10.2(1+cosh)0.20.20.4+0.1sinh0.50.20.40.3],A~2,h=[0.20.2(1+cosh)0.10.20.4+0.1sinh0.30.40.20.5],A~3,h=[0.20.1+0.2cosh0.20.20.4+0.1sinh0.40.40.60.3],F~1,h=[10.50.8],F~2,h=[11.20.4],F~3,h=[10.80.7],D~1,h=[0.20.40.3],D~2,h=[0.20.40.2],D~3,h=[0.10.20.4],H~1,h=[1.820.4]T,H~2,h=[10.50.8]T,H~3,h=[11.80.7]T. The uncertain inner coupling matrix is Γ~=diag{γ~1,γ~2,γ~3} with γ~i[0.1 0.3] (i=1,2,3). The covariances of noises are given by Q1,h=0.13, Q2,h=0.1, Q3,h=0.12, R1,h=0.1, R2,h=0.15 and R3,h=0.12. The estimator gain perturbation matrix K¯i,h satisfies K¯1,h=[0.050.080.050.03]T, K¯2,h=[0.020.020.010.05]T and K¯3,h=[0.020.020.030.04]T. The scaling parameters satisfy ϵ1=0.8, ϵ2=ϵ3=ϵ4=ϵ5=0.5, ϵ6=0.4 and ϵπ=1 (π=7,8,,13). The initial estimations are given by x~ˆ1,0|0=E{x~1,0}=[0.20.10.4]T, x~ˆ2,0|0=E{x~2,0}=[0.11.50.8]T and x~ˆ3,0|0=E{x~3,0}=[0.80.70.8]T. The initial covariance upper bound matrices satisfy Σ1,kτ|kτ=Σ2,kτ|kτ=Σ3,kτ|kτ=0.2I4 with τ=max{τ1,τ2} and kτ0. Other parameters are given by τ1=τ2=4, l = 0.35 and fi,h=0.9.

The nonlinear function g(xi,h)(i=1,2,3) satisfies g(xi,h)=[0.04xi,h10.02xi,h2+0.04xi,h3+0.1sin(xi,h1)0.02xi,h1+0.02xi,h20.06xi,h3+0.2cos(xi,h2)0.04xi,h1+0.08xi,h2+0.03xi,h30], where xi,h=[xi,h1 xi,h2 xi,h3 fi,h]T is the state vector. On the basis of the developed estimation method, the related simulation results are shown in Figures , where the comparisons of the state x1,h and its estimation are shown in Figure . Similarly, the comparisons of the state x2,h and its estimation are shown in Figure  and the comparisons of the state x3,h and its estimation are given in Figure . It can be seen from the estimation results that the presented joint estimation approach is able to effectively estimate the unknown states despite the existence of mixed time-delays, uncertain coupling and gain perturbation. Besides, the fault fi,h and its estimation are plotted in Figure . MSEj (j=1,2,3) are used to represent the mean square error for the jth node. The MSE and the corresponding upper bound are shown in Figure . To illustrate the effect of the time-delays on the estimation accuracy, the comparisons of the MSEj with α¯i,h=0.4 and α¯i,h=0.8 are presented in Figures .

Figure 1. The state and estimation trajectories of x1,h.

Figure 1. The state and estimation trajectories of x1,h.

Figure 2. The state and estimation trajectories of x2,h.

Figure 2. The state and estimation trajectories of x2,h.

Figure 3. The state and estimation trajectories of x3,h.

Figure 3. The state and estimation trajectories of x3,h.

Figure 4. The real fault fi,h and its estimation.

Figure 4. The real fault fi,h and its estimation.

Figure 5. MSE and their upper bounds.

Figure 5. MSE and their upper bounds.

Figure 6. MSE1 with different α¯1,h.

Figure 6. MSE1 with different α¯1,h.

Figure 7. MSE2 with different α¯2,h.

Figure 7. MSE2 with different α¯2,h.

Figure 8. MSE3 with different α¯3,h.

Figure 8. MSE3 with different α¯3,h.

6. Conclusion

In this paper, the non-fragile joint state and fault estimation problem has been solved for NTVCNs with uncertain inner coupling and mixed time-delays. A novel joint estimation method has been designed, which can estimate the state and fault simultaneously. A set of zero-mean multiplicative noises has been used to characterize the variations of the estimator gain. The upper bound of the SEECM has been obtained, which can be minimized at each sampling instant via parameterizing the estimator gain properly. Moreover, a sufficient condition has been given to guarantee that the obtained upper bound is bounded. Finally, a numerical simulation has been given to illustrate the validity and effectiveness of the developed VCRSE algorithms. Based on the obtained results, the potential research directions include the design of the protocol-based VCRSE algorithm, such as the FlexRay protocol in Liu, Wang, Wang, et al. (Citation2021) and adaptive event-triggered communication protocol in Wang et al. (Citation2022).

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work was supported in part by the National Natural Science Foundation of China under Grant 72001059 and 12071102, the Key Foundation of Educational Science Planning in Heilongjiang Province of China under Grant GJB1422069, the Outstanding Youth Science Foundation of Heilongjiang Province of China under Grant YQ2020A004, and the University Nursing Program for Young Scholars with Creative Talents in Heilongjiang Province of China under Grant UNPYSCT-2020186.

References

  • Chen, Y., Meng, X., Wang, Z., & Dong, H. (2021). Event-triggered recursive state estimation for stochastic complex dynamical networks under hybrid attacks. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/TNNLS.2021.3105409.
  • Dong, H., Hou, N., & Wang, Z. (2020). Fault estimation for complex networks with randomly varying topologies and stochastic inner couplings. Automatica, 112(11), 108734. https://doi.org/10.1016/j.automatica.2019.108734.
  • Duan, P., Lv, G., Duan, Z., & Lv, Y. (2020). Resilient state estimation for complex dynamic networks with system model perturbation. IEEE Transactions on Control of Network Systems, 8(1), 135–146. https://doi.org/10.1109/TCNS.6509490
  • Gao, H., Dong, H., Wang, Z., & Han, F. (2021). Recursive minimum-variance filter design for state-saturated complex networks with uncertain coupling strengths subject to deception attacks. IEEE Transactions on Cybernetics. https://doi.org/10.1109/TCYB.2021.3067822.
  • Gao, M., Zhang, W., Sheng, L., & Zhou, D. (2020). Distributed fault estimation for delayed complex networks with round-robin protocol based on unknown input observer. Journal of the Franklin Institute, 357(13), 8678–8702. https://doi.org/10.1016/j.jfranklin.2020.04.012
  • Geng, H., Liu, H., Ma, L., & Yi, X. (2021). Multi-sensor filtering fusion meets censored measurements under a constrained network environment: Advances, challenges and prospects. International Journal of Systems Science, 52(16), 3410–3436. https://doi.org/10.1080/00207721.2021.2005178
  • Hou, N., Li, J., Liu, H., Ge, Y., & Dong, H. (2022). Finite-horizon resilient state estimation for complex networks with integral measurements from partial nodes. Science China Information Sciences, 65(3), 1–15. https://doi.org/10.1007/s11432-020-3243-7
  • Hu, J., Jia, C., Liu, H., Yi, X., & Liu, Y. (2021). A survey on state estimation of complex dynamical networks. International Journal of Systems Science, 52(16), 3351–3367. https://doi.org/10.1080/00207721.2021.1995528
  • Hu, J., Wang, Z., Liu, G.-P., & Zhang, H. (2020). Variance-constrained recursive state estimation for time-varying complex networks with quantized measurements and uncertain inner coupling. IEEE Transactions on Neural Networks and Learning Systems, 31(6), 1955–1967. https://doi.org/10.1109/TNNLS.5962385
  • Huang, C., Xiong, Y., & Wang, W. (2021). Partial-information-based synchronization of complex networks with multiple and event-triggered couplings. Complexity, 2021(3), 1–14. Article No. 6613435.https://doi.org/10.1155/2021/6613435.
  • Jia, C., Hu, J., Lv, C., & Shi, Y. (2020). Optimized state estimation for nonlinear dynamical networks subject to fading measurements and stochastic coupling strength: An event-triggered communication mechanism. Kybernetika, 56(1), 35–56. https://doi.org/10.14736/kyb-2020-1-0035
  • Ju, Y., Tian, X., Liu, H., & Ma, L. (2021). Fault detection of networked dynamical systems: A survey of trends and techniques. International Journal of Systems Science, 52(16), 3390–3409. https://doi.org/10.1080/00207721.2021.1998722
  • Li, J., Wang, Z., Hu, J., Liu, H., & Yi, X. (2022). Communication-protocol-based distributed filtering for general systems over sensor networks: Developments and challenges. International Journal of General Systems. https://doi.org/10.1080/03081079.2022.2052063.
  • Li, J.-Y., Wang, Z., Lu, R., & Xu, Y. (2021). Partial-nodes-based state estimation for complex networks with constrained bit rate. IEEE Transactions on Network Science and Engineering, 8(2), 1887–1899. https://doi.org/10.1109/TNSE.2021.3076113
  • Li, Q., Shen, B., Wang, Z., Huang, T., & Luo, J. (2019). Synchronization control for a class of discrete time-delay complex dynamical networks: A dynamic event-triggered approach. IEEE Transactions on Cybernetics, 49(5), 1979–1986. https://doi.org/10.1109/TCYB.6221036
  • Li, X., & Xu, S. (2021). Multi-sensor complex network data fusion under the condition of uncertainty of coupling occurrence probability. IEEE Sensors Journal, 21(22), 24933–24940. https://doi.org/10.1109/JSEN.2021.3061437
  • Liu, D., Wang, Z., Liu, Y., Alsaadi, F. E., & Alsaadi, F. E. (2021). Recursive state estimation for stochastic complex networks under round-robin communication protocol: Handling packet disorders. IEEE Transactions on Network Science and Engineering, 8(3), 2455–2468. https://doi.org/10.1109/TNSE.2021.3095217
  • Liu, L., Zhang, Y., Zhou, W., Ren, Y., & Li, X. (2020). Event-triggered approach for finite-time state estimation of delayed complex dynamical networks with random parameters. International Journal of Robust and Nonlinear Control, 30(14), 5693–5711. https://doi.org/10.1002/rnc.v30.14
  • Liu, S., Wang, Z., Wang, L., & Wei, G. (2021). Recursive set-membership tate estimation over a FlexRay network. IEEE Transactions on Systems, Man, and Cybernetics: Systems. https://doi.org/10.1109/TSMC.2021.3071390.
  • Liu, Y., Shen, B., & Sun, J. (2021). Stubborn state estimation for complex-valued neural networks with mixed time delays: The discrete time case. Neural Computing and Applications, 34(7), 5449–5464. https://doi.org/10.1007/s00521-021-06707-y
  • Liu, Y., Wang, Z., Zou, L., Zhou, D., & Chen, W.-H. (2022). Joint state and fault estimation of complex networks under measurement saturations and stochastic nonlinearities. IEEE Transactions on Signal and Information Processing Over Networks, 8, 173–186. https://doi.org/10.1109/TSIPN.2022.3150183
  • Luo, Y., Wang, Z., Chen, Y., & Yi, X. (2021). H∞ state estimation for coupled stochastic complex networks with periodical communication protocol and intermittent nonlinearity switching. IEEE Transactions on Network Science and Engineering, 8(2), 1414–1425. https://doi.org/10.1109/TNSE.2021.3058220
  • Ma, L., Wang, Z., Liu, Y., & Alsaadi, F. E. (2019). Distributed filtering for nonlinear time-delay systems over sensor networks subject to multiplicative link noises and switching topology. International Journal of Robust and Nonlinear Control, 29(10), 2941–2959. https://doi.org/10.1002/rnc.v29.10
  • Mao, J., Sun, Y., Yi, X., Liu, H., & Ding, D. (2021). Recursive filtering of networked nonlinear systems: A survey. International Journal of Systems Science, 52(6), 1110–1128. https://doi.org/10.1080/00207721.2020.1868615
  • Peng, H., Lu, R., Xu, Y., & Yao, F. (2018). Dissipative non-fragile state estimation for Markovian complex networks with coupling transmission delays. Neurocomputing, 275(8), 1576–1584. https://doi.org/10.1016/j.neucom.2017.09.096
  • Shen, B., Wang, Z., & Qiao, H. (2017). Event-triggered state estimation for discrete-time multidelayed neural networks with stochastic parameters and incomplete measurements. IEEE Transactions on Neural Networks and Learning Systems, 28(5), 1152–1163. https://doi.org/10.1109/TNNLS.2016.2516030
  • Shen, B., Wang, Z., Wang, D., & Li, Q. (2020). State-saturated recursive filter design for stochastic time-varying nonlinear complex networks under deception attacks. IEEE Transactions on Neural Networks and Learning Systems, 31(10), 3788–3800. https://doi.org/10.1109/TNNLS.5962385
  • Shen, H., Hu, X., Wu, X., He, S., & Wang, J. (2022). Generalized dissipative state estimation of singularly perturbed switched complex dynamic networks with persistent dwell-time mechanism. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 52(3), 1795–1806. https://doi.org/10.1109/TSMC.2020.3034635
  • Sheng, L., Niu, Y., Zou, L., Liu, Y., & Alsaadi, F. E. (2018). Finite-horizon state estimation for time-varying complex networks with random coupling strengths under Round-Robin protocol. Journal of the Franklin Institute, 355(15), 7417–7442. https://doi.org/10.1016/j.jfranklin.2018.07.026
  • Tan, Y., Xiong, M., Zhang, B., & Fei, S. (2021). Adaptive event-triggered nonfragile state estimation for fractional-order complex networked systems with cyber attacks. IEEE Transactions on Systems, Man, and Cybernetics: Systems. 52(4), 2121–2133. https://doi.org/10.1109/TSMC.2021.3049231.
  • Wang, J.-L., Zhang, X.-X., Wen, G., Chen, Y., & Wu, H.-N. (2021). Passivity and finite-time passivity for multi-weighted fractional-order complex networks with fixed and adaptive couplings. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/TNNLS.2021.3103809.
  • Wang, L., Liu, S., Zhang, Y., Ding, D., & Yi, X. (2022). Non-fragile l2- l∞ state estimation for time-delayed artificial neural networks: An adaptive event-triggered approach. International Journal of Systems Science. https://doi.org/10.1080/00207721.2022.2049919.
  • Wang, L., Wang, Z., Huang, T., & Wei, G. (2016). An event-triggered approach to state estimation for a class of complex networks with mixed time delays and nonlinearities. IEEE Transactions on Cybernetics, 46(11), 2497–2508. https://doi.org/10.1109/TCYB.2015.2478860
  • Wang, S. (2019). Adaptive synchronisation of complex networks with non-dissipatively coupled and uncertain inner coupling matrix. Pramana-Journal of Physics, 93(1), 1–10. https://doi.org/10.1007/s12043-019-1748-9
  • Yu, L., Liu, Y., Cui, Y., Alotaibi, N. D., & Alsaadi, F. E. (2021). Intermittent dynamic event-triggered state estimation for delayed complex networks based on partial nodes. Neurocomputing, 459(11), 59–69. https://doi.org/10.1016/j.neucom.2021.06.017
  • Zhang, X.-M., Han, Q.-L., Wang, Z., & Zhang, B.-L. (2017). Neuronal state estimation for neural networks with two additive time-varying delay components. IEEE Transactions on Cybernetics, 47(10), 3184–3194. https://doi.org/10.1109/TCYB.2017.2690676
  • Zou, L., Wang, Z., Gao, H., & Liu, X. (2017). State estimation for discrete-time dynamical networks with time-varying delays and stochastic disturbances under the Round-Robin protocol. IEEE Transactions on Neural Networks and Learning Systems, 28(5), 1139–1151. https://doi.org/10.1109/TNNLS.5962385
  • Zou, L., Wang, Z., Han, Q.-L., & Zhou, D. H. (2021). Moving horizon estimation of networked nonlinear systems with random access protocol. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 51(5), 2937–2948. https://doi.org/10.1109/TSMC.2019.2918002
  • Zou, L., Wang, Z., Hu, J., & Dong, H. (2022). Partial-node-based state estimation for delayed complex networks under intermittent measurement outliers: A multiple-order-holder approach. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/TNNLS.2021.3138979.
  • Zou, L., Wang, Z., Hu, J., Liu, Y., & Liu, X. (2021). Communication-protocol-based analysis and synthesis of networked systems: Progress, prospects and challenges. International Journal of Systems Science, 52(14), 3013–3034. https://doi.org/10.1080/00207721.2021.1917721