# Quasi-Stochastic Integration Filter for Nonlinear Estimation

Authors: Yong-Gang Zhang; Yu-Long Huang; Zhe-Min Wu; Ning Li
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

In practical applications, numerical instability problem, systematic error problem caused by nonlinear approximation, and nonlocal sampling problem for high-dimensional applications, exist in unscented Kalman filter (UKF). To solve these problems, a quasi-stochastic integration filter (QSIF) for nonlinear estimation is proposed in this paper. nonlocal sampling problem is solved based on the unbiased property of stochastic spherical integration rule, which can also reduce systematic error and improve filtering accuracy. In addition, numerical instability problem is solved by using fixed radial integration rule. Simulations of bearing-only tracking model and nonlinear filtering problem with different state dimensions show that the proposed QSIF has higher filtering accuracy and good numerical stability as compared with existing methods, and it can also solve nonlocal sampling problem effectively.


---

## Body

## 1. Introduction

Nonlinear filtering has been widely used in many applications. Generally, filtering problem can be addressed by using Bayesian estimation theory, which provides an optimal solution for dynamic state estimation problem by computing the posterior probability density function (PDF) [1, 2]. However, multidimensional integrals involved in the Bayesian estimation are typically intractable, and closed form solution to the Bayesian estimation is available only for a few special cases [3], for example, for a linear Gaussian system which leads to the well-known Kalman filter (KF) [4]. In other cases, approximate methods are necessary to obtain suboptimal nonlinear filters. These methods can be divided into two groups: global and local methods [5, 6].Global methods do not make any explicit assumption about PDFs which are computed directly by using approximate methods [6], such as the point-mass filter using adaptive grids [7], the Gaussian mixture filter [8], the particle filter [9], and Quasi-Monte Carlo filter [10]. Typically, global methods suffer from enormous computational demands. In addition, the performances of the particle filter and Quasi-Monte Carlo filter depend highly on the selection of proposal distributions [10].Local methods derive nonlinear filters by assuming PDFs to be Gaussian, which leads to Gaussian filter (GF) [11]. The unscented transformation- (UT-) based unscented Kalman filter (UKF) is a typical Gaussian approximate filter and has been widely used due to its ease of implementation, modest computational cost, and appropriate performance [12, 13]. However, UKF suffers from three main problems in its practical applications: numerical instability problem [6, 11], systematic error problem caused by nonlinear approximation [14–16], and nonlocal sampling problem for high-dimensional applications [17].In order to address the numerical instability problem, Arasaratnam and Haykin proposed the cubature Kalman filter (CKF) based on the third-degree spherical-radial cubature rule [6]. However, CKF is virtually a special case of UKF with parameter κ
=
0 and can only capture the third order information of Taylor series expansion for nonlinear approximation; thus large systematic errors may be produced. In addition, CKF suffers the nonlocal sampling problem for high-dimensional applications.To reduce systematic errors caused by nonlinear approximation and improve filtering accuracy, Jia et al. proposed high-degree CKF which can capture the fifth order information of Taylor series expansion for nonlinear approximation by generalizing the third-degree spherical-radial cubature rule to arbitrary degree spherical-radial cubature rule [18]. However, high order systematic errors still exist in high-degree CKF and the nonlocal sampling problem is not addressed in high-dimensional applications. Dunik et al. indicated that systematic errors exist in all Gaussian approximate filters for nonlinear estimation [14]. To eliminate systematic errors caused by nonlinear approximation, Straka et al. proposed the stochastic integration filter (SIF) [14–16] based on the stochastic integral rule (SIR) [19]. The posteriori mean and covariance computed by SIR tend to true posteriori mean and covariance in the sense of statistics because it can provide asymptotically unbiased integral computation; thus filtering accuracy is improved. However, a large number of round-off errors are introduced into integration computation using the third-degree SIR (3rd-SIR) because the negative weight is utilized in the 3rd-SIR; thus the filtering numerical stability cannot be ensured and the filtering accuracy will degrade greatly, even filtering divergence may appear in the third-degree SIF (3rd-SIF).To address nonlocal sampling problem for high-dimensional applications, Chang et al. proposed the transformed UKF (TUKF) by using the transformed sigma points to compute the nonlinear posteriori mean and covariance in the Gaussian filtering frame [17]. As compared with CKF and UKF, high order terms of nonlinear posteriori mean and covariance computed by TUKF are much smaller, and the nonlocal sampling problem is addressed to some extent. However, similar to CKF algorithm, TUKF can only capture the third order information of Taylor series expansion for nonlinear approximation; thus large systematic errors still exist in TUKF. Besides, the high order information of transformed sigma points computing mean and covariance may be in the opposite direction of the true terms in some cases, which causes TUKF to produce much larger systematic errors.In conclusion, the above-mentioned existing typical nonlinear filtering methods including UKF, CKF, high-degree CKF, TUKF, and 3rd-SIF cannot simultaneously address numerical instability problem, systematic error problem, and nonlocal sampling problem. To simultaneously address these problems, a quasi-stochastic integration rule (QSIR) with arbitrary degree accuracy is proposed in this paper based on fixed radial integral rule (FRIR) and stochastic spherical integral rule (SSIR). A novel quasi-stochastic integration filter (QSIF) with arbitrary degree accuracy is then obtained by applying the proposed QSIR to compute multidimensional integrals involved in GF. QSIF addresses the nonlocal sampling problem for high-dimensional applications and reduces systematic errors by SSIR. The numerical instability problem is solved by FRIR, thus filtering accuracy is improved.To illustrate the superiority of the proposed QSIF algorithm, two numerical simulations are presented including bearings-only tracking and nonlinear filtering problem with different state dimensions. As can be seen from simulation results of bearings-only tracking, the proposed QSIF has higher filtering accuracy and better numerical stability than existing filtering algorithms. Simulation results of nonlinear filtering problem with different state dimensions show that the nonlocal sampling problem can be effectively addressed by the proposed QSIF. Note that, as a special case of SIF, the first-degree SIF (1st-SIF) proposed in [16] can also address numerical instability problem, systematic error problem, and nonlocal sampling problem. However, its estimation accuracy can be further improved, and, as shown in our simulations, the proposed 5th-QSIF has higher estimation accuracy than the 1st-SIF, and it provides a new way to solve the above-mentioned problems.The remainder of the paper is organized as follows. The GF for nonlinear estimation and its problems are introduced in Section2. The QSIR based on FRIR and SSIR is proposed in Section 3. The specific third-degree QSIF (3rd-QSIF) and fifth-degree QSIF (5th-QSIF) are given in Section 4. Simulations are provided in Section 5. Concluding remarks are drawn in Section 6.


## 2. Gaussian Filter and Problem Statement

### 2.1. Gaussian Filter

Consider a discrete nonlinear system written in the form of dynamic state space model as follows:(1)
x
k
=
f
(
x
k
-
1
)
+
w
k
-
1
,
z
k
=
h
(
x
k
)
+
v
k
,
where x
k
∈
R
n and z
k
∈
R
m represent the immeasurable state of the system and measurement at time k, respectively. f
(
·
) and h
(
·
) are any known functions. w
k
-
1 is Gaussian process noise with zero mean and known covariance Q
k
-
1. v
k is Gaussian measurement noise with zero mean and known covariance R
k and it is uncorrelated with the process noise. The nonlinear filter is to obtain the minimum variance estimate of the true but unknown system state based on the noisy observations at time j
(
j
≤
k
), that is, E
[
x
k
∣
Z
k
] with Z
k
=
{
z
j
,
1
≤
j
≤
k
} [11].If the PDF is well approximated by the Gaussian distribution, a Gaussian filter in the Kalman-like structure (using linear update rule) can be used to address the estimation task. The Gaussian distribution is uniquely characterized by its first two-order moments (mean and covariance), and the general Gaussian filter is formulated as [6]
(2)
x
^
k
∣
k
=
x
^
k
∣
k
-
1
+
W
k
(
z
k
-
z
^
k
∣
k
-
1
)
,
(3)
P
k
∣
k
=
P
k
∣
k
-
1
-
W
k
P
z
z
,
k
∣
k
-
1
W
k
T
,
(4)
W
k
=
P
x
z
,
k
∣
k
-
1
P
z
z
,
k
∣
k
-
1
-
1
,
where
(5)
x
^
k
∣
k
-
1
=
E
[
f
(
x
k
-
1
)
∣
Z
k
-
1
]
=
∫
R
n
x
f
(
x
k
-
1
)
p
(
x
k
-
1
∣
Z
k
-
1
)
d
x
k
-
1
=
∫
R
n
x
f
(
x
k
-
1
)
N
(
x
k
-
1
;
x
^
k
-
1
∣
k
-
1
,
P
k
-
∣
k
-
1
)
d
x
k
-
1
,
P
k
∣
k
-
1
=
E
[
(
x
k
-
x
^
k
∣
k
-
1
)
(
x
k
-
x
^
k
∣
k
-
1
)
T
∣
Z
k
-
1
]
=
∫
R
n
x
f
(
x
k
-
1
)
f
T
(
x
k
-
1
)
m
m
m
×
N
(
x
k
-
1
;
x
^
k
-
1
∣
k
-
1
,
P
k
-
1
∣
k
-
1
)
d
x
k
-
1
-
x
^
k
-
1
∣
k
-
1
x
^
k
-
1
∣
k
-
1
T
+
Q
k
-
1
,
z
^
k
∣
k
-
1
=
E
[
h
(
x
k
)
∣
Z
k
-
1
]
=
∫
R
n
z
h
(
x
k
)
N
(
x
k
;
x
^
k
∣
k
-
1
,
P
k
∣
k
-
1
)
d
x
k
,
P
z
z
,
k
∣
k
-
1
=
E
[
(
z
k
-
z
^
k
∣
k
-
1
)
(
z
k
-
z
^
k
∣
k
-
1
)
T
∣
Z
k
-
1
]
=
∫
R
n
x
h
(
x
k
)
h
T
(
x
k
)
N
(
x
k
;
x
^
k
|
k
-
1
,
P
k
∣
k
-
1
)
d
x
k
-
z
^
k
∣
k
-
1
z
^
k
∣
k
-
1
T
+
R
k
,
P
x
z
,
k
∣
k
-
1
=
E
[
(
x
k
-
x
^
k
∣
k
-
1
)
(
z
k
-
z
^
k
∣
k
-
1
)
T
∣
Z
k
-
1
]
=
∫
R
n
x
x
k
h
T
(
x
k
)
N
(
x
k
;
x
^
k
∣
k
-
1
,
P
k
∣
k
-
1
)
d
x
k
-
x
^
k
∣
k
-
1
z
^
k
∣
k
-
1
T
.It can be seen from the above update that the general GF consists of one-step prediction of state and measurement in (5) and measurement update in the sense of linear minimum mean square error (MSE) in (2)–(4). The heart of the GF is to compute Gaussian weighted integrals in (5) and different Gaussian filters will be obtained by using different numerical methods. For example, the UKF can be obtained by using the UT to compute Gaussian weighted integrals in (5). However, the numerical instability problem, systematic error problem, and nonlocal sampling problem exist in the UKF. Next we will show systematic errors and nonlocal sampling problem by introducing the computation of the mean and covariance in cubature transform (CT) and the numerical instability problem by introducing the 3rd-SIR.


