Skip to main content
Sensors (Basel, Switzerland) logoLink to Sensors (Basel, Switzerland)
. 2023 Aug 5;23(15):6968. doi: 10.3390/s23156968

Robust Fusion Kalman Estimator of the Multi-Sensor Descriptor System with Multiple Types of Noises and Packet Loss

Jie Zheng 1,*, Wenxia Cui 1, Sian Sun 1
Editors: Gemine Vivone1, Wei Yi1, Paolo Mercorelli1
PMCID: PMC10422304  PMID: 37571750

Abstract

Under the influence of multiple types of noises, missing measurement, one-step measurement delay and packet loss, the robust Kalman estimation problem is studied for the multi-sensor descriptor system (MSDS) in this paper. Moreover, the established MSDS model describes uncertain-variance noises, multiplicative noises, time delay and packet loss phenomena. Different types of noises and packet loss make it more difficult to build the estimators of MSDS. Firstly, MSDS is transformed to the new system model by applying the singular value decomposition (SVD) method, augmented state and fictitious noise approach. Furthermore, the robust Kalman estimator is constructed for the newly deduced augmented system based on the min-max robust estimation principle and Kalman filter theory. In addition, the given estimator consists of four parts, which are the usual Kalman filter, predictor, smoother and white noise deconvolution estimator. Then, the robust fusion Kalman estimator is obtained for MSDS according to the relation of augmented state and the original system state. Simultaneously, the robustness is demonstrated for the actual Kalman estimator of MSDS by using the mathematical induction method and Lyapunov’s equation. Furthermore, the error variance of the obtained Kalman estimator is guaranteed to the upper bound for all admissible uncertain noise variance. Finally, the simulation example of a circuit system is examined to illustrate the performance and effectiveness of the robust estimators.

Keywords: descriptor system, Kalman estimator, unified measurement model, multi-sensor, multiplicative noises, uncertain-variance noises

1. Introduction

The descriptor system is also a singular system, which has a broader structure than the normal system. Furthermore, the descriptor system can describe the non-causal phenomena in real systems, such as robot systems, power systems, image modeling, and economic systems [1,2,3]. The state estimation problem of the descriptor system has been a popular topic in recent years. Many research results and methods have been obtained to solve the estimation problem [4,5,6,7,8,9,10,11,12]. Based on the reduced-order Kalman estimation algorithm [13,14], the singular value decomposition (SVD) method for the descriptor system is presented in [4,7]. The authors of [5] give the least squares method and the maximum likelihood method for the descriptor systems, respectively. In [8], the time domain Wiener filter for the descriptor system is proposed by using the modern time series analysis method. However, the above estimation problems are only studied for the known general descriptor systems.

Moreover, it is well known that the estimator based on the classical Kalman filtering requires that noise statistics and the model parameters are exactly known [11]. However, in many practical systems, there exist many uncertainties such as modelling errors, unmodeled dynamic, random perturbations, missing measurements, measurement delays, multiplicative noises and so on [15,16,17,18]. In order to solve the effect of the uncertainty, the robust estimation is studied for an uncertain system [11]. At present, for the uncertain descriptor system, the Kalman robust filter and predictor are presented [12]. The robust time-varying estimator is proposed for descriptor systems with random one-step measurement delay by using the SVD method, the augmented method, and the fictitious noise approach [19]. However, it should be noted that reference [19] only considers the descriptor with a one-step measurement delay, and other uncertainties are not considered. In [20], the robust centralized and weighted observation fusion (CAWOF) prediction algorithm is derived for the uncertain MSDS with multiplicative noise by using the SVD method and the minimax robustness estimation criterion. Reference [20] only considers the descriptor system with multiplicative noise and uncertain noise. However, packet loss and measurement delay problems have not been taken into account. In [21], the uncertain-variance noises and packet loss problems are solved in the MSDS; however, the effects of multiplicative noise and measurement delay are not considered in the MSDS.

In addition, the estimation accuracy and performance of a single sensor descriptor system can be easily affected by the stability and reliability of the sensor [22]. To improve estimation accuracy and guarantee performance of the considered system, a multi-sensor system has been widely used [23]. For the multi-sensor descriptor system, Kalman filtering is a fundamental tool due to its recursive structure and excellent performance. In general, the fusion method of the Kalman filter can be categorized into three types: centralized fusion, measurement fusion, and distributed state fusion method [24,25]. In [24,26], the authors present distributed fusion algorithms that use optimally weighted fusion criteria with a matrix weight, a diagonal matrix weight, and a scalar weight. These algorithms the address estimation problems in multi-sensor systems, which are typically studied based on the known parameters of the system model and the complete known noise statistical structure. In [25], the fusion Kalman filter algorithm deals with an uncertain nonsingular system with multiplicative noises, missing measurements, and linearly correlated white noises with uncertain variances. However, for a multi-sensor networked descriptor control system, the distributed fusion robust Kalman filter algorithm is proposed in [27]. However, reference [27] only considers uncertain-variance correlated noises and missing measurement problems of the multi-sensor networked descriptor control system.

To date, the robust fusion estimation problem is not solved for MSDS with uncertain-variance noises, multiplicative noises and a unified measurement model, which totally include five kinds of uncertainties which are uncertain-variance noises, multiplicative noises, missing measurements, one-step measurement delays and packet dropouts. Motivated by the aforementioned analysis, for MSDS with the above five uncertainties, the robust estimation problem will be studied. The main contributions and innovations of this paper are as follows: (1) The considered MSDS is novel and challenging, which includes uncertain-variance noises, multiplicative noises, missing measurements, one-step measurement delays and packet dropouts. (2) Applying the SVD method, the augmented state method and the fictitious white noises method, MSDS is transformed to a new standard system only with uncertain-variance noise. (3) Based on the Kalman filter and the relations of the original MSDS and the newly obtained system, the robust Kalman estimators are given for MSDS and the newly obtained augmented system. (4) The robustness is proved for the proposed estimators by using the Lyapunov equation approach and the mathematical induction method.

This paper is organized into seven sections. In Section 2, the system model is given. In Section 3, a new standard augmented state model is presented. The robust Kalman estimator for descriptor system is discussed in Section 4. In Section 5, a robust analysis is discussed. Section 6 presents the numerical simulation results. Finally, Section 7 provides the conclusion.

2. System Description and Preliminaries

Consider MSDS with uncertain-variance noises, multiplicative noises and a unified measurement model

