# Robust Filtering for Linear Equality Constrained Systems

Authors: Chuanbo Wen; Yunze Cai; Xiaoming Xu
Journal: Discrete Dynamics in Nature and Society
 (2012)

---

## Abstract

This paper deals with the robust filtering problem for linear discrete-time constrained systems. The purpose is the design of a linear filter such that the resulting error system is bounded. An orthogonal factorization is used to decompose the original robust filtering problem into stochastic and deterministic parts, which are then solved separately. Finally, a numerical example is presented to demonstrate the applicability of the proposed method.


---

## Body

## 1. Introduction

Kalman filtering is one of the well-knownH2 filtering methods that is widely used in the fields of signal processing and automatic control [1]. It is noted that the Kalman filtering method is based on the assumption that the system has known model and its disturbances are Gaussian white noises with known statistics. In some applications, however, the statistics of the noises are not exactly known, and the standard Kalman filtering algorithms will generally not guarantee satisfactory performance and only can obtain the estimate value with great error. Also, the strict assumptions limit the application scope of this filtering especially when there are uncertainties in either the state model or the measurement model. To handle the above problem, an alternative regularized estimate method based on least square design technique has been proposed recently. The objective is to find a filter such that the resulting estimate error is bounded and the main idea of this method is to reduce the vector optimization problem to an equivalent scalar minimization problem [2, 3]. Compared with earlier studies, such as H∞ method and guaranteed-cost method, the new method simultaneously uses regularization and weighting to deal with a class of uncertainties [3–5].On the other hand, constrained filtering and control problem has drawn considerable attention over the past decades due to extensive application backgrounds. Actually, constraint formulation arises naturally in many fields such as target tracking, manufacturing production, engine health estimation, and vehicle motion [6, 7]. One of the features of these systems is that some components of the state are affected by some equations without noises. In conventional linear stochastic models with additive white process noise, filtering method for constrained systems has been investigated by many scholars. For example, Wen and Durrant-Whyte   have considered the constrained problem by treating the set of constraint equations as additional accurate observations without noises [8].  Simon and Chia   have shown that the solution of constrained problem can be obtained by treating the constraint equation as a constrained condition and solving a Lagrangian equation [9]. Moreover, Hewett et al. have presented a reduced null space method based on the null space decomposition to solve such problems [10].Among the previous works on constrained estimation, the most popular approach is the projection method. This method enforces linear equality constraints on state space estimation, and the constrained estimate is merely a correction that forces the unconstrained estimate onto the constraint space [9]. In actual estimate and in value of objective function, the null space method often produces similar results as that of the project method. For the problem of robust filtering for constrained systems, however, there are still no results available in the literature. This motivates the present study. The regularized robust filtering is originally developed by Sayed to deal with the regularized dynamic system [2, 3] and Ishihara et al. use this method to present the robust filtering for uncertain singular system [11]. In this paper, we will give the regularized robust design method for uncertain constrained system.In this paper, we deal with the robust filtering problem for uncertain constrained systems. Attention is focused on solving the least square problem, and the robust Kalman type recursion is developed. The remainder of this paper is organized as follows. Section2 formulates the constrained systems and the problems to be solved. We review the filtering method for accurate constrained model in Section 3. In Section 4, the QR factorization is used to gain a new reduced system and the robust filtering is presented. We show numerical example that illustrates the new method performance in Section 5 and offer conclusion in Section 6.The notation used in this paper is standard.AT and A† are the transpose and the pseudoinverse of the matrix A, respectively. P>0 (P≥0) denotes a positive-definite (semidefinite) matrix. For a column vector x and a positive matrix W, ∥x∥2 is the Euclidean norm of x, and ∥x∥W is the weighted form. diag{x,y} denotes a block diagonal matrix with entries x and y.


## 2. Problem Formulation and Analysis

### 2.1. Problem Formation

Consider a uncertain linear constrained system described by following model:(2.1)xk=(Ak+δAk)xk-1+wk-1,(2.2)yk=(Hk+δHk)xk+vk,(2.3)Dkxk=dk,
where xk∈Rn is the state vector satisfying equality constraints and yk∈Rm is the measurement output. Ak is a n×n state update matrix, Hk is an m×n observation matrix, Dk is a s×n constraint matrix, and dk is a known vector. δAk and δHk are time-varying uncertainties to the nominal system matrices. The initial state x0, process noises sequence wk, and measurement noises sequence vk are uncorrelated zero mean white noises with variance
(2.4)E([x0wkvk][x0wlvl]T)=[Π0000Ωkδkl000Vkδkl],
where δkl is the Kronecker function, Π0>0, Ωk>0, and Vk>0. The uncertainties are assumed with the following structure:
(2.5)[δAkδHk]=[MakMhk]ΔkNk,Δk≤1,
where Mak, Mhk, and Nk are known matrices, and Δk is a bounded matrix but otherwise arbitrary. We allow Mak, Mhk, and Nk to vary with time.The purpose of this paper is to find a recursive robust state estimate algorithm for this constrained system with modeling uncertainties. With the constrained condition (2.3), the system (2.1)–(2.3) is not a standard form and the robust filtering presented in [2] is not applicable, so we cannot directly use them to present the analysis. The key to solving this problem is to transfer the constrained system into some new systems without constraint.On the other hand, the final estimate result of the statexk should satisfy the additional constraint (2.3), which means that the estimate belongs to the space, denoted as Θk, composed by the solutions of (2.3). The constraint matrix Dk and vector dk are assumed to satisfy Rank[Dkdk]=Rank[Dk] to make Θk≠⌀. We assume that the constraint matrix Dk has full column row rank and s<n.