### 2.2. Problems Statement

#### 2.2.1. Systematic Errors

Suppose thatx is an n-dimensional Gaussian random vector with mean x
^ and covariance P
x. Another n
y-dimensional random vector y is related to x through the nonlinear function y
=
g
(
x
). The CT can be used to calculate the mean and covariance of y. The mean and covariance of y using CT, that is, y
^
CT and P
y
CT, are formulated as
(6)
y
^
CT
=
1
2
n
∑
j
=
1
n
[
g
(
n
P
x
e
j
+
x
^
)
+
g
(
-
n
P
x
e
j
+
x
^
)
]
,
P
y
CT
=
1
2
n
∑
j
=
1
n
[
g
(
n
P
x
e
j
+
x
^
)
g
T
(
n
P
x
e
j
+
x
^
)
m
m
m
i
m
m
m
+
g
(
-
n
P
x
e
j
+
x
^
)
g
T
(
-
n
P
x
e
j
+
x
^
)
]
m
m
m
m
m
i
m
-
y
^
CT
(
y
^
CT
)
T
,
where P
x is the square root matrix of P
x; that is, P
x
P
x
T
=
P
x. e
j
=
[
0,0
,
…
,
1
j
,
…
,
0
]
T denotes a unit vector to the direction of coordinate axis j.Taylor series expansion is the most commonly used tool for the error analysis of local methods. Firstly, computational error of mean using CT will be considered. The Taylor expansion of the true mean ofy is as follows [12, 13]:
(7)
y
=
g
(
x
^
)
+
1
2
∑
i
=
1
n
∑
j
=
1
n
P
x
(
i
,
j
)
∇
i
,
j
2
g
+
E
[
D
Δ
x
4
g
(
x
)
4
!
+
D
Δ
x
6
g
(
x
)
6
!
+
⋯
]
,
where
(8)
∇
i
,
j
2
g
=
∂
2
∂
x
i
∂
x
j
g
(
x
)
|
x
=
x
^
,
1
j
!
D
Δ
x
j
g
(
x
)
=
1
j
!
(
∑
i
=
1
n
Δ
x
i
∂
∂
x
i
)
j
g
(
x
)
|
x
=
x
^
,
Δ
x
=
x
-
x
^
,
Δ
x
j is the jth element of the vector Δ
x.The Taylor expansion of computational mean ofy can be formulated as follows [14, 15, 20]:
(9)
y
^
CT
=
g
(
x
^
)
+
1
2
∑
i
=
1
n
∑
j
=
1
n
P
x
(
i
,
j
)
∇
i
,
j
2
g
mmm
+
1
2
n
∑
p
=
1
2
n
(
D
ε
p
4
g
(
χ
p
)
4
!
+
D
ε
p
6
g
(
χ
p
)
6
!
+
⋯
)
,
where
(10)
D
ε
p
j
g
(
χ
p
)
j
!
=
1
j
!
(
∑
i
=
1
n
(
χ
p
(
i
)
-
x
^
i
)
∂
∂
χ
p
(
i
)
)
j
g
(
χ
p
)
|
χ
p
=
x
^
,
χ
p
=
n
P
x
e
p
+
x
^
,
ε
p
=
n
P
x
e
p
;
χ
p
(
i
) is the ith element of the vector χ
p.The systematic errorε
CT is defined as the difference between the true mean value shown in (7) and the estimated mean value calculated by CT in (9):
(11)
ε
CT
=
E
[
D
Δ
x
4
g
(
x
)
4
!
+
D
Δ
x
6
g
(
x
)
6
!
+
⋯
]
mmm
-
1
2
n
∑
p
=
1
2
n
(
D
ε
p
4
g
(
χ
p
)
4
!
+
D
ε
p
6
g
(
χ
p
)
6
!
+
⋯
)
.Generally, the errorε
CT is nonzero [14]. Similarly, it can be shown that the covariance matrix computations using the CT also contain systematic errors; thus systematic errors exist in CKF. Finally, it should be noted that systematic errors can be found in all local filters. To reduce systematic errors, high-degree CKF captures the fifth order information of nonlinear Taylor series expansion in (7) by using more sigma points, but high order errors still exist. Systematic errors in (11) in local filters are because of bias of the deterministic numerical integration for computing multidimensional integrals [14–16]. To address this problem, Genz and Monahan proposed the SIR by using stochastic radial integral rule (SRIR) and SSIR to fulfill the Gaussian weighted integrals computation. Because the SIR is unbiased, that is, E
[
ε
SIR
]
=
0, hence, the SIR can eliminate the systematic errors in (11) and improve filtering accuracy. However, the 3rd-SIF suffers from numerical instability problem which will be specified in Section 2.2.3.


#### 2.2.2. Nonlocal Sampling Problem

The fourth and higher-order moments (hom) of thejth component for the computational posterior mean of CT in (9) can also be written as [17]
(12)
hom
=
1
2
n
∑
p
=
1
2
n
[
∑
l
=
2
∞
D
ε
p
2
l
g
(
χ
p
)
(
2
l
)
!
]
j
=
1
2
n
∑
p
=
1
2
n
[
∑
l
=
2
∞
[
ε
p
,
j
]
2
l
(
2
l
)
!
]
=
∑
l
=
2
∞
n
l
-
1
[
1
(
2
l
)
!
∑
p
=
1
2
n
P
x
(
p
,
j
)
]
.As can be seen from (12), hom is proportional to the index power of state dimension n
l
-
1 and increases as state dimension increases. More seriously, the computational posterior mean and covariance using CT will have large high order information for high-dimensional problem coupled with strong nonlinear functions such as the exponent and trigonometric, which will degrade the filtering accuracy of CKF [17]. This problem is regarded as the nonlocal sampling problem whose essence is that sigma points used in CKF are far away from the mean as the state dimension increases, which degrades the ability of approximating PDF. The TUKF proposed in [17] mitigates the nonlocal sampling problem by constructing transformed sigma points based on orthogonal transform and improves the filtering accuracy of CKF or UKF. However, similar to CKF algorithm, TUKF can only capture the third order information of Taylor series expansion for nonlinear approximation; thus large systematic errors still exist. Besides, the high order information of transformed sigma points computing mean and covariance may be in the opposite direction of the true terms in some cases, which causes TUKF to produce much larger systematic errors.


#### 2.2.3. Numerical Instability Problem

Dunik et al. proposed the so-called SIF using the SIR to compute multidimensional integrals in (5) based on the GF frame [14–16]. Next we will show the numerical instability problem by introducing the 3rd-SIR [14–16].The mean ofy computed by the 3rd-SIR is formulated as
(13)
y
^
SIR
3
=
w
0
g
(
x
^
)
+
∑
i
=
1
n
w
i
[
g
(
x
^
+
P
x
ρ
Q
e
i
)
+
g
(
x
^
-
P
x
ρ
Q
e
i
)
]
,
where w
0
=
1
-
n
/
ρ
2 and w
i
=
1
/
2
ρ
2 with ρ
~
χ
2
(
n
+
2
). Q is a uniformly random orthogonal matrix. ρ is randomly chosen from χ
2
(
n
+
2
); thus its value will be in the range [
0
n
] with a certain probability. Consequently, w
0
=
1
-
n
/
ρ
2 will be negative with a certain probability. In particular, if ρ
→
0, then w
0
→
-
∞, which leads to ∑
i
=
0
2
n
x
|
w
i
|
≫
1. As a result, large round-off errors are introduced for integration computation [6, 11, 21, 22], which may result in divergence of the 3rd-SIF method when the system noise is large. This problem is regarded as numerical instability problem and it also exists in UKF [6]. CKF method which is based on deterministic spherical-radial cubature rule can avoid round-off errors of numerical computation and has good numerical stability. However, the accuracy of CKF is low and nonlocal sampling problem exists in CKF for high-dimensional applications.To mitigate numerical instability problem, systematic error problem, and nonlocal sampling problem in nonlinear estimation, a QSIR with arbitrary degree accuracy is proposed based on the FRIR and the SSIR in the paper. Then the QSIF with arbitrary degree accuracy will be obtained by applying the proposed QSIR to compute multidimensional integrals involved in GF. Next we will introduce the QSIR.


## 2.1. Gaussian Filter

Consider a discrete nonlinear system written in the form of dynamic state space model as follows:(1)
x
k
=
f
(
x
k
-
1
)
+
w
k
-
1
,
z
k
=
h
(
x
k
)
+
v
k
,
where x
k
∈
R
n and z
k
∈
R
m represent the immeasurable state of the system and measurement at time k, respectively. f
(
·
) and h
(
·
) are any known functions. w
k
-
1 is Gaussian process noise with zero mean and known covariance Q
k
-
1. v
k is Gaussian measurement noise with zero mean and known covariance R
k and it is uncorrelated with the process noise. The nonlinear filter is to obtain the minimum variance estimate of the true but unknown system state based on the noisy observations at time j
(
j
≤
k
), that is, E
[
x
k
∣
Z
k
] with Z
k
=
{
z
j
,
1
≤
j
≤
k
} [11].If the PDF is well approximated by the Gaussian distribution, a Gaussian filter in the Kalman-like structure (using linear update rule) can be used to address the estimation task. The Gaussian distribution is uniquely characterized by its first two-order moments (mean and covariance), and the general Gaussian filter is formulated as [6]
(2)
x
^
k
∣
k
=
x
^
k
∣
k
-
1
+
W
k
(
z
k
-
z
^
k
∣
k
-
1
)
,
(3)
P
k
∣
k
=
P
k
∣
k
-
1
-
W
k
P
z
z
,
k
∣
k
-
1
W
k
T
,
(4)
W
k
=
P
x
z
,
k
∣
k
-
1
P
z
z
,
k
∣
k
-
1
-
1
,
where
(5)
x
^
k
∣
k
-
1
=
E
[
f
(
x
k
-
1
)
∣
Z
k
-
1
]
=
∫
R
n
x
f
(
x
k
-
1
)
p
(
x
k
-
1
∣
Z
k
-
1
)
d
x
k
-
1
=
∫
R
n
x
f
(
x
k
-
1
)
N
(
x
k
-
1
;
x
^
k
-
1
∣
k
-
1
,
P
k
-
∣
k
-
1
)
d
x
k
-
1
,
P
k
∣
k
-
1
=
E
[
(
x
k
-
x
^
k
∣
k
-
1
)
(
x
k
-
x
^
k
∣
k
-
1
)
T
∣
Z
k
-
1
]
=
∫
R
n
x
f
(
x
k
-
1
)
f
T
(
x
k
-
1
)
m
m
m
×
N
(
x
k
-
1
;
x
^
k
-
1
∣
k
-
1
,
P
k
-
1
∣
k
-
1
)
d
x
k
-
1
-
x
^
k
-
1
∣
k
-
1
x
^
k
-
1
∣
k
-
1
T
+
Q
k
-
1
,
z
^
k
∣
k
-
1
=
E
[
h
(
x
k
)
∣
Z
k
-
1
]
=
∫
R
n
z
h
(
x
k
)
N
(
x
k
;
x
^
k
∣
k
-
1
,
P
k
∣
k
-
1
)
d
x
k
,
P
z
z
,
k
∣
k
-
1
=
E
[
(
z
k
-
z
^
k
∣
k
-
1
)
(
z
k
-
z
^
k
∣
k
-
1
)
T
∣
Z
k
-
1
]
=
∫
R
n
x
h
(
x
k
)
h
T
(
x
k
)
N
(
x
k
;
x
^
k
|
k
-
1
,
P
k
∣
k
-
1
)
d
x
k
-
z
^
k
∣
k
-
1
z
^
k
∣
k
-
1
T
+
R
k
,
P
x
z
,
k
∣
k
-
1
=
E
[
(
x
k
-
x
^
k
∣
k
-
1
)
(
z
k
-
z
^
k
∣
k
-
1
)
T
∣
Z
k
-
1
]
=
∫
R
n
x
x
k
h
T
(
x
k
)
N
(
x
k
;
x
^
k
∣
k
-
1
,
P
k
∣
k
-
1
)
d
x
k
-
x
^
k
∣
k
-
1
z
^
k
∣
k
-
1
T
.It can be seen from the above update that the general GF consists of one-step prediction of state and measurement in (5) and measurement update in the sense of linear minimum mean square error (MSE) in (2)–(4). The heart of the GF is to compute Gaussian weighted integrals in (5) and different Gaussian filters will be obtained by using different numerical methods. For example, the UKF can be obtained by using the UT to compute Gaussian weighted integrals in (5). However, the numerical instability problem, systematic error problem, and nonlocal sampling problem exist in the UKF. Next we will show systematic errors and nonlocal sampling problem by introducing the computation of the mean and covariance in cubature transform (CT) and the numerical instability problem by introducing the 3rd-SIR.