Mx(t+1)=Φx(t)+Γω(t)+Bu(t), (1)
z0i(t)=Hi+l=1naail(t)Hilx(t), (2)
zi(t)=γi(t)z0i(t)+νi(t), (3)
yi(t)=αi(t)zi(t)+(1αi(t))βi(t)zi(t1)+(1αi(t))(1βi(t))yi(t1), i=0,1,,L (4)

where t is a discrete time, x(t)Rn is the state, u(t) is the input, ω(t)Rnw is additive process noise, νi(t)Rmi is additive measurement noise, z0i(t)Rmi is the ith noise-free measurement, ail(t)R1 is multiplicative state-dependent noise, zi(t)Rmi is the measurement of the ith sensor, yi(t)Rmi is the measurement received by estimator to be designed, na and L are the number of multiplicative noises and sensors, respectively. M, Φ, Γ, B and Hi are constant matrices with suitable dimensions.

Assumption 1. 

M is a singular matrix, rank(M)=n1, n1<n, that is, det M=0, and the system (1) is regular.

Assumption 2. 

αi(t), βi(t) and γi(t)(i=0,1,,L) are mutually independent random sequences, obeying Bernoulli distributions with known probabilities of taking 1 or 0, such that

Prob{αi(t)=1}=λαi, Prob{αi(t)=0}=1λαi, 0λαi1, (5)
Prob{βi(t)=1}=λβi, Prob{βi(t)=0}=1λβi, 0λβi1, (6)
Prob{γi(t)=1}=λγi, Prob{γi(t)=0}=1λγi, 0λγi1, i=0,1,,L, (7)

from Assumption 2, it follow that

E[αi(t)]=E[αi2(t)]=λαi, E[βi(t)]=E[βi2(t)]=λβi, E[γi(t)]=E[γi2(t)]=λγi, (8)

zero-means white noises α0i(t), β0i(t) and γ0i(t) are defined as follows:

α0i(t)=αi(t)λαi,β0i(t)=βi(t)λβi,γ0i(t)=γi(t)λγi, (9)

it follow that

E[α0i(t)]=0,E[α0i2(t)]=λαi(1λαi)λα0i,E[α0i(t)α0j(k)]=0, ij, t,k, (10)
E[β0i(t)]=0,E[β0i2(t)]=λβi(1λβi)λβ0i, E[β0i(t)β0j(k)]=0, ij, t,k, (11)
E[γ0i(t)]=0, E[γ0i2(t)]=λγi(1λγi)λγ0i, E[γ0i(t)γ0j(k)]=0, ij, t,k. (12)

Assumption 3. 

ω(t), νi(t) and ail(t) are mutually independent white noises with zero means and the unknown actual variance are Q¯w, R¯i and σ¯αil, respectively, and

E[ω(t)ωT(t)]=Q¯w, E[νi(t)νjT(t)]=R¯iδij,E[ail(t)ajlT(t)]=σ¯αilδij. (13)

The unknown actual variance are, respectively, have known conservative upper bounds, which are

Q¯wQw, R¯iRi,σ¯αilσαil. (14)

Remark 1. 

In real-world measurement, time delay and packet loss may occur at any time. The measurement models (2)–(4) describe a unified measurement model by introducing random sequences αi(t), βi(t) and γi(t), which include the missing measurements, one-step delay measurement and packet dropouts. If γi(t)=1, αi(t)=1, then yi(t)=zi(t). If γi(t)=0, αi(t)=1, then yi(t)=νi(t), which means measurement missed. If αi(t)=0, βi(t)=1, then yi(t)=zi(t1), which means that there is one-step measurement delay. If αi(t)=0, βi(t)=0, then yi(t)=yi(t1), which means packet dropout.

3. New Standard Augmented State Model with Uncertain-Variance Fictitious Noises

Applying the SVD approach, there are non-singular matrices P and Q satisfying

PMQ=M1000,M1=diag{σ1,,σn1}, (15)
PΦQ=Φ11Φ12Φ21Φ22,PΓ=Γ1Γ2,PB=B1B2,HiQ=[Hi1,Hi2], (16)

letting

x(t)=Qx1(t)x2(t), (17)

substituting (15) and (16) into (1) yields

M1000x1(t+1)x2(t+1)=Φ11Φ12Φ21Φ22x1(t)x2(t)+Γ1Γ2ω(t)+B1B2u(t), (18)

then we have two new subsystems

x1(t+1)=Jx1x1(t)+Ux1ω(t)+Gx1u(t), (19)
x2(t)=Jx2x1(t)+Ux2ω(t)+Gx2u(t), (20)

where Jx1=M11(Φ11Φ12Φ221Φ21), Ux1=M11(Γ1Φ12Φ221Γ2), Gx1=M11(B1Φ12Φ221B2), Jx2=Φ221Φ21, Ux2=Φ221Γ2, Gx1=Φ221B2, HiQ in (16) and (17) are substituted into (2), then it is easy to obtain

z0i(t)=Hi1x1(t)+Hi2x2(t)+l=1naαil(t)Hilx(t),

substituting (20) into z0i(t) yields

z0i(t)=(Hi1+Hi2Jx2)x1(t)+Hi2Ux2ω(t)+Hi2Gx2u(t)+l=1naαil(t)Hilx(t), (21)

substituting (21) into (3), it is easy to obtain

zi(t)=γi(t)(Hi1+Hi2Jx2)x1(t)+γi(t)Hi2Ux2ω(t)+γi(t)Hi2Gx2u(t)+γi(t)l=1naαil(t)Hilx(t)+νi(t), (22)

from (9), we have γi(t)=γ0i(t)+λγi, in (22), replacing γi(t) by γ0i(t)+λγi yields

zi(t)=λγi(Hi1+Hi2Jx2)x1(t)+(γ0i(t)+λγi)Hi2Gx2u(t)+νzi(t), (23)

where νzi(t)=γ0i(t)(Hi1+Hi2Jx2)x1(t)+(γ0i(t)+λγi)Hi2Ux2ω(t)+(γ0i(t)+λγi) × l=1naαil(t)Hilx(t)+νi(t), substituting (23) into (4), replacing αi(t) by α0i(t)+λαi and replacing βi(t) by β0i(t)+λβi yield

yi(t)=λαiλγi(Hi1+Hi2Jx2)x1(t)+(α0i(t)+λαi)(γ0i(t)+λγi)Hi2Gx2u(t)+(1λαi)λβizi(t1)+(1λαi)(1λβi)yi(t1)+νyi(t), (24)

where νyi(t)=(α0i(t)+λαi)(γ0i(t)+λγi)l=1naαil(t)Hilx(t)+(α0i(t)+λαi)(γ0i(t)+λγi)Hi2Ux2ω(t)+(α0i(t)+λαi)νi(t)+λαiγ0i(t)(Hi1+Hi2Jx2)x1(t)+α0i(t)γ0i(t)(Hi1+Hi2Jx2)x1(t)+λγiα0i(t)(Hi1+Hi2Jx2)x1(t)+(1λαi)β0i(t)zi(t1)λβiα0i(t)zi(t1)α0i(t)β0i(t)zi(t1)(1λαi)β0i(t)yi(t1)(1λβi)α0i(t)yi(t1)+α0i(t)β0i(t)yi(t1). In order to facilitate the calculation, it is necessary to simplify νyi(t). New parameters Cui(t) and Hui(t)(u=1,2,3,4) are defined, then we can rewrite νyi(t) as

νyi(t)=(α0i(t)+λαi)(γ0i(t)+λγi)l=1naαil(t)Hilx(t)+(α0i(t)+λαi)νi(t)+(α0i(t)+λαi)(γ0i(t)+λγi)Hi2Ux2ω(t)+λαiγ0i(t)(Hi1+Hi2Jx2)x1(t)+u=14Cui(t)Hcuix1(t)zi(t1)yi(t1), (25)

where C1i=α0i(t),C2i=β0i(t),C3i=α0i(t)γ0i(t),C4i=α0i(t)β0i(t),Hc1i=[λγi(Hi1+Hi2Jx2),λβiImi,(1λβi)Imi],Hc2i=[0,(1λαi)Imi,(1λαi)Imi],Hc3i=[(Hi1+Hi2Jx2),0,0],Hc4i=[0,Imi,Imi], defining new white noise variances σcui2=E[CuiCuiT](u=1,2,3,4) as follows

σc1i2=λα0i,σc2i2=λβ0i,σc3i2=λα0iλγ0i,σc4i2=λα0iλβ0i, (26)

let

xai(t)=x1(t)zi(t1)yi(t1),ωai(t)=ωtνzi(t)νyi(t),yai(t)=yi(t)αi(t)γi(t)Hi2Gx2u(t), (27)

then it is easy to obtain the new standard augmented state apace model as follows

xai(t+1)=Φaixai(t)+Γaiωai(t)+Gaiu(t), (28)
yai(t)=Haixai(t)+νyi(t), (29)

where

Φai=Jx100λγi(Hi1+Hi2Jx2)00λαiλγi(Hi1+Hi2Jx2)(1λαi)λβiImi(1λαi)(1λβi)Imi,Γai=Ux1000Imi000Imi,Gai=Gx1γi(t)Hi2Gx20,Hai=[λαiλγi(Hi1+Hi2Jx2),(1λαi)λβiImi,(1λαi)(1λβi)Imi]. (30)

Non-central second order moments are defined as X(t)=E[x(t)xT(t)], X1(t)=E[x1(t)x1T(t)] and Xai(t)=E[xai(t)xaiT(t)], they satisfy the following Lyapunov equations

X1(t+1)=Jx1X1(t)Jx1T+Ux1QwUx1T,Xai(t+1)=ΦaiXai(t)ΦaiT+ΓaiQwai(t)ΓaiT, (31)

and we have corresponding upper values

X¯1(t+1)=Jx1X¯1(t)Jx1T+Ux1Q¯wUx1T,X¯ai(t+1)=ΦaiX¯ai(t)ΦaiT+ΓaiQ¯wai(t)ΓaiT, (32)

with initial values Xai(0)=diag(P01,0,0),X¯ai(0)=diag(P01,0,0), P0=P01***, P¯0=P¯01***.

For the new process noise ωai in (28), it has corresponding conservative variance Qwai and real variance Q¯wai. Similarly, for new measurement noise νyi(t) in (29), it has corresponding conservative variance Rzyi(t) and real variance R¯zyi(t).

Let Rzi(t)=E[νzi(t)νziT(t)], R¯zi(t) is actual variance of νzi(t), the conservative and actual noise variances Rzi(t) and R¯zi(t) are given as follows

Rzi(t)=λγ0i(Hi1+Hi2Jx2)X1(t)(Hi1+Hi2Jx2)T+λγil=1naσαil2HilX(t)HilT+λγiHi2Ux2Qw(Hi2Ux2)T+Ri,R¯zi(t)=λγ0i(Hi1+Hi2Jx2)X¯1(t)(Hi1+Hi2Jx2)T+λγil=1naσ¯αil2HilX(t)HilT+λγiHi2Ux2Q¯w(Hi2Ux2)T+R¯i. (33)

Let Rzyi(t)=E[νyi(t)νyiT(t)], then R¯zyi(t) is the actual variance of νyi(t), the conservative and actual noise variances Rzyi(t) and R¯zyi(t) are given as follows

Rzyi(t)=λαiλγ0i(Hi1+Hi2Jx2)X1(t)(Hi1+Hi2Jx2)T+λαiλγil=1naσαil2HilX(t)HilT+λαiλγiHi2Ux2Qw(Hi2Ux2)T+λαiRi,R¯zyi(t)=λαiλγ0i(Hi1+Hi2Jx2)X¯1(t)(Hi1+Hi2Jx2)T+λαiλγil=1naσ¯αil2HilX¯(t)HilT+λαiλγiHi2Ux2Q¯w(Hi2Ux2)T+λαiR¯i. (34)

In (33) and (34), let

U1i(t)=l=1naσαil2HilX(t)HilT,U2i(t)=(Hi1+Hi2Jx2)X1(t)(Hi1+Hi2Jx2)T,U¯1i(t)=l=1naσ¯αil2HilX¯(t)HilT,U¯2i(t)=(Hi1+Hi2Jx2)X¯1(t)(Hi1+Hi2Jx2)T,U3i(t)=Hi2Ux2Qw(Hi2Ux2)T,U¯3i(t)=Hi2Ux2(t)Q¯w(Hi2Ux2)T, (35)

then (33) and (34) can be simplified into the following equations

Rzi(t)=λγiU1i(t)+λγ0iU2i(t)+λγiU3i(t)+Ri,R¯zi(t)=λγiU¯1i(t)+λγ0iU¯2i(t)+λγiU¯3i(t)+R¯i,Rzyi(t)=λαiλγiU1i(t)+λαiλγ0iU2i(t)+λαiλγiU3i(t)+λαiRi,R¯zyi(t)=λαiλγiU¯1i(t)+λαiλγ0iU¯2i(t)+λαiλγiU¯3i(t)+λαiR¯i. (36)

