# Nonlinear Unknown Input Observer Based on Singular Value Decomposition Aided Reduced Dimension Cubature Kalman Filter

Authors: Wei Zhao; Huiguang Li; Liying Zou; Wenjuan Huang
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

The paper presents a nonlinear unknown input observer (NUIO) based on singular value decomposition aided reduced dimension Cubature Kalman filter (SVDRDCKF) for a special class of nonlinear systems, the nonlinearity of which is only caused by part of its states. Firstly, the algorithm of general NUIO is discussed and the unknown input observer based on singular value decomposition aided Cubature Kalman filter (SVDCKF) given. Then a special nonlinear system model with unknown input is introduced. Based on the proposed model and the corresponding NUIO, the equivalent integral form with partial sampling and all sampling of the state vector in Cubature Kalman filter is analyzed. Finally the nonlinear unknown input observer based on singular value decomposition aided reduced dimension Cubature Kalman filter is obtained. Simulation results show that the proposed algorithm can meet the requirements of the system and is more important to increase the calculating efficiency a lot, although it has a decline in the accuracy of the filter.


---

## Body

## 1. Introduction

The optimal control theory is able to improve the characteristics of the system. In most instances, control theory often needs to estimate the state variables and parameters in practical application. However, the actual control system has the uncertainty, which makes the robust control theory develop rapidly and be one of the most active research fields. The Kalman filter [1] proposed in 1960s is an optimal linear minimum variance estimation method. The Kalman filter has strict requirements on the system model, and the uncertainty of the model will make the performance of the filter drop or even diverge. Sayed [2] divides the robust Kalman filter method into four kinds, (i) H-∞ filtering, (ii) set-valued estimation, (iii) guaranteed-cost filtering, and (iv) regularized least-squares.H-∞ estimators can minimize the worst-case H-∞ norm of the power spectral density or keep it the prescribed constraints [3]. Set-valued estimation recursively computes the bounded ellipsoid corresponding to sets of possible states using observations assuming that the collection of initial condition, input noise, and observation noise can be approximated as ellipsoid [4]. The method of guaranteed-cost filtering designs an upper bound of variation of the estimated error for the reasonable system, and the resultant estimator minimizes the upper bound [5]. The regularized least-squares filter presented by Sayed [2] minimizes the worst-possible regularized residual norm over the class of admissible uncertainties at each iteration.In recent years, the unknown input observer (UIO), as a robust estimator, is gradually becoming the focus in the robust control field [6]. The observer treats the model uncertainty and external disturbance as the unknown input of the system and can eliminate their influence on the system by decoupling the unknown inputs. The UIO has been widely used in aerospace [7] and chemical industry [8].For nonlinear systems, the early presented EKF [9] can do nothing for the complex nonlinear systems, especially when the nonlinear system cannot be linearized by Taylor’s expansion [10]. To improve the performances of Kalman filter, the algorithms, such as Unscented Kalman Filter (UKF) [11], Cubature Kalman filter (CKF) [12], and Particle Filter (PF) [13], are proposed to deal with nonlinear system. Then these algorithms are combined with NUIO for the state estimation, fault diagnosis and detection. The algorithm of linear UIO model is extended to nonlinear UIO system, and gets better applications. For example, in literature [8] the linear UIO model is expanded to NUIO to estimate the gain of the observer in which Unscented Transformation (UT) is used. Among the aforementioned filters, the CKF algorithm with its excellent performance, such as higher stability and accuracy as well as faster convergence rate than those of UKF, has been widely used in the high dimensional nonlinear system [14].For linear systems, the reduced order or full order UIO has been given in many literatures. The literature [15] proposes a filtering method for unknown input using system identification. Based on the reduced order UIO, the robust detection problem of intermittent failures for a class of linear discrete time stochastic systems with time-varying parameter disturbances and unknown disturbances is studied in [16].At present, in the NUIO system, the solution to reduce the dimensionality of the problem is mainly concentrated in reduction of dimension of UIO combining with the nonlinearities of the system [17]; on the contrary, considering the nonlinearity of the system, the paper uses the reduced dimension algorithm to design the full order NUIO, whose purpose is to improve the computational efficiency. As known that using the UKF or CKF in the NUIO system it is needed to sample the state, which is termed sampling point. The UKF requires selecting 2n+1 sampling points for the state, while CKF needs 2n sampling points. When the number of system state is small, the influence of the number of sampling points on the computational efficiency is not obvious. However, when the number is more than a few, this effect may be revealed [18].In this paper, a nonlinear unknown input observer based on singular value decomposition aided reduced dimension Cubature Kalman Filter (NUIO based on SVDRDCKF) is discussed. The greatest contribution of this paper is reducing the number of sampling points to improve the computational efficiency of NUIO for a special class of nonlinear systems. In practice, it is known that, for some nonlinear systems, its nonlinearity is not caused by all the elements of the state vector. It may be that only part of the system states makes the system nonlinear, so if the CKF only samples the state vector resulting nonlinearly, it will significantly reduce the number of sampling points. The smaller number of sampling points means higher computational efficiency. In this paper, the equivalent integral form used in CKF for nonlinear propagation between the nonlinear part and all of state vector is given. Although the reduction of the sampling points will make the estimated accuracy slightly lower than that of the conventional CKF, it does not affect the accuracy of the CKF to the third-order Taylor’s expansion.The organization of the remaining part is as follows: Section2 presents the preliminary knowledge about NUIO that how the general form of NUIO is obtained. The complete algorithm of NUIO based on SVDCKF is given in Section 3. In Section 4, we firstly give a special nonlinear NUIO model, based on which the theorem for the equivalent integral form of the part and all sampling points is proved. Then the NUIO based on SVDRDCKF algorithm is obtained consequently. Analysis is made in Section 5 to justify the performances of the proposed algorithm compared with the NUIO based on SVDCKF algorithm through the simulation of the maneuvering target tracking system. Finally, the conclusion is given in Section 6.


## 2. Preliminary Knowledge about NUIO

There are usually two different ways to process the unknown input in the existing methods. The first method [19] relies on the introduction of an additional matrix into the state estimation equation, which is used to decouple the effects of unknown inputs on the state estimation error. The second one [20] is to transform the system with the unknown input into a system without unknown input. In this paper, we will take second methods as the theoretical basis for the design of NUIO.Consider a nonlinear time-variant discrete time stochastic system(1)xk+1=fxk,uk+Ekdk+wk(2)yk+1=hxk+1+vk,where x is the n-dimensional system state vector, y is the m-dimensional measurement vector, and d is the q-dimensional unknown input (or disturbance) with its corresponding distribution matrixE. f(·) and h(·) are the nonlinear equations. w~N(0,Qw) and v~N(0,Qv) represent the n-dimensional process noise and m-dimensional measurement noise, respectively.Without loss of generality, the measurement equation is generally linearized as follows:(3)Ck+1=∂hxk+1∂xk+1,where Ck+1 is the linearized measurement matrix and ∂h(xk+1)/∂xk+1 is the partial derivative of function h(xk+1) on xk+1.Then the measurement equation is obtained as(4)yk+1=Ck+1xk+1+vk.The necessary condition for the existence of a solution to the unknown input decoupling problem isrank⁡(Ck+1Ek)=rank⁡(Ek). If the condition is satisfied, then it is possible to calculate the parameter matrix H of the observer [21].(5)Hk+1=Ck+1Ek+1+=Ck+1Ek+1TCk+1Ek+1-1Ck+1Ek+1T.Note 1.
The symbol “+” represents the pseudo inverse of matrix.Hk+1 is the solution of (12).Multiply (5) by (4) and substitute (1) into the resultant equation. Then we have(6)Hk+1yk+1=Hk+1Ck+1xk+1+Hk+1vk=Hk+1Ck+1fxk,uk+Ekdk+wk+Hk+1vk.Retaining only the termEkdk on the right of (6) with the other moved to left, (6) can be received as (7)Hk+1yk+1-Ck+1fxk,uk+wk-vk=Hk+1Ck+1Ekdk=Ck+1Ek+1+Ck+1Ekdk=dk.Substitute (7) into (1).(8)xk+1=fxk,uk+Ekdk+wk=fxk,uk+EkHk+1yk+1-Ck+1fxk,uk+wk-vk+wk=fxk,uk+Ekdk+wk=fxk,uk+EkHk+1yk+1-Ck+1fxk,uk+wk-EkHk+1vk+wk=I-EkHk+1Ck+1fxk,uk+EkHk+1yk+1+I-EkHk+1Ck+1wk-EkHk+1vk=f-xk,uk+E-kyk+1+I-EkHk+1Ck+1wk-EkHk+1vk.Then the UIO for system represented by (1) and (4) can be shown as follows:(9)x^k+1/k=f-x^k,uk+E-kyk+1(10)x^k+1=x^k+1/k+Kk+1yk+1-y^k+1/k,where f-(x^k,uk)=(I-EkHk+1Ck+1)f(x^k,uk) and E-k=EkHk+1. The observer gain Kk can be obtained using the Kalman filter algorithm, which will be discussed in Section 3 in detail.Note 2.
The symbol “^” above a variable represents its estimated value.Necessary and sufficient conditions [21] for the UIO in (9) and (10) of the defined system in (1) and (2) are as follows:(1)
(11)rankCk+1Ek=rankEk.(2)
(12)Ek=Hk+1Ck+1Ek.(3)
Kk+1 should make the observer stable.


## 3. NUIO Based on SVDCKF

According to the obtained UIO in (9) and (10), the observer gain Kk can be obtained under the CKF framework [22]. As the covariance matrix may lose positive definite in abnormal condition while using the Cholesky decomposition in CKF, it can be used to substitute the singular value decomposition of matrix for the corresponding ones. In such way, the stability of the numerical calculation can be improved. Combined with the literature [7, 22], this paper gives the complete algorithm of NUIO based on SVDCKF as follows.(A) Initialization
(1)
Initialize withx^0=E(x0), P^x,0=Ex0-x^0x0-x^0T, and H0=0.
(2)
Use (6) to calculate Hk+1 for k=0,1,2,…, and then check the necessary and sufficient conditions for the UIO.(B) Time Update
(
k
=
0,1
,
2
,
…
)
(1)
Obtain the cubature points by singular value decomposition forP^x,k. (13)P^x,k=UkSk∗000VkT(14)X^i,k=UkSk∗ξi+x^ki=1,2,…,2n(15)ξi=n1i,where 1i is the ith column of the points set [1].
(2)
These cubature points are propagated through the nonlinear state equation shown in (9).(16)X^i,k+1/k=f-X^i,k,uk+E-kyk+1.
(3)
Calculate the value of state predictionx^k+1/k, and covariance matrix P^x,k+1/k.(17)x^k+1/k=12n∑i=12nX^i,k+1/k.(18)P^x,k+1/k=12n∑i=12nX^i,k+1/kX^i,k+1/kT-x^k+1/kx^k+1/kT+I-EkHk+1Ck+1QkI-EkHk+1Ck+1T-EkHk+1RkEkHk+1T(C) Measurement Update
(1)
Obtain the new cubature points by singular value decomposition forP^x,k+1/k.(19)P^x,k+1/k=UkSk∗000VkTX^i,k+1/k∗=UkSk∗ξi+x^k+1/ki=1,2,…,2n.
(2)
These cubature points are propagated through the measurement equation shown in (4).(20)Y^i,k+1/k=Ck+1X^i,k+1/k∗.
(3)
Calculate the measurement estimation.(21)y^k+1/k=12n∑i=12nY^i,k+1/k.
(4)
Calculate the measurement predictionP^y,k+1/k and cross-covariance matrix P^xy,k+1/k.(22)P^y,k+1/k=12n∑i=12nY^i,k+1/kY^i,k+1/kT-y^k+1/ky^k+1/kT+RkP^xy,k+1/k=12n∑i=12nX^i,k+1/kY^i,k+1/kT-x^k+1/ky^k+1/kT.(D) State Update
(1)
The observer gainKk+1 can be obtained as(23)KK+1=P^xy,k+1/kP^yy,k+1/k.
(2)
Calculate the state estimation.(24)x^k+1=x^k+1/k+Kk+1yk+1-y^k+1/k.
(3)
Calculate covariance matrix.(25)P^x,k+1=P^x,k+1/k-Kk+1P^yy,k+1/kKk+1T.


## 4. NUIO Based on SVDRDCKF

### 4.1. System Model with Special Nonlinearity

For some special nonlinear models, the cause that makes KF unable to be applied to the system is found to be that only some elements of the system state make the whole system nonlinear. The system model to be studied below belongs to this case. Before using the reduced dimension algorithm for the design of NUIO, the system expressed by (1) needs to be reformed.Assumption 1.
Assume that the UIO system described by (1) can be transformed into a special nonlinear systems shown as (26).(26)xk+1=Fζk,ukxk+gζk,uk+Ekdk+wkyk+1=Ck+1xk+1+vk,where ζ is first l elements (linear part) of x.Ifη is defined as the last n-l elements (nonlinear part) of x, then x=ζTηTT.According to the analysis in Section2, the NUIO for system in (26) can be obtained as follows:(27)x^k+1/k=f-x^k,uk+E-kyk+1=I-EkHk+1Ck+1fxk,uk+EkHk+1yk+1=I-EkHk+1Ck+1Fζk,ukxk+gζk,uk+EkHk+1yk+1.(28)x^k+1=x^k+1/k+Kk+1yk+1-y^k+1/kIn order to understand and identify more easily, the nonlinear function in (27) is defined in Definition 2 for the SVDCKF.Definition 2.
For the nonlinear system described by (27), define that, at instant k (k=0,1,2,…), Z=I-EkHk+1Ck+1Fζk,ukxk+gζk,uk+EkHk+1yk+1, where xk~Nxk;xk^,Px,k with n dimension. ζk is first l elements (linear part) of xk. yk+1, Ek, Hk+1, Ck+1, and uk are known vector or matrix aforementioned.


### 4.2. Relative Theorems

According to the NUIO given by (27) and (28), it needs to select the 2n sampling points if NUIO based on SVDCKF is used to obtain the observer gain Kk (See (14)). Due to that only partial elements of the system state are nonlinear, if we only sample on the nonlinear part of state rather than on the entire state, it can reduce the number of sampling points so as to the amount of the filtering computation. This resultant filter to be discussed is termed as singular value decomposition aided reduced dimension Cubature Kalman filter (SVDRDCKF).In order to obtain a priori estimates of the state with the same third-order accuracy using reduced dimension algorithm compared with regular algorithm, we first give the Lemma3 [18].Lemma 3.
Whenx=ζ1,ζ2,…,ζl,η1,η2,…,ηn-lT0≤l≤nandx~Nx;0,In, where ζ=ζ1,ζ2,…,ζlT and η=η1,η2,…,ηn-lT, the following equations should be true:(29)Eηifζ=0(30)Eηiηjfζ=0(31)Eηi2fζ=Efζ.Proof.
(A)
ProveE(ηif(ζ))=0.(32)Eηifζ=12πn/2∫ηifζe-xTx/2dx=12πn/2∫ηie-ηi2/2dηi·∫fζe-ζζT/2dζ∫e-η12+η22+⋯+ηi-12+ηi+12+⋯+ηn-l2/2dη1dη2⋯dηi-1dηi+1⋯dηn-l.As ∫ηie-ηi2/2dηi=0, E(ηif(ζ))=0, so (29) is true.
(B)
ProveEηiηjfζ=0.
Similar to the proof ofE(ηiηjf(ζ))=0, (30) is true too.
(C)
ProveE(ηi2f(ζ))=E(f(ζ)).(33)Eηi2fζ=12πn/2∫ηi2fζe-xTx/2dx=12πn/2∫ηi2e-ηi2/2dηi·∫fζe-ζTζ/2dζ∫e-η12+η22+⋯+ηi-12+ηi+12+⋯+ηn-l2/2dη1dη2⋯dηi-1dηi+1⋯dηn-l.As(34)∫ηi2e-ηi2/2dηi=2π1/2,∫e-η12+η22+⋯+ηi-12+ηi+12+⋯+ηn-l2/2dη1dη2⋯dηi-1dηi+1⋯dηn-l=2πn-l-1/2we have(35)Eηi2fζ=12πn-l/2∫fζe-ζTζ/2dζ=Efζ.
Thus, (31) is true.Theorem 4.
ForZ=I-EkHk+1Ck+1Fζk,ukxk+gζk,uk+EkHk+1yk+1, the equivalent forms of Z^=∫ZNxk;xk^,Px,kdxk and PZ=∫ZZTNxk;xk^,Px,kdxk-Z^Z^T can be expressed as follows. (36)Z^=∫ΦζkNζk;ζ^k,Pζ,kdζk(37)PZ=∫ΨζkNζk;ζ^k,Pζ,kdζk-Z^Z^T,where Pζ,k is the matrix composed of elements of the former l rows and former l columns of Px,k; S and Sζk are the Cholesky decomposition of Px,k and Pζ,k, respectively; ζ^k is first l elements of x^k; and(38)Φζk=I-EkHk+1Ck+1Fζk,ukx^+SSζk-1ζk-ζ^k0n-l+I-EkHk+1Ck+1gζk+EkHk+1yk+1.(39)Ψζk=ΦζkΦζkT+I-EkHk+1Ck+1FζkS000In-lSTFTζkI-EkHk+1Ck+1TProof.
Defineηk as the last n-l elements of xk; then xk=ζkTηkTT. As xk~N(xk;x^k,Px,k), then ζk~N(ζk;ζ^k,Pζ,k).
(A) Firstly, prove thatZ^=∫Φ∗(ζk)N(ζk;ζ^k,Pζ,k)dζk is true.(40)Z^=EZ=EI-EkHk+1Ck+1Fζk,ukxk+gζk+EkHk+1yk+1=I-EkHk+1Ck+1EFζk,ukxk+I-EkHk+1Ck+1Egζk+EkHk+1yk+1.
ObviouslyEg(ζk) is the Gauss integral for ζk; the next proof is that E(F(ζk,uk)xk) is also the Gauss integral for ζk.(41)EFζk,ukxk=∫Fζk,ukζkηkNxk;xk^,Px,kdxk.
Making Cholesky decomposition forPx,k and Pζ,k, we have Px,k=SST and Pζ,k=SζkSζkT. As S and Sζk are the lower triangular matrix, it is known that Sζk is the matrix composed of elements of the former l rows and former l columns of S.
Definexk=x^k+Sx~k, where x~k=ζ~kTη~kTT. As Sζk is the lower triangular matrix and ζk=ζ^k+Sζkζ~k, we have(42)∫Fζk,ukζkηkNxk;xk^,Px,kdxk=12πn/2∫Fζ^k+Sζkζ~k,ukxk^+Sζ~kη~ke-x~kTx~k/2dx~k.
DefiningF1(ζ^k+Sζkζ~k,uk)=F(ζ~k,uk), we have(43)EFζk,ukxk=12πn/2∫F1ζ^k+Sζkζ~k,ukxk^e-x~kTx~k/2dx~k+12πn/2∫F1ζ^k+Sζkζ~k,ukSζ~kη~ke-x~kTx~k/2dx~k.
The first term on the right side of (43) can be written as(44)12πn/2∫F1ζ~k,ukxk^e-x~kTx~k/2dx~k=12πl/2∫F1ζ~k,ukxk^e-ζ~kTζ~k/2dζ~k=∫F1ζ~k,ukxk^Nζ~k;0,Ildζ~k.
The second term on the right side of (43) can be written as(45)12πn/2∫F1ζ~k,ukSζ~kη~ke-x~kTx~k/2dx~k=12πn/2∫F1ζ~k,ukSζ~k0e-x~kTx~k/2dx~k+12πn/2∫F1ζ~k,ukS0η~ke-x~kTx~k/2dx~k.
The first term on the right side of (45) can be written as(46)12πn/2∫F1ζ~k,ukSζ~k0e-x~kTx~k/2dx~k=12πl/2∫F1ζ~k,ukSζ~k0e-ζ~kTζ~k/2dζ~k=∫F1ζ~k,ukSζ~k0Nζ~k;0,Ildζ~k.
The second term on the right side of (45) can be written as (47)12πn/2∫F1ζ~k,ukS0η~ke-x~kTx~k/2dx~k=∫F1ζ~k,ukS0η~kNζ~k;0,Indζ~k=∫∑i=1n-lf1iζ~k,ukη~ki⋮∑i=1n-lfniζ~k,ukη~kiNζ~k;0,Indζ~k.
According to Lemma3, we have(48)Efjiζ~k,ukη~ki=0i=1,2,…,n-l;j=1,2,…,n.
So(49)12πn/2∫F1ζ~k,ukS0η~ke-x~kTx~k/2dx~k=0,EFζk,ukxk=∫F1ζ~k,ukSζ~k0Nζ~k;0,Ildζ~k=∫Fζk,ukx^+SSζk-1ζk-ζ^k0Nζk;ζ^k,Pζ,kdζk.
AsE(F(ζk,uk)xk) is the Gauss integral for ζk, it is true that (40) is also the Gauss integral for ζk. Then set(50)Φζk=I-EkHk+1Ck+1Fζk,ukx^+SSζk-1ζk-ζ^k0+I-EkHk+1Ck+1gζk+EkHk+1yk+1.
Hence, (36) is proved.(B) Secondly, Prove thatPZ=∫Ψ(ζk)N(ζk;ζ^k,Pζ,k)dζk-Z^Z^T is true. (51)PZ=EZZT-Z^Z^T.Settingxk=x^k+Sx~k and as Sζk is the lower triangular matrix, we have ζk=ζ^k+Sζkζ~k.Define(52)I-EkHk+1Ck+1Fζ^k+Sζkζ~k,uk=F1ζ~k,ukI-EkHk+1Ck+1Fζk,uk=F2ζk,ukI-EkHk+1Ck+1gζ^k+Sζkζ~k,uk=g1ζ~k,ukI-EkHk+1Ck+1Fζk,ukx^k+gζk=Γζk,ukF1ζ~k,ukx^k+g1ζ~k=Γ1ζ~k,ukF1ζ~k,ukx^k+g1ζ~k+F1ζ~k,ukSx~k=Λ1ζ~k,ukEkHk+1yk+1=B.E
Z
Z
T can be represented as(53)EZZT=∫I-EkHk+1Ck+1Fζk,ukxk+gζk+EkHk+1yk+1I-EkHk+1Ck+1Fζk,ukxk+gζkT+EkHk+1yk+1TNxk;xk^,Px,kdx=f1x~k+f2x~k+f2Tx~k+f3x~k+f3Tx~k+f4x~k+f5x~k+f5Tx~k+BBT,where(54)f1x~k=∫Γ1ζ~k,ukΓ1Tζ~k,ukNx~k;0,Indx~kf2x~k=∫Γ1ζ~k,ukF1ζ~k,ukSx~kTNx~k;0,Indx~kf3x~k=∫Γ1ζ~k,ukBTNx~k;0,Indx~kf4x~k=∫F1ζ~k,ukSx~kF1ζ~k,ukSx~kTNx~k;0,Indx~kf5x~k=∫F1ζ~k,ukSx~kBTNx~k;0,Indx~k.It is easy to prove that bothf1(x~k) and f3(x~k) are the Gauss integrals for ζk, since x^k is constant vector, shown as(55)f1x~k=∫Γ1ζ~k,ukΓ1Tζ~k,ukNζ~k;0,Ildζ~k=∫Γζk,ukΓTζk,ukNζk;ζ^,Pζ,kdζkf3x~k=∫Γ1ζ~k,ukBTNζ~k;0,Ildζ~k=∫Γζk,ukBTNζk;ζ^,Pζ,kdζk.Similar to the deduction forE(F(ζk,uk)xk), we have(56)f2x~k=∫Γ1ζ~k,ukx~kTSTF1Tζ~k,ukNx~k;0,Indx~k=∫Γζk,ukSζk-1ζk-ζ^k0TSTF2Tζk,ukNζk;ζ^,Pζ,kdζkf5x~k=∫F1ζ~k,ukSx~kBTNx~k;0,Indx~k=∫F2ζk,ukSSζk-1ζk-ζ^k0BTNζk;ζ^,Pζ,kdζk.Sof2(x~k) and f5(x~k) are also the Gauss integrals for ζk. (57)f4x~k=∫F1ζ~k,ukSx~kx~kTSTF1Tζ~k,ukNx~k;0,Indx~k=∫F1ζ~k,ukSζ~kζ~kTζ~kη~kTη~kζ~kTη~kη~kTSTF1Tζ~k,ukNx~k;0,Indx~k.Set(58)φζ~k=F1ζ~k,ukSζ~kζ~kTζ~kη~kTη~kζ~kTη~kη~kTSTF1Tζ~k,uk.φζ~k=∑α=1l∑β=1lgα,βζ~kζ~k,αζ~k,β+2∑α=1l∑β=1n-lgα,β+lζ~kζ~k,αη~k,β+∑α=1n-l∑β=1n-lgα+l,β+lζ~kη~k,αη~k,βi,jn×nAccording to Lemma3, we have(59)Egα,β+lζ~kζ~k,αη~k,β=0α=1,2,…,l;β=1,2,…,n-lEgα+l,β+lζ~kη~k,αη~k,β=0α=1,2,…,n-l;β=1,2,…,n-l;α≠βEgα+l,β+lζ~kη~k,α2=Egα+l,β+lζ~kα=β=1,2,…,n-l.Hence,(60)Eφζ~k=∑α=1l∑β=1lEgα,βζ~kζ~k,αζ~k,β+∑α=1n-l∑β=1n-lEgα+l,β+lζ~ki,jn×n=∫F1ζ~k,ukSζ~kζ~kT00In-lSTF1Tζ~k,ukNζ~k;0,Ildζ~k=∫F2ζk,ukSSζk-1ζk-ζ~kζk-ζ~kTSζk-1T00In-lSTF2Tζk,uk·Nζk;ζ~k,Pζ,kdζk.f
4
(
x
~
k
) is the Gauss integral for ζk. It is proved that PZ is the Gauss integral for ζk, shown as (61)PZ=∫Ψ∗ζkNζk;ζ^k,Pζ,kdζk-Z^Z^T,where(62)Ψζk=Γζk,ukΓTζk,uk+Γζk,ukSζk-1ζk-ζ^k0TSTF2Tζk,uk+Γζk,ukSζk-1ζk-ζ^k0TSTF2Tζk,ukT+Γζk,ukBT+Γζk,ukBTT+F2ζk,ukSSζk-1ζk-ζ~kζk-ζ~kTSζk-1T00In-lSTF2Tζk,uk+F2ζk,ukSSζk-1ζk-ζ^k0BT+F2ζk,ukSSζk-1ζk-ζ^k0BTT+BBT.Arrange (62) as (63)Ψζk=ΦζkΦζkT+I-EkHk+1Ck+1FζkS000In-lSTFTζkI-EkHk+1Ck+1T.Eq. (37) is proved.By Definition2, Theorem 4 gives the equivalent form of Z^ (equivalent to x^k+1/k in (17)) and PZ (equivalent to P^x,k+1/k in (18)) when the reduced dimension SVDCKF is applied.


### 4.3. The Proposed NUIO

According to the Assumption1 and NUIO in (28) to (29), 2n sampling points are needed for the state in SVDCKF. As proved in Theorem 4, P^x,k+1/k and x^k+1/k are the Gauss integrals for ζk, shown as(64)x^k+1/k=∫ΦζkNζk;ζ^k,Pζ,kdζkP^x,k+1/k=∫ΨζkNζk;ζ^k,Pζ,kdζk-x^k+1/kx^k+1/kT.Therefore, when third-degree spherical-radial cubature rule is used to approximate the integrals in (64), only 2l sampling points are needed.Eqs. (13) and (14) are rewritten as(65)P^ζk=Uζ,k∗Sζ,k∗000Vζ,k∗TX^i,k=Uζ,k∗Sζ,k∗ξi+ζ^ki=1,2,…,2l.Then (16), (17), and (18) are rewritten as(66)X^i,k+1/k=ΦX^i,kx^k+1/k=12l∑i=12lX^i,k+1/kP^x,k+1/k=12l∑i=12lΨX^i,k-x^k+1/kx^k+1/kT.Note 3.
Here,S=UkSk∗ and Sζk=UkSζ,k∗ in (38) and (39), respectively.Replacing the corresponding equations by (65)-(66) in the algorithm given in Section 3, the NUIO based on SVDRDCKF is obtained and its flowchart is shown in Figure 1. In this algorithm, since the equivalent form of Theorem 4 is used in the propagation of nonlinear function, the third-order accuracy of the nonlinear function is guaranteed.Figure 1
The flowchart of NUIO based on SVDRDCKF.


## 4.1. System Model with Special Nonlinearity

For some special nonlinear models, the cause that makes KF unable to be applied to the system is found to be that only some elements of the system state make the whole system nonlinear. The system model to be studied below belongs to this case. Before using the reduced dimension algorithm for the design of NUIO, the system expressed by (1) needs to be reformed.Assumption 1.
Assume that the UIO system described by (1) can be transformed into a special nonlinear systems shown as (26).(26)xk+1=Fζk,ukxk+gζk,uk+Ekdk+wkyk+1=Ck+1xk+1+vk,where ζ is first l elements (linear part) of x.Ifη is defined as the last n-l elements (nonlinear part) of x, then x=ζTηTT.According to the analysis in Section2, the NUIO for system in (26) can be obtained as follows:(27)x^k+1/k=f-x^k,uk+E-kyk+1=I-EkHk+1Ck+1fxk,uk+EkHk+1yk+1=I-EkHk+1Ck+1Fζk,ukxk+gζk,uk+EkHk+1yk+1.(28)x^k+1=x^k+1/k+Kk+1yk+1-y^k+1/kIn order to understand and identify more easily, the nonlinear function in (27) is defined in Definition 2 for the SVDCKF.Definition 2.
For the nonlinear system described by (27), define that, at instant k (k=0,1,2,…), Z=I-EkHk+1Ck+1Fζk,ukxk+gζk,uk+EkHk+1yk+1, where xk~Nxk;xk^,Px,k with n dimension. ζk is first l elements (linear part) of xk. yk+1, Ek, Hk+1, Ck+1, and uk are known vector or matrix aforementioned.


## 4.2. Relative Theorems

According to the NUIO given by (27) and (28), it needs to select the 2n sampling points if NUIO based on SVDCKF is used to obtain the observer gain Kk (See (14)). Due to that only partial elements of the system state are nonlinear, if we only sample on the nonlinear part of state rather than on the entire state, it can reduce the number of sampling points so as to the amount of the filtering computation. This resultant filter to be discussed is termed as singular value decomposition aided reduced dimension Cubature Kalman filter (SVDRDCKF).In order to obtain a priori estimates of the state with the same third-order accuracy using reduced dimension algorithm compared with regular algorithm, we first give the Lemma3 [18].Lemma 3.
Whenx=ζ1,ζ2,…,ζl,η1,η2,…,ηn-lT0≤l≤nandx~Nx;0,In, where ζ=ζ1,ζ2,…,ζlT and η=η1,η2,…,ηn-lT, the following equations should be true:(29)Eηifζ=0(30)Eηiηjfζ=0(31)Eηi2fζ=Efζ.Proof.
(A)
ProveE(ηif(ζ))=0.(32)Eηifζ=12πn/2∫ηifζe-xTx/2dx=12πn/2∫ηie-ηi2/2dηi·∫fζe-ζζT/2dζ∫e-η12+η22+⋯+ηi-12+ηi+12+⋯+ηn-l2/2dη1dη2⋯dηi-1dηi+1⋯dηn-l.As ∫ηie-ηi2/2dηi=0, E(ηif(ζ))=0, so (29) is true.
(B)
ProveEηiηjfζ=0.
Similar to the proof ofE(ηiηjf(ζ))=0, (30) is true too.
(C)
ProveE(ηi2f(ζ))=E(f(ζ)).(33)Eηi2fζ=12πn/2∫ηi2fζe-xTx/2dx=12πn/2∫ηi2e-ηi2/2dηi·∫fζe-ζTζ/2dζ∫e-η12+η22+⋯+ηi-12+ηi+12+⋯+ηn-l2/2dη1dη2⋯dηi-1dηi+1⋯dηn-l.As(34)∫ηi2e-ηi2/2dηi=2π1/2,∫e-η12+η22+⋯+ηi-12+ηi+12+⋯+ηn-l2/2dη1dη2⋯dηi-1dηi+1⋯dηn-l=2πn-l-1/2we have(35)Eηi2fζ=12πn-l/2∫fζe-ζTζ/2dζ=Efζ.
Thus, (31) is true.Theorem 4.
ForZ=I-EkHk+1Ck+1Fζk,ukxk+gζk,uk+EkHk+1yk+1, the equivalent forms of Z^=∫ZNxk;xk^,Px,kdxk and PZ=∫ZZTNxk;xk^,Px,kdxk-Z^Z^T can be expressed as follows. (36)Z^=∫ΦζkNζk;ζ^k,Pζ,kdζk(37)PZ=∫ΨζkNζk;ζ^k,Pζ,kdζk-Z^Z^T,where Pζ,k is the matrix composed of elements of the former l rows and former l columns of Px,k; S and Sζk are the Cholesky decomposition of Px,k and Pζ,k, respectively; ζ^k is first l elements of x^k; and(38)Φζk=I-EkHk+1Ck+1Fζk,ukx^+SSζk-1ζk-ζ^k0n-l+I-EkHk+1Ck+1gζk+EkHk+1yk+1.(39)Ψζk=ΦζkΦζkT+I-EkHk+1Ck+1FζkS000In-lSTFTζkI-EkHk+1Ck+1TProof.
Defineηk as the last n-l elements of xk; then xk=ζkTηkTT. As xk~N(xk;x^k,Px,k), then ζk~N(ζk;ζ^k,Pζ,k).
(A) Firstly, prove thatZ^=∫Φ∗(ζk)N(ζk;ζ^k,Pζ,k)dζk is true.(40)Z^=EZ=EI-EkHk+1Ck+1Fζk,ukxk+gζk+EkHk+1yk+1=I-EkHk+1Ck+1EFζk,ukxk+I-EkHk+1Ck+1Egζk+EkHk+1yk+1.
ObviouslyEg(ζk) is the Gauss integral for ζk; the next proof is that E(F(ζk,uk)xk) is also the Gauss integral for ζk.(41)EFζk,ukxk=∫Fζk,ukζkηkNxk;xk^,Px,kdxk.
Making Cholesky decomposition forPx,k and Pζ,k, we have Px,k=SST and Pζ,k=SζkSζkT. As S and Sζk are the lower triangular matrix, it is known that Sζk is the matrix composed of elements of the former l rows and former l columns of S.
Definexk=x^k+Sx~k, where x~k=ζ~kTη~kTT. As Sζk is the lower triangular matrix and ζk=ζ^k+Sζkζ~k, we have(42)∫Fζk,ukζkηkNxk;xk^,Px,kdxk=12πn/2∫Fζ^k+Sζkζ~k,ukxk^+Sζ~kη~ke-x~kTx~k/2dx~k.
DefiningF1(ζ^k+Sζkζ~k,uk)=F(ζ~k,uk), we have(43)EFζk,ukxk=12πn/2∫F1ζ^k+Sζkζ~k,ukxk^e-x~kTx~k/2dx~k+12πn/2∫F1ζ^k+Sζkζ~k,ukSζ~kη~ke-x~kTx~k/2dx~k.
The first term on the right side of (43) can be written as(44)12πn/2∫F1ζ~k,ukxk^e-x~kTx~k/2dx~k=12πl/2∫F1ζ~k,ukxk^e-ζ~kTζ~k/2dζ~k=∫F1ζ~k,ukxk^Nζ~k;0,Ildζ~k.
The second term on the right side of (43) can be written as(45)12πn/2∫F1ζ~k,ukSζ~kη~ke-x~kTx~k/2dx~k=12πn/2∫F1ζ~k,ukSζ~k0e-x~kTx~k/2dx~k+12πn/2∫F1ζ~k,ukS0η~ke-x~kTx~k/2dx~k.
The first term on the right side of (45) can be written as(46)12πn/2∫F1ζ~k,ukSζ~k0e-x~kTx~k/2dx~k=12πl/2∫F1ζ~k,ukSζ~k0e-ζ~kTζ~k/2dζ~k=∫F1ζ~k,ukSζ~k0Nζ~k;0,Ildζ~k.
The second term on the right side of (45) can be written as (47)12πn/2∫F1ζ~k,ukS0η~ke-x~kTx~k/2dx~k=∫F1ζ~k,ukS0η~kNζ~k;0,Indζ~k=∫∑i=1n-lf1iζ~k,ukη~ki⋮∑i=1n-lfniζ~k,ukη~kiNζ~k;0,Indζ~k.
According to Lemma3, we have(48)Efjiζ~k,ukη~ki=0i=1,2,…,n-l;j=1,2,…,n.
So(49)12πn/2∫F1ζ~k,ukS0η~ke-x~kTx~k/2dx~k=0,EFζk,ukxk=∫F1ζ~k,ukSζ~k0Nζ~k;0,Ildζ~k=∫Fζk,ukx^+SSζk-1ζk-ζ^k0Nζk;ζ^k,Pζ,kdζk.
AsE(F(ζk,uk)xk) is the Gauss integral for ζk, it is true that (40) is also the Gauss integral for ζk. Then set(50)Φζk=I-EkHk+1Ck+1Fζk,ukx^+SSζk-1ζk-ζ^k0+I-EkHk+1Ck+1gζk+EkHk+1yk+1.
Hence, (36) is proved.(B) Secondly, Prove thatPZ=∫Ψ(ζk)N(ζk;ζ^k,Pζ,k)dζk-Z^Z^T is true. (51)PZ=EZZT-Z^Z^T.Settingxk=x^k+Sx~k and as Sζk is the lower triangular matrix, we have ζk=ζ^k+Sζkζ~k.Define(52)I-EkHk+1Ck+1Fζ^k+Sζkζ~k,uk=F1ζ~k,ukI-EkHk+1Ck+1Fζk,uk=F2ζk,ukI-EkHk+1Ck+1gζ^k+Sζkζ~k,uk=g1ζ~k,ukI-EkHk+1Ck+1Fζk,ukx^k+gζk=Γζk,ukF1ζ~k,ukx^k+g1ζ~k=Γ1ζ~k,ukF1ζ~k,ukx^k+g1ζ~k+F1ζ~k,ukSx~k=Λ1ζ~k,ukEkHk+1yk+1=B.E
Z
Z
T can be represented as(53)EZZT=∫I-EkHk+1Ck+1Fζk,ukxk+gζk+EkHk+1yk+1I-EkHk+1Ck+1Fζk,ukxk+gζkT+EkHk+1yk+1TNxk;xk^,Px,kdx=f1x~k+f2x~k+f2Tx~k+f3x~k+f3Tx~k+f4x~k+f5x~k+f5Tx~k+BBT,where(54)f1x~k=∫Γ1ζ~k,ukΓ1Tζ~k,ukNx~k;0,Indx~kf2x~k=∫Γ1ζ~k,ukF1ζ~k,ukSx~kTNx~k;0,Indx~kf3x~k=∫Γ1ζ~k,ukBTNx~k;0,Indx~kf4x~k=∫F1ζ~k,ukSx~kF1ζ~k,ukSx~kTNx~k;0,Indx~kf5x~k=∫F1ζ~k,ukSx~kBTNx~k;0,Indx~k.It is easy to prove that bothf1(x~k) and f3(x~k) are the Gauss integrals for ζk, since x^k is constant vector, shown as(55)f1x~k=∫Γ1ζ~k,ukΓ1Tζ~k,ukNζ~k;0,Ildζ~k=∫Γζk,ukΓTζk,ukNζk;ζ^,Pζ,kdζkf3x~k=∫Γ1ζ~k,ukBTNζ~k;0,Ildζ~k=∫Γζk,ukBTNζk;ζ^,Pζ,kdζk.Similar to the deduction forE(F(ζk,uk)xk), we have(56)f2x~k=∫Γ1ζ~k,ukx~kTSTF1Tζ~k,ukNx~k;0,Indx~k=∫Γζk,ukSζk-1ζk-ζ^k0TSTF2Tζk,ukNζk;ζ^,Pζ,kdζkf5x~k=∫F1ζ~k,ukSx~kBTNx~k;0,Indx~k=∫F2ζk,ukSSζk-1ζk-ζ^k0BTNζk;ζ^,Pζ,kdζk.Sof2(x~k) and f5(x~k) are also the Gauss integrals for ζk. (57)f4x~k=∫F1ζ~k,ukSx~kx~kTSTF1Tζ~k,ukNx~k;0,Indx~k=∫F1ζ~k,ukSζ~kζ~kTζ~kη~kTη~kζ~kTη~kη~kTSTF1Tζ~k,ukNx~k;0,Indx~k.Set(58)φζ~k=F1ζ~k,ukSζ~kζ~kTζ~kη~kTη~kζ~kTη~kη~kTSTF1Tζ~k,uk.φζ~k=∑α=1l∑β=1lgα,βζ~kζ~k,αζ~k,β+2∑α=1l∑β=1n-lgα,β+lζ~kζ~k,αη~k,β+∑α=1n-l∑β=1n-lgα+l,β+lζ~kη~k,αη~k,βi,jn×nAccording to Lemma3, we have(59)Egα,β+lζ~kζ~k,αη~k,β=0α=1,2,…,l;β=1,2,…,n-lEgα+l,β+lζ~kη~k,αη~k,β=0α=1,2,…,n-l;β=1,2,…,n-l;α≠βEgα+l,β+lζ~kη~k,α2=Egα+l,β+lζ~kα=β=1,2,…,n-l.Hence,(60)Eφζ~k=∑α=1l∑β=1lEgα,βζ~kζ~k,αζ~k,β+∑α=1n-l∑β=1n-lEgα+l,β+lζ~ki,jn×n=∫F1ζ~k,ukSζ~kζ~kT00In-lSTF1Tζ~k,ukNζ~k;0,Ildζ~k=∫F2ζk,ukSSζk-1ζk-ζ~kζk-ζ~kTSζk-1T00In-lSTF2Tζk,uk·Nζk;ζ~k,Pζ,kdζk.f
4
(
x
~
k
) is the Gauss integral for ζk. It is proved that PZ is the Gauss integral for ζk, shown as (61)PZ=∫Ψ∗ζkNζk;ζ^k,Pζ,kdζk-Z^Z^T,where(62)Ψζk=Γζk,ukΓTζk,uk+Γζk,ukSζk-1ζk-ζ^k0TSTF2Tζk,uk+Γζk,ukSζk-1ζk-ζ^k0TSTF2Tζk,ukT+Γζk,ukBT+Γζk,ukBTT+F2ζk,ukSSζk-1ζk-ζ~kζk-ζ~kTSζk-1T00In-lSTF2Tζk,uk+F2ζk,ukSSζk-1ζk-ζ^k0BT+F2ζk,ukSSζk-1ζk-ζ^k0BTT+BBT.Arrange (62) as (63)Ψζk=ΦζkΦζkT+I-EkHk+1Ck+1FζkS000In-lSTFTζkI-EkHk+1Ck+1T.Eq. (37) is proved.By Definition2, Theorem 4 gives the equivalent form of Z^ (equivalent to x^k+1/k in (17)) and PZ (equivalent to P^x,k+1/k in (18)) when the reduced dimension SVDCKF is applied.


## 4.3. The Proposed NUIO

According to the Assumption1 and NUIO in (28) to (29), 2n sampling points are needed for the state in SVDCKF. As proved in Theorem 4, P^x,k+1/k and x^k+1/k are the Gauss integrals for ζk, shown as(64)x^k+1/k=∫ΦζkNζk;ζ^k,Pζ,kdζkP^x,k+1/k=∫ΨζkNζk;ζ^k,Pζ,kdζk-x^k+1/kx^k+1/kT.Therefore, when third-degree spherical-radial cubature rule is used to approximate the integrals in (64), only 2l sampling points are needed.Eqs. (13) and (14) are rewritten as(65)P^ζk=Uζ,k∗Sζ,k∗000Vζ,k∗TX^i,k=Uζ,k∗Sζ,k∗ξi+ζ^ki=1,2,…,2l.Then (16), (17), and (18) are rewritten as(66)X^i,k+1/k=ΦX^i,kx^k+1/k=12l∑i=12lX^i,k+1/kP^x,k+1/k=12l∑i=12lΨX^i,k-x^k+1/kx^k+1/kT.Note 3.
Here,S=UkSk∗ and Sζk=UkSζ,k∗ in (38) and (39), respectively.Replacing the corresponding equations by (65)-(66) in the algorithm given in Section 3, the NUIO based on SVDRDCKF is obtained and its flowchart is shown in Figure 1. In this algorithm, since the equivalent form of Theorem 4 is used in the propagation of nonlinear function, the third-order accuracy of the nonlinear function is guaranteed.Figure 1
The flowchart of NUIO based on SVDRDCKF.


## 5. Simulation and Analysis

Consider the following nonlinear system, which is a maneuvering target tracking model with unknown inputs. It is necessary to estimate the position of the maneuvering target in theX- and the Y-axis as well as their corresponding linear velocities.(67)Zk+1=Zk2+25Zk1+Zk2+8cos⁡1.2k-1+rkχk+1=Aχk+BZk+1+Edk+wkyk+1=Dχk+1+vk,where χk+1=χ1,k+1χ2,k+1χ3,k+1χ4,k+1T is the position of the maneuvering target in the X- and the Y-axis, as well as their corresponding linear velocities.d
k
=
0.05
sin
⁡
0.1
k
π
cos
⁡
(
0.1
k
π
)
0.05
sin
⁡
0.1
k
π
cos
⁡
(
0.1
k
π
) is the unknown input, which affects the linear velocity in the X- and Y-axis of the maneuvering target. Zk+1 is a scalar quantity as the maneuvering acceleration value of the target. (68)A=100.100100.100100001,B=1.25-1.250.25-0.25,D=10000100,E=00000.2110.2,rk~N0,Qr,wk~N0,Qw.Settingxk=Zk,χ1,k,χ2,k,χ3,k,χ4,kT=X1,X2,X3,X4,X5T and rewriting (67) into the form described by (26), we have(69)xk+1=0.500.5BAxk+gZk+0000000.2110.20.05sin⁡0.1kπcos⁡0.1kπ0.05sin⁡0.1kπcos⁡0.1kπ+rkBrk+wkyk+1=0Dxk+vk,where g(Zk)=1B25Zk/1+Zk2+8cos⁡1.2k-1.In order to justify the performances of the proposed algorithm, NUIO based on SVDRDCKF is applied for the estimation ofxk compared with the NUIO based on SVDCKF.The initial value and related settings are given as follows:(70)x^0=0.120.130.11.31,Qw=0.0900000.0900000.0900000.09,Qv=9000090000900009,Px,0=1000000100000010000001000001,Qr=2.As proved in Theorem4, P^x,k+1/k and x^k+1/k are the Gauss integrals for the nonlinear part of the state xk. For the system in (69), 10 sampling points should be selected according to NUIO based on SVDCKF. However, if the proposed reduced dimension algorithm is used, only 2 sampling points are needed for that there is only one element of xk causing the nonlinearity of the system. As the Gauss integral with 10 sampling points is equivalent to that with 2 points, NUIO based on SVDRDCKF algorithm in the estimation process still maintains the third-order accuracy for integral of the nonlinear state function, as well as that of SVDCKF.Figures2–5 present the estimation of position and the corresponding linear velocities in the X- and Y-axis for maneuvering target applying the NUIO based on SVDCKF and SVDRDCKF, respectively. As can be seen in these figures, the algorithm with 10 sampling points is very good to achieve the four state estimations of x. At the same time, we also see that, even if there are only 2 sampling points selected, the NUIO based on SVDRDCKF also achieves the estimation of the four states. Taking the subgraph in Figure 2 for example, the accuracy of the X2 for the proposed algorithm is lower than the other, which is inevitable for the fewer sampling points.Figure 2
EstimatedX2 applying NUIO based on SVDCKF and SVDRDCKF.Figure 3
EstimatedX3 applying NUIO based on SVDCKF and SVDRDCKF.Figure 4
EstimatedX4 applying NUIO based on SVDCKF and SVDRDCKF.Figure 5
EstimatedX5 applying NUIO based on SVDCKF and SVDRDCKF.This can also be verified by the relative errors (RE) of estimated position and linear velocities, shown in Figures6–9. With the change of time, the values of the states estimated by the two algorithms are all close to the real values. This can be seen from the figures of RE, since their REs are eventually close to 0. In the subgraph of Figure 9, it is obvious that the RE of NUIO based on SVDRDCKF is larger than that of SVDCKF.Figure 6
RE ofX2 applying NUIO based on SVDCKF and SVDRDCKF.Figure 7
RE ofX3 applying NUIO based on SVDCKF and SVDRDCKF.Figure 8
RE ofX4 applying NUIO based on SVDCKF and SVDRDCKF.Figure 9
RE ofX5 applying NUIO based on SVDCKF and SVDRDCKF.To further compare the estimation performance of the two algorithms, 100 Monte-Carlo simulations are carried out, and the average absolute errors (MAD) of four states are shown in Figures10–13, respectively.Figure 10
MAD ofX2 applying NUIO based on SVDCKF and SVDRDCKF.Figure 11
MAD ofX3 applying NUIO based on SVDCKF and SVDRDCKF.Figure 12
MAD ofX4 applying NUIO based on SVDCKF and SVDRDCKF.Figure 13
MAD ofX5 applying NUIO based on SVDCKF and SVDRDCKF.The MAD of each state is larger by the proposed algorithm. But if the accuracies are permitted in applications, it can be seen that the MAD of the two algorithms is basically equivalent. Correspondingly, we greatly reduce the number of sampling points, reduced from 10 sampling points to only two. Hence, the NUIO based on SVDRDCKF can improve the calculating efficiency which can also maintain the third-order accuracy of Taylor’s expansion.In order to better demonstrate the excellent computational efficiency of proposed algorithm, we calculated the achieved average time cost of two algorithms across 100 Monte-Carlo experiments, shown in Table1. The average time of the proposed algorithm is 0.2656 s compared to 0.3246 of the SVDCKF. The proposed algorithm has saved 22.21% of the time. The result means that, although the accuracy is decreased by reducing sampling points, it is still in the acceptable range, and the computational efficiency has been significantly improved.Table 1
The average time of 100 Monte-Carlo simulations.
NUIO based on SVDCKF (s)
0.3246
NUIO based on SVDRDCKF (s)
0.2656
Saving time percent
22.21%


## 6. Conclusion

For some special nonlinear systems with unknown inputs, their nonlinearities are only caused by part of the state. The paper gives a nonlinear unknown input observer based on singular value decomposition aided reduced dimension Cubature Kalman filter. The proposed algorithm maintains the third-order accuracy of Taylor’s expansion for the integral of the nonlinear state function though sampling with the nonlinear part of the state instead of all. Simulation results show that the calculation efficiency is improved greatly while the filtering accuracy is guaranteed.



---

*Source: 1267380-2017-03-07.xml*