## 2.2. Problems Statement

### 2.2.1. Systematic Errors

Suppose thatx is an n-dimensional Gaussian random vector with mean x
^ and covariance P
x. Another n
y-dimensional random vector y is related to x through the nonlinear function y
=
g
(
x
). The CT can be used to calculate the mean and covariance of y. The mean and covariance of y using CT, that is, y
^
CT and P
y
CT, are formulated as
(6)
y
^
CT
=
1
2
n
∑
j
=
1
n
[
g
(
n
P
x
e
j
+
x
^
)
+
g
(
-
n
P
x
e
j
+
x
^
)
]
,
P
y
CT
=
1
2
n
∑
j
=
1
n
[
g
(
n
P
x
e
j
+
x
^
)
g
T
(
n
P
x
e
j
+
x
^
)
m
m
m
i
m
m
m
+
g
(
-
n
P
x
e
j
+
x
^
)
g
T
(
-
n
P
x
e
j
+
x
^
)
]
m
m
m
m
m
i
m
-
y
^
CT
(
y
^
CT
)
T
,
where P
x is the square root matrix of P
x; that is, P
x
P
x
T
=
P
x. e
j
=
[
0,0
,
…
,
1
j
,
…
,
0
]
T denotes a unit vector to the direction of coordinate axis j.Taylor series expansion is the most commonly used tool for the error analysis of local methods. Firstly, computational error of mean using CT will be considered. The Taylor expansion of the true mean ofy is as follows [12, 13]:
(7)
y
=
g
(
x
^
)
+
1
2
∑
i
=
1
n
∑
j
=
1
n
P
x
(
i
,
j
)
∇
i
,
j
2
g
+
E
[
D
Δ
x
4
g
(
x
)
4
!
+
D
Δ
x
6
g
(
x
)
6
!
+
⋯
]
,
where
(8)
∇
i
,
j
2
g
=
∂
2
∂
x
i
∂
x
j
g
(
x
)
|
x
=
x
^
,
1
j
!
D
Δ
x
j
g
(
x
)
=
1
j
!
(
∑
i
=
1
n
Δ
x
i
∂
∂
x
i
)
j
g
(
x
)
|
x
=
x
^
,
Δ
x
=
x
-
x
^
,
Δ
x
j is the jth element of the vector Δ
x.The Taylor expansion of computational mean ofy can be formulated as follows [14, 15, 20]:
(9)
y
^
CT
=
g
(
x
^
)
+
1
2
∑
i
=
1
n
∑
j
=
1
n
P
x
(
i
,
j
)
∇
i
,
j
2
g
mmm
+
1
2
n
∑
p
=
1
2
n
(
D
ε
p
4
g
(
χ
p
)
4
!
+
D
ε
p
6
g
(
χ
p
)
6
!
+
⋯
)
,
where
(10)
D
ε
p
j
g
(
χ
p
)
j
!
=
1
j
!
(
∑
i
=
1
n
(
χ
p
(
i
)
-
x
^
i
)
∂
∂
χ
p
(
i
)
)
j
g
(
χ
p
)
|
χ
p
=
x
^
,
χ
p
=
n
P
x
e
p
+
x
^
,
ε
p
=
n
P
x
e
p
;
χ
p
(
i
) is the ith element of the vector χ
p.The systematic errorε
CT is defined as the difference between the true mean value shown in (7) and the estimated mean value calculated by CT in (9):
(11)
ε
CT
=
E
[
D
Δ
x
4
g
(
x
)
4
!
+
D
Δ
x
6
g
(
x
)
6
!
+
⋯
]
mmm
-
1
2
n
∑
p
=
1
2
n
(
D
ε
p
4
g
(
χ
p
)
4
!
+
D
ε
p
6
g
(
χ
p
)
6
!
+
⋯
)
.Generally, the errorε
CT is nonzero [14]. Similarly, it can be shown that the covariance matrix computations using the CT also contain systematic errors; thus systematic errors exist in CKF. Finally, it should be noted that systematic errors can be found in all local filters. To reduce systematic errors, high-degree CKF captures the fifth order information of nonlinear Taylor series expansion in (7) by using more sigma points, but high order errors still exist. Systematic errors in (11) in local filters are because of bias of the deterministic numerical integration for computing multidimensional integrals [14–16]. To address this problem, Genz and Monahan proposed the SIR by using stochastic radial integral rule (SRIR) and SSIR to fulfill the Gaussian weighted integrals computation. Because the SIR is unbiased, that is, E
[
ε
SIR
]
=
0, hence, the SIR can eliminate the systematic errors in (11) and improve filtering accuracy. However, the 3rd-SIF suffers from numerical instability problem which will be specified in Section 2.2.3.


### 2.2.2. Nonlocal Sampling Problem

The fourth and higher-order moments (hom) of thejth component for the computational posterior mean of CT in (9) can also be written as [17]
(12)
hom
=
1
2
n
∑
p
=
1
2
n
[
∑
l
=
2
∞
D
ε
p
2
l
g
(
χ
p
)
(
2
l
)
!
]
j
=
1
2
n
∑
p
=
1
2
n
[
∑
l
=
2
∞
[
ε
p
,
j
]
2
l
(
2
l
)
!
]
=
∑
l
=
2
∞
n
l
-
1
[
1
(
2
l
)
!
∑
p
=
1
2
n
P
x
(
p
,
j
)
]
.As can be seen from (12), hom is proportional to the index power of state dimension n
l
-
1 and increases as state dimension increases. More seriously, the computational posterior mean and covariance using CT will have large high order information for high-dimensional problem coupled with strong nonlinear functions such as the exponent and trigonometric, which will degrade the filtering accuracy of CKF [17]. This problem is regarded as the nonlocal sampling problem whose essence is that sigma points used in CKF are far away from the mean as the state dimension increases, which degrades the ability of approximating PDF. The TUKF proposed in [17] mitigates the nonlocal sampling problem by constructing transformed sigma points based on orthogonal transform and improves the filtering accuracy of CKF or UKF. However, similar to CKF algorithm, TUKF can only capture the third order information of Taylor series expansion for nonlinear approximation; thus large systematic errors still exist. Besides, the high order information of transformed sigma points computing mean and covariance may be in the opposite direction of the true terms in some cases, which causes TUKF to produce much larger systematic errors.


### 2.2.3. Numerical Instability Problem

Dunik et al. proposed the so-called SIF using the SIR to compute multidimensional integrals in (5) based on the GF frame [14–16]. Next we will show the numerical instability problem by introducing the 3rd-SIR [14–16].The mean ofy computed by the 3rd-SIR is formulated as
(13)
y
^
SIR
3
=
w
0
g
(
x
^
)
+
∑
i
=
1
n
w
i
[
g
(
x
^
+
P
x
ρ
Q
e
i
)
+
g
(
x
^
-
P
x
ρ
Q
e
i
)
]
,
where w
0
=
1
-
n
/
ρ
2 and w
i
=
1
/
2
ρ
2 with ρ
~
χ
2
(
n
+
2
). Q is a uniformly random orthogonal matrix. ρ is randomly chosen from χ
2
(
n
+
2
); thus its value will be in the range [
0
n
] with a certain probability. Consequently, w
0
=
1
-
n
/
ρ
2 will be negative with a certain probability. In particular, if ρ
→
0, then w
0
→
-
∞, which leads to ∑
i
=
0
2
n
x
|
w
i
|
≫
1. As a result, large round-off errors are introduced for integration computation [6, 11, 21, 22], which may result in divergence of the 3rd-SIF method when the system noise is large. This problem is regarded as numerical instability problem and it also exists in UKF [6]. CKF method which is based on deterministic spherical-radial cubature rule can avoid round-off errors of numerical computation and has good numerical stability. However, the accuracy of CKF is low and nonlocal sampling problem exists in CKF for high-dimensional applications.To mitigate numerical instability problem, systematic error problem, and nonlocal sampling problem in nonlinear estimation, a QSIR with arbitrary degree accuracy is proposed based on the FRIR and the SSIR in the paper. Then the QSIF with arbitrary degree accuracy will be obtained by applying the proposed QSIR to compute multidimensional integrals involved in GF. Next we will introduce the QSIR.


## 2.2.1. Systematic Errors

Suppose thatx is an n-dimensional Gaussian random vector with mean x
^ and covariance P
x. Another n
y-dimensional random vector y is related to x through the nonlinear function y
=
g
(
x
). The CT can be used to calculate the mean and covariance of y. The mean and covariance of y using CT, that is, y
^
CT and P
y
CT, are formulated as
(6)
y
^
CT
=
1
2
n
∑
j
=
1
n
[
g
(
n
P
x
e
j
+
x
^
)
+
g
(
-
n
P
x
e
j
+
x
^
)
]
,
P
y
CT
=
1
2
n
∑
j
=
1
n
[
g
(
n
P
x
e
j
+
x
^
)
g
T
(
n
P
x
e
j
+
x
^
)
m
m
m
i
m
m
m
+
g
(
-
n
P
x
e
j
+
x
^
)
g
T
(
-
n
P
x
e
j
+
x
^
)
]
m
m
m
m
m
i
m
-
y
^
CT
(
y
^
CT
)
T
,
where P
x is the square root matrix of P
x; that is, P
x
P
x
T
=
P
x. e
j
=
[
0,0
,
…
,
1
j
,
…
,
0
]
T denotes a unit vector to the direction of coordinate axis j.Taylor series expansion is the most commonly used tool for the error analysis of local methods. Firstly, computational error of mean using CT will be considered. The Taylor expansion of the true mean ofy is as follows [12, 13]:
(7)
y
=
g
(
x
^
)
+
1
2
∑
i
=
1
n
∑
j
=
1
n
P
x
(
i
,
j
)
∇
i
,
j
2
g
+
E
[
D
Δ
x
4
g
(
x
)
4
!
+
D
Δ
x
6
g
(
x
)
6
!
+
⋯
]
,
where
(8)
∇
i
,
j
2
g
=
∂
2
∂
x
i
∂
x
j
g
(
x
)
|
x
=
x
^
,
1
j
!
D
Δ
x
j
g
(
x
)
=
1
j
!
(
∑
i
=
1
n
Δ
x
i
∂
∂
x
i
)
j
g
(
x
)
|
x
=
x
^
,
Δ
x
=
x
-
x
^
,
Δ
x
j is the jth element of the vector Δ
x.The Taylor expansion of computational mean ofy can be formulated as follows [14, 15, 20]:
(9)
y
^
CT
=
g
(
x
^
)
+
1
2
∑
i
=
1
n
∑
j
=
1
n
P
x
(
i
,
j
)
∇
i
,
j
2
g
mmm
+
1
2
n
∑
p
=
1
2
n
(
D
ε
p
4
g
(
χ
p
)
4
!
+
D
ε
p
6
g
(
χ
p
)
6
!
+
⋯
)
,
where
(10)
D
ε
p
j
g
(
χ
p
)
j
!
=
1
j
!
(
∑
i
=
1
n
(
χ
p
(
i
)
-
x
^
i
)
∂
∂
χ
p
(
i
)
)
j
g
(
χ
p
)
|
χ
p
=
x
^
,
χ
p
=
n
P
x
e
p
+
x
^
,
ε
p
=
n
P
x
e
p
;
χ
p
(
i
) is the ith element of the vector χ
p.The systematic errorε
CT is defined as the difference between the true mean value shown in (7) and the estimated mean value calculated by CT in (9):
(11)
ε
CT
=
E
[
D
Δ
x
4
g
(
x
)
4
!
+
D
Δ
x
6
g
(
x
)
6
!
+
⋯
]
mmm
-
1
2
n
∑
p
=
1
2
n
(
D
ε
p
4
g
(
χ
p
)
4
!
+
D
ε
p
6
g
(
χ
p
)
6
!
+
⋯
)
.Generally, the errorε
CT is nonzero [14]. Similarly, it can be shown that the covariance matrix computations using the CT also contain systematic errors; thus systematic errors exist in CKF. Finally, it should be noted that systematic errors can be found in all local filters. To reduce systematic errors, high-degree CKF captures the fifth order information of nonlinear Taylor series expansion in (7) by using more sigma points, but high order errors still exist. Systematic errors in (11) in local filters are because of bias of the deterministic numerical integration for computing multidimensional integrals [14–16]. To address this problem, Genz and Monahan proposed the SIR by using stochastic radial integral rule (SRIR) and SSIR to fulfill the Gaussian weighted integrals computation. Because the SIR is unbiased, that is, E
[
ε
SIR
]
=
0, hence, the SIR can eliminate the systematic errors in (11) and improve filtering accuracy. However, the 3rd-SIF suffers from numerical instability problem which will be specified in Section 2.2.3.


## 2.2.2. Nonlocal Sampling Problem

The fourth and higher-order moments (hom) of thejth component for the computational posterior mean of CT in (9) can also be written as [17]
(12)
hom
=
1
2
n
∑
p
=
1
2
n
[
∑
l
=
2
∞
D
ε
p
2
l
g
(
χ
p
)
(
2
l
)
!
]
j
=
1
2
n
∑
p
=
1
2
n
[
∑
l
=
2
∞
[
ε
p
,
j
]
2
l
(
2
l
)
!
]
=
∑
l
=
2
∞
n
l
-
1
[
1
(
2
l
)
!
∑
p
=
1
2
n
P
x
(
p
,
j
)
]
.As can be seen from (12), hom is proportional to the index power of state dimension n
l
-
1 and increases as state dimension increases. More seriously, the computational posterior mean and covariance using CT will have large high order information for high-dimensional problem coupled with strong nonlinear functions such as the exponent and trigonometric, which will degrade the filtering accuracy of CKF [17]. This problem is regarded as the nonlocal sampling problem whose essence is that sigma points used in CKF are far away from the mean as the state dimension increases, which degrades the ability of approximating PDF. The TUKF proposed in [17] mitigates the nonlocal sampling problem by constructing transformed sigma points based on orthogonal transform and improves the filtering accuracy of CKF or UKF. However, similar to CKF algorithm, TUKF can only capture the third order information of Taylor series expansion for nonlinear approximation; thus large systematic errors still exist. Besides, the high order information of transformed sigma points computing mean and covariance may be in the opposite direction of the true terms in some cases, which causes TUKF to produce much larger systematic errors.


## 2.2.3. Numerical Instability Problem

Dunik et al. proposed the so-called SIF using the SIR to compute multidimensional integrals in (5) based on the GF frame [14–16]. Next we will show the numerical instability problem by introducing the 3rd-SIR [14–16].The mean ofy computed by the 3rd-SIR is formulated as
(13)
y
^
SIR
3
=
w
0
g
(
x
^
)
+
∑
i
=
1
n
w
i
[
g
(
x
^
+
P
x
ρ
Q
e
i
)
+
g
(
x
^
-
P
x
ρ
Q
e
i
)
]
,
where w
0
=
1
-
n
/
ρ
2 and w
i
=
1
/
2
ρ
2 with ρ
~
χ
2
(
n
+
2
). Q is a uniformly random orthogonal matrix. ρ is randomly chosen from χ
2
(
n
+
2
); thus its value will be in the range [
0
n
] with a certain probability. Consequently, w
0
=
1
-
n
/
ρ
2 will be negative with a certain probability. In particular, if ρ
→
0, then w
0
→
-
∞, which leads to ∑
i
=
0
2
n
x
|
w
i
|
≫
1. As a result, large round-off errors are introduced for integration computation [6, 11, 21, 22], which may result in divergence of the 3rd-SIF method when the system noise is large. This problem is regarded as numerical instability problem and it also exists in UKF [6]. CKF method which is based on deterministic spherical-radial cubature rule can avoid round-off errors of numerical computation and has good numerical stability. However, the accuracy of CKF is low and nonlocal sampling problem exists in CKF for high-dimensional applications.To mitigate numerical instability problem, systematic error problem, and nonlocal sampling problem in nonlinear estimation, a QSIR with arbitrary degree accuracy is proposed based on the FRIR and the SSIR in the paper. Then the QSIF with arbitrary degree accuracy will be obtained by applying the proposed QSIR to compute multidimensional integrals involved in GF. Next we will introduce the QSIR.


## 3. Quasi-Stochastic Integral Rules