Substituting (25) into ωai(t) in (27), we have

ωai(t)=Γai(1)u=14Cui(t)Hcuixai(t)+ωai(1)(t), (37)

where Γai(1)=[0,0,Im1]T, ωai(1)(t)=ωtνzi(t)νzyi(1)(t)T, νzyi(1)(t)=αi(t)γi(t)×l=1naαil(t)Hilx(t)+αi(t)γi(t)Hi2Ux2ω(t)+αi(t)νi(t)+λαiγ0i(t)(Hi1+Hi2Jx2)x1(t), we can obtain the conservative and actual variances Qwai(1)(t) and Q¯wai(1)(t) as follows

Qwai(1)(t)=QwλγiQw(Hi2Ux2)TλαiλγiQw(Hi2Ux2)Tλγi(Hi2Ux2)QwRzi(t)Rzyi(t)λαiλγi(Hi2Ux2)QwRzyi(t)TR˘, (38)
Q¯wai(1)(t)=Q¯wλγiQ¯w(Hi2Ux2)TλαiλγiQ¯w(Hi2Ux2)Tλγi(Hi2Ux2)Q¯wR¯zi(t)R¯zyi(t)λαiλγi(Hi2Ux2)Q¯wR¯zyi(t)TR¯˘, (39)

where R˘=λαiλγiU1i(t)+λαi2λγ0iU2i(t)+λαiλγiU3i(t)+λαiRi, R¯˘=λαiλγiU¯1i(t)+λαi2λγ0iU¯2i(t)+λαiλγiU¯3i(t)+λαiR¯i. Defining U4i(t) and U¯4i(t), we have

Qwai(t)=Γai(1)U4i(t)Γai(1)T+Qwai(1)(t),Q¯wai(t)=Γai(1)U¯4i(t)Γai(1)T+Q¯wai(1)(t), (40)

where U4i(t)=u=14σcui2HcuiXai(t)HcuiT,U¯4i(t)=u=14σcui2HcuiX¯ai(t)HcuiT, then we have

Ryi(t)=λαiλγiU1i(t)+λαi2λγ0iU2i(t)+λαiRi+λαiλγiU3i(t)+U4i(t),R¯yi(t)=λαiλγiU¯1i(t)+λαi2λγ0iU¯2i(t)+λαiR¯i+λαiλγiU¯3i(t)+U¯4i(t), (41)

the conservative and actual cross-covariance Sai(t) and S¯ai(t) are defined as follows

Sai(t)=E[ωai(t)νyjT(t)]=λαiλγiQw(Hi2Ux2)TRzyi(t)Ryi(t)δij,S¯ai(t)=E[ω¯ai(t)ν¯yjT(t)]=λαiλγiQ¯w(Hi2Ux2)TR¯zyi(t)R¯yi(t)δij. (42)

Lemma 1 

([28]). (i) Let Ai0,i=0,1,,L, then diag(A1,,AL)0. (ii) Let A0,ARn×n, and Aδ=(Aij)nL×nL, Aij=A, then Aδ0. (iii) Let A0, ARm×m, then for arbitrary CRp×m, CACT0.

Parameters ΔX1(t), ΔX(t), ΔXai(t), ΔRyi(t) and ΔQwai(t) are defined as ΔX1(t)=X1(t)X¯1(t), ΔX(t)=X(t)X¯(t), ΔXai(t)=X1(t)X¯ai(t), ΔRyi(t)=Ryi(t)R¯yi(t), ΔQwai(t)=Qwai(t)Q¯wai(t).

Theorem 1. 

For all admissible uncertain variance Q¯ω, R¯i, σ¯il in (13), all of the following inequalities are true, that is,

ΔX1(t)0,ΔX(t)0,ΔXai(t)0,ΔRyi(t)0,ΔQwai(t)0. (43)

Proof of Theorem 1. 

From (31) and (32), it is easy to obtain

ΔX1(t+1)=Jx1ΔX1(t)Jx1T+Ux1ΔQwUx1T, (44)

with the initial condition ΔX1(0)=X1(0)X1(0)0, ΔQw0, applying Lemma 1, iterating (44) yield ΔX1(t)0.

Let Q=[Q1,Q2], from (17), (19) and (20), it is easy to obtain

x(t)=(Q1+Q2Jx2)x1(t)+Q2Ux2ω(t)+Q2Gx2u(t), (45)
ΔX(t)=(Q1+Q2Jx2)ΔX1(t)(Q1+Q2JX2)T+Q2Ux2ΔQw(Q2Ux2)T, (46)

because of ΔX1(t)0 and ΔQw0, based on Lemma 1, we have ΔX(t)0.

Rewriting Qwai(1)(t) as follows

ΔQwai(1)(t)=D(0)ΔQwΔQwΔQwΔQw00ΔQw00D(0)T+λαiλγiD(1)ΔU1iD(1)T+λγ0iD(2)ΔU2iD(2)T+λαiλγiD(3)ΔU3iD(3)T+λαiD(4)ΔRiD(4)T+0000λγi(1λαi)ΔU1i+λγi(1λαi)ΔU3i+(1λαi)ΔRi0Δ000 (47)

where D(0)=diag{In1,λγiHi1Ux2,λαiλγiHi1Ux2},D(1)=D(3)=D(4)=0Im1Im1,D(2)=diag{In1,Im1,λαiIm1}.

Let ΔU1i=U1iU¯1i, ΔU2i=U2iU¯2i, ΔU3i=U3iU¯3i, from (35), we have

ΔU1i=l=1na(Δσαil2HilX(t)HilT+σαil2HilΔX(t)HilT),ΔU2i=(Hi1+Hi2Jx2)ΔX1(t)(Hi1+Hi2Jx2)T,ΔU3i=Hi2Ux2ΔQw(Hi2Ux2)T, (48)

since Δσαil20, ΔX(t)0, ΔX1(t)0 and ΔQw0, based on Lemma 1, it is easy to obtain

ΔU1i0,ΔU2i0,ΔU3i0, (49)

applying Lemma 1, we can easily obtain ΔQwai(1)(t)0, from (31), (32) and (40), it is easy to obtain ΔXai(t+1) as follows

ΔXai(t+1)=ΦaiΔXai(t)ΦaiT+ΓaiΔQwai(t)ΓaiT (50)
ΔXai(t+1)=ΦaiΔXai(t)ΦaiT+Γai(Γai(1)ΔU4i(t)Γai(1)T+ΔQwai(1)(t))ΓaiT, (51)