## 2.1. Problem Formation

Consider a uncertain linear constrained system described by following model:(2.1)xk=(Ak+δAk)xk-1+wk-1,(2.2)yk=(Hk+δHk)xk+vk,(2.3)Dkxk=dk,
where xk∈Rn is the state vector satisfying equality constraints and yk∈Rm is the measurement output. Ak is a n×n state update matrix, Hk is an m×n observation matrix, Dk is a s×n constraint matrix, and dk is a known vector. δAk and δHk are time-varying uncertainties to the nominal system matrices. The initial state x0, process noises sequence wk, and measurement noises sequence vk are uncorrelated zero mean white noises with variance
(2.4)E([x0wkvk][x0wlvl]T)=[Π0000Ωkδkl000Vkδkl],
where δkl is the Kronecker function, Π0>0, Ωk>0, and Vk>0. The uncertainties are assumed with the following structure:
(2.5)[δAkδHk]=[MakMhk]ΔkNk,Δk≤1,
where Mak, Mhk, and Nk are known matrices, and Δk is a bounded matrix but otherwise arbitrary. We allow Mak, Mhk, and Nk to vary with time.The purpose of this paper is to find a recursive robust state estimate algorithm for this constrained system with modeling uncertainties. With the constrained condition (2.3), the system (2.1)–(2.3) is not a standard form and the robust filtering presented in [2] is not applicable, so we cannot directly use them to present the analysis. The key to solving this problem is to transfer the constrained system into some new systems without constraint.On the other hand, the final estimate result of the statexk should satisfy the additional constraint (2.3), which means that the estimate belongs to the space, denoted as Θk, composed by the solutions of (2.3). The constraint matrix Dk and vector dk are assumed to satisfy Rank[Dkdk]=Rank[Dk] to make Θk≠⌀. We assume that the constraint matrix Dk has full column row rank and s<n.


## 3. Standard Constrained Filter

The constrained filter algorithm has some advantages compared with the standard Kalman filter, which are given in [9, 10]. In this section, we will review the constrained filtering method for accurate state-space model.The accurate constrained system is(3.1)xk=Akxk-1+wk-1,yk=Hkxk+vk,Dkxk=dk.In [10], it uses orthogonal factorization to decompose the original state into stochastic and deterministic parts. The QR factorization of DkT(3.2)DkT=[Q1,kQ2,k][R11,k0]
and the initial state can be rewritten as
(3.3)xk=xd,k+Q2,kzs,k,
where
(3.4)xd,k=Q1,kR11,k-Tdk.It also gives a new reduced constrained system(3.5)zs,k=Q2,kTAkxd,k-1+Q2,kTAkQ2,k-1zs,k-1+Q2,kTwk-1,yk-Hkxd,k=HkQ2,kzs,k+vk.The recursive estimate algorithm for accurate constrained system can be summarized asStep 0.
Initialization
Q
R decomposition:
(3.6)[Q1,0Q2,0][R11,00]=QR(D0T).
The deterministic part is(3.7)xd,0=Q1,0R11,0-Td0.
Set(3.8)z^s,0∣-1=-Q2,0Txd,0,Ps,0∣-1=Q2,0TΠ0Q2,0.Step 1.
Prediction
Q
R decomposition:
(3.9)[Q1,kQ2,k][R11,k0]=QR(DkT).
The deterministic part is(3.10)xd,k=Q1,kR11,k-Tdk.
According to (3.5), it gives
(3.11)z^s,k∣k-1=Q2,kT[AkQ2,k-1z^s,k-1∣k-1+Akxd,k],Ps,k∣k-1=Q2,kT[AkQ2,k-1Ps,k-1∣k-1Q2,k-1TAkT+Ωk-1]Q2,k.Step 2.
Measurement Update
One has(3.12)Kz,k=Ps,k∣k-1(HkQ2,k)T[HkQ2,kPs,k∣k-1(HkQ2,k)T+Vk]-1,z^s,k∣k=z^s,k∣k-1+Kz,k[yk-Hkxd,k-HkQ2,kz^s,k∣k-1],Ps,k∣k=Ps,k∣k-1-Kz,kHkQ2,kPs,k∣k-1.Step 3.
Reconstruction
Prediction reconstruction:(3.13)x^k∣k-1=xd,k+Q2,kz^s,k∣k-1,Pk∣k-1=Q2,kPs,k∣k-1Q2,kT.
Estimate reconstruction:(3.14)x^k∣k=xd,k+Q2,kz^s,k∣k,Pk∣k=Q2,kPs,k∣kQ2,kT.
The key for the above recursive estimation algorithm is finding the optimal estimation ofz^s,k∣k. With (3.5), the optimal estimate of z^s,k∣k can be derived by solving the following regularized least-square problem:
(3.15)min⁡zs,k-1,zs,k[‖zs,k-1-z^s,k-1∣k-1‖Ps,k-1∣k-1-12+‖zs,k-Q2,kTAkQ2,k-1zs,k-1-Q2,kTAkxd,k‖Ωk-1-12+‖yk-Hkxd,k-HkQ2,kzs,k‖Vk-12‖zs,k-Q2,kTAkQ2,k-1zs,k-1-Q2,kTAkxd,k‖Ωk-1-12].Next, we will present the robust filter for the uncertain constrained system also by solving a uncertain least-square problem.


## 4. Robust Filtering

Referring again to the state-space model (2.1)–(2.3), the optimum robust filtering method will be presented in this section. Firstly, we will decompose the original uncertain constrained system into two parts, and then solve them separately.


### 4.1. New Dimension Reduced Uncertain Model

With the state evolution equation (2.1) and measurement equation (2.3), we will give the optimal estimate x^k∣k for state xk. Similar to the approach described in Section 3, we will use the null space method to deal with the uncertain model.According to the uncertain model (2.1)–(2.3), we define the QR factorization of DkT and rewrite the initial state equation as
(4.1)xk=xd,k+xs,k=Q1,kξk+Q2,kηk,
where Q1,kT is an s×n matrix whose columns form a basis for Span(A), and Q2,kT is an (n-s)×n matrix whose columns form a orthogonal basis for Span(A)⊥=Null(A).Substituting (4.1) into (2.3) gives
(4.2)[R11,kT0][Q1,kTQ2,kT](Q1,kξk+Q2,kηk)=dk,
then we have
(4.3)ξk=R11,k-Tdk.Also substituting (4.1) into (2.1), we have
(4.4)Q1,kξk+Q2,kηk=(Ak+δAk)(Q1,k-1ξk-1+Q2,k-1ηk-1)+wk-1.Both sides of above equation multiplyingQ2,kT gives
(4.5)Q2,kTQ1,kξk+Q2,kTQ2,kηk=Q2,kT(Ak+δAk)(Q1,k-1ξk-1+Q2,k-1ηk-1)+Q2,kTwk-1.Since(4.6)Q2,kTQ1,k=0,Q2,kTQ2,k=I.We have(4.7)ηk=Q2,kT(Ak+δAk)Q1,k-1ξk-1+Q2,kT(Ak+δAk)Q2,k-1ηk-1+Q2,kTwk-1=Q2,kT(Ak+δAk)Q1,k-1R11,k-1-Tdk-1+Q2,kT(Ak+δAk)Q2,k-1ηk-1+Q2,kTwk-1.Similarly, substituting (4.1) into (2.2) gives
(4.8)yk=(Hk+δHk)xk+vk=(Hk+δHk)(Q1,kξk+Q2,kηk)+vk=(Hk+δHk)Q1,kR11,k-Tdk+(Hk+δHk)Q2,kηk+vk,
that is,
(4.9)yk-HkQ1,kR11,k-Tdk=δHkQ1,kR11,k-Tdk+(Hk+δHk)Q2,kηk+vk.The uncertain constrained state space model inxk is converted into an unconstrained uncertain state space model in ηk. Written together, (4.7) and (4.9) yield a new uncertain unconstrained state space model.
(4.10)ηk=Q2,kT(Ak+δAk)Q1,k-1R11,k-1-Tdk-1+Q2,kT(Ak+δAk)Q2,k-1ηk-1+Q2,kTwk-1,yk-HkQ1,kR11,k-Tdk=δHkQ1,kR11,k-Tdk+(Hk+δHk)Q2,kηk+vk.


### 4.2. Robust Filtering for the Uncertain Model

