![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
This paper is concerned with the distributed filtering problem for a class of delayed nonlinear systems with random sensor saturation (RSS) under a dynamic event-triggered mechanism. The nonlinear function is assumed to satisfy the Lipschitz condition. A dynamic event-triggered mechanism is employed to further reduce the innovation transmission frequencies among the adjacent nodes. Both the Bernoulli distributed random variables and saturation function are employed to model the phenomenon of RSS. The aim of this paper is to design a sub-optimal filter such that the covariance of the filtering error has an upper bound, which is minimized by appropriately computing the filter gain. Furthermore, the error boundedness is analysed and a sufficient criterion is presented to ensure that the filtering error is mean-square bounded. Finally, a numerical example is provided to verify the effectiveness of the proposed filtering algorithm.
1. Introduction
Wireless sensor network (WSN) can connect a large number of intelligent sensors to work together via the communication networks with limited bandwidth. Compared with the traditional point-to-point sensor system, the WSN has the advantages of scalability, flexibility, low cost and easy installation (Shi et al., Citation2014), which has been widely used in intelligent transportation (Tacconi et al., Citation2010; Yousef et al., Citation2010), process control (Gungor & Hancke, Citation2009; Sun & El-Farra, Citation2012), intelligent household, intelligent medical (Hu et al., Citation2013) and other fields (Ciuonzo et al., Citation2013; Ciuonzo & Salvo Rossi, Citation2017). Accordingly, the filtering problem based on WSN has attracted a great deal of attention. To mention a few, the distributed filtering problem has been investigated in Wen et al. (Citation2018) for discrete-time state-saturated systems with random nonlinearity and measurement loss, where the topological structure of sensor network (SN) has been described by a digraph. In Liu et al. (Citation2019), the distributed filtering problem has been handled for a class of continuous-time stochastic systems over SN with Markovian switching topology, and the considered time-varying topology may stochastically changes among a set of disconnected graphs at every sampling instant. To reduce the communication load, in Shen et al. (Citation2020), the distributed recursive filtering scheme has been designed for stochastic discrete systems subject to Round-Robin protocol, and the matrix simplification technique has been used to tackle the problem of topological sparseness of SN. For 2-D systems with measurement degradations over SN, in Wang et al. (Citation2020), the recursive filter has been designed and an upper bound of the error covariance has been constructed by exploiting the stochastic analysis and the mathematical induction approach.
The network-induced phenomena, which are mainly caused by the network characteristics, could worsen the filtering method performance if not handled properly (Walsh & Ye, Citation2001; Zhang et al., Citation2001; Hu et al., Citation2016). At present, the sensor saturation problem has attracted great interest of researchers (Ding et al., Citation2013; Li et al., Citation2020; Singh, Citation2007). Motivated by the widespread sensor saturation problem, in Hu et al. (Citation2012), a probability-guaranteed finite-horizon filtering algorithm has been given, where the saturation function has been decomposed into a linear part and a sector-bounded nonlinear part. In fact, the sensor saturation may be affected by some uncertain factors, in consequence, it is more practical to investigate the random sensor saturation (RSS) for large-scale SN. In Wang et al. (Citation2012), a novel sensor measurement model has been established to account for the RSS by using a set of Bernoulli distributed white sequences with known conditional probabilities. In consideration of both variance-constrained and
performance, the multi-objective filter has been put forward in Li et al. (Citation2020) for multi-rate time-varying systems with RSS.
It is well recognized that the state delays exist in many real-word systems. Thus, many results have been developed to tackle the delays and avoid the great deterioration of system performance (Chen et al., Citation2019; Chen & Xu, Citation2014). For example, in (Du et al., Citation2016), an optimal filtering algorithm has been developed for a class of networked stochastic systems, where both the state delay and missing measurements have been taken into account. On the other hand, the extended Kalman-type recursive filter has been designed in Mao et al. (Citation2019) for a class of nonlinear stochastic systems subject to missing measurement, fixed time-delay and uniform quantization, where the Round-Robin protocol has been employed to regulate the transmissions and lighten the network transmission burden. In Mao et al. (Citation2017), the recursive filtering algorithm has been designed for a class of delayed nonlinear systems with event-based communication protocols, and a time-varying triggered threshold has been introduced to dynamically regulate the networked communications. In particular, the event-triggering mechanism is a sporadic transmission strategy if the current signal meets a prescribed event generator condition. In order to reduce network load, Arzen (Citation1999) proposed event-triggering mechanism and designed a PID controller. Recently, in order to further save network resources, a dynamic event-triggered mechanism has been put forward in Girard (Citation2015) by introducing dynamic auxiliary variables. Subsequently, the comparisons between static and dynamic event-triggered mechanism have been specified in Ge et al. (Citation2019), where the event-triggered weighted matrix has been obtained by a recursive convex optimization algorithm and a distributed set-membership estimator has been designed. Based on the time-varying topology, the recursive distributed filtering problem has been investigated in Li et al. (Citation2020) for nonlinear time-varying systems under a dynamic event-triggered mechanism. Unfortunately, to the best of the authors' knowledge, the recursive filter design problem has not been thoroughly addressed yet for nonlinear delayed systems with dynamic event-triggering mechanism and RSS. Besides, the boundedness analysis is desirable on handling the issue of corresponding distributed filtering.
Motivated by the above analysis, we aim to address the distributed filter design problem for a class of delayed nonlinear systems with RSS under dynamic event-triggered mechanism. Here, the time-invariant delay is considered. The RSS is modelled by the Bernoulli distributed random variable and a saturation function. Moreover, an auxiliary variable that is correlated with innovation is used to construct the dynamic event-triggered mechanism. The contributions of this paper can be highlighted as follows: (i) the proposed time-varying system is fairly comprehensive that covers time delay, delay-dependent nonlinearity and RSS, thereby better reflecting the engineering reality; (ii) the recursive distributed filtering scheme is developed for the delayed system under the dynamic event-triggered communication mechanism; and (iii) a novel sufficient criterion is given to guarantee a bounded variance of filtering errors in the mean square sense.
Notations The notations used throughout this paper are standard. denotes the n-dimensional Euclidean space.
is the Euclidean norm of real vectors or the spectral norm of real matrices. For a matrix P,
and
represent its transpose and inverse, respectively.
denotes the mathematical expectation of the random variable x. I stands for the identity matrix with appropriate dimension.
represents the trace of matrix P.
represents a block-diagonal matrix with matrices
on the diagonal. Matrices, if their dimensions are not explicitly stated, are assumed to be compatible for algebraic operations.
2. Problem formulation and preliminaries
In this paper, we use a digraph to describe the communication topology of the considered sensor network. The digraph
contains a vertex set
, an edge set
, and an adjacency matrix
with nonnegative elements, where N is the number of sensor nodes. Moreover, we assume that
for all
. The set of neighbours of node
plus the node itself is denoted by
.
Consider the following discrete time-varying systems with RSS:
(1)
(1)
(2)
(2) where k is the sampling instant,
represents the state vector to be estimated, the initial state is
,
denotes the measurement output of ith sensor,
,
,
, and
are known matrices with appropriate dimensions.
and
are zero mean additive noises with covariances
and
, respectively. The random variable
, which describes the phenomenon of RSS, takes value on 0 or 1 with
(3)
(3) where
is a known constant. It is assumed that
,
and
are mutually independent. The saturation function
is defined as
where
(4)
(4) and
is the ith element of the saturation level vector
.
Assumption 2.1
The nonlinear vector function satisfies
and the following bounded condition:
(5)
(5) with
and
are known real constant matrices.
In this paper, the dynamic event-triggered communication protocol is adopted to reduce the network transmission burden. Before presenting a specific event generator function, let us explain some relevant variables.
denotes the one-step prediction at instant k−1 of node i, and the corresponding innovation
can be written as
(6)
(6) Let
represent the last triggering time corresponding to the instant k, and therefore
is the innovation at
. Next, the dynamic event generator function is proposed as follows:
(7)
(7) where
,
and
are given positive scalars. The auxiliary offset variable
in (Equation7
(7)
(7) ) satisfies the following equation:
(8)
(8) where the initial state
is a known constant. In (Equation7
(7)
(7) ) and (Equation8
(8)
(8) ),
and
are prescribed positive scalars satisfying
(9)
(9) The innovation of the ith node will be transmitted to the corresponding nodes to update the innovation recorded by its zero-order holder, if and only if, the function
. Therefore, we define the triggered instant sequence of node i by
, which is determined iteratively by
(10)
(10) Then, the signal used to update the local estimation can be written as follows:
(11)
(11)
Remark 2.1
Now, we explain the differences between k and in order to make the event-triggered mechanism to be understood easily. For example, it can be seen from Figure that k represents the sampling instant of the sensor nodes, while k, k + 3 and k + 4 are the triggered instants of the ith node, respectively. Accordingly,
emphasizes the sense of nearest triggered instant and
is the next triggered instant.
Lemma 2.1
Ge et al., Citation2019
For prescribed positive scalars and
satisfying (Equation9
(9)
(9) ), the auxiliary offset variable
(12)
(12) holds for all
.
Remark 2.2
Note that the dynamic event-triggered mechanism can dynamically adjust the communication frequency. Compared to the static event-triggered function , the auxiliary variable
in (Equation7
(7)
(7) ) described by (Equation8
(8)
(8) ) can be seen as the estimation of
.
is a parameter that is used to adjust the trigger frequency. The dynamic event-triggered mechanism can further reduce the consumption of communication resources. It is easy to see that the impact of
to
is negligible when
. Consequently, the dynamic event-triggered function degenerates into the static event-triggered function. On the other hand, the threshold
of static event-triggered mechanism is time-invariant. By introducing an offset variable generated through the auxiliary systems, the threshold of dynamic event-triggered mechanism is varying and the interval
is dynamically adjusted.
For systems (Equation1(1)
(1) )–(Equation2
(2)
(2) ), the recursive filters to be designed are of the following forms:
(13)
(13)
(14)
(14) where
are the filter parameters to be designed.
Remark 2.3
Compared with the existing results (e.g. Mao et al. (Citation2019), Mao et al. (Citation2017) and Li et al. (Citation2020)), the recursive filtering algorithm to be given has the following features: (i) a new distributed filtering scheme is given for nonlinear delayed systems with RSS and dynamic event-triggered mechanism in a unified framework; (ii) the nonlinear disturbance influenced by both current and delayed information is common in engineering case and the related influences are considered when designing the filter; and (iii) the available information of time delay and dynamic event-triggered mechanism is employed in the filter with hope to compensate the corresponding impacts. Viewed from another perspective, compared to linear matrix inequality method, the advantages of recursive method lie in its potential in the online applications.
Remark 2.4
The problem of the distributed filtering for discrete time-varying delayed system with dynamic event-triggered mechanism in sensor network has very important practical significance in the target tracking field over the underwater sensor networks (USNs). Firstly, in Yu and Choi (Citation2014), a distributed filtering scheme has been given based on sensor network transmission, which can overcome the defects of underwater centralized fusion target tracking algorithm. Secondly, the working conditions and environments of the sensor node are not ideal, and the changes of temperature, salinity, depth and pressure of sea would inevitably cause time delay. Therefore, the study of filtering problem of delayed systems is more suitable from the practical engineering viewpoint. Finally, the sensor nodes in USNs use batteries to provide the energy. Special underwater environment makes it is hard to replace the depleted batteries, that is, the service life of USNs often depends on the life span of the sensor nodes. In Sun et al. (Citation2018), an event-triggered mechanism that adaptively adjusts the sampling interval has been put forward for target tracking over USNs. Overall, the concerned distributed filtering problem has important significance from the engineering background.
Lemma 2.2
Wen et al., Citation2018
For , there exists a real number
such that
where the saturation function
isdefined in (Equation4
(4)
(4) ).
Lemma 2.3
Wen et al., Citation2018
Let be a real-valued matrix and
be a diagonal random matrix. Then, one has
where ° is the Hadamard product and
is defined as
Lemma 2.4
Xie et al., Citation1994
For any given vectors and a positive scalar
, the following inequality holds:
The main objective of this paper is to design a set of distributed filters based on local estimation and triggered innovations such that an upper bound of filtering error covariance is obtained and the desired filter gain is provided to minimize such an upper bound at each time step. Furthermore, a sufficient condition is given to guarantee the mean-square boundedness of the filtering error.
3. Main results
In this section, the forms of one-step prediction error covariance and filtering error covariance are given firstly. Then, the upper bound on the filtering error covariance is calculated by employing the stochastic analysis technique. Moreover, the desired filtering gain is constructed based on the solutions to Riccati-like matrix difference equations. Finally, the boundedness analysis of filtering error is also discussed.
3.1. Design of the filter gain
For node i, let be the one-step prediction error and
represent the filter error. According to (Equation1
(1)
(1) ), (Equation2
(2)
(2) ), (Equation13
(13)
(13) ) and (Equation14
(14)
(14) ), one has
(15)
(15)
(16)
(16) where
. Adding the following zero terms
into the right-hand side of (Equation16
(16)
(16) ) and employing Lemma 2.2, we have
(17)
(17) where
,
.
For notational simplicity, we set
(18)
(18) Based on the above notations, Equations (Equation15
(15)
(15) ) and (Equation17
(17)
(17) ) can be rewritten as follows:
(19)
(19)
(20)
(20) where
, and
.
For the sake of simplifying the calculation, we denote the state covariance of system (Equation1(1)
(1) ) by
. Similarly, the covariance of augmented system state
mentioned in (Equation18
(18)
(18) ) could be written as
.
Lemma 3.1
For given positive scalars
, the sequence of matrices
is always bounded by the solution to the following recursive equation:
(21)
(21) where
with the initial value
, that is to say,
.
Proof.
From Equation (Equation18(18)
(18) ), Equation (Equation1
(1)
(1) ) can be rewritten as a compact form as follows:
(22)
(22) Based on Lemmas 2.2, 2.4 and (Equation22
(22)
(22) ),
can be calculated by
(23)
(23) It is not difficult to see that the terms
(24)
(24) and their transpositions are equal to zero. Then, it follows from (Equation22
(22)
(22) )–(Equation24
(24)
(24) ) and Lemma 2.4 that
Subsequently, in view of (Equation5
(5)
(5) ) and Lemma 2.4, we obtain
(25)
(25) Then, based on the mathematical induction approach, we have
Lemma 3.2
Li et al., Citation2020
For given positive scalars
, under the assumption that
, if the following recursion equation
has a solution
with the initial value
, then
is the upper bound of
.
Lemma 3.3
Given the error covariance at step k, the recursion of the one-step prediction error covariance has the following form
(26)
(26) where
(27)
(27)
Proof.
It follows from (Equation19(19)
(19) ) that
(28)
(28) where
(29)
(29) According to the statistical properties of
, the terms
are equal to zero, then (Equation26
(26)
(26) ) is true.
Lemma 3.4
The covariance matrix of estimation error can be obtained by the following recursion:
(30)
(30) where
Proof.
In terms of (Equation20(20)
(20) ), it is easy to see that
(31)
(31) where
Notice that
is independent with
and
and the expectation of
is a zero matrix, so
are equal to zero. Consequently, the result in (Equation26
(26)
(26) ) can be obtained easily.
It is noted that the filtering error covariance contains unknown terms, hence it is difficult to design the filter gain and ensure the minimization of the trace of the resulted filtering error covariance. In what follows, we derive an upper bound of filtering error covariance, and the trace of the upper bound is minimized by designing proper filter gain matrix at each time step.
Theorem 3.1
For given positive scalars
, consider the covariance matrices of the one-step prediction error and the filtering error in (Equation19
(19)
(19) ) and (Equation20
(20)
(20) ), and assume that the following two discrete-time Riccati-like difference equations:
(32)
(32)
(33)
(33) where
under the initial condition
, have symmetric positive definite solutions. Then, the matrix
is an upper bound of
, i.e.
Proof.
First, we handle the crossed terms of right hand side of (Equation26(26)
(26) ). In light of Lemma 2.4, we have
(34)
(34) where
are positive scalars. It follows from (Equation34
(34)
(34) ) that
(35)
(35) According to similar method of (Equation25
(25)
(25) ), one has
(36)
(36) From (Equation35
(35)
(35) ) and (Equation36
(36)
(36) ), one has
(37)
(37) Secondly, we are ready to deal with the crossed terms of the right hand side of (Equation30
(30)
(30) ). Again, it follows from Lemma 2.4 that
(38)
(38) Review the expression of
in (Equation7
(7)
(7) ) and the innovation
in (Equation11
(11)
(11) ), if
, the innovation of node i will be transmitted, therefore
and
, otherwise
. Furthermore,
are independent of each other, we obtain
(39)
(39) where
is the Kronecker delta function. Subsequently, we rewrite (Equation39
(39)
(39) ) as a compact form
(40)
(40) where
. Also,
can be derived as follows:
(41)
(41) It follows from (38)–(Equation41
(41)
(41) ) that
(42)
(42) Employing Lemmas 2.2 and 2.3, the second term on the right-hand side of (Equation42
(42)
(42) ) satisfies
(43)
(43) where
.
Similarly, as in (Equation43(43)
(43) ), we obtain
(44)
(44)
(45)
(45) With the definition of
and Lemma 2.4, we obtain
(46)
(46) In terms of (Equation21
(21)
(21) ), (Equation45
(45)
(45) ) and (Equation46
(46)
(46) ), we have
(47)
(47)
where
(48)
(48) Next, from (Equation6
(6)
(6) ), we obtain
(49)
(49) From (Equation42
(42)
(42) )–(Equation49
(49)
(49) ), one has
Therefore, we have
and this completes the proof.
Next, we are now ready to minimize the upper bound by appropriately designing the filter parameters. To proceed, let us define the following useful notations:
(50)
(50) where the notation
is employed to denote the new matrix after removing all the zero columns of
.
Theorem 3.2
Consider the distributed filter (Equation13(13)
(13) ), (Equation14
(14)
(14) ) and the upper bound
determined by (Equation33
(33)
(33) ). The parameters
of filter (Equation14
(14)
(14) ) achieving the minimization of
are given by
(51)
(51) where
is given by (Equation50
(50)
(50) ).
Proof.
According to (Equation33(33)
(33) ), the trace of
can be given as follows:
(52)
(52) From the property
and the specialization of
in (Equation18
(18)
(18) ), one has
where Z is a matrix of appropriate dimension. Then, (Equation52
(52)
(52) ) can be rewritten as
(53)
(53) Calculating the partial derivative of the trace of (Equation53
(53)
(53) ) with respect to
and letting it be zero, we have
(54)
(54) Recalling the definition of
, we can rewrite (Equation54
(54)
(54) ) as
(55)
(55) Noting
and substituting it into (Equation55
(55)
(55) ), we get
(56)
(56) Since the matrix
has full row rank, we obtain
(57)
(57) Subsequently, note that matrix
is invertible, we have
(58)
(58) Post-multiplying both sides of (Equation58
(58)
(58) ) by
, one has
(59)
(59) and recalling the definition of
and
in (Equation50
(50)
(50) ), we obtain
(60)
(60) Therefore, the proof is completed.
3.2. Boundedness analysis
In what follows, we will present the sufficient condition to guarantee the mean-square boundedness of the filtering error. Accordingly, an assumption is introduced to facilitate further derivations.
Assumption 3.1
There are positive real numbers ,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
and
such that the following conditions:
(61)
(61) hold for all
.
To begin, we define some notations:
(62)
(62)
Theorem 3.3
Consider the time-varying systems (Equation1(1)
(1) )–(Equation2
(2)
(2) ) with the designed filters as in (Equation13
(13)
(13) )–(Equation14
(14)
(14) ) with filter gain (Equation51
(51)
(51) ). Under Assumption 3.1, the filtering error
is mean-square bounded, i.e.
(63)
(63) if the following inequalities hold
(64)
(64)
Proof.
It follows from (Equation32(32)
(32) ) and Assumption 3.1, we have
(65)
(65) Review the expression of
and Assumption 3.1, one has
(66)
(66) Substituting (Equation66
(66)
(66) ) into (Equation65
(65)
(65) ) leads to
(67)
(67) Since we only care about the non-sparse part of
, (Equation54
(54)
(54) ) can be rewritten as
(68)
(68) Taking the norm for Equation (Equation68
(68)
(68) ) yields that
(69)
(69) Next, it is straightforward to see that
(70)
(70) Then, according to (Equation33
(33)
(33) ) and Assumption 3.1, the norms of second to fifth terms can be magnified as follows
(71)
(71)
(72)
(72)
(73)
(73) and
(74)
(74) So, we can get the following inequality
(75)
(75) Substituting (Equation67
(67)
(67) ) into (Equation75
(75)
(75) ) leads to
(76)
(76) According to the condition given by (Equation64
(64)
(64) ), the sequence
converges eventually, which ends the proof.
Remark 3.1
The main research difficulties can be listed as follows: (i) how to propose a new distributed filtering algorithm for nonlinear delayed systems with RSS under dynamic event-triggered mechanism; and (ii) how to select the appropriate performance index to evaluate the filtering algorithm performance and provide the desirable sufficient condition. To address the above difficulties, the following effort is devoted. On the one hand, an upper bound of second-order moment for auxiliary variable has been obtained by constructing the recursive Equation (Equation8(8)
(8) ) and utilizing triggering conditions (Equation7
(7)
(7) )–(Equation9
(9)
(9) ) as well as Lemma 3.2. When considering the influence of time delay τ, the delay-dependent terms
and
are taken into account in filter (Equation13
(13)
(13) ). Accordingly, a new distributed filtering method of the recursive form is proposed. On the other hand, there are two major types of performance index: error boundedness (Li et al., Citation2020) and monotonicity of the filtering error covariance with respect to the (event-triggered threshold (Liu et al., Citation2018), missing probabilities (Hu et al., Citation2020), quantization accuracy (Liu et al., Citation2020) and so on). In this paper, by utilizing the stochastic analysis technique, the sufficient condition of mean-square boundedness for the upper bound of the filtering error under Assumption 3.1 has been given.
Remark 3.2
It should be noted that the nonlinear function brings some difficulties when deducting the upper bound of filtering error covariance. Specifically, for nonlinear functions shaped like
or
satisfying the Lipschitz condition, we can usually obtain an simple upper bound by using Schur complement lemma as formula (Equation34
(34)
(34) ) in reference (Hu et al., Citation2018). But for the nonlinear functions which satisfy the special Lipschitz condition in this paper, this treatment is no longer applicable. Therefore, we use the properties of Euclidean norm and the trace of matrix as well as Lemma 2.4 to get (Equation25
(25)
(25) ).
4. A numerical example
In this section, a numerical simulation example is presented to illustrate the effectiveness of the proposed distributed filtering scheme. Consider a second-order system, where with dynamic event-triggered strategy (Equation7
(7)
(7) )–(Equation12
(12)
(12) ), RSS described by the random variable
. System parameters
,
,
and
are given as follows:
The nonlinear function
is chosen as
The covariances of the process noise and measurement noise are given by
and
,
,
. In the simulation, the time-delay is
,
is a random vector with mean
and covariance
,
,
. The initial upper bound of states covariance is
The relevant parameters of Assumption 2.1 are chosen as
,
. Suppose that the mean of random variables
are
,
,
, the saturation levels are
,
,
. Other parameters are set as
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
and
. The topology of the sensor network is described by the digraph
, where the set of nodes is
, the set of edges is
, and the adjacency matrix is
The simulation results are plotted in Figures . The real states of all nodes and their estimations are shown in Figures –, and the event-triggered instants are depicted in Figures and , it can be seen that the advantage of DET mechanism is reflected. Moreover, Figures plot the measurement outputs with and without RSS.
For the purpose of comparison, we also present the mean square error (MSE) as follows:
where M denotes the number of Monte Carlo rounds,
and
represent the system state and estimation, respectively. The trace of actual mean square error and the trace of upper bound are obtained with M = 100 in Figure , which confirms that the MSE is bounded by
. The traces of the minimized upper bounds of the filtering error covariance under different triggering cases are shown in Figure . It is well known that the more measurement can be utilized in the filter side, the better estimation accuracy can be ensured and the corresponding filtering error is smaller. In Remark 2.2, we explain that
in (Equation7
(7)
(7) ) can regulate the trigger frequencies. Under the same circumstances, the smaller the value of
is, the larger the traces of the upper-bound
will be obtained. It can be seen from Figure that the minimized upper bounds of the filtering error covariance is decreasing with respect to the increasing of
.
5. Conclusions
In this paper, the distributed filter design problem has been addressed for discrete time-varying delayed systems subject to RSS. The sensors have been employed to transmit the innovation based on a dynamic event-triggered mechanism. The upper bound for filter error covariance have been established since the error covariance cannot be derived directly. Subsequently, the optimal filter gain matrix has been constructed such that the upper bound of filtering error can be minimized at each step. Besides, the corresponding proof has been derived to testify the boundedness of filtering error. Finally, some simulations have been provided to show the validity of main results. The future research topics can be listed as follows: (i) it is of great theoretical value to discuss the filtering problems of nonlinear systems subject to equality constraints; and (ii) inspired by Wang et al. (Citation2020), Li et al. (Citation2019) and Wang et al. (Citation2018), the recursive distributed filtering problems for 2-D delayed systems with more complex networked phenomena will be our future research topics.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
References
- Arzen, K. E. (1999). A simpled event based PID controller. IFAC Proceedings Volumes, 18(2), 8687–8692. https://doi.org/https://doi.org/10.1016/S1474-6670(17)57482-0
- Chen, D., Chen, W., Hu, J., & Liu, H. (2019). Variance-constrained filtering for discrete-time genetic regulatory networks with state delay and random measurement delay. International Journal of Systems Science, 50(2), 231–243. https://doi.org/https://doi.org/10.1080/00207721.2018.1542045
- Chen, D., & Xu, L. (2014). Optimal kalman filtering for a class of state delay systems with randomly multiple sensor delays. Abstract and Applied Analysis, 1, 1–10. https://doi.org/https://doi.org/10.1155/2014/716716
- Ciuonzo, D., Papa, G., Romano, G., Rossi, P. S., & Willett, P. (2013). One-bit decentralized detection with a rao test for multisensor fusion. IEEE Signal Processing Letters, 20(9), 861–864. https://doi.org/https://doi.org/10.1109/LSP.2013.2271847
- Ciuonzo, D., & Salvo Rossi, P. (2017). Distributed detection of a non-cooperative target via generalized locally-optimum approaches. Information Fusion, 36, 261–274. https://doi.org/https://doi.org/10.1016/j.inffus.2016.12.006
- Ding, D., Wang, Z., Hu, J., & Shu, H. (2013). Dissipative control for state-saturated discrete time-varying systems with randomly occurring nonlinearities and missing measurements. International Journal of Control, 86(4), 674–688. https://doi.org/https://doi.org/10.1080/00207179.2012.757652
- Du, J., Xu, L., Liu, Y., Song, Y., & Fan, X. (2016). Linear optimal filtering for time-delay networked systems subject to missing measurements with individual occurrence probability. Neurocomputing, 214, 767–774. https://doi.org/https://doi.org/10.1016/j.neucom.2016.07.008
- Ge, X., Han, Q., & Wang, Z. (2019). A dynamic event-triggered transmission scheme for distributed set-membership estimation over wireless sensor networks. IEEE Transactions on Cybernetics, 49(1), 171–183. https://doi.org/https://doi.org/10.1109/TCYB.2017.2769722
- Girard, A. (2015). Dynamic triggering mechanisms for event-triggered control. IEEE Transactions on Automatic Control, 60(7), 1992–1997. https://doi.org/https://doi.org/10.1109/TAC.9
- Gungor, V. C., & Hancke, G. P. (2009). Industrial wireless sensor networks: challenges, design principles, and technical approaches. IEEE Transactions on Industrial Electronics, 56(10), 4258–4265. https://doi.org/https://doi.org/10.1109/TIE.2009.2015754
- Hu, J., Wang, Z., Dong, H., & Gao, H. (2013). Recent advances on recursive filtering and sliding mode design for networked nonlinear stochastic systems: a survey. Mathematical Problems in Engineering, 12, 1–12. https://doi.org/https://doi.org/10.1155/2013/646059
- Hu, J., Wang, Z., & Gao, H. (2018). Joint state and fault estimation for time-varying nonlinear systems with randomly occurring faults and sensor saturations. Automatica, 97, 150–160. https://doi.org/https://doi.org/10.1016/j.automatica.2018.07.027
- Hu, J., Wang, Z., Gao, H., & Stergioulas, L. K. (2012). Probability-guaranteed H∞ finite-horizon filtering for a class of nonlinear time-varying systems with sensor saturations. Systems & Control Letters, 61(4), 477–484. https://doi.org/https://doi.org/10.1016/j.sysconle.2012.01.005
- Hu, J., Wang, Z., Liu, S., & Gao, H. (2016). A variance-constrained approach to recursive state estimation for time-varying complex networks with missing measurements. Automatica, 64, 155–162. https://doi.org/https://doi.org/10.1016/j.automatica.2015.11.008
- Hu, J., Wang, Z., Liu, G., Jia, C., & Williams, J. (2020). Event-triggered recursive state estimation for dynamical networks under randomly switching topologies and multiple missing measurements. Automatica, 115, 108908. https://doi.org/https://doi.org/10.1016/j.automatica.2020.108908
- Li, J., Hu, J., Chen, D., & Wu, Z. (2020). Distributed extended Kalman filtering for state-saturated nonlinear systems subject to randomly occurring cyberattacks with uncertain probabilities. Advances in Difference Equations, 2020, 437. https://doi.org/https://doi.org/10.1186/s13662-020-02896-3
- Li, D., Liang, J., & Wang, F. (2019). Dissipative networked filtering for two-dimensional systems with randomly occurring uncertainties and redundant channels. Neurocomputing, 369, 1–10. https://doi.org/https://doi.org/10.1016/j.neucom.2019.08.056
- Li, H., Lyu, M., & Du, B. (2020). Event-based multi-objective filtering for multi-rate time-varying systems with random sensor saturation. Kybernetika, 56(1), 81–106. https://doi.org/https://doi.org/10.14736/kyb-2020-1-0081
- Li, Q., Shen, B., Wang, Z., & Sheng, W. (2020). Recursive distributed filtering over sensor networks on gilbert-elliott channels: a dynamic event-triggered approach. Automatica, 113, 108681. https://doi.org/https://doi.org/10.1016/j.automatica.2019.108681
- Liu, Q., Wang, Z., Han, Q., & Jiang, C. (2020). Quadratic estimation for discrete time-varying non-Gaussian systems with multiplicative noises and quantization effects. Automatica, 113, 108714. https://doi.org/https://doi.org/10.1016/j.automatica.2019.108714
- Liu, Q., Wang, Z., He, X., & Zhou, D. (2019). Event-based distributed filtering over Markovian switching topologies. IEEE Transactions on Automatic Control, 64(4), 1595–1602. https://doi.org/https://doi.org/10.1109/TAC.9
- Liu, Q., Wang, Z., He, X., & Zhou, D. H. (2018). Event-triggered resilient filtering with measurement quantization and random sensor failures: monotonicity and convergence. Automatica, 94, 458–464. https://doi.org/https://doi.org/10.1016/j.automatica.2018.03.031
- Mao, J., Ding, D., Song, Y., Liu, Y., & Alsaadi, F. E. (2017). Event-based recursive filtering for time-delayed stochastic nonlinear systems with missing measurements. Signal Processing, 134, 158–165. https://doi.org/https://doi.org/10.1016/j.sigpro.2016.12.004
- Mao, J., Ding, D., Wei, G., & Liu, H. (2019). Networked recursive filtering for time-delayed nonlinear stochastic systems with uniform quantisation under round-robin protocol. International Journal of Systems Science, 50(4), 871–884. https://doi.org/https://doi.org/10.1080/00207721.2019.1586002
- Shen, B., Wang, Z., Wang, D., & Liu, H. (2020). Distributed state-saturated recursive filtering over sensor networks under round-robin protocol. IEEE Transactions on Cybernetics, 50(8), 3605–3615. https://doi.org/https://doi.org/10.1109/TCYB.6221036
- Shi, D., Chen, T., & Shi, L. (2014). Event-triggered maximum likelihood state estimation. Automatica, 50(1), 247–254. https://doi.org/https://doi.org/10.1016/j.automatica.2013.10.005
- Singh, V. (2007). Improved criterion for global asymptotic stability of 2-D discrete systems with state saturation. IEEE Signal Processing Letters, 14(10), 719–722. https://doi.org/https://doi.org/10.1109/LSP.2007.896432
- Sun, Y., & El-Farra, N. H. (2012). Resource aware quasi-decentrali-zed control of networked process systems over wireless sensor networks. Chemical Engineering Science, 69(1), 93–106. https://doi.org/https://doi.org/10.1016/j.ces.2011.10.010
- Sun, Y., Yuan, Y., Li, L., Xu, Q., & Guan, X. (2018). An adaptive sampling algorithm for target tracking in underwater wireless sensor networks. IEEE Access, 6, 68324–68336. https://doi.org/https://doi.org/10.1109/ACCESS.2018.2879536
- Tacconi, D., Miorandi, D., Carreras, I., Chiti, F., & Fantacci, R. (2010). Using wireless sensor networks to support intelligent transportation systems. Ad Hoc Networks, 8(5), 462–473. https://doi.org/https://doi.org/10.1016/j.adhoc.2009.12.007
- Walsh, G. C., & Ye, H. (2001). Scheduling of network control systems. IEEE Control Systems, 21(1), 57–65. https://doi.org/https://doi.org/10.1109/37.898792
- Wang, F., Liang, J., Wang, Z., & Liu, X. (2018). A variance-constrained approach to recursive filtering for nonlinear two-dimensional systems with measurement degradations. IEEE Transactions on Cybernetics, 48(6), 1877–1887. https://doi.org/https://doi.org/10.1109/TCYB.2017.2716400
- Wang, Z., Shen, B., & Liu, X. (2012). H∞ filtering with randomly occurring sensor saturations and missing measurements. Automatica, 48(3), 477–484. https://doi.org/https://doi.org/10.1016/0005-1098(94)00118-3
- Wang, F., Wang, Z., Liang, J., & Liu, X. (2020). Robust finite-horizon filtering for 2-D systems with randomly varying sensor delays. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(1), 220–232. https://doi.org/https://doi.org/10.1109/TSMC.622-1021
- Wang, F., Wang, Z., Liang, J., & Yang, J. (2020). Locally minimum-variance filtering of 2-D systems over sensor networks with measurement degradations: a distributed recursive algorithm. IEEE Transactions on Cybernetics. https://doi.org/https://doi.org/10.1109/TCYB.2020.2989207.
- Wen, C., Wang, Z., Geng, T., & Alsaadi, F. E. (2018). Event-based distributed recursive filtering for state-saturated systems with redundant channels. Information Fusion, 39, 96–107. https://doi.org/https://doi.org/10.1016/j.inffus.2017.04.004
- Xie, L., Soh, Y. C., & de Souza, C. E. (1994). Robust Kalman filtering for uncertain discrete-time systems. IEEE Transactions on Automatic Control, 39(6), 1310–1314. https://doi.org/https://doi.org/10.1109/9.293203
- Yousef, K. M., Al-Karaki, J. N., & Shatnawi, A. M. (2010). Intelligent traffic light flow control system using wireless sensors networks. Journal of Information Science and Engineering, 26(3), 753–768.
- Yu, C. H., & Choi, J. W. (2014). Interacting multiple model filter-based distributed target tracking algorithm in underwater wireless sensor networks. International Journal of Control, Automation and Systems, 12(3), 618–627. https://doi.org/https://doi.org/10.1007/s12555-013-0238-y
- Zhang, W., Branicky, M. S., & Phillips, S. M. (2001). Stability of network control systems. IEEE Control Systems, 21(1), 84–99. https://doi.org/https://doi.org/10.1109/37.898794