then we have

ΔU4i(t)=u=14σcui2HcuiΔXai(t)HcuiT, (52)

we can easily obtain ΔU4i(t)0, with the initial condition ΔXai(0)0. According to (50) and applying mathematical induction, yield ΔXai(t)0, since ΔQwai(1)(t)0, ΔU4i(t)0, from (40), yield ΔQwai(t)0.

From (41), it is easy to obtain

ΔRyi(t)=λαiλγiΔU1i+λαiΔRi+λαi2λγ0iΔU2i+λαiλγiΔU3i, (53)

from (49), yield ΔRyi(t)0. The Proof of Theorem 1 is completed. □

4. Robust Kalman Estimator of Descriptor System

4.1. Conservative Kalman Estimator of New State Space Model

For the new standard system (28) and (29), applying the Kalman filtering algorithm [29] yields the optimal Kalman estimator x^ai(t|t+N) (include filter (N=0), predictor (N=1), smoother (N1))

x^ai(t+1|t)=Ψpi(t)x^ai(t|t1)+Kpi(t)yai(t)+Gai(t), (54)
x^ai(t|t+N)=hatxai(t|t1)+r=0NKi(t|t+r)εi(t+r), N0, (55)
εi(t)=yai(t)Haix^ai(t|t1), (56)

where Ψpi(t)=ΦaiKpi(t)Hai, Kpi(t)=(ΦaiPai(t|t1)HaiT+ΓaiSai(t))Qεi1(t), Qεi(t)=HaiPai(t|t1)HaiT+Ryi(t), Ki(t|t)=Pai(t|t1)HaiTQεi1(t),Ki(t|t+r)=Pai(t|t1)×j=0r1Ψpi(t+j)HaiTεi(t+r), r1, and the conservative prediction error variance satisfies the Riccati equation

Pai(t+1|t)=ΦaiPai(t|t1)ΦaiT(ΦaiPai(t|t1)HaiT+ΓaiSai(t))(HaiPai(t|t1)HaiT+Ryi(t))1×(ΦaiPai(t|t1)HaiT+ΓaiSai(t))T+ΓaiQwaiΓaiT. (57)

The one-step predicting error is defined as x˜ai(t+1|t)=xai(t)x^ai(t+1|t)

x˜ai(t+1|t)=Ψpi(t)x˜ai(t|t1)+[Γai,Kpi(t)]ξwv(t), (58)

where ξwv(t)=ωai(t)νyi(t).

Furthermore, the conservative and the actual variance Λi(t) and Λ¯i(t) are defined as follows

Λi(t)=Qwai(t)Sai(t)SaiT(t)Ryi(t),Λ¯i(t)=Q¯wai(t)S¯ai(t)S¯aiT(t)R¯yi(t). (59)

The conservative and actual one-step prediction error variance Pai(t+1|t) and P¯ai(t+1|t) can be rewritten as the following Lyapunov function

Pai(t+1|t)=Ψpi(t)Pai(t|t1)ΨpiT(t)+[Γai,Kpi(t)]Λi(t)[Γai,Kpi(t)]T (60)
P¯ai(t+1|t)=Ψpi(t)P¯ai(t|t1)ΨpiT(t)+[Γai,Kpi(t)]Λ¯i(t)[Γai,Kpi(t)]T, (61)

with the initial values Pai(1|0)=diag{P01,0,0},P¯ai(1|0)=diag{P¯01,0,0}.

From (29), (56), we have εi(t+r)=Haix˜ai(t+r|t+r1)+νyi(t+r), iterating (58), we can obtain

x˜ai(t|t+N)=ΨN(t)x˜ai(t|t1)+r=0N[KrNw(t),KrNv(t)]ξwv(t+r), (62)

where Ψpi(t+r|t)=Ψpi(t+r1)Ψpi(t) and Ψpi(t|t)=In1+2mi,

ΨN(t)=In1+2mir=0NKi(t|t+r)HaiΨpi(t+r|t),
KrNw(t)=j=r+1NKi(t+r)HaiΨpi(t+j|t+r+1)Γai,KrNw(t)=0, N0,
KrNv(t)=j=r+1NKi(t+r)HaiΨpi(t+j|t+r+1)Kpi(t+r)Ki(t|t+r),KrNv(t)=Ki(t|t+r), N0.

Furthermore, the optimal conservative white noise deconvolution estimator ω^ai(t|t+N) of fictitious noise ωai(t) is

ω^ai(t|t1)=0, (63)
ω^ai(t|t+N)=r=0NMwi(t|t+r)εi(t+r), N0, (64)

where Mwi(t|t)=Sai(t)Qεi1(t),Mwi(t|t)=(Qwai(t)ΓaiTSai(t)KpiT(t))j=0r1ΨpiT(t+j)×HaiTQεi1(t+r), noise estimation error is defined as ω˜ai(t|t+N)=ωai(t)ω^ai(t|t+N), then it is easy to obtain

ω˜ai(t|t+N)=ΨNw(t)x˜ai(t|t1)+r=0N[MrNw(t),MrNv(t)]ξwv(t+r), (65)

where ΨNw(t)=r=0NMwi(t|t+r)HaiΨpi(t+r|t),

M0Nw(t)=Irk=1NMωi(t|t+k)HaiΨpi(t+k|t+1)Γai,MrNw(t)=j=r+1NMωi(t|t+j)HaiΨpi(t+j|t+r+1)Γai,r=0,, N1MNNw(t)=0,
MrNv(t)=j=r+1NMωi(t|t+j)HaiΨpi(t+j|t+r+1)Kpi(t+r)Mωi(t|t+r),MrNv(t)=Mωi(t|t+N).

The conservative and actual estimation error variances Pai(t|t+N) and P¯ai(t|t+N) are defined as follows

Pai(t|t+N)=ΨN(t)Pai(t|t1)ΨNT(t)+r=0N[KrNw(t),KrNv(t)]Λi(t+r)[KrNw(t),KrNv(t)]T,P¯ai(t|t+N)=ΨN(t)P¯ai(t|t1)ΨNT(t)+r=0N[KrNw(t),KrNv(t)]Λ¯i(t+r)[KrNw(t),KrNv(t)]T. (66)

The conservative and actual estimation error variances Pwai(t|t+N) and P¯wai(t|t+N) of ω˜ai(t|t+N) are defined as follows

Pwai(t|t+N)=ΨNw(t)Pai(t|t1)ΨNwT(t)+r=0N[MrNw(t),MrNv(t)]Λi(t+r)[MrNw(t),MrNv(t)]T,P¯wai(t|t+N)=ΨNw(t)P¯ai(t|t1)ΨNwT(t)+r=0N[MrNw(t),MrNv(t)]Λ¯i(t+r)[MrNw(t),MrNv(t)]T. (67)

4.2. Conservative Kalman Estimator of Original Descriptor System

Theorem 2. 

For the uncertain MSDS (1)–(4) with Assumptions 1–3, the robust Kalman estimator x^(t|t+N) is obtained as follows

x^(t|t+N)=Q0x^ai(t|t+N)ω^ai(t|t+N)+Q0Gx2u(t), (68)

where

Q0=QIn10Jx1Ux2In10n1×mi0n1×mi0n1×nw0n1×nw0n1×nw0nw×n10nw×mi0nw×miInw0nw×mi0nw×mi,,
P(t|t+N)=Q0Pai(t|t+N)Pxω(t|t+N)PxωT(t|t+N)Pwai(t|t+N),P¯(t|t+N)=Q0P¯ai(t|t+N)P¯xω(t|t+N)P¯xωT(t|t+N)P¯wai(t|t+N),

where

Pxω(t|t+N)=ΨN(t)Pai(t|t1)ΨNwT(t)+r=0N[KrNw(t),KrNv(t)]Λi(t+r)[MrNw(t),MrNv(t)]T,P¯xω(t|t+N)=ΨN(t)P¯ai(t|t1)ΨNwT(t)+r=0N[KrNw(t),KrNv(t)]Λ¯i(t+r)[MrNw(t),MrNv(t)]T.

Proof of Theorem 2. 

From (27), we can obtain

x1(t)=[In1,0n1×mi,0n1×mi]xai(t), (69)
ω(t)=[Inw,0nw×mi,0nw×mi]ωai(t). (70)

Substituting (69) and (70) into (17) yields

x(t)=Qx1(t)Jx1x1(t)+Ux2ω(t)+Gx2u(t)=QIn10Jx1Ux2In10n1×mi0n1×mi0n1×nw0n1×nw0n1×nw0nw×n10nw×mi0nw×miInw0nw×mi0nw×mix^ai(t|t+N)ω^ai(t|t+N)+0Gx2u(t). (71)

Taking the projection of (71), we can obtain (68). Subtracting (71) from (68), yields

x˜(t|t+N)=Q0x˜ai(t|t+N)ω˜ai(t|t+N), (72)

then we can obtain the conservative and actual state estimation error variance E[x˜(t|t+N)x˜T(t|t+N)]. The Proof of Theorem 2 is completed. □

5. Robust Analysis

Theorem 3. 

Consider the uncertain MSDS (1)–(4), for all admissible uncertain variance Q¯ω, R¯i, σ¯il in (13), ΔΛi(t)0, and the actual estimation error variance P¯(t|t+N) has upper bound P(t|t+N), and the trace of error variance tr(P¯(t|t+N)) has upper bound tr(P(t|t+N)), that is

ΔP(t|t+N)0,Δtr(P(t|t+N))0, (73)

where ΔΛi(t)=Λi(t)Λ¯i(t), ΔP(t|t+N)=P(t|t+N)P¯(t|t+N), Δtr(P(t|t+N))=tr(P(t|t+N))tr(P¯(t|t+N)).

Proof of Theorem 3. 

According to (59), it is easy to obtain

ΔΛi(t)=ΔQwai(t)ΔSai(t)ΔSaiT(t)ΔRyi(t), (74)

rewriting ΔΛi(t) as follows

ΔΛi(t)=ΔΛi(1)(t)+ΔΛi(2)(t), (75)

where

ΔΛi(1)(t)=ΔQwai(t)00ΔRyi(t),ΔΛi(2)(t)=0ΔSai(t)ΔSaiT(t)0
ΔΛi(2)(t)=000λαiΔQw(Hi2Ux2)T000ΔRzyi(t)000ΔRyi(t)λαiHi2Ux2ΔQwΔRzyi(t)ΔRyi(t)0=λαidiagIni×m1,Imi,Imi,Hi2Ux2000ΔQw00000000ΔQw000×diagIni×m1,Imi,Imi,Hi2Ux2T+0000000ΔRzyi(t)00000ΔRzyi(t)00+00000000000ΔRyi(t)00ΔRyi(t)0,

since ΔQwai(t)0, ΔRyi(t)0, we have ΔΛi(1)(t)0, applying Lemma 1, we have ΔΛi(2)(t)0, then ΔΛi(t)0.

Parameters ΔPai(t|t1), ΔPai(t|t+N), ΔPwai(t|t+N) and ΔPxw(t|t+N) are defined as follows:

ΔPai(t|t1)=Pai(t|t1)P¯ai(t|t1),ΔPai(t|t+N)=Pai(t|t+N)P¯ai(t|t+N),ΔPwai(t|t+N)=Pwai(t|t+N)P¯wai(t|t+N),ΔPxw(t|t+N)=Pai(t|t+N)P¯xw(t|t+N), (76)

from (60) and (61) and (67), it is easy to obtain

ΔPai(t|t1)=Ψpi(t)ΔPai(t|t1)ΨpiT(t)+[Γai,Kpi(t)]ΔΛi(t)[Γai,Kpi(t)]T,ΔPai(t|t+N)=ΨN(t)ΔPai(t|t1)ΨNT(t)+r=0N[KrNw(t),KrNv(t)]ΔΛi(t+r)[KrNw(t),KrNv(t)]T,ΔPwai(t|t+N)=ΨNw(t)ΔPai(t|t1)ΨNwT(t)+r=0N[MrNw(t),MrNv(t)]ΔΛi(t+r)[MrNw(t),MrNv(t)]T,ΔPxω(t|t+N)=ΨN(t)ΔPai(t|t1)ΨNwT(t) (77)
+r=0N[KrNw(t),KrNv(t)]ΔΛi(t+r)[MrNw(t),MrNv(t)]T, (78)

with the initial condition ΔPai(1|0)0, applying mathematical induction method, yield

ΔPai(t|t1)0. (79)

From (72), defining ΔP(t|t+N)=E[x˜(t|t+N)x˜T(t|t+N)], we have

ΔP(t|t+N)=Q0ΔPai(t|t+N)ΔPxω(t|t+N)ΔPxωT(t|t+N)ΔPwai(t|t+N)Q0T, (80)