Definition 1.
We introduce the following integral:(14)
∫
R
n
g
(
x
)
w
f
(
x
)
d
x
≈
∑
i
w
i
g
(
γ
i
)
,
where x
=
[
x
1
x
2
⋯
x
n
]
T
∈
R
n and w
f
(
x
) is a given weighting function. Equation (14) is a dth-degree rule if it is exact for all monomials x
1
α
1
x
2
α
2
⋯
x
n
α
n with the total degree up to d, that is, {
x
1
α
1
x
2
α
2
⋯
x
n
α
n
∣
∑
i
=
1
n
α
i
≤
d
}, and there is at least one monomial of degree d
+
1 for which (14) is not exact.
It is clear from the analysis in Section2.1 that the key problem of GF is how to compute multidimensional integrals formulated as
(15)
I
(
g
)
=
∫
R
n
g
(
x
)
exp
⁡
(
-
x
T
x
)
d
x
.
A crucial step before applying the spherical-radial cubature rule is to transform the integration variable from Cartesian coordinate system to spherical-radial system. Definex
=
r
s with s
T
s
=
1; then
(16)
I
(
g
)
=
∫
0
∞
∫
U
n
g
(
r
s
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
σ
(
s
)
d
r
,
where s
=
[
s
1
,
s
2
,
…
,
s
n
]
T, U
n
=
{
s
∈
R
n
:
s
1
2
+
s
2
2
+
⋯
+
s
n
2
=
1
}, and σ
(
s
) is the spherical surface measure or an area element on U
n. Two types of integrals are contained in (16), that is, radial integral ∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r and spherical integral ∫
U
n
g
(
r
s
)
d
σ
(
s
).
The integration rule proposed in this paper is QSIR, in which the spherical integral∫
U
n
g
(
r
s
)
d
σ
(
s
) is computed by using SSIR and radial integral ∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r is computed by using FRIR. Next we will introduce SSIR and FRIR, respectively.


### 3.1. Stochastic Spherical Integral Rule

Lemma 2 (see [18]).
For the spherical integralI
U
n
(
g
s
)
=
∫
U
n
g
s
(
s
)
d
σ
(
s
), the (
2
m
+
1
)th-degree full symmetric spherical integral rule is formulated as
(17)
I
U
n
,
2
m
+
1
(
g
s
)
≈
∑
|
p
|
=
m
w
p
G
{
u
p
}
,
where I
U
n denotes a spherical integral and I
U
n
,
2
m
+
1 denotes (
2
m
+
1
)th-degree full symmetric spherical integral rule. Here w
p and G
{
u
p
} are defined as
(18)
w
p
=
I
U
n
(
∏
i
=
1
n
∏
j
=
0
p
i
-
1
s
i
2
-
u
j
2
u
p
i
2
-
u
j
2
)
,
G
{
u
p
}
=
2
-
c
(
u
p
)
∑
v
g
s
(
v
1
u
p
1
,
v
2
u
p
2
,
…
,
v
n
u
p
n
)
,
where p
i is a nonnegative integer. p
=
[
p
1
,
p
2
,
…
,
p
n
] and |
p
|
=
p
1
+
p
2
+
⋯
+
p
n. c
(
u
p
) is the number of nonzero entries in u
p
=
(
u
p
1
,
u
p
2
,
…
,
u
p
n
), where u
p
i
=
p
i
/
m
(
p
i
=
0
,
…
,
m
). The points of the spherical integral rule I
U
n
,
2
m
+
1 are given by [
v
1
u
p
1
,
v
2
u
p
2
,
…
,
v
n
u
p
n
] with weights 2
-
c
(
u
p
)
w
p, where v
i
=
±
1. Hence, the arbitrary degree spherical integral rules can be obtained through Lemma 2.Lemma 3 (see [19, 23]).
IfQ is a uniformly random orthogonal matrix, I
U
n
,
2
m
+
1
(
g
s
)
≈
∑
j
=
1
N
s
w
j
g
s
(
s
j
) is (
2
m
+
1
)th-degree full symmetric spherical integral rule of I
U
n
(
g
s
)
=
∫
U
n
g
s
(
s
)
d
σ
(
s
), then I
Q
,
U
n
,
2
m
+
1
(
g
s
)
≈
∑
j
=
1
N
s
w
j
g
s
(
Q
s
j
) is an unbiased (
2
m
+
1
)th-degree full symmetric SSIR.According to Lemma2, the third-degree full symmetric spherical integral rule can be formulated as [18]
(19)
I
U
n
,
3
(
g
s
)
≈
A
n
2
n
∑
j
=
1
n
(
g
s
(
e
j
)
+
g
s
(
-
e
j
)
)
.Based on Lemma3, the unbiased third-degree full symmetric SSIR can be formulated as
(20)
I
Q
,
U
n
,
3
(
g
s
)
≈
A
n
2
n
∑
j
=
1
n
(
g
s
(
Q
e
j
)
+
g
s
(
-
Q
e
j
)
)
.Note that (20) is based on the third-degree full symmetric spherical integral rule and can capture the third order information at least, and it needs 2
n spherical integral points, that is, ±
Q
e
j
(
j
=
1,2
,
…
,
n
). The existing first-degree SIR (1st-SIR) is based on the first-degree full symmetric spherical integral rule and can capture the first order information at least, and it needs 2 spherical integral points, that is, ±
Q
ς, where ς is any point on U
n. Similarly, the unbiased fifth-degree full symmetric SSIR can be formulated as
(21)
I
Q
,
U
n
,
5
(
g
s
)
≈
w
-
s
1

∑
j
=
1
n
(
n
-
1
)
/
2
(

g
s
(
Q
s
j
+
)

+

g
s
(

-
Q
s
j
+

)

+

g
s
(
Q
s
j
-
)
+
g
s
(
-
Q
s
j
-
)
)
+
w
-
s
2
∑
j
=
1
n
(
g
s
(
Q
e
j
)
+
g
s
(
-
Q
e
j
)
)
,
where
(22)
w
-
s
1
=
A
n
n
(
n
+
2
)
,
w
-
s
2
=
(
4
-
n
)
A
n
2
n
(
n
+
2
)
,
s
j
+
=
{
1
2
(
e
k
+
e
l
)
:
k
<
l
,
k
,
l
=
1,2
,
…
.
,
n
}
,
s
j
-
=
{
1
2
(
e
k
-
e
l
)
:
k
<
l
,
k
,
l
=
1,2
,
…
.
,
n
}
.In the calculation of the unbiased fifth-degree SSIR, we need2
n
2 spherical integral points.


### 3.2. Fixed Radial Integral Rule

The generalized Gauss-Laguerre quadrature rule (GGLQR) can be used to compute radial integral. If we definet
=
r
2, the radial integral can be rewritten as
(23)
∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r
=
1
2
∫
0
∞
g
~
r
(
t
)
t
(
n
/
2
-
1
)
exp
⁡
(
-
t
)
d
t
,
where g
~
r
(
t
)
=
g
r
(
t
). The right-hand side of (23) is the generalized Gauss-Laguerre integral with the weighting function t
(
n
/
2
-
1
)
exp
⁡
(
-
t
) and can be approximated by GGLQR. The (2
N
r
-
1)th-degree GGLQR is formulated as
(24)
∫
0
∞
g
~
r
(
t
)
t
(
n
/
2
-
1
)
exp
⁡
(
-
t
)
d
t
≈
∑
i
=
1
N
r
w
f
,
i
g
~
r
(
r
f
,
i
)
,
where w
f
,
i and r
f
,
i can be obtained because (23) is exact for g
~
r
(
t
)
=
1
,
t
,
t
2
,
…
,
t
2
N
r
-
1. w
r
,
i and r
i can be obtained by using w
r
,
i
=
(
1
/
2
)
w
f
,
i,  r
i
=
r
f
,
i
(
i
=
1
,
…
,
N
r
). Finally, the GGLQR formulated by (24) is exact for g
r
(
r
)
=
1
,
r
2
,
r
4
,
…
,
r
2
(
2
N
r
-
1
). Next two radial integral rules which are the most commonly used in nonlinear filtering will be given.WhenN
r
=
1, the radial integral rule that is exact for g
r
(
r
)
=
1
,
r
2 is formulated as [18]
(25)
∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r
≈
Γ
(
n
/
2
)
2
g
r
(
n
2
)
.WhenN
r
=
2, the radial integral rule that is exact for g
r
(
r
)
=
1
,
r
2
,
r
4 is formulated as [18]
(26)
∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r
≈
1
n
+
2
Γ
(
1
2
n
)
g
r
(
0
)
+
n
2
(
n
+
2
)
Γ
(
1
2
n
)
g
r
(
1
2
n
+
1
)
.As can be seen from (24) and (25) the above given FRIRs are not exact for odd-degree polynomials such as g
r
(
r
)
=
r
,
r
3. Fortunately, when the FRIRs are combined with the SSIRs to compute the integral (15), the combined spherical-radial rule vanishes for all odd-degree polynomials because SSIR vanishes by symmetry for any odd-degree. Hence, the arbitrary degree QSIR can be obtained by combining SSIR introduced in Section 3.1 and FRIR introduced in Section 3.2. Next we will formulate two QSIF methods based on the proposed QSIR.


## 3.1. Stochastic Spherical Integral Rule

Lemma 2 (see [18]).
For the spherical integralI
U
n
(
g
s
)
=
∫
U
n
g
s
(
s
)
d
σ
(
s
), the (
2
m
+
1
)th-degree full symmetric spherical integral rule is formulated as
(17)
I
U
n
,
2
m
+
1
(
g
s
)
≈
∑
|
p
|
=
m
w
p
G
{
u
p
}
,
where I
U
n denotes a spherical integral and I
U
n
,
2
m
+
1 denotes (
2
m
+
1
)th-degree full symmetric spherical integral rule. Here w
p and G
{
u
p
} are defined as
(18)
w
p
=
I
U
n
(
∏
i
=
1
n
∏
j
=
0
p
i
-
1
s
i
2
-
u
j
2
u
p
i
2
-
u
j
2
)
,
G
{
u
p
}
=
2
-
c
(
u
p
)
∑
v
g
s
(
v
1
u
p
1
,
v
2
u
p
2
,
…
,
v
n
u
p
n
)
,
where p
i is a nonnegative integer. p
=
[
p
1
,
p
2
,
…
,
p
n
] and |
p
|
=
p
1
+
p
2
+
⋯
+
p
n. c
(
u
p
) is the number of nonzero entries in u
p
=
(
u
p
1
,
u
p
2
,
…
,
u
p
n
), where u
p
i
=
p
i
/
m
(
p
i
=
0
,
…
,
m
). The points of the spherical integral rule I
U
n
,
2
m
+
1 are given by [
v
1
u
p
1
,
v
2
u
p
2
,
…
,
v
n
u
p
n
] with weights 2
-
c
(
u
p
)
w
p, where v
i
=
±
1. Hence, the arbitrary degree spherical integral rules can be obtained through Lemma 2.Lemma 3 (see [19, 23]).
IfQ is a uniformly random orthogonal matrix, I
U
n
,
2
m
+
1
(
g
s
)
≈
∑
j
=
1
N
s
w
j
g
s
(
s
j
) is (
2
m
+
1
)th-degree full symmetric spherical integral rule of I
U
n
(
g
s
)
=
∫
U
n
g
s
(
s
)
d
σ
(
s
), then I
Q
,
U
n
,
2
m
+
1
(
g
s
)
≈
∑
j
=
1
N
s
w
j
g
s
(
Q
s
j
) is an unbiased (
2
m
+
1
)th-degree full symmetric SSIR.According to Lemma2, the third-degree full symmetric spherical integral rule can be formulated as [18]
(19)
I
U
n
,
3
(
g
s
)
≈
A
n
2
n
∑
j
=
1
n
(
g
s
(
e
j
)
+
g
s
(
-
e
j
)
)
.Based on Lemma3, the unbiased third-degree full symmetric SSIR can be formulated as
(20)
I
Q
,
U
n
,
3
(
g
s
)
≈
A
n
2
n
∑
j
=
1
n
(
g
s
(
Q
e
j
)
+
g
s
(
-
Q
e
j
)
)
.Note that (20) is based on the third-degree full symmetric spherical integral rule and can capture the third order information at least, and it needs 2
n spherical integral points, that is, ±
Q
e
j
(
j
=
1,2
,
…
,
n
). The existing first-degree SIR (1st-SIR) is based on the first-degree full symmetric spherical integral rule and can capture the first order information at least, and it needs 2 spherical integral points, that is, ±
Q
ς, where ς is any point on U
n. Similarly, the unbiased fifth-degree full symmetric SSIR can be formulated as
(21)
I
Q
,
U
n
,
5
(
g
s
)
≈
w
-
s
1

∑
j
=
1
n
(
n
-
1
)
/
2
(

g
s
(
Q
s
j
+
)

+

g
s
(

-
Q
s
j
+

)

+

g
s
(
Q
s
j
-
)
+
g
s
(
-
Q
s
j
-
)
)
+
w
-
s
2
∑
j
=
1
n
(
g
s
(
Q
e
j
)
+
g
s
(
-
Q
e
j
)
)
,
where
(22)
w
-
s
1
=
A
n
n
(
n
+
2
)
,
w
-
s
2
=
(
4
-
n
)
A
n
2
n
(
n
+
2
)
,
s
j
+
=
{
1
2
(
e
k
+
e
l
)
:
k
<
l
,
k
,
l
=
1,2
,
…
.
,
n
}
,
s
j
-
=
{
1
2
(
e
k
-
e
l
)
:
k
<
l
,
k
,
l
=
1,2
,
…
.
,
n
}
.In the calculation of the unbiased fifth-degree SSIR, we need2
n
2 spherical integral points.


## 3.2. Fixed Radial Integral Rule

The generalized Gauss-Laguerre quadrature rule (GGLQR) can be used to compute radial integral. If we definet
=
r
2, the radial integral can be rewritten as
(23)
∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r
=
1
2
∫
0
∞
g
~
r
(
t
)
t
(
n
/
2
-
1
)
exp
⁡
(
-
t
)
d
t
,
where g
~
r
(
t
)
=
g
r
(
t
). The right-hand side of (23) is the generalized Gauss-Laguerre integral with the weighting function t
(
n
/
2
-
1
)
exp
⁡
(
-
t
) and can be approximated by GGLQR. The (2
N
r
-
1)th-degree GGLQR is formulated as
(24)
∫
0
∞
g
~
r
(
t
)
t
(
n
/
2
-
1
)
exp
⁡
(
-
t
)
d
t
≈
∑
i
=
1
N
r
w
f
,
i
g
~
r
(
r
f
,
i
)
,
where w
f
,
i and r
f
,
i can be obtained because (23) is exact for g
~
r
(
t
)
=
1
,
t
,
t
2
,
…
,
t
2
N
r
-
1. w
r
,
i and r
i can be obtained by using w
r
,
i
=
(
1
/
2
)
w
f
,
i,  r
i
=
r
f
,
i
(
i
=
1
,
…
,
N
r
). Finally, the GGLQR formulated by (24) is exact for g
r
(
r
)
=
1
,
r
2
,
r
4
,
…
,
r
2
(
2
N
r
-
1
). Next two radial integral rules which are the most commonly used in nonlinear filtering will be given.WhenN
r
=
1, the radial integral rule that is exact for g
r
(
r
)
=
1
,
r
2 is formulated as [18]
(25)
∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r
≈
Γ
(
n
/
2
)
2
g
r
(
n
2
)
.WhenN
r
=
2, the radial integral rule that is exact for g
r
(
r
)
=
1
,
r
2
,
r
4 is formulated as [18]
(26)
∫
0
∞
g
r
(
r
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
r
≈
1
n
+
2
Γ
(
1
2
n
)
g
r
(
0
)
+
n
2
(
n
+
2
)
Γ
(
1
2
n
)
g
r
(
1
2
n
+
1
)
.As can be seen from (24) and (25) the above given FRIRs are not exact for odd-degree polynomials such as g
r
(
r
)
=
r
,
r
3. Fortunately, when the FRIRs are combined with the SSIRs to compute the integral (15), the combined spherical-radial rule vanishes for all odd-degree polynomials because SSIR vanishes by symmetry for any odd-degree. Hence, the arbitrary degree QSIR can be obtained by combining SSIR introduced in Section 3.1 and FRIR introduced in Section 3.2. Next we will formulate two QSIF methods based on the proposed QSIR.


## 4. Quasi-Stochastic Integral Filtering Methods

The third-degree quasi-stochastic integration algorithm (3rd-QSIA) and fifth-degree QSIA (5th-QSIA) will be specified in this section. We use them to compute Gaussian weighted multidimensional integrals in (5) and obtain the corresponding 3rd-QSIF and 5th-QSIF.


### 4.1. Third-Degree and Fifth-Degree Quasi-Stochastic Integration Filters

The third-degree QSIR (3rd-QSIR) is used in the 3rd-QSIF. Combining (16), (20), and (25), the 3rd-QSIR is given by
(27)
I
=
∫
R
n
g
(
x
)
N
(
x
;
μ
,
Σ
)
d
x
=
∫
R
n
g
(
Σ
2
x
+
μ
)
exp
⁡
(
-
x
T
x
)
d
x
=
1
π
n
/
2
∫
0
∞
∫
U
n
g
(
Σ
2
r
s
+
μ
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
σ
(
s
)
d
r
≈
1
π
n
/
2
∑
j
=
1
n
Γ
(
n
/
2
)
2
A
n
2
n
×
[
g
(
Σ
2
n
2
Q
e
j
+
μ
)
+
g
(
-
Σ
2
n
2
Q
e
j
+
μ
)
]
≈
1
2
n
∑
j
=
1
n
[
g
(
n
Σ
Q
e
j
+
μ
)
+
g
(
-
n
Σ
Q
e
j
+
μ
)
]
.As can be seen from (27), in the calculation of the 3rd-QSIR, we need 2
n cubature points with the same weight (
1
/
2
n
)
>
0. Hence, the 3rd-QSIR is numerically stable because its weights are all positive.Similarly, combining (16), (21), and (26), the fifth-degree QSIR (5th-QSIR) is given by
(28)
I
=
∫
R
n
g
(
x
)
N
(
x
;
μ
,
Σ
)
d
x
=
∫
R
n
g
(
Σ
2
x
+
μ
)
exp
⁡
(
-
x
T
x
)
d
x
=
1
π
n
/
2
∫
0
∞
∫
U
n
g
(
Σ
2
r
s
+
μ
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
σ
(
s
)
d
r
≈
2
n
+
2
g
(
μ
)
+
1
(
n
+
2
)
2
×
∑
j
=
1
n
(
n
-
1
)
/
2
(
(
n
+
2
)
Σ
g
(
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
mm
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
)
+
1
(
n
+
2
)
2
∑
j
=
1
n
(
n
-
1
)
/
2
(
(
n
+
2
)
Σ
g
(
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
m
m
m
m
m
m
m
m
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
)
+
4
-
n
2
(
n
+
2
)
2
∑
j
=
1
n
(
g
(
(
n
+
2
)
Σ
Q
e
j
+
μ
)
m
m
m
m
m
m
m
m
m
+
g
(
-
(
n
+
2
)
Σ
Q
e
j
+
μ
)
)
.As can be seen from (28), in the calculation of the 5th-QSIR, we need 2
n
2
+
1 cubature points and it has the same weights as that of deterministic fifth-degree cubature rule. The 3rd-QSIA and 5th-QSIA are summarized as follows.Step 1.
Choose a maximum number of iterationsN
max
⁡.Step 2.
Set the number of iterationsN
=
0, initial computational integral values of the 3rd-QSIA and 5th-QSIA I
~
3
=
0 and I
~
5
=
0, and initial computational variance values of the 3rd-QSIA and 5th-QSIA V
3
=
0 and V
5
=
0.Step 3.
Repeat (untilN
=
N
max
⁡) the following loop.(a)
SetN
=
N
+
1, S
R
3
=
0, and S
R
5
=
0.
(b)
Generate a uniformly random orthogonal matrixQ of dimension n
×
n.
(c)
Compute the valuesS
R
3 and S
R
5 at current iteration:
(29)
S
R
3
=
1
2
n
∑
j
=
1
n
[
g
(
n
Σ
Q
e
j
+
μ
)
+
g
(
-
n
Σ
Q
e
j
+
μ
)
]
(30)
S
R
5
=
2
n
+
2
g
(
μ
)
+
1
(
n
+
2
)
2
∑
j
=
1
n
(
n
-
1
)
/
2
(
g
(
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
KKKKKKKKKKKK
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
)
+
1
(
n
+
2
)
2
∑
j
=
1
n
(
n
-
1
)
/
2
(
g
(
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
KKKKKKKKKKKK
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
)
+
4
-
n
2
(
n
+
2
)
2
∑
j
=
1
n
(
g
(
(
n
+
2
)
Σ
Q
e
j
+
μ
)
KKKKKKKKKKK
+
g
(
-
(
n
+
2
)
Σ
Q
e
j
+
μ
)
)
and use them to update the approximate variance and integral value as
(31)
V
i
=
(
N
-
2
)
V
i
N
+
∥
(
S
R
i
-
I
~
i
)
N
∥
2
(
i
=
3,5
)
,
I
~
i
=
I
~
i
+
(
S
R
i
-
I
~
i
)
N
(
i
=
3,5
)
.Step 4.
Output the approximate integral valueI
~
i and standard deviation σ
i
=
V
i of the 3rd-QSIA and 5th-QSIA.Note that the variableN
max
⁡ provides a tradeoff between efficiency and accuracy, and its selection depends on application requirements. For the calculation of (b), Stewart (1980) gave an algorithm for generating from the uniform distribution (invariant Haar measure) over orthogonal matrices [23]. Essentially, the approach is to generate an n
×
n matrix X of standard norm variables and form the Q
R factorization: X
=
Q
R. Then Q has the right distribution. The algorithm for computing I
~
i and V
i is a modified version of a stable one-pass algorithm [19]. The output standard deviations σ
3 and σ
5 can be used to evaluate the exactness of the 3rd-QSIA and 5th-QSIA, respectively.Based on GF frame and using the above 3rd-QSIA and 5th-QSIA to compute Gaussian weighted multidimensional integrals in (5), the 3rd-QSIF and 5th-QSIF can be developed.


### 4.2. Properties of Quasi-Stochastic Integration Filters

QSIF is obtained by using QSIR to compute Gaussian weighted multidimensional integrals in (5); thus its properties depend completely on properties of QSIR.Firstly, QSIF can reduce systematic errors and improve filtering accuracy by using unbiased spherical integral computation. The computational accuracy of Gaussian weighted multidimensional integral mainly depends on the computational accuracy of spherical integral [18, 21, 22]. An unbiased spherical integral computation is important in nonlinear GF.Secondly, QSIF has good numerical stability, similar to that of CKF. QSIR has the same weights as deterministic spherical-radial cubature rule because it uses FRIR to compute the radial integral. The 3rd-QSIR is a completely stable numerical integral rule because its weights are all positive. The 5th-QSIR is also completely stable when state dimension is less than four; that is,n
≤
4. However, it is not completely stable when n
≥
5 due to ∑
i
=
0
2
n
2
|
w
i
|
>
1. Fortunately, ∑
i
=
0
2
n
2
|
w
i
|
≫
1 will not happen in the 5th-QSIR because as n
→
+
∞, ∑
i
=
0
2
n
2
|
w
i
|
→
1; thus it does not suffer from numerical instability problem. Hence, QSIF has good numerical stability.Thirdly, high order information of computational mean and covariance of QSIF converges to true values and its high order errors do not increase as state dimension increases, so QSIF can mitigate the nonlocal sampling problem.Finally, a comparison of computational complexity between the proposed filters and existing Gaussian approximate filters is shown in Table1. The computational complexity of the proposed QSIF and existing SIF are all dependent on the iteration numbers, and the proposed 3rd-QSIF and existing 3rd-SIF are almost consistent in computational complexity. Note that, as a special case of SIF, the 1st-SIF can be deemed as MCKF with antithetic variates [16]. Although its computational complexity in a single iteration is smaller than the proposed QSIF algorithms, it needs more iteration numbers to achieve equivalent accuracy as compared with 3rd-SIF, 3rd-QSIF, and 5th-QSIF. As will be shown in later simulations, the proposed 5th-QSIF has higher estimation accuracy than the 1st-SIF with equivalent computational complexity by choosing different iteration numbers for both algorithms.Table 1
Comparison of computational complexity.
Filters
3rd-CKF and TUKF
5th-CKF
1st-SIF
3rd-SIF and 3rd-QSIF
5th-QSIF
Computational complexity
O
(
n
3
)
O
(
n
4
)
O
(
N
max
⁡
n
2
)
O
(
N
max
⁡
n
3
)
O
(
N
max
⁡
n
4
)In conclusion, the proposed QSIF not only has high accuracy and good numerical stability, but also can effectively mitigate the nonlocal sampling problem. Next the advantages of the proposed QSIF as compared with existing methods will be illustrated by two simulation examples.


## 4.1. Third-Degree and Fifth-Degree Quasi-Stochastic Integration Filters

The third-degree QSIR (3rd-QSIR) is used in the 3rd-QSIF. Combining (16), (20), and (25), the 3rd-QSIR is given by
(27)
I
=
∫
R
n
g
(
x
)
N
(
x
;
μ
,
Σ
)
d
x
=
∫
R
n
g
(
Σ
2
x
+
μ
)
exp
⁡
(
-
x
T
x
)
d
x
=
1
π
n
/
2
∫
0
∞
∫
U
n
g
(
Σ
2
r
s
+
μ
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
σ
(
s
)
d
r
≈
1
π
n
/
2
∑
j
=
1
n
Γ
(
n
/
2
)
2
A
n
2
n
×
[
g
(
Σ
2
n
2
Q
e
j
+
μ
)
+
g
(
-
Σ
2
n
2
Q
e
j
+
μ
)
]
≈
1
2
n
∑
j
=
1
n
[
g
(
n
Σ
Q
e
j
+
μ
)
+
g
(
-
n
Σ
Q
e
j
+
μ
)
]
.As can be seen from (27), in the calculation of the 3rd-QSIR, we need 2
n cubature points with the same weight (
1
/
2
n
)
>
0. Hence, the 3rd-QSIR is numerically stable because its weights are all positive.Similarly, combining (16), (21), and (26), the fifth-degree QSIR (5th-QSIR) is given by
(28)
I
=
∫
R
n
g
(
x
)
N
(
x
;
μ
,
Σ
)
d
x
=
∫
R
n
g
(
Σ
2
x
+
μ
)
exp
⁡
(
-
x
T
x
)
d
x
=
1
π
n
/
2
∫
0
∞
∫
U
n
g
(
Σ
2
r
s
+
μ
)
r
n
-
1
exp
⁡
(
-
r
2
)
d
σ
(
s
)
d
r
≈
2
n
+
2
g
(
μ
)
+
1
(
n
+
2
)
2
×
∑
j
=
1
n
(
n
-
1
)
/
2
(
(
n
+
2
)
Σ
g
(
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
mm
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
)
+
1
(
n
+
2
)
2
∑
j
=
1
n
(
n
-
1
)
/
2
(
(
n
+
2
)
Σ
g
(
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
m
m
m
m
m
m
m
m
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
)
+
4
-
n
2
(
n
+
2
)
2
∑
j
=
1
n
(
g
(
(
n
+
2
)
Σ
Q
e
j
+
μ
)
m
m
m
m
m
m
m
m
m
+
g
(
-
(
n
+
2
)
Σ
Q
e
j
+
μ
)
)
.As can be seen from (28), in the calculation of the 5th-QSIR, we need 2
n
2
+
1 cubature points and it has the same weights as that of deterministic fifth-degree cubature rule. The 3rd-QSIA and 5th-QSIA are summarized as follows.Step 1.
Choose a maximum number of iterationsN
max
⁡.Step 2.
Set the number of iterationsN
=
0, initial computational integral values of the 3rd-QSIA and 5th-QSIA I
~
3
=
0 and I
~
5
=
0, and initial computational variance values of the 3rd-QSIA and 5th-QSIA V
3
=
0 and V
5
=
0.Step 3.
Repeat (untilN
=
N
max
⁡) the following loop.(a)
SetN
=
N
+
1, S
R
3
=
0, and S
R
5
=
0.
(b)
Generate a uniformly random orthogonal matrixQ of dimension n
×
n.
(c)
Compute the valuesS
R
3 and S
R
5 at current iteration:
(29)
S
R
3
=
1
2
n
∑
j
=
1
n
[
g
(
n
Σ
Q
e
j
+
μ
)
+
g
(
-
n
Σ
Q
e
j
+
μ
)
]
(30)
S
R
5
=
2
n
+
2
g
(
μ
)
+
1
(
n
+
2
)
2
∑
j
=
1
n
(
n
-
1
)
/
2
(
g
(
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
KKKKKKKKKKKK
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
+
+
μ
)
)
+
1
(
n
+
2
)
2
∑
j
=
1
n
(
n
-
1
)
/
2
(
g
(
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
KKKKKKKKKKKK
+
g
(
-
(
n
+
2
)
Σ
Q
s
j
-
+
μ
)
)
+
4
-
n
2
(
n
+
2
)
2
∑
j
=
1
n
(
g
(
(
n
+
2
)
Σ
Q
e
j
+
μ
)
KKKKKKKKKKK
+
g
(
-
(
n
+
2
)
Σ
Q
e
j
+
μ
)
)
and use them to update the approximate variance and integral value as
(31)
V
i
=
(
N
-
2
)
V
i
N
+
∥
(
S
R
i
-
I
~
i
)
N
∥
2
(
i
=
3,5
)
,
I
~
i
=
I
~
i
+
(
S
R
i
-
I
~
i
)
N
(
i
=
3,5
)
.Step 4.
Output the approximate integral valueI
~
i and standard deviation σ
i
=
V
i of the 3rd-QSIA and 5th-QSIA.Note that the variableN
max
⁡ provides a tradeoff between efficiency and accuracy, and its selection depends on application requirements. For the calculation of (b), Stewart (1980) gave an algorithm for generating from the uniform distribution (invariant Haar measure) over orthogonal matrices [23]. Essentially, the approach is to generate an n
×
n matrix X of standard norm variables and form the Q
R factorization: X
=
Q
R. Then Q has the right distribution. The algorithm for computing I
~
i and V
i is a modified version of a stable one-pass algorithm [19]. The output standard deviations σ
3 and σ
5 can be used to evaluate the exactness of the 3rd-QSIA and 5th-QSIA, respectively.Based on GF frame and using the above 3rd-QSIA and 5th-QSIA to compute Gaussian weighted multidimensional integrals in (5), the 3rd-QSIF and 5th-QSIF can be developed.


## 4.2. Properties of Quasi-Stochastic Integration Filters

QSIF is obtained by using QSIR to compute Gaussian weighted multidimensional integrals in (5); thus its properties depend completely on properties of QSIR.Firstly, QSIF can reduce systematic errors and improve filtering accuracy by using unbiased spherical integral computation. The computational accuracy of Gaussian weighted multidimensional integral mainly depends on the computational accuracy of spherical integral [18, 21, 22]. An unbiased spherical integral computation is important in nonlinear GF.Secondly, QSIF has good numerical stability, similar to that of CKF. QSIR has the same weights as deterministic spherical-radial cubature rule because it uses FRIR to compute the radial integral. The 3rd-QSIR is a completely stable numerical integral rule because its weights are all positive. The 5th-QSIR is also completely stable when state dimension is less than four; that is,n
≤
4. However, it is not completely stable when n
≥
5 due to ∑
i
=
0
2
n
2
|
w
i
|
>
1. Fortunately, ∑
i
=
0
2
n
2
|
w
i
|
≫
1 will not happen in the 5th-QSIR because as n
→
+
∞, ∑
i
=
0
2
n
2
|
w
i
|
→
1; thus it does not suffer from numerical instability problem. Hence, QSIF has good numerical stability.Thirdly, high order information of computational mean and covariance of QSIF converges to true values and its high order errors do not increase as state dimension increases, so QSIF can mitigate the nonlocal sampling problem.Finally, a comparison of computational complexity between the proposed filters and existing Gaussian approximate filters is shown in Table1. The computational complexity of the proposed QSIF and existing SIF are all dependent on the iteration numbers, and the proposed 3rd-QSIF and existing 3rd-SIF are almost consistent in computational complexity. Note that, as a special case of SIF, the 1st-SIF can be deemed as MCKF with antithetic variates [16]. Although its computational complexity in a single iteration is smaller than the proposed QSIF algorithms, it needs more iteration numbers to achieve equivalent accuracy as compared with 3rd-SIF, 3rd-QSIF, and 5th-QSIF. As will be shown in later simulations, the proposed 5th-QSIF has higher estimation accuracy than the 1st-SIF with equivalent computational complexity by choosing different iteration numbers for both algorithms.Table 1
Comparison of computational complexity.
Filters
3rd-CKF and TUKF
5th-CKF
1st-SIF
3rd-SIF and 3rd-QSIF
5th-QSIF
Computational complexity
O
(
n
3
)
O
(
n
4
)
O
(
N
max
⁡
n
2
)
O
(
N
max
⁡
n
3
)
O
(
N
max
⁡
n
4
)In conclusion, the proposed QSIF not only has high accuracy and good numerical stability, but also can effectively mitigate the nonlocal sampling problem. Next the advantages of the proposed QSIF as compared with existing methods will be illustrated by two simulation examples.


## 5. Simulations

The high accuracy and good numerical stability of the proposed QSIF are illustrated by a bearings-only tracking simulation. A nonlinear filtering problem with different state dimensions is used to illustrate that the proposed QSIF can effectively mitigate the nonlocal sampling problem.


### 5.1. Bearings-Only Tracking

The considered nonlinear model, describing the bearings-only tracking, is of the form [24]
(32)
x
k
=
[
0.9
0
0
1
]
x
k
-
1
+
n
k
-
1
,
z
k
=
ta
n
-
1
(
x
2
,
k
-
sin
(
k
)
x
1
,
k
-
cos
⁡
(
k
)
)
+
v
k
,
where x
k
=
[
x
1
,
k
x
2
,
k
]
T
=
[
s
t
]
T denotes the positions in the s
-
t plane (Cartesian coordinate system). The process noise n
k
~
N
(
0
,
Q
k
) and Q
k
=
[
0.1
0.05
0.05
0.1
]. The measurement noise v
k
~
N
(
0
,
R
k
) and R
k
=
0.025. The true initial state x
0
=
[
20
5
]
T and the associated covariance P
0
∣
0
=
[
0.1
0
;
0
0.1
]
T. Under the same initial conditions, we give simulation results of TUKF, MCKF with sampling points of 50, 1st-SIF with iteration numbers of 25, 3rd-SIF with iteration numbers of 5, 3rd-CKF, 5th-CKF, the proposed 3rd-QSIF, and 5th-QSIF with iteration numbers of 5. Note that the 1st-SIF, MCKF, and the proposed 5th-QSIF have almost consistent computational complexity in this simulation. Besides, we also give the conditional posterior Cramér–Rao low bound (CPCRLB) [25] for better comparison. To compare the performances of these filters, simulation results are presented in the form of figures and tables. In figures, all filtering methods are intuitively compared by using the MSE performance index defined as follows:
(33)
MSE
(
k
)
=
1
N
∑
n
=
1
N
(
x
i
,
k
n
-
x
^
i
,
k
/
k
n
)
2
(
i
=
1,2
)
.
In Table 2, all filtering methods are specifically compared by using the average MSE (AMSE) performance index defined as follows:
(34)
AMSE
(
k
)
=
1
2
T
N
∑
i
=
1
2
∑
k
=
1
T
∑
n
=
1
N
(
x
i
,
k
n
-
x
^
i
,
k
/
k
n
)
2
,
where x
i
,
k
n is the ith component of the true state in the nth simulation at time k and x
^
i
,
k
/
k
n is its filtering estimate, N denotes the number of Monte Carlo simulations, and T denotes the simulation time. We set T as 100 seconds in simulation.Table 2
AMSEs and single step running times for bearings-only tracking.
Filters
TUKF
MCKF
1st-SIF
3rd-SIF
3rd-CKF
5th-CKF
3rd-QSIF
5th-QSIF
AMSEs (m)
8.79
64.33
2.30
107.87
8.79
2.07
6.86
1.79
Time (msec)
0.38
3.64
3.65
1.85
0.35
0.72
1.81
3.62For a fair comparison, we do 1000 independent Monte Carlo runs. MSEs and CPCRLB of positions are shown in Figures1 and 2, and AMSEs and single step running times are shown in Table 2. (Note that TUKF is identical to 3rd-CKF when state dimension n
=
2.)Figure 1
MSE ofx
(
1
).Figure 2
MSE ofx
(
2
).As shown in Figures1 and 2, the existing 3rd-SIF and MCKF diverge at time 30 s and 10 s, respectively, and the proposed 3rd-QSIF and 5th-QSIF outperform the existing 3rd-CKF and 5th-CKF in terms of filtering accuracy, respectively. From Table 2, we can see that the proposed 3rd-QSIF has almost consistent computation demands with the existing 3rd-SIF, and the proposed 5th-QSIF provides higher estimation accuracy than the existing 1st-SIF with almost consistent computation demands.


### 5.2. Nonlinear Problem with Different State Dimensions

We consider a nonlinear filtering problem with different state dimensions to show the nonlocal sampling problem for different methods. The nonlinear model is formulated as [17]
(35)
x
k
=
2
cos
⁡
(
x
k
-
1
)
+
q
k
-
1
,
z
k
=
1
+
x
k
T
x
k
+
v
k
,
k
=
1
,
…
,
T
,
where x
k is assumed to be an n-dimensional Gaussian random variable. q
k
~
N
(
q
;
0
n
×
1
,
I
n
) is the Gaussian process noise, 0
n
×
1 denotes an n-dimensional column vector with all its elements equal to 0. I
n denotes an n-dimensional identity matrix. v
k is Gaussian measurement noise with zero mean and unity variance. The true initial state x
0
=
0.1
×
1
n
×
1, where 1
n
×
1 denotes an n-dimensional column vector with all its elements equal to 1. The initial conditions for all methods are x
^
0
=
0
n
×
1 and P
0
∣
0
=
I
n. We aim to compare the performances of 3rd-CKF, 5th-CKF, TUKF, 1st-SIF, 3rd-SIF, 3rd-QSIF, and 5th-QSIF for different state dimensions n (n
=
1
:
30). The performance is compared by using the MSE defined as follows:
(36)
MSE
(
n
)
=
1
M
T
∑
m
=
1
M
∑
k
=
1
T
(
x
1
,
k
m
-
x
^
1
,
k
/
k
m
)
2
,
where M denotes the number of Monte Carlo simulations and T denotes the simulation time. We set T as 100 seconds in simulation. x
1
,
k
m is the first component of the true state in the mth simulation at time k and x
^
1
,
k
/
k
m is its filtering estimate. In fact, any element of x
k can be chosen to illustrate the performance due to their symmetric status in x
k and x
k(1) is chosen in our simulation.We do 50 independent Monte Carlo runs under the same initial conditions. MSEs for state dimensionsn
= 1 : 30 are shown in Figure 3, and single step running times of all filters for 30-dimensional system model are shown in Table 3.Table 3
Single step running times for 30-dimensional system model.
Filters
TUKF
1st-SIF
3rd-SIF
3rd-CKF
5th-CKF
3rd-QSIF
5th-QSIF
Time (msec)
1.01
8.99
11.68
0.97
14.63
10.33
131.93Figure 3
MSE with different state dimensions.As shown in Figure3, TUKF outperforms the 1st-SIF, 3rd-SIF, 3rd-CKF, and 5th-CKF, especially for high state dimensions, and the proposed 3rd-QSIF and 5th-QSIF considerably outperform TUKF for moderate state dimensions in terms of filtering accuracy, and the proposed 3rd-QSIF, 5th-QSIF, and TUKF are almost consistent in filtering accuracy for high state dimensions. Besides, from Figure 3 and Table 3, we can see that the proposed 3rd-QSIF has higher filtering accuracy than the existing 1st-SIF with almost consistent computation demands. Simulation results illustrate that the proposed QSIF can effectively mitigate the nonlocal sampling problem.


## 5.1. Bearings-Only Tracking

The considered nonlinear model, describing the bearings-only tracking, is of the form [24]
(32)
x
k
=
[
0.9
0
0
1
]
x
k
-
1
+
n
k
-
1
,
z
k
=
ta
n
-
1
(
x
2
,
k
-
sin
(
k
)
x
1
,
k
-
cos
⁡
(
k
)
)
+
v
k
,
where x
k
=
[
x
1
,
k
x
2
,
k
]
T
=
[
s
t
]
T denotes the positions in the s
-
t plane (Cartesian coordinate system). The process noise n
k
~
N
(
0
,
Q
k
) and Q
k
=
[
0.1
0.05
0.05
0.1
]. The measurement noise v
k
~
N
(
0
,
R
k
) and R
k
=
0.025. The true initial state x
0
=
[
20
5
]
T and the associated covariance P
0
∣
0
=
[
0.1
0
;
0
0.1
]
T. Under the same initial conditions, we give simulation results of TUKF, MCKF with sampling points of 50, 1st-SIF with iteration numbers of 25, 3rd-SIF with iteration numbers of 5, 3rd-CKF, 5th-CKF, the proposed 3rd-QSIF, and 5th-QSIF with iteration numbers of 5. Note that the 1st-SIF, MCKF, and the proposed 5th-QSIF have almost consistent computational complexity in this simulation. Besides, we also give the conditional posterior Cramér–Rao low bound (CPCRLB) [25] for better comparison. To compare the performances of these filters, simulation results are presented in the form of figures and tables. In figures, all filtering methods are intuitively compared by using the MSE performance index defined as follows:
(33)
MSE
(
k
)
=
1
N
∑
n
=
1
N
(
x
i
,
k
n
-
x
^
i
,
k
/
k
n
)
2
(
i
=
1,2
)
.
In Table 2, all filtering methods are specifically compared by using the average MSE (AMSE) performance index defined as follows:
(34)
AMSE
(
k
)
=
1
2
T
N
∑
i
=
1
2
∑
k
=
1
T
∑
n
=
1
N
(
x
i
,
k
n
-
x
^
i
,
k
/
k
n
)
2
,
where x
i
,
k
n is the ith component of the true state in the nth simulation at time k and x
^
i
,
k
/
k
n is its filtering estimate, N denotes the number of Monte Carlo simulations, and T denotes the simulation time. We set T as 100 seconds in simulation.Table 2
AMSEs and single step running times for bearings-only tracking.
Filters
TUKF
MCKF
1st-SIF
3rd-SIF
3rd-CKF
5th-CKF
3rd-QSIF
5th-QSIF
AMSEs (m)
8.79
64.33
2.30
107.87
8.79
2.07
6.86
1.79
Time (msec)
0.38
3.64
3.65
1.85
0.35
0.72
1.81
3.62For a fair comparison, we do 1000 independent Monte Carlo runs. MSEs and CPCRLB of positions are shown in Figures1 and 2, and AMSEs and single step running times are shown in Table 2. (Note that TUKF is identical to 3rd-CKF when state dimension n
=
2.)Figure 1
MSE ofx
(
1
).Figure 2
MSE ofx
(
2
).As shown in Figures1 and 2, the existing 3rd-SIF and MCKF diverge at time 30 s and 10 s, respectively, and the proposed 3rd-QSIF and 5th-QSIF outperform the existing 3rd-CKF and 5th-CKF in terms of filtering accuracy, respectively. From Table 2, we can see that the proposed 3rd-QSIF has almost consistent computation demands with the existing 3rd-SIF, and the proposed 5th-QSIF provides higher estimation accuracy than the existing 1st-SIF with almost consistent computation demands.


## 5.2. Nonlinear Problem with Different State Dimensions

We consider a nonlinear filtering problem with different state dimensions to show the nonlocal sampling problem for different methods. The nonlinear model is formulated as [17]
(35)
x
k
=
2
cos
⁡
(
x
k
-
1
)
+
q
k
-
1
,
z
k
=
1
+
x
k
T
x
k
+
v
k
,
k
=
1
,
…
,
T
,
where x
k is assumed to be an n-dimensional Gaussian random variable. q
k
~
N
(
q
;
0
n
×
1
,
I
n
) is the Gaussian process noise, 0
n
×
1 denotes an n-dimensional column vector with all its elements equal to 0. I
n denotes an n-dimensional identity matrix. v
k is Gaussian measurement noise with zero mean and unity variance. The true initial state x
0
=
0.1
×
1
n
×
1, where 1
n
×
1 denotes an n-dimensional column vector with all its elements equal to 1. The initial conditions for all methods are x
^
0
=
0
n
×
1 and P
0
∣
0
=
I
n. We aim to compare the performances of 3rd-CKF, 5th-CKF, TUKF, 1st-SIF, 3rd-SIF, 3rd-QSIF, and 5th-QSIF for different state dimensions n (n
=
1
:
30). The performance is compared by using the MSE defined as follows:
(36)
MSE
(
n
)
=
1
M
T
∑
m
=
1
M
∑
k
=
1
T
(
x
1
,
k
m
-
x
^
1
,
k
/
k
m
)
2
,
where M denotes the number of Monte Carlo simulations and T denotes the simulation time. We set T as 100 seconds in simulation. x
1
,
k
m is the first component of the true state in the mth simulation at time k and x
^
1
,
k
/
k
m is its filtering estimate. In fact, any element of x
k can be chosen to illustrate the performance due to their symmetric status in x
k and x
k(1) is chosen in our simulation.We do 50 independent Monte Carlo runs under the same initial conditions. MSEs for state dimensionsn
= 1 : 30 are shown in Figure 3, and single step running times of all filters for 30-dimensional system model are shown in Table 3.Table 3
Single step running times for 30-dimensional system model.
Filters
TUKF
1st-SIF
3rd-SIF
3rd-CKF
5th-CKF
3rd-QSIF
5th-QSIF
Time (msec)
1.01
8.99
11.68
0.97
14.63
10.33
131.93Figure 3
MSE with different state dimensions.As shown in Figure3, TUKF outperforms the 1st-SIF, 3rd-SIF, 3rd-CKF, and 5th-CKF, especially for high state dimensions, and the proposed 3rd-QSIF and 5th-QSIF considerably outperform TUKF for moderate state dimensions in terms of filtering accuracy, and the proposed 3rd-QSIF, 5th-QSIF, and TUKF are almost consistent in filtering accuracy for high state dimensions. Besides, from Figure 3 and Table 3, we can see that the proposed 3rd-QSIF has higher filtering accuracy than the existing 1st-SIF with almost consistent computation demands. Simulation results illustrate that the proposed QSIF can effectively mitigate the nonlocal sampling problem.


## 6. Conclusion

A QSIF method is proposed based on unbiased SSIR and FRIR in the paper. It can effectively solve the numerical instability problem, systematic error problem caused by nonlinear approximation, and nonlocal sampling problem for high-dimensional applications which exist in Gaussian filtering. Simulations of bearing-only tracking model and nonlinear filtering problem with different state dimensions show the advantages as compared with existing Gaussian filtering algorithms.



---

*Source: 967127-2014-06-23.xml*