Reference [2] develops the framework for state estimation when the parameters of the state equations are subject to uncertainties. However, both the system matrix and measurement matrix in the system (4.7) and (4.9) have uncertainties, and the matrix defined in [2] cannot directly be  used. In order to present the robust filtering for this system, some new matrices will be defined in next subsection.Let us first introduce a lemma.Lemma 4.1 (see [2]).
Consider the following optimization problem:(4.11)min⁡xmax⁡δA,δb[‖x‖Q2+‖(A+δA)x-(b-δb)‖W2],
where A denotes the data matrix, δA denotes a perturbation matrix, b denotes the measurement vector, and δb denotes a perturbation vector. x is the unknown vector, Q=QT>0 and W=WT>0 is a weighting matrix. δA and δb are assumed to satisfy a model
(4.12)[δAδb]=HΔ[EaEb],
where Δ is an arbitrary contraction satisfying ∥Δ∥≤1. H, Ea, and Eb are known quantities of appropriate dimensions.
The problem (4.11) has a unique solution, which is given by
(4.13)x^=[Q^+ATW^A]-1[ATW^b+λ^EaTEb],
where the modified weighting matrix {Q^,W^} is defined by
(4.14)Q^:=Q+λ^EaTEa,W^:=W+WH(λ^I-HTWH)†HTW,
and λ^ is a nonnegative scalar parameter obtained by following optimization problem:
(4.15)λ^=argmin⁡λ≥∥HTWH∥G(λ),
where
(4.16)G(λ):=‖x(λ)‖Q2+λ‖Eax(λ)-Eb‖2+‖Ax(λ)-b‖W(λ)2.
The auxiliary function are defined by(4.17)W(λ):=W+WH(λI-HTWH)†HTW,Q(λ):=Q+λEaTEa,x(λ):=[Q(λ)+ATW(λ)A]-1[ATW(λ)b+λEaTEb].As mentioned in Section3, the optimal estimate problem can be solved by minimizing the cost function (3.15). Similarly, the robust filtering problem for the dimension reduced model (4.7) and (4.9) can be turn to solve following least-square problem:
(4.18)min⁡ηk-1,ηkmax⁡δAk‖ηk-1-η^k-1∣k-1‖Pη,k-1∣k-1-12+‖ηk-Q2,kT(Ak+δAk)Q1,k-1R11,k-1-Tdk-1-Q2,kT(Ak+δAk)Q2,k-1ηk-1‖Ω-k-1-12+‖yk-HkQ1,kR11,k-Tdk-δHkQ1,kR11,k-Tdk-(Hk+δHk)Q2,kηk‖Vk-12,
where
(4.19)Ω-k-1=Q2,kTΩk-1Q2,k.In (4.18), the parameters Ak and Hk contain uncertainties. With appropriate definition, the lest-square problem can be rewritten more compactly. Let us define
(4.20)x⟵[ηk-1-η^k-1∣k-1ηk],A⟵[Q2,kTAkQ2,k-1-I0HkQ2,k],δA⟵[Q2,kTδAkQ2,k-100δHkQ2,k],b⟵[Q2,kTAkQ1,k-1R11,k-1-Tdk-1+Q2,kTAkQ2,k-1η^k-1∣k-1HkQ1,kR11,k-Tdk-yk],δb⟵[Q2,kTδAkQ1,k-1R11,k-1-Tdk-1+Q2,kTδAkQ2,k-1η^k-1∣k-1δHkQ1,kR11,k-Tdk],Q⟵[Pη,k-1∣k-1-1000],W⟵[(Q2,kTΩk-1Q2,k)-100Vk-1],H⟵[Q2,kTMhk00Q2,k],Ea⟵[NkQ2,k-100Q2,k],Eb⟵[Nk(Q1,k-1R11,k-1-Tdk-1+Q2,k-1η^k-1∣k-1)NkQ1,kR11,k-Tdk].Letηk∣k and Pη,k∣kk=1,2,3,… be the estimate result and estimate error covariance of the stochastic vector ηk, respectively. With Lemma 4.1 and above definition, the robust filter for ηk can be summarized as in the following theorem.Theorem 4.2.
Assume that the estimateη^k-1∣k-1 and the estimate error covariance Pη,k-1∣k-1 of ηk-1 have been known. At time index k, the robust filter of x can be given by solving the following equation:
(4.21)(Q^+ATW^A)x^=ATW^b+λ^kEaTEb,
where
(4.22)Q^=[Pη,k-1|k-1-1+λ^k(NkQ2,k-1)TNkQ2,k-100Q2,kTQ2,k],W^=[Ω^k-100V^k-1]-1,Ω^k-1=Q2,kT(Ωk-1-λ^k-1-1Mak-1Mak-1T)Q2,k,V^k=Vk-λ^k-1-1HkQ2,kMhkMhkT(HkQ2,k)T,
and λ^k is determined by minimizing the function G(λ) of (4.16) in the interval (λl,k,∞), where
(4.23)λl,k:=‖HTWH‖=‖diag⁡{MakTQ2,k(Q2,kTΩk-1Q2,k)-1Q2,kTMak,Q2,kTVk-1Q2,k}‖.Proof.
Analogous to [2, 3, 11], using Lemma 4.1 yields (4.21).Theorem4.2 gives the robust filter of ηk, then, the robust constrained estimate of the full state xk can be constructed by using the relationship
(4.24)x^k∣k=Q1,kξk+Q2,kη^k∣k.It is easily verified thatx^k∣k satisfies the constraint equation
(4.25)Dkx^k∣k=Dk[Q1,kξk+Q2,kη^k∣k]=DkQ1,kξk+DkQ2,kη^k∣k=dk.Similarly, the constrained error covariancePk∣k can be computed by using
(4.26)Pk∣k=Q2,kPη,k∣kQ2,kT,
where Pη,k∣k of (4.35) is the estimate error covariance of ηk.


### 4.3. Recursive Form of Constrained Robust Filter

After some considerable algebra, similar to [2], the recursive robust estimate x^k∣k can be summarized as follows.Step 0.
Initialization
Q
R decomposition:
(4.27)[R11,0T0][Q1,0TQ2,0T]=QR(D0).
The deterministic part is(4.28)ξ0=R11,0Td0.
Set(4.29)η^0∣0=Pη,0∣0(H0Q2,0)TV0-1y0,Pη,0∣0=[(Q2,0TΠ0Q2,0)-1+(H0Q2,0)TV0-1H0Q2,0]-1.Step 1.
Determiningλ^k
QR decomposition:
(4.30)[R11,kT0][Q1,kTQ2,kT]=QR(Dk).
It gives the deterministic part at time indexk(4.31)ξk=R11,kTdk
and the new dimension reduced robust system (4.7) and (4.9).
IfMak≠0, then set λ^k=0. Otherwise, with the definitions of (4.20), determine the scalar parameter λ^k by minimizing G(λ) over the interval (λl,k,∞).Step 2.
Replace Parameters
Ifλ^k≠0, the original parameters {Ωk-1,Vk,Pη,k-1∣k-1,Ak} are replaced by
(4.32)Ω^k-1=Q2,kT(Ωk-1-λ^k-1-1Mak-1Mak-1T)Q2,k,V^k=Vk-λ^k-1-1HkQ2,kMhkMhkT(HkQ2,k)T,P^η,k-1∣k-1=Pη,k-1∣k-1-Pη,k-1∣k-1(NkQ2,k-1)T×[λ^k-1-1I+NkQ2,k-1Pη,k-1∣k-1(NkQ2,k-1)T]-1×NkQ2,k-1Pη,k-1∣k-1,A^k=Ak[I-λ^k-1P^k-1∣k-1(NkQ2,k-1)TNkQ2,k-1].Step 3.
Prediction and Update
Prediction:(4.33)η^k∣k-1=A^kη^k-1∣k-1+Q2,kTAkQ1,k-1R11,k-1-Tdk-1,Pη,k∣k-1=A^kP^η,k∣k-1A^kT.
Update:(4.34)η^k∣k=η^k∣k-1+Pη,k∣k-1(HkQ2,k)TV^k-1ek,(4.35)Pη,k∣k=Pη,k∣k-1-Pη,k∣k-1(HkQ2,k)TVe,k-1HkQ2,kPη,k∣k-1,
where
(4.36)ek=yk-HkQ1,kR11,k-1-Tdk-1-HkQ2,kη^k∣k-1,Ve,k=V^k+(HkQ2,k)TPη,k∣k-1HkQ2,k.Step 4.
Reconstruction
Prediction reconstruction:(4.37)x^k∣k-1=Q1,kξk+Q2,kη^k∣k-1,Pk∣k-1=Q2,kPη,k∣k-1Q2,kT.
Estimate reconstruction:(4.38)x^k∣k=Q1,kξk+Q2,kη^k∣k,Pk∣k=Q2,kPη,k∣kQ2,kT.Steps1–4 give the robust estimate of the full state xk.Remark 4.3.
From the definition of{Ω^k-1,V^k,P^η,k-1∣k-1,A^k} and the prediction and update process in Step 3, it is easy to verify that for the constrained system without uncertainties, the robust filtering algorithm reduces to the filtering result introduced in [10].Remark 4.4.
IfDk∈Rn×n and Rank{Dk}=n, the matrix Q2,k and the dimensional reduced model (4.7) will disappear, then we have x^k∣k=Dk-1dk.


## 4.1. New Dimension Reduced Uncertain Model

With the state evolution equation (2.1) and measurement equation (2.3), we will give the optimal estimate x^k∣k for state xk. Similar to the approach described in Section 3, we will use the null space method to deal with the uncertain model.According to the uncertain model (2.1)–(2.3), we define the QR factorization of DkT and rewrite the initial state equation as
(4.1)xk=xd,k+xs,k=Q1,kξk+Q2,kηk,
where Q1,kT is an s×n matrix whose columns form a basis for Span(A), and Q2,kT is an (n-s)×n matrix whose columns form a orthogonal basis for Span(A)⊥=Null(A).Substituting (4.1) into (2.3) gives
(4.2)[R11,kT0][Q1,kTQ2,kT](Q1,kξk+Q2,kηk)=dk,
then we have
(4.3)ξk=R11,k-Tdk.Also substituting (4.1) into (2.1), we have
(4.4)Q1,kξk+Q2,kηk=(Ak+δAk)(Q1,k-1ξk-1+Q2,k-1ηk-1)+wk-1.Both sides of above equation multiplyingQ2,kT gives
(4.5)Q2,kTQ1,kξk+Q2,kTQ2,kηk=Q2,kT(Ak+δAk)(Q1,k-1ξk-1+Q2,k-1ηk-1)+Q2,kTwk-1.Since(4.6)Q2,kTQ1,k=0,Q2,kTQ2,k=I.We have(4.7)ηk=Q2,kT(Ak+δAk)Q1,k-1ξk-1+Q2,kT(Ak+δAk)Q2,k-1ηk-1+Q2,kTwk-1=Q2,kT(Ak+δAk)Q1,k-1R11,k-1-Tdk-1+Q2,kT(Ak+δAk)Q2,k-1ηk-1+Q2,kTwk-1.Similarly, substituting (4.1) into (2.2) gives
(4.8)yk=(Hk+δHk)xk+vk=(Hk+δHk)(Q1,kξk+Q2,kηk)+vk=(Hk+δHk)Q1,kR11,k-Tdk+(Hk+δHk)Q2,kηk+vk,
that is,
(4.9)yk-HkQ1,kR11,k-Tdk=δHkQ1,kR11,k-Tdk+(Hk+δHk)Q2,kηk+vk.The uncertain constrained state space model inxk is converted into an unconstrained uncertain state space model in ηk. Written together, (4.7) and (4.9) yield a new uncertain unconstrained state space model.
(4.10)ηk=Q2,kT(Ak+δAk)Q1,k-1R11,k-1-Tdk-1+Q2,kT(Ak+δAk)Q2,k-1ηk-1+Q2,kTwk-1,yk-HkQ1,kR11,k-Tdk=δHkQ1,kR11,k-Tdk+(Hk+δHk)Q2,kηk+vk.


## 4.2. Robust Filtering for the Uncertain Model

Reference [2] develops the framework for state estimation when the parameters of the state equations are subject to uncertainties. However, both the system matrix and measurement matrix in the system (4.7) and (4.9) have uncertainties, and the matrix defined in [2] cannot directly be  used. In order to present the robust filtering for this system, some new matrices will be defined in next subsection.Let us first introduce a lemma.Lemma 4.1 (see [2]).
Consider the following optimization problem:(4.11)min⁡xmax⁡δA,δb[‖x‖Q2+‖(A+δA)x-(b-δb)‖W2],
where A denotes the data matrix, δA denotes a perturbation matrix, b denotes the measurement vector, and δb denotes a perturbation vector. x is the unknown vector, Q=QT>0 and W=WT>0 is a weighting matrix. δA and δb are assumed to satisfy a model
(4.12)[δAδb]=HΔ[EaEb],
where Δ is an arbitrary contraction satisfying ∥Δ∥≤1. H, Ea, and Eb are known quantities of appropriate dimensions.
The problem (4.11) has a unique solution, which is given by
(4.13)x^=[Q^+ATW^A]-1[ATW^b+λ^EaTEb],
where the modified weighting matrix {Q^,W^} is defined by
(4.14)Q^:=Q+λ^EaTEa,W^:=W+WH(λ^I-HTWH)†HTW,
and λ^ is a nonnegative scalar parameter obtained by following optimization problem:
(4.15)λ^=argmin⁡λ≥∥HTWH∥G(λ),
where
(4.16)G(λ):=‖x(λ)‖Q2+λ‖Eax(λ)-Eb‖2+‖Ax(λ)-b‖W(λ)2.
The auxiliary function are defined by(4.17)W(λ):=W+WH(λI-HTWH)†HTW,Q(λ):=Q+λEaTEa,x(λ):=[Q(λ)+ATW(λ)A]-1[ATW(λ)b+λEaTEb].As mentioned in Section3, the optimal estimate problem can be solved by minimizing the cost function (3.15). Similarly, the robust filtering problem for the dimension reduced model (4.7) and (4.9) can be turn to solve following least-square problem:
(4.18)min⁡ηk-1,ηkmax⁡δAk‖ηk-1-η^k-1∣k-1‖Pη,k-1∣k-1-12+‖ηk-Q2,kT(Ak+δAk)Q1,k-1R11,k-1-Tdk-1-Q2,kT(Ak+δAk)Q2,k-1ηk-1‖Ω-k-1-12+‖yk-HkQ1,kR11,k-Tdk-δHkQ1,kR11,k-Tdk-(Hk+δHk)Q2,kηk‖Vk-12,
where
(4.19)Ω-k-1=Q2,kTΩk-1Q2,k.In (4.18), the parameters Ak and Hk contain uncertainties. With appropriate definition, the lest-square problem can be rewritten more compactly. Let us define
(4.20)x⟵[ηk-1-η^k-1∣k-1ηk],A⟵[Q2,kTAkQ2,k-1-I0HkQ2,k],δA⟵[Q2,kTδAkQ2,k-100δHkQ2,k],b⟵[Q2,kTAkQ1,k-1R11,k-1-Tdk-1+Q2,kTAkQ2,k-1η^k-1∣k-1HkQ1,kR11,k-Tdk-yk],δb⟵[Q2,kTδAkQ1,k-1R11,k-1-Tdk-1+Q2,kTδAkQ2,k-1η^k-1∣k-1δHkQ1,kR11,k-Tdk],Q⟵[Pη,k-1∣k-1-1000],W⟵[(Q2,kTΩk-1Q2,k)-100Vk-1],H⟵[Q2,kTMhk00Q2,k],Ea⟵[NkQ2,k-100Q2,k],Eb⟵[Nk(Q1,k-1R11,k-1-Tdk-1+Q2,k-1η^k-1∣k-1)NkQ1,kR11,k-Tdk].Letηk∣k and Pη,k∣kk=1,2,3,… be the estimate result and estimate error covariance of the stochastic vector ηk, respectively. With Lemma 4.1 and above definition, the robust filter for ηk can be summarized as in the following theorem.Theorem 4.2.
Assume that the estimateη^k-1∣k-1 and the estimate error covariance Pη,k-1∣k-1 of ηk-1 have been known. At time index k, the robust filter of x can be given by solving the following equation:
(4.21)(Q^+ATW^A)x^=ATW^b+λ^kEaTEb,
where
(4.22)Q^=[Pη,k-1|k-1-1+λ^k(NkQ2,k-1)TNkQ2,k-100Q2,kTQ2,k],W^=[Ω^k-100V^k-1]-1,Ω^k-1=Q2,kT(Ωk-1-λ^k-1-1Mak-1Mak-1T)Q2,k,V^k=Vk-λ^k-1-1HkQ2,kMhkMhkT(HkQ2,k)T,
and λ^k is determined by minimizing the function G(λ) of (4.16) in the interval (λl,k,∞), where
(4.23)λl,k:=‖HTWH‖=‖diag⁡{MakTQ2,k(Q2,kTΩk-1Q2,k)-1Q2,kTMak,Q2,kTVk-1Q2,k}‖.Proof.
Analogous to [2, 3, 11], using Lemma 4.1 yields (4.21).Theorem4.2 gives the robust filter of ηk, then, the robust constrained estimate of the full state xk can be constructed by using the relationship
(4.24)x^k∣k=Q1,kξk+Q2,kη^k∣k.It is easily verified thatx^k∣k satisfies the constraint equation
(4.25)Dkx^k∣k=Dk[Q1,kξk+Q2,kη^k∣k]=DkQ1,kξk+DkQ2,kη^k∣k=dk.Similarly, the constrained error covariancePk∣k can be computed by using
(4.26)Pk∣k=Q2,kPη,k∣kQ2,kT,
where Pη,k∣k of (4.35) is the estimate error covariance of ηk.


## 4.3. Recursive Form of Constrained Robust Filter

After some considerable algebra, similar to [2], the recursive robust estimate x^k∣k can be summarized as follows.Step 0.
Initialization
Q
R decomposition:
(4.27)[R11,0T0][Q1,0TQ2,0T]=QR(D0).
The deterministic part is(4.28)ξ0=R11,0Td0.
Set(4.29)η^0∣0=Pη,0∣0(H0Q2,0)TV0-1y0,Pη,0∣0=[(Q2,0TΠ0Q2,0)-1+(H0Q2,0)TV0-1H0Q2,0]-1.Step 1.
Determiningλ^k
QR decomposition:
(4.30)[R11,kT0][Q1,kTQ2,kT]=QR(Dk).
It gives the deterministic part at time indexk(4.31)ξk=R11,kTdk
and the new dimension reduced robust system (4.7) and (4.9).
IfMak≠0, then set λ^k=0. Otherwise, with the definitions of (4.20), determine the scalar parameter λ^k by minimizing G(λ) over the interval (λl,k,∞).Step 2.
Replace Parameters
Ifλ^k≠0, the original parameters {Ωk-1,Vk,Pη,k-1∣k-1,Ak} are replaced by
(4.32)Ω^k-1=Q2,kT(Ωk-1-λ^k-1-1Mak-1Mak-1T)Q2,k,V^k=Vk-λ^k-1-1HkQ2,kMhkMhkT(HkQ2,k)T,P^η,k-1∣k-1=Pη,k-1∣k-1-Pη,k-1∣k-1(NkQ2,k-1)T×[λ^k-1-1I+NkQ2,k-1Pη,k-1∣k-1(NkQ2,k-1)T]-1×NkQ2,k-1Pη,k-1∣k-1,A^k=Ak[I-λ^k-1P^k-1∣k-1(NkQ2,k-1)TNkQ2,k-1].Step 3.
Prediction and Update
Prediction:(4.33)η^k∣k-1=A^kη^k-1∣k-1+Q2,kTAkQ1,k-1R11,k-1-Tdk-1,Pη,k∣k-1=A^kP^η,k∣k-1A^kT.
Update:(4.34)η^k∣k=η^k∣k-1+Pη,k∣k-1(HkQ2,k)TV^k-1ek,(4.35)Pη,k∣k=Pη,k∣k-1-Pη,k∣k-1(HkQ2,k)TVe,k-1HkQ2,kPη,k∣k-1,
where
(4.36)ek=yk-HkQ1,kR11,k-1-Tdk-1-HkQ2,kη^k∣k-1,Ve,k=V^k+(HkQ2,k)TPη,k∣k-1HkQ2,k.Step 4.
Reconstruction
Prediction reconstruction:(4.37)x^k∣k-1=Q1,kξk+Q2,kη^k∣k-1,Pk∣k-1=Q2,kPη,k∣k-1Q2,kT.
Estimate reconstruction:(4.38)x^k∣k=Q1,kξk+Q2,kη^k∣k,Pk∣k=Q2,kPη,k∣kQ2,kT.Steps1–4 give the robust estimate of the full state xk.Remark 4.3.
From the definition of{Ω^k-1,V^k,P^η,k-1∣k-1,A^k} and the prediction and update process in Step 3, it is easy to verify that for the constrained system without uncertainties, the robust filtering algorithm reduces to the filtering result introduced in [10].Remark 4.4.
IfDk∈Rn×n and Rank{Dk}=n, the matrix Q2,k and the dimensional reduced model (4.7) will disappear, then we have x^k∣k=Dk-1dk.


## 5. Numerical Example

In this section, simulations are presented to verify the performance of the new algorithm. We consider an example described by  (2.1)–(2.3), with xk=[xk1,xk2,xk3]T. The parameters are given as follows:
(5.1)Ak=[110011001],Hk=[0.810000.9],Ωk=[100030001],Vk=[1.2001],Dk=[1,0.3,0.2],d(k)=1,Mak=[200],Mhk=[01],Nk=[101].The initial state isx0=[001], P0=[0.10000.10000.1], and we will take L=1000 sampling points. Figures 1 and 2 display the estimate error variance of xk1 and xk2, respectively. The variance curves are computed via the ensemble-average
(5.2)ε‖xk-x^k‖≈1T∑i=1T‍‖xki-x^ki‖.Figure 1
Comparison of the estimate variancexk1 with different methods.Figure 2
Comparison of the estimate variancexk2 with different methods.Each point at instantk in each variance curve is the ensemble-average calculated over T=500 experiments. For each experiment i,Δki with norm less or equal than one is selected randomly.To demonstrate the performance of the new robust filter more clearly, we also present the variance curves of the Kalman filter for uncertain model and the system without uncertainties. The variances of these two filters are also shown in Figures1 and 2.From Figures1 and 2, we see that the performance of new filter is better than that of Kalman filter when they are used to deal with the uncertain model, this is because Kalman filter does not consider the uncertain parameters. The variance of Kalman filter dealing with accurate model is smaller than that of new filter dealing with uncertain model.Furthermore, the performance of an algorithm is often affected by the measurement noises, and larger noises variance always bring larger estimate error variance. Table1 lists the error variance for x100 with three different measurement noises variance to show the variation of performance.Table 1
Variation of error variance with different measurement noises variance.
Precision
Measurement noises variance
V
(
k
)
=
0.7
*
I
2
V
(
k
)
=
1.2
*
I
2
V
(
k
)
=
2.5
*
I
2
Error variance ofx~1,100
0.9429
1.3377
2.7273
Error variance ofx~2,100
1.3217
1.8631
3.6547
Error variance ofx~3,100
1.6217
2.2641
3.9199From Table1, we see that, for xk1 and xk2, the larger is the noise variance, the larger is estimation error variance.


## 6. Conclusions

This paper has studied the robust constrained filtering problem for linear discrete uncertain systems. The original constrained system is transformed into a new uncertain unconstrained system. The state of the new system is derived by the least square method and then the optimal estimate is obtained similar to the update process of the robust Kalman filter. A numerical example is presented to show the effectiveness of the new filter. Next, we will consider the regularized filtering method for the case when network-induced phenomena are taken into account [12–15].



---

*Source: 301043-2012-07-12.xml*