substituting (78) into (80), yield

ΔP(t|t+N)=Q0ΨN(t)ΔPai(t|t1)ΨNT(t)ΨN(t)ΔPai(t|t1)ΨNwT(t)ΨNw(t)ΔPai(t|t1)ΨNT(t)ΨNw(t)ΔPai(t|t1)ΨNwT(t)Q0T+Q0r=0NK˘ΔΛi(t+r)K˘Tr=0NK˘ΔΛi(t+r)M˘Tr=0NM˘ΔΛi(t+r)K˘Tr=0NM˘ΔΛi(t+r)M˘TQ0T, (81)

then (81) can be rewritten as

ΔP(t|t+N)=Q(0)ΔPai(t|t1)ΔPai(t|t1)ΔPai(t|t1)ΔPai(t|t1)Q(0)T+r=0NQ(1)ΔΛi(t+r)ΔΛi(t+r)ΔΛi(t+r)ΔΛi(t+r)Q(1)T,

where Q(0)=Q0diagΨN(t),ΨNw(t),K˘=[KrNw(t),KrNv(t)],M˘=[MrNw(t),MrNv(t)],Q(1)=Q0diag[KrNw(t),KrNv(t)],[MrNw(t),MrNv(t)], applying Lemma 1, we have

ΔP(t|t+N)0. Taking the trace of ΔP(t|t+N), we can easily obtain Δtr(P(t|t+N))0. The Proof of Theorem 3 is completed. □

6. Simulation

Consider the circuits system shown in Figure 1, ue(t) is control input, R0, L0, C1 and C2 are resister, inductor and capacities, respectively. The MSDS model is given as follows

C10000C20000L000000dx(t)dt=00010010110010R0R0x(t)+0001w(t)+0001u(t)

where, x(t)=[ue1(t),ue2(t),i1(t),i2(t)]T, ue1(t) and ue2(t) are the voltage of C1 and C2, i1(t) and i2(t) are the current of C1 and C2, w(t) is zero mean white noise, the variance is QW.

Figure 1.

Figure 1

The circuit system.

Taking the sample period T0=0.1 s, the brief parameter matrices are as follows:

M=C10000C20000L000000,Γ=0001,Φ=M+T000010010110010R0R0,B=000T0.

Let ue1(t)=0.1, C1=2, C2=10, L0=1, H=[0,1,0,1], λα=0.9, λβ=0.9, λγ=0.9, QW=1.5, R=4, P0=102I4. Furthermore, the following matrices in (15) as given as

M1=1000020001,P=0100100000100001,Q=0100100000100001.

Figure 2 and Figure 3 gives the first and second components of actual state x1, x2 and corresponding filters x1(t|t), x2(t|t) from t=600 to t=1200, where the solid curves denote the true state components x(t) and the dotted curves denote xp(t|t). From Figure 3, the every component of robust filter can effectively follow the true state component xp(t).

Figure 2.

Figure 2

x1 and its filter x^1(t|t).

Figure 3.

Figure 3

x2 and its filter x^2(t|t).

To verify the correctness of the obtained robust Kalman estimator, a Monte Carlo simulation is performed, and the mean square error (MSE) curve of the robust time-varying estimator is shown in Figure 4, Figure 5 and Figure 6. It is easy to see that the value of MSE(t|t+N) can be approximated to the value of trP(t|t+N), and as Theorem 3 states, it has an upper bound trP(t|t+N).

Figure 4.

Figure 4

MSE(t|t1) curve.

Figure 5.

Figure 5

MSE(t|t) curve.

Figure 6.

Figure 6

MSE(t|t+1) curve.

In Figure 4, Figure 5 and Figure 6, the dashed black line shows the trace of the actual estimated error variance, the curved line shows the MSE value, and the dashed orange line shows the actual upper bound on the variance of the estimation error.

Remark 2. 

Time delay is not considered in references [20,21,22,23,24,25,26,27]. Meanwhile, references [19,20,21] do not consider missing measurement, references [19,21,27] ignore the multiplicative noise, and references [19,20,25,27] do not consider packet dropouts. In Table 1, the model of this paper contains more influencing factors, and it is more general than references [19,20,21,22,23,24,25,26,27].

Table 1.

Model comparisons.

Model This Paper [19] [20] [21] [25] [27]
Uncertain-variance noise
Multiplicative noise × × ×
Missing measurement × × ×
Time delay × × × ×
Packet dropouts × × × ×
Multi-sensor descriptor system × ×

Where “√” means that the model contains this component, and “×” means that the model does not contain this component.

7. Conclusions

In this paper, the robust Kalman estimation of multi-sensor linear singular systems is studied. The singular value decomposition (SVD) method, the augmented state method and the fictitious noise method are applied to transform the original generalized system into a new standard system with uncertain-variance noise. Based on the minimum–maximum robust estimation principle and Kalman filtering theory, a new robust Kalman estimator for augmented systems is obtained. According to the relationship between the augmented state and the original system state, the robust Kalman estimator of the original system is given. Using mathematical induction and the Lyapunov equation method, the robustness of the actual Kalman estimator to the original system is proved. In the future, we will investigate time-varying robust Kalman estimators for a multi-sensor descriptor system with a measurement delay and packet loss. Furthermore, we will consider an uncertain multi-sensor descriptor system in which multiplicative noise occurs simultaneously in both the system and the measurement models, and study the corresponding Kalman filter.

The limitation of this paper is that it uses a general method for studying singular systems. In the future, we will explore some novel methods to study the problem of robust estimation of multi-sensor singular systems

Author Contributions

Methodology, J.Z.; Software, J.Z.; Formal analysis, W.C.; Writing—original draft, J.Z.; Writing—review & editing, S.S.; Supervision, W.C. All authors have read and agreed to the published version of the manuscript.

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.

Funding Statement

This research received no external funding.

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

References

  • 1.Luenberger D. Dynamic equations in descriptor form. IEEE Trans. Autom. Control. 1977;22:312–321. doi: 10.1109/TAC.1977.1101502. [DOI] [Google Scholar]
  • 2.Hasan M.A., Azim-Sadjani M.R. Noncausal image modeling using descriptor approach. IEEE Trans. Circuits Syst. II. 1995;42:536–540. doi: 10.1109/82.404084. [DOI] [Google Scholar]
  • 3.Dai L. Singular Control Systems. Springer; Berlin, Germany: 1989. [Google Scholar]
  • 4.Deng Z.L., Gao Y., Tao G.L. Reduced-order steady-state descriptor Kalman fuser weighted by block-diagonal matrices. Inf. Fusion. 2008;9:300–309. doi: 10.1016/j.inffus.2006.10.010. [DOI] [Google Scholar]
  • 5.Ishihara J.Y., Terra M.H., Campos J.C.T. Optimal recursive estimation for discrete-time descriptor systems. Int. J. Syst. Sci. 2008;36:605–615. doi: 10.1080/00207720500219302. [DOI] [Google Scholar]
  • 6.Dou Y.F., Sun S., Ran C.J. Self-tuning full-order WMF Kalman filter for multisensor descriptor systems. IET Control. Theory. Appl. 2017;11:359–368. doi: 10.1049/iet-cta.2016.0803. [DOI] [Google Scholar]
  • 7.Sun S.L., Ma J. Optimal filtering and smoothing for discrete-time stochastic singular systems. Signal Process. 2007;87:189–201. doi: 10.1016/j.sigpro.2006.05.007. [DOI] [Google Scholar]
  • 8.Deng Z.L., Xu Y. Descriptor Wiener state estimators. Automatica. 2000;36:1761–1766. doi: 10.1016/S0005-1098(00)00079-0. [DOI] [Google Scholar]
  • 9.Bai Y., Wang X., Jin X. A neuron-based kalman filter with nonlinear autoregressive model. Sensors. 2020;20:299. doi: 10.3390/s20010299. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Luttmann L., Mercorelli P. Comparison of backpropagation and Kalman filter-based training for neural networks; Proceedings of the 2021 25th International Conference on System Theory, Control and Computing (ICSTCC); Iasi, Romania. 20–23 October 2021; pp. 234–241. [Google Scholar]
  • 11.Lewis F.L., Xie L.X., Popa D. Optimal and Robust Estimation. 2nd ed. CRC Press; New York, NY, USA: 2008. [Google Scholar]
  • 12.Ishihara J.Y., Terra M.H. Robust state prediction for descriptor systems. Automatica. 2008;44:2185–2190. doi: 10.1016/j.automatica.2007.11.010. [DOI] [Google Scholar]
  • 13.Kalman R.E. A new approach to linear filtering and prediction problems. J. Basic Eng. 1960;82:35–45. doi: 10.1115/1.3662552. [DOI] [Google Scholar]
  • 14.Kalman R.E., Bucy R.S. New Results in Linear Filtering and Prediction Theory. J. Basic Eng. 1961;83:95–108. doi: 10.1115/1.3658902. [DOI] [Google Scholar]
  • 15.Wang Z.D., Ho D.W.C., Liu X.H. Variance-constrained filtering for uncertain stochastic systems with missing measurements. IEEE Trans. Syst. Man Cybern. 2003;48:1254–1258. [Google Scholar]
  • 16.Sun S., Xie L., Xiao W., Soh Y.C. Optimal linear estimation for systems with multiple packet dropouts. Automatica. 2008;44:1333–1342. doi: 10.1016/j.automatica.2007.09.023. [DOI] [Google Scholar]
  • 17.Nahi N. Optimal recursive estimation with uncertain observation. IEEE Trans. Inf. Theory. 1969;15:457–462. doi: 10.1109/TIT.1969.1054329. [DOI] [Google Scholar]
  • 18.Sun S.L., Lin H.L., Ma J., Li X.Y. Multi-sensor distributed fusion estimation with applications in networked systems: A review paper. Inf. Fusion. 2017;38:122–134. [Google Scholar]
  • 19.Shen H., Dou Y., Ran C. Robust time-varying estimator for descriptor system with random one-step measurement delay. Optim. Control Appl. Meth. 2021;42:1775–1793. doi: 10.1002/oca.2764. [DOI] [Google Scholar]
  • 20.Tao G., Liu W., Wang X., Zhang J., Yu H. Robust CAWOF Kalman predictors for uncertain multi-sensor generalized system. Int. J. Adapt. Control Signal Process. 2021;35:2423–2445. doi: 10.1002/acs.3330. [DOI] [Google Scholar]
  • 21.Liu W., Zheng J., Dou Y., Ran C. Robust fusion filter for multisensor descriptor system with uncertain-variance noises and packet dropout. Optim. Control Appl. Meth. 2022;43:1401–1421. doi: 10.1002/oca.2896. [DOI] [Google Scholar]
  • 22.Salahshoor K., Mosallaei M., Bayat M. Centralized and decentralized process and sensor fault monitoring using data fusion based on adaptive extended Kalman filter algorithm. Measurement. 2008;41:1059–1076. doi: 10.1016/j.measurement.2008.02.009. [DOI] [Google Scholar]
  • 23.Liggins M.E., Hall D.L., Llinas J. Handbook of multisensor data fusion: Theory and practice. Artech. House Radar. Lib. 2008;39:180–184. [Google Scholar]
  • 24.Sun S.L. Multi-sensor optimal information fusion Kalman filters with applications. Aerosp. Sci. Technol. 2004;8:57–62. doi: 10.1016/j.ast.2003.08.003. [DOI] [Google Scholar]
  • 25.Wang X., Liu W., Deng Z. Robust weighted fusion Kalman estimators for systems with multiplicative noises, missing measurements and uncertain-variance linearly correlated white noises. Aerosp. Sci. Technol. 2017;68:331–344. doi: 10.1016/j.ast.2017.05.023. [DOI] [Google Scholar]
  • 26.Deng Z.L., Gao Y., Mao L., Li Y., Hao G. New approach to information fusion steady-state Kalman filtering. Automatica. 2005;41:1695–1770. doi: 10.1016/j.automatica.2005.04.020. [DOI] [Google Scholar]
  • 27.Zheng J., Ran C. Distributed fusion robust estimators for multisensor networked singular control system with uncertain-variance correlated noises and missing measurement. Comput. Appl. Math. 2023;42:66. doi: 10.1007/s40314-023-02202-3. [DOI] [Google Scholar]
  • 28.Ran C., Deng Z. Robust fusion Kalman estimators for networked mixed uncertain systems with random one-step measurement delays, missing measurements, multiplicative noises and uncertain noise variances. Inf. Sci. 2020;534:27–52. doi: 10.1016/j.ins.2020.04.044. [DOI] [Google Scholar]
  • 29.Anderson B., Moore J. Optimal Filtering. Prentice-Hall; Englewood Clifs, NJ, USA: 1979. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

Not applicable.


Articles from Sensors (Basel, Switzerland) are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES