Next Article in Journal
Flow Ripple Reduction in Reciprocating Pumps by Multi-Phase Rectification
Previous Article in Journal
Traffic Noise Assessment Using Intelligent Acoustic Sensors (Traffic Ear) and Vehicle Telematics Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai 201620, China
*
Author to whom correspondence should be addressed.
Sensors 2023, 23(15), 6968; https://doi.org/10.3390/s23156968
Submission received: 22 March 2023 / Revised: 26 May 2023 / Accepted: 3 August 2023 / Published: 5 August 2023
(This article belongs to the Section Intelligent Sensors)

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.

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
M x ( t + 1 ) = Φ x ( t ) + Γ ω ( t ) + B u ( t ) ,
z 0 i ( t ) = H i + l = 1 n a a i l ( t ) H i l x ( t ) ,
z i ( t ) = γ i ( t ) z 0 i ( t ) + ν i ( t ) ,
y i ( t ) = α i ( t ) z i ( t ) + ( 1 α i ( t ) ) β i ( t ) z i ( t 1 ) + ( 1 α i ( t ) ) ( 1 β i ( t ) ) y i ( t 1 ) ,   i = 0 , 1 , , L
where t is a discrete time, x ( t ) R n is the state, u ( t ) is the input, ω ( t ) R n w is additive process noise, ν i ( t ) R m i is additive measurement noise, z 0 i ( t ) R m i is the ith noise-free measurement, a i l ( t ) R 1 is multiplicative state-dependent noise, z i ( t ) R m i is the measurement of the ith sensor, y i ( t ) R m i is the measurement received by estimator to be designed, n a and L are the number of multiplicative noises and sensors, respectively. M, Φ , Γ , B and H i are constant matrices with suitable dimensions.
Assumption 1. 
M is a singular matrix, r a n k ( M ) = n 1 , n 1 < 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 λ α i 1 ,
Prob { β i ( t ) = 1 } = λ β i ,   Prob { β i ( t ) = 0 } = 1 λ β i ,   0 λ β i 1 ,
Prob { γ i ( t ) = 1 } = λ γ i ,   Prob { γ i ( t ) = 0 } = 1 λ γ i ,   0 λ γ i 1 ,   i = 0 , 1 , , L ,
from Assumption 2, it follow that
E [ α i ( t ) ] = E [ α i 2 ( t ) ] = λ α i ,   E [ β i ( t ) ] = E [ β i 2 ( t ) ] = λ β i ,   E [ γ i ( t ) ] = E [ γ i 2 ( t ) ] = λ γ i ,
zero-means white noises α 0 i ( t ) , β 0 i ( t ) and γ 0 i ( t ) are defined as follows:
α 0 i ( t ) = α i ( t ) λ α i , β 0 i ( t ) = β i ( t ) λ β i , γ 0 i ( t ) = γ i ( t ) λ γ i ,
it follow that
E [ α 0 i ( t ) ] = 0 , E [ α 0 i 2 ( t ) ] = λ α i ( 1 λ α i ) λ α 0 i , E [ α 0 i ( t ) α 0 j ( k ) ] = 0 ,   i j ,   t , k ,
E [ β 0 i ( t ) ] = 0 , E [ β 0 i 2 ( t ) ] = λ β i ( 1 λ β i ) λ β 0 i ,   E [ β 0 i ( t ) β 0 j ( k ) ] = 0 ,   i j ,   t , k ,
E [ γ 0 i ( t ) ] = 0 ,   E [ γ 0 i 2 ( t ) ] = λ γ i ( 1 λ γ i ) λ γ 0 i ,   E [ γ 0 i ( t ) γ 0 j ( k ) ] = 0 ,   i j ,   t , k .
Assumption 3. 
ω ( t ) , ν i ( t ) and a i l ( t ) are mutually independent white noises with zero means and the unknown actual variance are Q ¯ w , R ¯ i and σ ¯ α i l , respectively, and
E [ ω ( t ) ω T ( t ) ] = Q ¯ w ,   E [ ν i ( t ) ν j T ( t ) ] = R ¯ i δ i j , E [ a i l ( t ) a j l T ( t ) ] = σ ¯ α i l δ i j .
The unknown actual variance are, respectively, have known conservative upper bounds, which are
Q ¯ w Q w ,   R ¯ i R i , σ ¯ α i l σ α i l .
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 y i ( t ) = z i ( t ) . If γ i ( t ) = 0 , α i ( t ) = 1 , then y i ( t ) = ν i ( t ) , which means measurement missed. If α i ( t ) = 0 , β i ( t ) = 1 , then y i ( t ) = z i ( t 1 ) , which means that there is one-step measurement delay. If α i ( t ) = 0 , β i ( t ) = 0 , then y i ( t ) = y i ( t 1 ) , 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
P M Q = M 1 0 0 0 , M 1 = diag { σ 1 , , σ n 1 } ,
P Φ Q = Φ 11 Φ 12 Φ 21 Φ 22 , P Γ = Γ 1 Γ 2 , P B = B 1 B 2 , H i Q = [ H i 1 , H i 2 ] ,
letting
x ( t ) = Q x 1 ( t ) x 2 ( t ) ,
substituting (15) and (16) into (1) yields
M 1 0 0 0 x 1 ( t + 1 ) x 2 ( t + 1 ) = Φ 11 Φ 12 Φ 21 Φ 22 x 1 ( t ) x 2 ( t ) + Γ 1 Γ 2 ω ( t ) + B 1 B 2 u ( t ) ,
then we have two new subsystems
x 1 ( t + 1 ) = J x 1 x 1 ( t ) + U x 1 ω ( t ) + G x 1 u ( t ) ,
x 2 ( t ) = J x 2 x 1 ( t ) + U x 2 ω ( t ) + G x 2 u ( t ) ,
where J x 1 = M 1 1 ( Φ 11 Φ 12 Φ 22 1 Φ 21 ) , U x 1 = M 1 1 ( Γ 1 Φ 12 Φ 22 1 Γ 2 ) , G x 1 = M 1 1 ( B 1 Φ 12 Φ 22 1 B 2 ) , J x 2 = Φ 22 1 Φ 21 , U x 2 = Φ 22 1 Γ 2 , G x 1 = Φ 22 1 B 2 , H i Q in (16) and (17) are substituted into (2), then it is easy to obtain
z 0 i ( t ) = H i 1 x 1 ( t ) + H i 2 x 2 ( t ) + l = 1 n a α i l ( t ) H i l x ( t ) ,
substituting (20) into z 0 i ( t ) yields
z 0 i ( t ) = ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + H i 2 U x 2 ω ( t ) + H i 2 G x 2 u ( t ) + l = 1 n a α i l ( t ) H i l x ( t ) ,
substituting (21) into (3), it is easy to obtain
z i ( t ) = γ i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + γ i ( t ) H i 2 U x 2 ω ( t ) + γ i ( t ) H i 2 G x 2 u ( t ) + γ i ( t ) l = 1 n a α i l ( t ) H i l x ( t ) + ν i ( t ) ,
from (9), we have γ i ( t ) = γ 0 i ( t ) + λ γ i , in (22), replacing γ i ( t ) by γ 0 i ( t ) + λ γ i yields
z i ( t ) = λ γ i ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + ( γ 0 i ( t ) + λ γ i ) H i 2 G x 2 u ( t ) + ν z i ( t ) ,
where ν z i ( t ) = γ 0 i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + ( γ 0 i ( t ) + λ γ i ) H i 2 U x 2 ω ( t ) + ( γ 0 i ( t ) + λ γ i ) × l = 1 n a α i l ( t ) H i l x ( t ) + ν i ( t ) , substituting (23) into (4), replacing α i ( t ) by α 0 i ( t ) + λ α i and replacing β i ( t ) by β 0 i ( t ) + λ β i yield
y i ( t ) = λ α i λ γ i ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + ( α 0 i ( t ) + λ α i ) ( γ 0 i ( t ) + λ γ i ) H i 2 G x 2 u ( t ) + ( 1 λ α i ) λ β i z i ( t 1 ) + ( 1 λ α i ) ( 1 λ β i ) y i ( t 1 ) + ν y i ( t ) ,
where ν y i ( t ) = ( α 0 i ( t ) + λ α i ) ( γ 0 i ( t ) + λ γ i ) l = 1 n a α i l ( t ) H i l x ( t ) + ( α 0 i ( t ) + λ α i ) ( γ 0 i ( t ) + λ γ i ) H i 2 U x 2 ω ( t ) + ( α 0 i ( t ) + λ α i ) ν i ( t ) + λ α i γ 0 i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + α 0 i ( t ) γ 0 i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + λ γ i α 0 i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + ( 1 λ α i ) β 0 i ( t ) z i ( t 1 ) λ β i α 0 i ( t ) z i ( t 1 ) α 0 i ( t ) β 0 i ( t ) z i ( t 1 ) ( 1 λ α i ) β 0 i ( t ) y i ( t 1 ) ( 1 λ β i ) α 0 i ( t ) y i ( t 1 ) + α 0 i ( t ) β 0 i ( t ) y i ( t 1 ) . In order to facilitate the calculation, it is necessary to simplify ν y i ( t ) . New parameters C u i ( t ) and H u i ( t ) ( u = 1 , 2 , 3 , 4 ) are defined, then we can rewrite ν y i ( t ) as
ν y i ( t ) = ( α 0 i ( t ) + λ α i ) ( γ 0 i ( t ) + λ γ i ) l = 1 n a α i l ( t ) H i l x ( t ) + ( α 0 i ( t ) + λ α i ) ν i ( t ) + ( α 0 i ( t ) + λ α i ) ( γ 0 i ( t ) + λ γ i ) H i 2 U x 2 ω ( t ) + λ α i γ 0 i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) + u = 1 4 C u i ( t ) H c u i x 1 ( t ) z i ( t 1 ) y i ( t 1 ) ,
where C 1 i = α 0 i ( t ) , C 2 i = β 0 i ( t ) , C 3 i = α 0 i ( t ) γ 0 i ( t ) , C 4 i = α 0 i ( t ) β 0 i ( t ) , H c 1 i = [ λ γ i ( H i 1 + H i 2 J x 2 ) , λ β i I m i , ( 1 λ β i ) I m i ] , H c 2 i = [ 0 , ( 1 λ α i ) I m i , ( 1 λ α i ) I m i ] , H c 3 i = [ ( H i 1 + H i 2 J x 2 ) , 0 , 0 ] , H c 4 i = [ 0 , I m i , I m i ] , defining new white noise variances σ c u i 2 = E [ C u i C u i T ] ( u = 1 , 2 , 3 , 4 ) as follows
σ c 1 i 2 = λ α 0 i , σ c 2 i 2 = λ β 0 i , σ c 3 i 2 = λ α 0 i λ γ 0 i , σ c 4 i 2 = λ α 0 i λ β 0 i ,
let
x a i ( t ) = x 1 ( t ) z i ( t 1 ) y i ( t 1 ) , ω a i ( t ) = ω t ν z i ( t ) ν y i ( t ) , y a i ( t ) = y i ( t ) α i ( t ) γ i ( t ) H i 2 G x 2 u ( t ) ,
then it is easy to obtain the new standard augmented state apace model as follows
x a i ( t + 1 ) = Φ a i x a i ( t ) + Γ a i ω a i ( t ) + G a i u ( t ) ,
y a i ( t ) = H a i x a i ( t ) + ν y i ( t ) ,
where
Φ a i = J x 1 0 0 λ γ i ( H i 1 + H i 2 J x 2 ) 0 0 λ α i λ γ i ( H i 1 + H i 2 J x 2 ) ( 1 λ α i ) λ β i I m i ( 1 λ α i ) ( 1 λ β i ) I m i , Γ a i = U x 1 0 0 0 I m i 0 0 0 I m i , G a i = G x 1 γ i ( t ) H i 2 G x 2 0 , H a i = [ λ α i λ γ i ( H i 1 + H i 2 J x 2 ) , ( 1 λ α i ) λ β i I m i , ( 1 λ α i ) ( 1 λ β i ) I m i ] .
Non-central second order moments are defined as X ( t ) = E [ x ( t ) x T ( t ) ] , X 1 ( t ) = E [ x 1 ( t ) x 1 T ( t ) ] and X a i ( t ) = E [ x a i ( t ) x a i T ( t ) ] , they satisfy the following Lyapunov equations
X 1 ( t + 1 ) = J x 1 X 1 ( t ) J x 1 T + U x 1 Q w U x 1 T , X a i ( t + 1 ) = Φ a i X a i ( t ) Φ a i T + Γ a i Q w a i ( t ) Γ a i T ,
and we have corresponding upper values
X ¯ 1 ( t + 1 ) = J x 1 X ¯ 1 ( t ) J x 1 T + U x 1 Q ¯ w U x 1 T , X ¯ a i ( t + 1 ) = Φ a i X ¯ a i ( t ) Φ a i T + Γ a i Q ¯ w a i ( t ) Γ a i T ,
with initial values X a i ( 0 ) = diag ( P 01 , 0 , 0 ) , X ¯ a i ( 0 ) = diag ( P 01 , 0 , 0 ) , P 0 = P 01 * * * , P ¯ 0 = P ¯ 01 * * * .
For the new process noise ω a i in (28), it has corresponding conservative variance Q w a i and real variance Q ¯ w a i . Similarly, for new measurement noise ν y i ( t ) in (29), it has corresponding conservative variance R z y i ( t ) and real variance R ¯ z y i ( t ) .
Let R z i ( t ) = E [ ν z i ( t ) ν z i T ( t ) ] , R ¯ z i ( t ) is actual variance of ν z i ( t ) , the conservative and actual noise variances R z i ( t ) and R ¯ z i ( t ) are given as follows
R z i ( t ) = λ γ 0 i ( H i 1 + H i 2 J x 2 ) X 1 ( t ) ( H i 1 + H i 2 J x 2 ) T + λ γ i l = 1 n a σ α i l 2 H i l X ( t ) H i l T + λ γ i H i 2 U x 2 Q w ( H i 2 U x 2 ) T + R i , R ¯ z i ( t ) = λ γ 0 i ( H i 1 + H i 2 J x 2 ) X ¯ 1 ( t ) ( H i 1 + H i 2 J x 2 ) T + λ γ i l = 1 n a σ ¯ α i l 2 H i l X ( t ) H i l T + λ γ i H i 2 U x 2 Q ¯ w ( H i 2 U x 2 ) T + R ¯ i .
Let R z y i ( t ) = E [ ν y i ( t ) ν y i T ( t ) ] , then R ¯ z y i ( t ) is the actual variance of ν y i ( t ) , the conservative and actual noise variances R z y i ( t ) and R ¯ z y i ( t ) are given as follows
R z y i ( t ) = λ α i λ γ 0 i ( H i 1 + H i 2 J x 2 ) X 1 ( t ) ( H i 1 + H i 2 J x 2 ) T + λ α i λ γ i l = 1 n a σ α i l 2 H i l X ( t ) H i l T + λ α i λ γ i H i 2 U x 2 Q w ( H i 2 U x 2 ) T + λ α i R i , R ¯ z y i ( t ) = λ α i λ γ 0 i ( H i 1 + H i 2 J x 2 ) X ¯ 1 ( t ) ( H i 1 + H i 2 J x 2 ) T + λ α i λ γ i l = 1 n a σ ¯ α i l 2 H i l X ¯ ( t ) H i l T + λ α i λ γ i H i 2 U x 2 Q ¯ w ( H i 2 U x 2 ) T + λ α i R ¯ i .
In (33) and (34), let
U 1 i ( t ) = l = 1 n a σ α i l 2 H i l X ( t ) H i l T , U 2 i ( t ) = ( H i 1 + H i 2 J x 2 ) X 1 ( t ) ( H i 1 + H i 2 J x 2 ) T , U ¯ 1 i ( t ) = l = 1 n a σ ¯ α i l 2 H i l X ¯ ( t ) H i l T , U ¯ 2 i ( t ) = ( H i 1 + H i 2 J x 2 ) X ¯ 1 ( t ) ( H i 1 + H i 2 J x 2 ) T , U 3 i ( t ) = H i 2 U x 2 Q w ( H i 2 U x 2 ) T , U ¯ 3 i ( t ) = H i 2 U x 2 ( t ) Q ¯ w ( H i 2 U x 2 ) T ,
then (33) and (34) can be simplified into the following equations
R z i ( t ) = λ γ i U 1 i ( t ) + λ γ 0 i U 2 i ( t ) + λ γ i U 3 i ( t ) + R i , R ¯ z i ( t ) = λ γ i U ¯ 1 i ( t ) + λ γ 0 i U ¯ 2 i ( t ) + λ γ i U ¯ 3 i ( t ) + R ¯ i , R z y i ( t ) = λ α i λ γ i U 1 i ( t ) + λ α i λ γ 0 i U 2 i ( t ) + λ α i λ γ i U 3 i ( t ) + λ α i R i , R ¯ z y i ( t ) = λ α i λ γ i U ¯ 1 i ( t ) + λ α i λ γ 0 i U ¯ 2 i ( t ) + λ α i λ γ i U ¯ 3 i ( t ) + λ α i R ¯ i .
Substituting (25) into ω a i ( t ) in (27), we have
ω a i ( t ) = Γ a i ( 1 ) u = 1 4 C u i ( t ) H c u i x a i ( t ) + ω a i ( 1 ) ( t ) ,
where Γ a i ( 1 ) = [ 0 , 0 , I m 1 ] T ,   ω a i ( 1 ) ( t ) = ω t ν z i ( t ) ν z y i ( 1 ) ( t ) T , ν z y i ( 1 ) ( t ) = α i ( t ) γ i ( t ) × l = 1 n a α i l ( t ) H i l x ( t ) + α i ( t ) γ i ( t ) H i 2 U x 2 ω ( t ) + α i ( t ) ν i ( t ) + λ α i γ 0 i ( t ) ( H i 1 + H i 2 J x 2 ) x 1 ( t ) , we can obtain the conservative and actual variances Q w a i ( 1 ) ( t ) and Q ¯ w a i ( 1 ) ( t ) as follows
Q w a i ( 1 ) ( t ) = Q w λ γ i Q w ( H i 2 U x 2 ) T λ α i λ γ i Q w ( H i 2 U x 2 ) T λ γ i ( H i 2 U x 2 ) Q w R z i ( t ) R z y i ( t ) λ α i λ γ i ( H i 2 U x 2 ) Q w R z y i ( t ) T R ˘ ,
Q ¯ w a i ( 1 ) ( t ) = Q ¯ w λ γ i Q ¯ w ( H i 2 U x 2 ) T λ α i λ γ i Q ¯ w ( H i 2 U x 2 ) T λ γ i ( H i 2 U x 2 ) Q ¯ w R ¯ z i ( t ) R ¯ z y i ( t ) λ α i λ γ i ( H i 2 U x 2 ) Q ¯ w R ¯ z y i ( t ) T R ¯ ˘ ,
where R ˘ = λ α i λ γ i U 1 i ( t ) + λ α i 2 λ γ 0 i U 2 i ( t ) + λ α i λ γ i U 3 i ( t ) + λ α i R i , R ¯ ˘ = λ α i λ γ i U ¯ 1 i ( t ) + λ α i 2 λ γ 0 i U ¯ 2 i ( t ) + λ α i λ γ i U ¯ 3 i ( t ) + λ α i R ¯ i . Defining U 4 i ( t ) and U ¯ 4 i ( t ) , we have
Q w a i ( t ) = Γ a i ( 1 ) U 4 i ( t ) Γ a i ( 1 ) T + Q w a i ( 1 ) ( t ) , Q ¯ w a i ( t ) = Γ a i ( 1 ) U ¯ 4 i ( t ) Γ a i ( 1 ) T + Q ¯ w a i ( 1 ) ( t ) ,
where U 4 i ( t ) = u = 1 4 σ c u i 2 H c u i X a i ( t ) H c u i T , U ¯ 4 i ( t ) = u = 1 4 σ c u i 2 H c u i X ¯ a i ( t ) H c u i T , then we have
R y i ( t ) = λ α i λ γ i U 1 i ( t ) + λ α i 2 λ γ 0 i U 2 i ( t ) + λ α i R i + λ α i λ γ i U 3 i ( t ) + U 4 i ( t ) , R ¯ y i ( t ) = λ α i λ γ i U ¯ 1 i ( t ) + λ α i 2 λ γ 0 i U ¯ 2 i ( t ) + λ α i R ¯ i + λ α i λ γ i U ¯ 3 i ( t ) + U ¯ 4 i ( t ) ,
the conservative and actual cross-covariance S a i ( t ) and S ¯ a i ( t ) are defined as follows
S a i ( t ) = E [ ω a i ( t ) ν y j T ( t ) ] = λ α i λ γ i Q w ( H i 2 U x 2 ) T R z y i ( t ) R y i ( t ) δ i j , S ¯ a i ( t ) = E [ ω ¯ a i ( t ) ν ¯ y j T ( t ) ] = λ α i λ γ i Q ¯ w ( H i 2 U x 2 ) T R ¯ z y i ( t ) R ¯ y i ( t ) δ i j .
Lemma 1 
([28]). (i) Let A i 0 , i = 0 , 1 , , L , then diag ( A 1 , , A L ) 0 . (ii) Let A 0 , A R n × n , and A δ = ( A i j ) n L × n L , A i j = A , then A δ 0 . (iii) Let A 0 ,   A R m × m , then for arbitrary C R p × m , C A C T 0 .
Parameters Δ X 1 ( t ) , Δ X ( t ) , Δ X a i ( t ) , Δ R y i ( t ) and Δ Q w a i ( t ) are defined as Δ X 1 ( t ) = X 1 ( t ) X ¯ 1 ( t ) , Δ X ( t ) = X ( t ) X ¯ ( t ) , Δ X a i ( t ) = X 1 ( t ) X ¯ a i ( t ) , Δ R y i ( t ) = R y i ( t ) R ¯ y i ( t ) , Δ Q w a i ( t ) = Q w a i ( t ) Q ¯ w a i ( t ) .
Theorem 1. 
For all admissible uncertain variance Q ¯ ω , R ¯ i , σ ¯ i l in (13), all of the following inequalities are true, that is,
Δ X 1 ( t ) 0 , Δ X ( t ) 0 , Δ X a i ( t ) 0 , Δ R y i ( t ) 0 , Δ Q w a i ( t ) 0 .
Proof of Theorem 1. 
From (31) and (32), it is easy to obtain
Δ X 1 ( t + 1 ) = J x 1 Δ X 1 ( t ) J x 1 T + U x 1 Δ Q w U x 1 T ,
with the initial condition Δ X 1 ( 0 ) = X 1 ( 0 ) X 1 ( 0 ) 0 , Δ Q w 0 , applying Lemma 1, iterating (44) yield Δ X 1 ( t ) 0 .
Let Q = [ Q 1 , Q 2 ] , from (17), (19) and (20), it is easy to obtain
x ( t ) = ( Q 1 + Q 2 J x 2 ) x 1 ( t ) + Q 2 U x 2 ω ( t ) + Q 2 G x 2 u ( t ) ,
Δ X ( t ) = ( Q 1 + Q 2 J x 2 ) Δ X 1 ( t ) ( Q 1 + Q 2 J X 2 ) T + Q 2 U x 2 Δ Q w ( Q 2 U x 2 ) T ,
because of Δ X 1 ( t ) 0 and Δ Q w 0 , based on Lemma 1, we have Δ X ( t ) 0 .
Rewriting Q w a i ( 1 ) ( t ) as follows
Δ Q w a i ( 1 ) ( t ) = D ( 0 ) Δ Q w Δ Q w Δ Q w Δ Q w 0 0 Δ Q w 0 0 D ( 0 ) T + λ α i λ γ i D ( 1 ) Δ U 1 i D ( 1 ) T + λ γ 0 i D ( 2 ) Δ U 2 i D ( 2 ) T + λ α i λ γ i D ( 3 ) Δ U 3 i D ( 3 ) T + λ α i D ( 4 ) Δ R i D ( 4 ) T + 0 0 0 0 λ γ i ( 1 λ α i ) Δ U 1 i + λ γ i ( 1 λ α i ) Δ U 3 i + ( 1 λ α i ) Δ R i 0 Δ 0 0 0
where D ( 0 ) = diag { I n 1 , λ γ i H i 1 U x 2 , λ α i λ γ i H i 1 U x 2 } , D ( 1 ) = D ( 3 ) = D ( 4 ) = 0 I m 1 I m 1 , D ( 2 ) = diag { I n 1 , I m 1 , λ α i I m 1 } .
Let Δ U 1 i = U 1 i U ¯ 1 i , Δ U 2 i = U 2 i U ¯ 2 i , Δ U 3 i = U 3 i U ¯ 3 i , from (35), we have
Δ U 1 i = l = 1 n a ( Δ σ α i l 2 H i l X ( t ) H i l T + σ α i l 2 H i l Δ X ( t ) H i l T ) , Δ U 2 i = ( H i 1 + H i 2 J x 2 ) Δ X 1 ( t ) ( H i 1 + H i 2 J x 2 ) T , Δ U 3 i = H i 2 U x 2 Δ Q w ( H i 2 U x 2 ) T ,
since Δ σ α i l 2 0 , Δ X ( t ) 0 , Δ X 1 ( t ) 0 and Δ Q w 0 , based on Lemma 1, it is easy to obtain
Δ U 1 i 0 , Δ U 2 i 0 , Δ U 3 i 0 ,
applying Lemma 1, we can easily obtain Δ Q w a i ( 1 ) ( t ) 0 , from (31), (32) and (40), it is easy to obtain Δ X a i ( t + 1 ) as follows
Δ X a i ( t + 1 ) = Φ a i Δ X a i ( t ) Φ a i T + Γ a i Δ Q w a i ( t ) Γ a i T
Δ X a i ( t + 1 ) = Φ a i Δ X a i ( t ) Φ a i T + Γ a i ( Γ a i ( 1 ) Δ U 4 i ( t ) Γ a i ( 1 ) T + Δ Q w a i ( 1 ) ( t ) ) Γ a i T ,
then we have
Δ U 4 i ( t ) = u = 1 4 σ c u i 2 H c u i Δ X a i ( t ) H c u i T ,
we can easily obtain Δ U 4 i ( t ) 0 , with the initial condition Δ X a i ( 0 ) 0 . According to (50) and applying mathematical induction, yield Δ X a i ( t ) 0 , since Δ Q w a i ( 1 ) ( t ) 0 , Δ U 4 i ( t ) 0 , from (40), yield Δ Q w a i ( t ) 0 .
From (41), it is easy to obtain
Δ R y i ( t ) = λ α i λ γ i Δ U 1 i + λ α i Δ R i + λ α i 2 λ γ 0 i Δ U 2 i + λ α i λ γ i Δ U 3 i ,
from (49), yield Δ R y i ( 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 ^ a i ( t | t + N ) (include filter ( N = 0 ) , predictor ( N = 1 ) , smoother ( N 1 ) )
x ^ a i ( t + 1 | t ) = Ψ p i ( t ) x ^ a i ( t | t 1 ) + K p i ( t ) y a i ( t ) + G a i ( t ) ,
x ^ a i ( t | t + N ) = h a t x a i ( t | t 1 ) + r = 0 N K i ( t | t + r ) ε i ( t + r ) ,   N 0 ,
ε i ( t ) = y a i ( t ) H a i x ^ a i ( t | t 1 ) ,
where Ψ p i ( t ) = Φ a i K p i ( t ) H a i ,   K p i ( t ) = ( Φ a i P a i ( t | t 1 ) H a i T + Γ a i S a i ( t ) ) Q ε i 1 ( t ) ,   Q ε i ( t ) = H a i P a i ( t | t 1 ) H a i T + R y i ( t ) ,   K i ( t | t ) = P a i ( t | t 1 ) H a i T Q ε i 1 ( t ) , K i ( t | t + r ) = P a i ( t | t 1 ) × j = 0 r 1 Ψ p i ( t + j ) H a i T ε i ( t + r ) ,   r 1 , and the conservative prediction error variance satisfies the Riccati equation
P a i ( t + 1 | t ) = Φ a i P a i ( t | t 1 ) Φ a i T ( Φ a i P a i ( t | t 1 ) H a i T + Γ a i S a i ( t ) ) ( H a i P a i ( t | t 1 ) H a i T + R y i ( t ) ) 1 × ( Φ a i P a i ( t | t 1 ) H a i T + Γ a i S a i ( t ) ) T + Γ a i Q w a i Γ a i T .
The one-step predicting error is defined as x ˜ a i ( t + 1 | t ) = x a i ( t ) x ^ a i ( t + 1 | t )
x ˜ a i ( t + 1 | t ) = Ψ p i ( t ) x ˜ a i ( t | t 1 ) + [ Γ a i , K p i ( t ) ] ξ w v ( t ) ,
where ξ w v ( t ) = ω a i ( t ) ν y i ( t ) .
Furthermore, the conservative and the actual variance Λ i ( t ) and Λ ¯ i ( t ) are defined as follows
Λ i ( t ) = Q w a i ( t ) S a i ( t ) S a i T ( t ) R y i ( t ) , Λ ¯ i ( t ) = Q ¯ w a i ( t ) S ¯ a i ( t ) S ¯ a i T ( t ) R ¯ y i ( t ) .
The conservative and actual one-step prediction error variance P a i ( t + 1 | t ) and P ¯ a i ( t + 1 | t ) can be rewritten as the following Lyapunov function
P a i ( t + 1 | t ) = Ψ p i ( t ) P a i ( t | t 1 ) Ψ p i T ( t ) + [ Γ a i , K p i ( t ) ] Λ i ( t ) [ Γ a i , K p i ( t ) ] T
P ¯ a i ( t + 1 | t ) = Ψ p i ( t ) P ¯ a i ( t | t 1 ) Ψ p i T ( t ) + [ Γ a i , K p i ( t ) ] Λ ¯ i ( t ) [ Γ a i , K p i ( t ) ] T ,
with the initial values P a i ( 1 | 0 ) = diag { P 01 , 0 , 0 } , P ¯ a i ( 1 | 0 ) = diag { P ¯ 01 , 0 , 0 } .
From (29), (56), we have ε i ( t + r ) = H a i x ˜ a i ( t + r | t + r 1 ) + ν y i ( t + r ) , iterating (58), we can obtain
x ˜ a i ( t | t + N ) = Ψ N ( t ) x ˜ a i ( t | t 1 ) + r = 0 N [ K r N w ( t ) , K r N v ( t ) ] ξ w v ( t + r ) ,
where Ψ p i ( t + r | t ) = Ψ p i ( t + r 1 ) Ψ p i ( t ) and Ψ p i ( t | t ) = I n 1 + 2 m i ,
Ψ N ( t ) = I n 1 + 2 m i r = 0 N K i ( t | t + r ) H a i Ψ p i ( t + r | t ) ,
K r N w ( t ) = j = r + 1 N K i ( t + r ) H a i Ψ p i ( t + j | t + r + 1 ) Γ a i , K r N w ( t ) = 0 ,   N 0 ,
K r N v ( t ) = j = r + 1 N K i ( t + r ) H a i Ψ p i ( t + j | t + r + 1 ) K p i ( t + r ) K i ( t | t + r ) , K r N v ( t ) = K i ( t | t + r ) ,   N 0 .
Furthermore, the optimal conservative white noise deconvolution estimator ω ^ a i ( t | t + N ) of fictitious noise ω a i ( t ) is
ω ^ a i ( t | t 1 ) = 0 ,
ω ^ a i ( t | t + N ) = r = 0 N M w i ( t | t + r ) ε i ( t + r ) ,   N 0 ,
where M w i ( t | t ) = S a i ( t ) Q ε i 1 ( t ) , M w i ( t | t ) = ( Q w a i ( t ) Γ a i T S a i ( t ) K p i T ( t ) ) j = 0 r 1 Ψ p i T ( t + j ) × H a i T Q ε i 1 ( t + r ) , noise estimation error is defined as ω ˜ a i ( t | t + N ) = ω a i ( t ) ω ^ a i ( t | t + N ) , then it is easy to obtain
ω ˜ a i ( t | t + N ) = Ψ N w ( t ) x ˜ a i ( t | t 1 ) + r = 0 N [ M r N w ( t ) , M r N v ( t ) ] ξ w v ( t + r ) ,
where Ψ N w ( t ) = r = 0 N M w i ( t | t + r ) H a i Ψ p i ( t + r | t ) ,
M 0 N w ( t ) = I r k = 1 N M ω i ( t | t + k ) H a i Ψ p i ( t + k | t + 1 ) Γ a i , M r N w ( t ) = j = r + 1 N M ω i ( t | t + j ) H a i Ψ p i ( t + j | t + r + 1 ) Γ a i , r = 0 , ,   N 1 M N N w ( t ) = 0 ,
M r N v ( t ) = j = r + 1 N M ω i ( t | t + j ) H a i Ψ p i ( t + j | t + r + 1 ) K p i ( t + r ) M ω i ( t | t + r ) , M r N v ( t ) = M ω i ( t | t + N ) .
The conservative and actual estimation error variances P a i ( t | t + N ) and P ¯ a i ( t | t + N ) are defined as follows
P a i ( t | t + N ) = Ψ N ( t ) P a i ( t | t 1 ) Ψ N T ( t ) + r = 0 N [ K r N w ( t ) , K r N v ( t ) ] Λ i ( t + r ) [ K r N w ( t ) , K r N v ( t ) ] T , P ¯ a i ( t | t + N ) = Ψ N ( t ) P ¯ a i ( t | t 1 ) Ψ N T ( t ) + r = 0 N [ K r N w ( t ) , K r N v ( t ) ] Λ ¯ i ( t + r ) [ K r N w ( t ) , K r N v ( t ) ] T .
The conservative and actual estimation error variances P w a i ( t | t + N ) and P ¯ w a i ( t | t + N ) of ω ˜ a i ( t | t + N ) are defined as follows
P w a i ( t | t + N ) = Ψ N w ( t ) P a i ( t | t 1 ) Ψ N w T ( t ) + r = 0 N [ M r N w ( t ) , M r N v ( t ) ] Λ i ( t + r ) [ M r N w ( t ) , M r N v ( t ) ] T , P ¯ w a i ( t | t + N ) = Ψ N w ( t ) P ¯ a i ( t | t 1 ) Ψ N w T ( t ) + r = 0 N [ M r N w ( t ) , M r N v ( t ) ] Λ ¯ i ( t + r ) [ M r N w ( t ) , M r N v ( t ) ] T .

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 ) = Q 0 x ^ a i ( t | t + N ) ω ^ a i ( t | t + N ) + Q 0 G x 2 u ( t ) ,
where
Q 0 = Q I n 1 0 J x 1 U x 2 I n 1 0 n 1 × m i 0 n 1 × m i 0 n 1 × n w 0 n 1 × n w 0 n 1 × n w 0 n w × n 1 0 n w × m i 0 n w × m i I n w 0 n w × m i 0 n w × m i , ,
P ( t | t + N ) = Q 0 P a i ( t | t + N ) P x ω ( t | t + N ) P x ω T ( t | t + N ) P w a i ( t | t + N ) , P ¯ ( t | t + N ) = Q 0 P ¯ a i ( t | t + N ) P ¯ x ω ( t | t + N ) P ¯ x ω T ( t | t + N ) P ¯ w a i ( t | t + N ) ,
where
P x ω ( t | t + N ) = Ψ N ( t ) P a i ( t | t 1 ) Ψ N w T ( t ) + r = 0 N [ K r N w ( t ) , K r N v ( t ) ] Λ i ( t + r ) [ M r N w ( t ) , M r N v ( t ) ] T , P ¯ x ω ( t | t + N ) = Ψ N ( t ) P ¯ a i ( t | t 1 ) Ψ N w T ( t ) + r = 0 N [ K r N w ( t ) , K r N v ( t ) ] Λ ¯ i ( t + r ) [ M r N w ( t ) , M r N v ( t ) ] T .
Proof of Theorem 2. 
From (27), we can obtain
x 1 ( t ) = [ I n 1 , 0 n 1 × m i , 0 n 1 × m i ] x a i ( t ) ,
ω ( t ) = [ I n w , 0 n w × m i , 0 n w × m i ] ω a i ( t ) .
Substituting (69) and (70) into (17) yields
x ( t ) = Q x 1 ( t ) J x 1 x 1 ( t ) + U x 2 ω ( t ) + G x 2 u ( t ) = Q I n 1 0 J x 1 U x 2 I n 1 0 n 1 × m i 0 n 1 × m i 0 n 1 × n w 0 n 1 × n w 0 n 1 × n w 0 n w × n 1 0 n w × m i 0 n w × m i I n w 0 n w × m i 0 n w × m i x ^ a i ( t | t + N ) ω ^ a i ( t | t + N ) + 0 G x 2 u ( t ) .
Taking the projection of (71), we can obtain (68). Subtracting (71) from (68), yields
x ˜ ( t | t + N ) = Q 0 x ˜ a i ( t | t + N ) ω ˜ a i ( t | t + N ) ,
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 , σ ¯ i l 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 ,
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 ) = Δ Q w a i ( t ) Δ S a i ( t ) Δ S a i T ( t ) Δ R y i ( t ) ,
rewriting Δ Λ i ( t ) as follows
Δ Λ i ( t ) = Δ Λ i ( 1 ) ( t ) + Δ Λ i ( 2 ) ( t ) ,
where
Δ Λ i ( 1 ) ( t ) = Δ Q w a i ( t ) 0 0 Δ R y i ( t ) , Δ Λ i ( 2 ) ( t ) = 0 Δ S a i ( t ) Δ S a i T ( t ) 0
Δ Λ i ( 2 ) ( t ) = 0 0 0 λ α i Δ Q w ( H i 2 U x 2 ) T 0 0 0 Δ R z y i ( t ) 0 0 0 Δ R y i ( t ) λ α i H i 2 U x 2 Δ Q w Δ R z y i ( t ) Δ R y i ( t ) 0 = λ α i diag I n i × m 1 , I m i , I m i , H i 2 U x 2 0 0 0 Δ Q w 0 0 0 0 0 0 0 0 Δ Q w 0 0 0 × diag I n i × m 1 , I m i , I m i , H i 2 U x 2 T + 0 0 0 0 0 0 0 Δ R z y i ( t ) 0 0 0 0 0 Δ R z y i ( t ) 0 0 + 0 0 0 0 0 0 0 0 0 0 0 Δ R y i ( t ) 0 0 Δ R y i ( t ) 0 ,
since Δ Q w a i ( t ) 0 , Δ R y i ( t ) 0 , we have Δ Λ i ( 1 ) ( t ) 0 , applying Lemma 1, we have Δ Λ i ( 2 ) ( t ) 0 , then Δ Λ i ( t ) 0 .
Parameters Δ P a i ( t | t 1 ) , Δ P a i ( t | t + N ) , Δ P w a i ( t | t + N ) and Δ P x w ( t | t + N ) are defined as follows:
Δ P a i ( t | t 1 ) = P a i ( t | t 1 ) P ¯ a i ( t | t 1 ) , Δ P a i ( t | t + N ) = P a i ( t | t + N ) P ¯ a i ( t | t + N ) , Δ P w a i ( t | t + N ) = P w a i ( t | t + N ) P ¯ w a i ( t | t + N ) , Δ P x w ( t | t + N ) = P a i ( t | t + N ) P ¯ x w ( t | t + N ) ,
from (60) and (61) and (67), it is easy to obtain
Δ P a i ( t | t 1 ) = Ψ p i ( t ) Δ P a i ( t | t 1 ) Ψ p i T ( t ) + [ Γ a i , K p i ( t ) ] Δ Λ i ( t ) [ Γ a i , K p i ( t ) ] T , Δ P a i ( t | t + N ) = Ψ N ( t ) Δ P a i ( t | t 1 ) Ψ N T ( t ) + r = 0 N [ K r N w ( t ) , K r N v ( t ) ] Δ Λ i ( t + r ) [ K r N w ( t ) , K r N v ( t ) ] T , Δ P w a i ( t | t + N ) = Ψ N w ( t ) Δ P a i ( t | t 1 ) Ψ N w T ( t ) + r = 0 N [ M r N w ( t ) , M r N v ( t ) ] Δ Λ i ( t + r ) [ M r N w ( t ) , M r N v ( t ) ] T , Δ P x ω ( t | t + N ) = Ψ N ( t ) Δ P a i ( t | t 1 ) Ψ N w T ( t )
+ r = 0 N [ K r N w ( t ) , K r N v ( t ) ] Δ Λ i ( t + r ) [ M r N w ( t ) , M r N v ( t ) ] T ,
with the initial condition Δ P a i ( 1 | 0 ) 0 , applying mathematical induction method, yield
Δ P a i ( t | t 1 ) 0 .
From (72), defining Δ P ( t | t + N ) = E [ x ˜ ( t | t + N ) x ˜ T ( t | t + N ) ] , we have
Δ P ( t | t + N ) = Q 0 Δ P a i ( t | t + N ) Δ P x ω ( t | t + N ) Δ P x ω T ( t | t + N ) Δ P w a i ( t | t + N ) Q 0 T ,
substituting (78) into (80), yield
Δ P ( t | t + N ) = Q 0 Ψ N ( t ) Δ P a i ( t | t 1 ) Ψ N T ( t ) Ψ N ( t ) Δ P a i ( t | t 1 ) Ψ N w T ( t ) Ψ N w ( t ) Δ P a i ( t | t 1 ) Ψ N T ( t ) Ψ N w ( t ) Δ P a i ( t | t 1 ) Ψ N w T ( t ) Q 0 T + Q 0 r = 0 N K ˘ Δ Λ i ( t + r ) K ˘ T r = 0 N K ˘ Δ Λ i ( t + r ) M ˘ T r = 0 N M ˘ Δ Λ i ( t + r ) K ˘ T r = 0 N M ˘ Δ Λ i ( t + r ) M ˘ T Q 0 T ,
then (81) can be rewritten as
Δ P ( t | t + N ) = Q ( 0 ) Δ P a i ( t | t 1 ) Δ P a i ( t | t 1 ) Δ P a i ( t | t 1 ) Δ P a i ( t | t 1 ) Q ( 0 ) T + r = 0 N Q ( 1 ) Δ Λ i ( t + r ) Δ Λ i ( t + r ) Δ Λ i ( t + r ) Δ Λ i ( t + r ) Q ( 1 ) T ,
where Q ( 0 ) = Q 0 diag Ψ N ( t ) , Ψ N w ( t ) , K ˘ = [ K r N w ( t ) , K r N v ( t ) ] , M ˘ = [ M r N w ( t ) , M r N v ( t ) ] , Q ( 1 ) = Q 0 diag [ K r N w ( t ) , K r N v ( t ) ] , [ M r N w ( t ) , M r N v ( 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, u e ( t ) is control input, R 0 , L 0 , C 1 and C 2 are resister, inductor and capacities, respectively. The MSDS model is given as follows
C 1 0 0 0 0 C 2 0 0 0 0 L 0 0 0 0 0 0 d x ( t ) d t = 0 0 0 1 0 0 1 0 1 1 0 0 1 0 R 0 R 0 x ( t ) + 0 0 0 1 w ( t ) + 0 0 0 1 u ( t )
where, x ( t ) = [ u e 1 ( t ) , u e 2 ( t ) , i 1 ( t ) , i 2 ( t ) ] T , u e 1 ( t ) and u e 2 ( t ) are the voltage of C 1 and C 2 , i 1 ( t ) and i 2 ( t ) are the current of C 1 and C 2 , w ( t ) is zero mean white noise, the variance is Q W .
Taking the sample period T 0 = 0.1 s, the brief parameter matrices are as follows:
M = C 1 0 0 0 0 C 2 0 0 0 0 L 0 0 0 0 0 0 , Γ = 0 0 0 1 , Φ = M + T 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 R 0 R 0 , B = 0 0 0 T 0 .
Let u e 1 ( t ) = 0.1 , C 1 = 2 , C 2 = 10 , L 0 = 1 , H = [ 0 , 1 , 0 , 1 ] , λ α = 0.9 , λ β = 0.9 , λ γ = 0.9 , Q W = 1.5 , R = 4 , P 0 = 10 2 I 4 . Furthermore, the following matrices in (15) as given as
M 1 = 10 0 0 0 2 0 0 0 1 , P = 0 1 0 0 1 0 0 0 0 0 1 0 0 0 0 1 , Q = 0 1 0 0 1 0 0 0 0 0 1 0 0 0 0 1 .
Figure 2 and Figure 3 gives the first and second components of actual state x 1 , x 2 and corresponding filters x 1 ( t | t ) , x 2 ( t | t ) from t = 600 to t = 1200 , where the solid curves denote the true state components x ( t ) and the dotted curves denote x p ( t | t ) . From Figure 3, the every component of robust filter can effectively follow the true state component x p ( 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 tr P ( t | t + N ) , and as Theorem 3 states, it has an upper bound tr P ( t | t + N ) .
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].

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.

Funding

This research received no external funding.

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.

References

  1. Luenberger, D. Dynamic equations in descriptor form. IEEE Trans. Autom. Control 1977, 22, 312–321. [Google Scholar] [CrossRef]
  2. Hasan, M.A.; Azim-Sadjani, M.R. Noncausal image modeling using descriptor approach. IEEE Trans. Circuits Syst. II 1995, 42, 536–540. [Google Scholar] [CrossRef] [Green Version]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  7. Sun, S.L.; Ma, J. Optimal filtering and smoothing for discrete-time stochastic singular systems. Signal Process 2007, 87, 189–201. [Google Scholar] [CrossRef]
  8. Deng, Z.L.; Xu, Y. Descriptor Wiener state estimators. Automatica 2000, 36, 1761–1766. [Google Scholar] [CrossRef]
  9. Bai, Y.; Wang, X.; Jin, X. A neuron-based kalman filter with nonlinear autoregressive model. Sensors 2020, 20, 299. [Google Scholar] [CrossRef] [Green Version]
  10. Luttmann, L.; Mercorelli, P. Comparison of backpropagation and Kalman filter-based training for neural networks. In 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. [Google Scholar] [CrossRef]
  13. Kalman, R.E. A new approach to linear filtering and prediction problems. J. Basic Eng. 1960, 82, 35–45. [Google Scholar] [CrossRef] [Green Version]
  14. Kalman, R.E.; Bucy, R.S. New Results in Linear Filtering and Prediction Theory. J. Basic Eng. 1961, 83, 95–108. [Google Scholar] [CrossRef] [Green Version]
  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. [Google Scholar] [CrossRef]
  17. Nahi, N. Optimal recursive estimation with uncertain observation. IEEE Trans. Inf. Theory 1969, 15, 457–462. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  29. Anderson, B.; Moore, J. Optimal Filtering; Prentice-Hall: Englewood Clifs, NJ, USA, 1979. [Google Scholar]
Figure 1. The circuit system.
Figure 1. The circuit system.
Sensors 23 06968 g001
Figure 2. x 1 and its filter x ^ 1 ( t | t ) .
Figure 2. x 1 and its filter x ^ 1 ( t | t ) .
Sensors 23 06968 g002
Figure 3. x 2 and its filter x ^ 2 ( t | t ) .
Figure 3. x 2 and its filter x ^ 2 ( t | t ) .
Sensors 23 06968 g003
Figure 4. MSE ( t | t 1 ) curve.
Figure 4. MSE ( t | t 1 ) curve.
Sensors 23 06968 g004
Figure 5. MSE ( t | t ) curve.
Figure 5. MSE ( t | t ) curve.
Sensors 23 06968 g005
Figure 6. MSE ( t | t + 1 ) curve.
Figure 6. MSE ( t | t + 1 ) curve.
Sensors 23 06968 g006
Table 1. Model comparisons.
Table 1. Model comparisons.
ModelThis 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.
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.

Share and Cite

MDPI and ACS Style

Zheng, J.; Cui, W.; Sun, S. Robust Fusion Kalman Estimator of the Multi-Sensor Descriptor System with Multiple Types of Noises and Packet Loss. Sensors 2023, 23, 6968. https://doi.org/10.3390/s23156968

AMA Style

Zheng J, Cui W, Sun S. Robust Fusion Kalman Estimator of the Multi-Sensor Descriptor System with Multiple Types of Noises and Packet Loss. Sensors. 2023; 23(15):6968. https://doi.org/10.3390/s23156968

Chicago/Turabian Style

Zheng, Jie, Wenxia Cui, and Sian Sun. 2023. "Robust Fusion Kalman Estimator of the Multi-Sensor Descriptor System with Multiple Types of Noises and Packet Loss" Sensors 23, no. 15: 6968. https://doi.org/10.3390/s23156968

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop