# Extended Ellipsoidal Outer-Bounding Set-Membership Estimation for Nonlinear Discrete-Time Systems with Unknown-but-Bounded Disturbances

Authors: Yushuang Liu; Yan Zhao; Falin Wu
Journal: Discrete Dynamics in Nature and Society
 (2016)

---

## Abstract

This paper develops an extended ellipsoidal outer-bounding set-membership estimation (EEOB-SME) algorithm with high accuracy and efficiency for nonlinear discrete-time systems under unknown-but-bounded (UBB) disturbances. The EEOB-SME linearizes the first-order terms about the current state estimations and bounds the linearization errors by ellipsoids using interval analysis for nonlinear equations of process and measurement equations, respectively. It has been demonstrated that the EEOB-SME algorithm is stable and the estimation errors of the EEOB-SME are bounded when the nonlinear system is observable. The EEOB-SME decreases the computation load and the feasible sets of EEOB-SME contain more true states. The efficiency of the EEOB-SME algorithm has been shown by a numerical simulation under UBB disturbances.


---

## Body

## 1. Introduction

State estimation of dynamical systems from disturbances observations is one of the fundamental problems in control and signal processing. Based on the Bayesian theory, traditional state estimation algorithms are commonly solved under statistics assumptions of process and measurement disturbances, which have been extensively studied in last decades. The most common approach in recursive estimation is Kalman Filter (KF) [1], and the corresponding stochastic state estimators are the extended Kalman Filter (EKF) [2, 3], unscented Kalman Filter [4], and particle filter [5] for nonlinear systems. However, traditional state estimation algorithms, which aim to construct the posterior density of the estimated state, estimates of the variance with stochastic disturbances under the stochastic framework, sometimes give biased results when statistical assumptions are not satisfied. In many real-time engineering applications, the probabilistic distribution assumptions of the process or measurement disturbances are often insufficient and cannot be determined precisely with a few system input and output records.Under the assumption of unknown-but-bounded (UBB) disturbances, the set-membership estimation (SME) algorithm is considered to be an attractive alternative for state estimation [6]. Set-membership methods with deterministic noise assumptions have been largely investigated in the past 40 years in systems state or parameter estimation literatures. Unlike probabilistic approaches, the only assumptions of process and measurement disturbances are UBB and there are not any assumptions in the deterministic bounded disturbances. The solution of the set-membership estimation is a feasible set rather than the posterior density of state variables. The feasible set is a complex convex set in the state space, which is consistent with the system model, the input and output data, and UBB disturbances. The centre of the feasible set is used as a point estimate. Because of the complicated shape of the true feasible set, the key problem in set-membership estimation is to use simple convex geometric set, such as ellipsoid [7], interval [8], and zonotope [9], to reduce the complexity of algorithms. As the intuitive mathematical derivation and computational efficient algorithm, ellipsoidal set methods are claimed to be much better in many situations.The first ellipsoidal set method for set-membership state estimation was established in [6] and developed to optimal control problem with parametric families of ellipsoids in [10]. The optimal bounding ellipsoid for parameter identification is proposed in [11]. Under the minimum-volume and minimum-trace criteria, optimal ellipsoidal state-bounding algorithms were introduced in [12–14]. With selective measurement update scheme [15], a set-membership state estimation algorithm was proposed by minimizing the upper bound on a Lyapunov function of the estimation error in observation update [16] and was developed with the nonincreasing property of the estimation errors in [17]. The multi-input multioutput situation was developed in [18]. By maximizing the decrease of a Lyapunov function of the estimation error in the worse noise case, an input-to-state stable (ISS) set-membership state estimation was presented in [19]. Recently, with lower computation load than the set-membership state estimation algorithm in [19], the ellipsoidal state-bounding-based set-membership estimation (ES-SME) is proposed [20].There are relatively fewer results to be available to deal with nonlinear cases for SME algorithms. A set-valued observer for nonlinear systems was produced in [21]. An extended set-membership filter for dynamic nonlinear systems was proposed with interval analysis and the convergence of the filter was proved in [22]. A UD factorization-based set-membership filter with suboptimal bounding ellipsoids to improve the numeric stability was presented in [23]. Based on DC programming, a set-membership state estimation algorithm for nonlinear discrete-time systems with tight bounds was developed in [24]. Using the Takagi-Sugeno fuzzy model, the set-membership fuzzy filtering was established for nonlinear discrete-time systems [25]. The ellipsoidal state-bounding algorithms for nonlinear systems were used in flight control [26], neural networks training [27], tracking [28], and power system dynamic state estimation [29].For nonlinear systems, the extended Kalman filter linearizes the state trajectory about the current state estimate and the EKF is known to give biased estimates. Using similar linearization technologies to EKF, nonlinear set-membership filters had been explored with predetermined explicit assumptions of linearization error bounds in [22, 23]. Due to the complexity of nonlinear transformation of feasible sets and the lack of accurate bounding information, the nonlinearity of the system may seriously degrade the performance of the above mentioned state estimation algorithms. There are still several challenges to estimate the state for nonlinear system with UBB disturbances.To improve the estimation accuracy and reduce the computation load, this paper extends the ES-SME algorithm to nonlinear discrete-time systems and proposes an extended ellipsoidal outer-bounding set-membership estimation (EEOB-SME) algorithm. The paper is presented as follows. The ES-SME algorithm is introduced in Section2. In Section 3, the ES-SME is extended to nonlinear system with interval analysis and the EEOB-SME algorithm is proposed. Section 4 analyses the stability of the proposed EEOB-SME. The effectiveness of the EEOB-SME is demonstrated through a numerical simulation in Section 5. Section 6 concludes the paper.


## 2. Ellipsoidal Outer-Bounding SME for Linear System

### 2.1. Recursive Structure of the ES-SME

Definition 1.
An ellipsoid set is given by the setE
a
,
σ
2
P
=
{
x
∈
R
n
:
(
x
-
a
)
T
(
σ
2
P
)
-
1
(
x
-
a
)
≤
1
}, where a
∈
R
n is the centre of the ellipsoid and σ
2
P
∈
R
n
×
n called the shape-defining matrix of ellipsoid is a symmetric positive definite matrix which defines the shape and orientation of the ellipsoid. The variable σ
2
∈
R is a scalar variable.
Consider the linear discrete-time system in state space form(1)
x
k
=
F
k
-
1
x
k
-
1
+
w
k
-
1
,
(2)
y
k
=
H
k
x
k
+
v
k
, where x
k
∈
R
n is the state vector and y
k
∈
R
m is the observation vector at time k. F
k
-
1
∈
R
n
×
n and H
k
∈
R
n
×
m are known matrices. The disturbance w
k and v
k are UBB disturbances in the time and measurement equations, which are confined to the following ellipsoid sets:(3)
w
k
-
1
∈
E
0
,
W
k
-
1
⟺
w
k
-
1
∈
R
n
:
w
k
-
1
T
W
k
-
1
-
1
w
k
-
1
≤
1
,
(4)
v
k
∈
E
0
,
V
k
⟺
v
k
∈
R
m
:
v
k
T
V
k
-
1
v
k
≤
1
, where W
k
-
1 and V
k are known positive definite matrices. It is assumed that the initial state belongs to a known ellipsoid set(5)
E
0
,
σ
0
2
P
0
=
x
0
∈
R
n
:
x
0
-
x
^
0
T
P
0
-
1
x
0
-
x
^
0
≤
σ
0
2
,where x
^
0 is the estimation result of x
0 at the initial time.
The recursive structures of ellipsoidal outer-bounding set-membership estimation are time update and measurement update, which are similar to the Kalman Filter. Assume at timek
-
1, the ellipsoid E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1 contains the state vector x
k
-
1. From (1) and (3), the priori state estimation x
k
∣
k
-
1 lies in the vector sum of the linear transform ellipsoid F
k
-
1
E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1 and ellipsoid E
0
,
W
k
-
1,(6)
x
k
∣
k
-
1
∈
F
k
-
1
E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1
⊕
E
0
,
W
k
-
1
.Generally, the vector sum of two ellipsoids is not an ellipsoid; we find an ellipsoid E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1 called the state prediction ellipsoid to contain the convex set of the vector sum,(7)
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1
⊃
F
k
-
1
E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1
⊕
E
0
,
W
k
-
1
.
At timek, the state x
k lies in the intersection of the observation ellipsoid S
k and the state prediction ellipsoid E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1,(8)
x
k
∈
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1
∩
S
k
,where the observation ellipsoid is(9)
S
k
=
x
k
∈
R
n
:
y
k
-
H
k
x
k
T
V
k
-
1
y
k
-
H
k
x
k
≤
1
.Normally, the intersection set of two ellipsoids is not an ellipsoid. It has to find an ellipsoid x
k
∈
E
x
^
k
,
σ
k
2
P
k called the updated state ellipsoid to contain the intersection set,(10)
E
x
^
k
,
σ
k
2
P
k
⊃
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1
∩
S
k
.Lemma 2 (see [20]).
The recursive procedures for ES-SME algorithm are the following equations.Time Update. Assuming a known state x
k
-
1 which lies in the ellipsoid E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1, we have x
k
∣
k
-
1
∈
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1,(11)
x
^
k
∣
k
-
1
=
F
k
-
1
x
^
k
-
1
,
(12)
P
k
∣
k
-
1
=
1
-
ρ
k
-
1
F
k
-
1
P
k
-
1
F
k
-
1
T
+
σ
k
∣
k
-
1
2
ρ
k
-
1
W
k
-
1
,
(13)
σ
k
∣
k
-
1
2
=
σ
k
-
1
2
,where the value of parameter ρ
k belongs to (
0,1
) and σ
k
∣
k
-
1
2 is positive.Observation Update. Given the observation ellipsoid S
k and the state prediction ellipsoid E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1, the state x
k
∈
E
x
^
k
,
σ
k
2
P
k,(14)
x
^
k
=
x
^
k
∣
k
-
1
+
K
k
δ
k
,
(15)
P
k
=
1
1
-
λ
k
I
-
K
k
H
k
P
k
∣
k
-
1
,
(16)
σ
k
2
=
1
-
λ
k
σ
k
∣
k
-
1
2
+
λ
k
-
δ
k
T
Q
k
-
1
δ
k
,
(17)
K
k
=
1
1
-
λ
k
P
k
∣
k
-
1
H
k
T
Q
k
-
1
,
(18)
Q
k
=
1
λ
k
V
k
+
1
1
-
λ
k
H
k
P
k
∣
k
-
1
H
k
T
,
(19)
δ
k
=
y
k
-
H
k
x
^
k
∣
k
-
1
, where the value of parameter λ
k belongs to (
0,1
) and σ
k
2 is positive.Remark 3.
The covariance of the posterior estimation error in the ES-SME algorithm can be written(20)
P
k
=
1
1
-
λ
k
I
-
K
k
H
k
P
k
∣
k
-
1
I
-
K
k
H
k
T
+
1
λ
k
K
k
V
k
K
k
T
.And the gain matrix in the ES-SME algorithm has another expression(21)
K
k
=
λ
k
P
k
H
k
T
V
k
-
1
.Remark 4.
The scalar variableσ
k
2 presents the upper bound of a Lyapunov function of the posteriori estimation error, which is the inequation x
k
-
x
^
k
P
k
-
1
≤
σ
k
2.Remark 5.
Through the assumption of UBB disturbances, a time-varying ellipsoid set is acquired in state space which always contains the true state of linear system. The shape-defining matricesσ
k
2
P
k of ellipsoids, which are equal to covariance matrices in KF, represent the uncertainty of the estimate results. The estimation accuracy is evaluated by the measure of the ellipsoid set. The size of an ellipsoid is measured by its volume or trace.


### 2.2. Optimal Parameters Selection in the ES-SME

Commonly, the minimum-volume or minimum-trace criterion is used to compute the optimal scalar parametersρ
k and λ
k in time and measurement update. For the computation efficiency, parameter ρ
k is computed under the minimum-trace criterion [14](22)
ρ
k
=
tr
⁡
W
k
-
1
tr
⁡
σ
k
-
1
2
F
k
-
1
P
k
-
1
F
k
-
1
T
+
tr
⁡
W
k
-
1
.According to Lemma6, the optimal parameter λ
k in measurement update is computed through minimizing the upper bound of scalar variable σ
k
2.Lemma 6 (see [20]).
Let the initial conditionσ
0
∣
0
2
≤
1 and β
k
=
1
-
σ
k
∣
k
-
1
2
/
δ
-
k
T
δ
-
k, where δ
-
k
=
V
-
k
δ
k, G
-
k
=
V
-
k
H
k
P
k
∣
k
-
1
H
k
T
V
-
k
T,  V
k
-
1
=
V
-
k
T
V
-
k, and g
-
k is the maximum eigenvalue of G
-
k. Minimizing parameter λ
k with respect to scalar variable σ
-
k
2, where σ
-
k
2
=
1
-
λ
k
σ
k
∣
k
-
1
2
+
λ
k
-
λ
k
1
-
λ
k
δ
-
k
T
δ
-
k
/
1
-
λ
k
+
λ
k
g
-
k, one can obtain the following:(23)
λ
k
=
0
σ
k
∣
k
-
1
2
+
δ
-
k
T
δ
-
k
≤
1
1
-
β
k
2
g
-
k
=
1
1
1
-
g
-
k
1
-
g
-
k
1
+
β
k
g
-
k
-
1
g
-
k
≠
1
,where parameter λ
k lies in [
0,1
).Remark 7.
The method in Lemma6 avoids the complexity computation for minimum-volume or trace criterion [14] and avoids solving the equation with the same dimension of the output vector for Becis-Aubry’s set-membership estimation (BA-SME) [19].


## 2.1. Recursive Structure of the ES-SME

Definition 1.
An ellipsoid set is given by the setE
a
,
σ
2
P
=
{
x
∈
R
n
:
(
x
-
a
)
T
(
σ
2
P
)
-
1
(
x
-
a
)
≤
1
}, where a
∈
R
n is the centre of the ellipsoid and σ
2
P
∈
R
n
×
n called the shape-defining matrix of ellipsoid is a symmetric positive definite matrix which defines the shape and orientation of the ellipsoid. The variable σ
2
∈
R is a scalar variable.
Consider the linear discrete-time system in state space form(1)
x
k
=
F
k
-
1
x
k
-
1
+
w
k
-
1
,
(2)
y
k
=
H
k
x
k
+
v
k
, where x
k
∈
R
n is the state vector and y
k
∈
R
m is the observation vector at time k. F
k
-
1
∈
R
n
×
n and H
k
∈
R
n
×
m are known matrices. The disturbance w
k and v
k are UBB disturbances in the time and measurement equations, which are confined to the following ellipsoid sets:(3)
w
k
-
1
∈
E
0
,
W
k
-
1
⟺
w
k
-
1
∈
R
n
:
w
k
-
1
T
W
k
-
1
-
1
w
k
-
1
≤
1
,
(4)
v
k
∈
E
0
,
V
k
⟺
v
k
∈
R
m
:
v
k
T
V
k
-
1
v
k
≤
1
, where W
k
-
1 and V
k are known positive definite matrices. It is assumed that the initial state belongs to a known ellipsoid set(5)
E
0
,
σ
0
2
P
0
=
x
0
∈
R
n
:
x
0
-
x
^
0
T
P
0
-
1
x
0
-
x
^
0
≤
σ
0
2
,where x
^
0 is the estimation result of x
0 at the initial time.
The recursive structures of ellipsoidal outer-bounding set-membership estimation are time update and measurement update, which are similar to the Kalman Filter. Assume at timek
-
1, the ellipsoid E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1 contains the state vector x
k
-
1. From (1) and (3), the priori state estimation x
k
∣
k
-
1 lies in the vector sum of the linear transform ellipsoid F
k
-
1
E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1 and ellipsoid E
0
,
W
k
-
1,(6)
x
k
∣
k
-
1
∈
F
k
-
1
E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1
⊕
E
0
,
W
k
-
1
.Generally, the vector sum of two ellipsoids is not an ellipsoid; we find an ellipsoid E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1 called the state prediction ellipsoid to contain the convex set of the vector sum,(7)
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1
⊃
F
k
-
1
E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1
⊕
E
0
,
W
k
-
1
.
At timek, the state x
k lies in the intersection of the observation ellipsoid S
k and the state prediction ellipsoid E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1,(8)
x
k
∈
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1
∩
S
k
,where the observation ellipsoid is(9)
S
k
=
x
k
∈
R
n
:
y
k
-
H
k
x
k
T
V
k
-
1
y
k
-
H
k
x
k
≤
1
.Normally, the intersection set of two ellipsoids is not an ellipsoid. It has to find an ellipsoid x
k
∈
E
x
^
k
,
σ
k
2
P
k called the updated state ellipsoid to contain the intersection set,(10)
E
x
^
k
,
σ
k
2
P
k
⊃
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1
∩
S
k
.Lemma 2 (see [20]).
The recursive procedures for ES-SME algorithm are the following equations.Time Update. Assuming a known state x
k
-
1 which lies in the ellipsoid E
x
^
k
-
1
,
σ
k
-
1
2
P
k
-
1, we have x
k
∣
k
-
1
∈
E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1,(11)
x
^
k
∣
k
-
1
=
F
k
-
1
x
^
k
-
1
,
(12)
P
k
∣
k
-
1
=
1
-
ρ
k
-
1
F
k
-
1
P
k
-
1
F
k
-
1
T
+
σ
k
∣
k
-
1
2
ρ
k
-
1
W
k
-
1
,
(13)
σ
k
∣
k
-
1
2
=
σ
k
-
1
2
,where the value of parameter ρ
k belongs to (
0,1
) and σ
k
∣
k
-
1
2 is positive.Observation Update. Given the observation ellipsoid S
k and the state prediction ellipsoid E
x
^
k
∣
k
-
1
,
σ
k
∣
k
-
1
2
P
k
∣
k
-
1, the state x
k
∈
E
x
^
k
,
σ
k
2
P
k,(14)
x
^
k
=
x
^
k
∣
k
-
1
+
K
k
δ
k
,
(15)
P
k
=
1
1
-
λ
k
I
-
K
k
H
k
P
k
∣
k
-
1
,
(16)
σ
k
2
=
1
-
λ
k
σ
k
∣
k
-
1
2
+
λ
k
-
δ
k
T
Q
k
-
1
δ
k
,
(17)
K
k
=
1
1
-
λ
k
P
k
∣
k
-
1
H
k
T
Q
k
-
1
,
(18)
Q
k
=
1
λ
k
V
k
+
1
1
-
λ
k
H
k
P
k
∣
k
-
1
H
k
T
,
(19)
δ
k
=
y
k
-
H
k
x
^
k
∣
k
-
1
, where the value of parameter λ
k belongs to (
0,1
) and σ
k
2 is positive.Remark 3.
The covariance of the posterior estimation error in the ES-SME algorithm can be written(20)
P
k
=
1
1
-
λ
k
I
-
K
k
H
k
P
k
∣
k
-
1
I
-
K
k
H
k
T
+
1
λ
k
K
k
V
k
K
k
T
.And the gain matrix in the ES-SME algorithm has another expression(21)
K
k
=
λ
k
P
k
H
k
T
V
k
-
1
.Remark 4.
The scalar variableσ
k
2 presents the upper bound of a Lyapunov function of the posteriori estimation error, which is the inequation x
k
-
x
^
k
P
k
-
1
≤
σ
k
2.Remark 5.
Through the assumption of UBB disturbances, a time-varying ellipsoid set is acquired in state space which always contains the true state of linear system. The shape-defining matricesσ
k
2
P
k of ellipsoids, which are equal to covariance matrices in KF, represent the uncertainty of the estimate results. The estimation accuracy is evaluated by the measure of the ellipsoid set. The size of an ellipsoid is measured by its volume or trace.


## 2.2. Optimal Parameters Selection in the ES-SME

Commonly, the minimum-volume or minimum-trace criterion is used to compute the optimal scalar parametersρ
k and λ
k in time and measurement update. For the computation efficiency, parameter ρ
k is computed under the minimum-trace criterion [14](22)
ρ
k
=
tr
⁡
W
k
-
1
tr
⁡
σ
k
-
1
2
F
k
-
1
P
k
-
1
F
k
-
1
T
+
tr
⁡
W
k
-
1
.According to Lemma6, the optimal parameter λ
k in measurement update is computed through minimizing the upper bound of scalar variable σ
k
2.Lemma 6 (see [20]).
Let the initial conditionσ
0
∣
0
2
≤
1 and β
k
=
1
-
σ
k
∣
k
-
1
2
/
δ
-
k
T
δ
-
k, where δ
-
k
=
V
-
k
δ
k, G
-
k
=
V
-
k
H
k
P
k
∣
k
-
1
H
k
T
V
-
k
T,  V
k
-
1
=
V
-
k
T
V
-
k, and g
-
k is the maximum eigenvalue of G
-
k. Minimizing parameter λ
k with respect to scalar variable σ
-
k
2, where σ
-
k
2
=
1
-
λ
k
σ
k
∣
k
-
1
2
+
λ
k
-
λ
k
1
-
λ
k
δ
-
k
T
δ
-
k
/
1
-
λ
k
+
λ
k
g
-
k, one can obtain the following:(23)
λ
k
=
0
σ
k
∣
k
-
1
2
+
δ
-
k
T
δ
-
k
≤
1
1
-
β
k
2
g
-
k
=
1
1
1
-
g
-
k
1
-
g
-
k
1
+
β
k
g
-
k
-
1
g
-
k
≠
1
,where parameter λ
k lies in [
0,1
).Remark 7.
The method in Lemma6 avoids the complexity computation for minimum-volume or trace criterion [14] and avoids solving the equation with the same dimension of the output vector for Becis-Aubry’s set-membership estimation (BA-SME) [19].


## 3. Extended Ellipsoidal Outer-Bounding SME

The EKF considers the first-order terms used for time update and measurement update, and the second-order terms is defined as the Lagrange remainder. The main idea of EEOB-SME is to linearize the nonlinear systems about the current estimation and use interval mathematics to acquire the bound of the higher order terms. Then, the bound of the linearization error is combined together with the process or measurement disturbances to acquire a new disturbances ellipsoid, which can be seen as new UBB disturbances. The state prediction ellipsoid and the updated state ellipsoid can be estimated recursively by applying a linear set-membership estimation algorithm at each time step.Consider a nonlinear discrete-time state space system(24)
x
k
+
1
=
f
x
k
+
w
k
,
(25)
y
k
+
1
=
h
x
k
+
1
+
v
k
+
1
, where f
(
·
) and h
(
·
) are nonlinear C
2 functions and the other variables are defined in Section 2.Linearizing equation (24) about the current state estimate x
^
k yields(26)
x
k
+
1
=
f
x
k
x
k
=
x
^
k
+
∂
f
x
k
∂
x
x
k
=
x
^
k
x
k
-
x
^
k
+
O
x
k
2
+
w
k
,where ∂
f
(
x
k
)
/
∂
x is the gradient of the nonlinear function f
(
·
). The term O
(
x
k
2
) represents the high order terms, which are equal to the linearization error.Define an interval vectorX
-
k called the state interval bound, which can take on any value over the interval where (
x
k
-
x
^
k
) is defined. Then the state interval bound X
-
k based on the ellipsoid extrema is(27)
X
-
k
i
=
x
^
k
i
-
P
k
i
,
i
x
^
k
i
+
P
k
i
,
i
,
i
=
1
,
…
,
n
,where the superscripts i
,
j denote the (
i
,
j
) element of a matrix [22].Considering the scalar case for simplicity, (26) can be expanded with a remainder(28)
x
k
+
1
=
f
x
k
x
k
=
x
^
k
+
∂
f
x
k
∂
x
x
k
=
x
^
k
x
k
-
x
^
k
+
⋯
+
f
x
k
n
r
n
r
!
x
k
=
x
^
k
x
k
-
x
^
k
n
r
+
R
n
r
x
k
-
x
^
k
,
X
-
k
+
w
k
,where R
n
r
(
x
k
-
x
^
k
,
X
-
k
) is a remainder term and f
(
x
k
)
n
r is the (
n
r
)th derivative about the estimation x
k. Evaluating R
n
r
(
x
k
-
x
^
k
,
X
-
k
) by interval mathematics [30], R
n
r
(
x
k
-
x
^
k
,
X
-
k
) can be bounded by an interval, which is defined by the interval vector X
-
k. The interval of the Lagrange remainder is written as(29)
R
n
r
x
k
-
x
^
k
,
X
-
k
=
f
X
-
k
n
r
+
1
n
r
+
1
!
x
k
=
x
^
k
x
k
-
x
^
k
n
r
+
1
.Considering the expansion of the dynamics (28) with n
r
=
1, the remainder term can be seen as simple function of the Hessian of the nonlinear dynamics(30)
R
2
x
k
-
x
^
k
,
X
-
k
=
1
2
∂
2
f
X
-
k
∂
x
2
x
k
=
x
^
k
x
k
-
x
^
k
2
,and (28) can be written as(31)
x
k
+
1
=
f
x
k
x
k
=
x
^
k
+
∂
f
x
k
∂
x
x
k
=
x
^
k
x
k
-
x
^
k
+
1
2
∂
2
f
X
-
k
∂
x
2
x
k
=
x
^
k
x
k
-
x
^
k
2
+
w
k
.The expression for the general multistate case is shown(32)
X
-
R
2
=
1
2
diag
⁡
X
-
k
-
x
^
k
T
H
f
1
X
-
k
⋮
H
f
n
X
-
k
X
-
k
-
x
^
k
,where H
f
j
(
·
)
=
∂
2
f
(
·
)
/
∂
x
2 is the Hessian matrix of nonlinear function f
(
·
) [22].The interval of the Lagrange remainder can be bounded using an ellipsoid [12]. Minimizing the volume of the ellipsoid, a unique closed form solution is written as(33)
W
-
k
i
,
j
=
2
X
-
R
2
i
+
-
X
-
R
2
i
-
2
i
=
j
0
i
≠
j
,where the subscripts + and − denote the maximum and minimum values in the interval X
-
R
k. Then the ellipsoid of linearization error is defined as E
(
0
,
W
-
k
).Combine with the process disturbance ellipsoid and the linearization error ellipsoid into a new ellipsoid bound called the extended process disturbance ellipsoidE
(
0
,
W
^
k
)
(34)
w
^
k
∈
E
0
,
W
^
k
⊃
E
0
,
W
k
⊕
E
0
,
W
-
k
(35)
W
^
k
=
W
-
k
1
-
p
w
^
k
+
W
k
p
w
^
k
,where p
w
^
k is a parameter to be chosen to minimize the ellipsoid E
(
0
,
W
^
k
).The measurement equation should be dealt with in the same way as calculatingw
^
k to acquire the extended measurement disturbance ellipsoid E
(
0
,
V
^
k
+
1
),(36)
X
-
k
+
1
∣
k
i
=
x
^
k
+
1
∣
k
i
-
P
k
+
1
∣
k
i
,
i
x
^
k
+
1
∣
k
i
+
P
k
+
1
∣
k
i
,
i
,
i
=
1
,
…
,
n
,
Y
-
R
2
=
R
2
x
k
+
1
-
x
^
k
+
1
∣
k
,
X
-
k
+
1
∣
k
=
1
2
diag
⁡
X
-
k
+
1
∣
k
-
x
^
k
+
1
∣
k
T
H
h
1
X
-
k
+
1
∣
k
⋮
H
h
m
X
-
k
+
1
∣
k
X
-
k
-
x
^
k
+
1
∣
k
,
V
-
k
+
1
i
,
j
=
2
Y
-
R
k
i
+
-
Y
-
R
k
i
-
2
i
=
j
0
i
≠
j
.
v
^
k
+
1
∈
E
0
,
V
^
k
+
1
⊃
E
0
,
V
k
+
1
⊕
E
0
,
V
-
k
+
1
,
V
^
k
+
1
=
V
-
k
+
1
1
-
p
v
^
k
+
1
+
V
k
+
1
p
v
^
k
+
1
.Remark 8.
The specific procedures of the extended EOB-SME algorithm are summarized as follows:(i)
At timek
=
1, initialise x
^
0,  P
0, and σ
0
2
=
1.
(ii)
At each time stepk, the state interval X
-
k and the linearization error interval of process equation X
-
R
2 are given by (27) and (32). Then the extended process disturbance ellipsoid E
(
0
,
W
^
k
) can be calculated by (35). Let x
^
k
+
1
∣
k
=
f
(
x
^
k
) and F
k
=
∂
f
(
x
k
)
/
∂
x
k
x
k
=
x
^
k; then the state prediction ellipsoid E
x
^
k
+
1
∣
k
,
σ
k
+
1
∣
k
2
P
k
+
1
∣
k is computed by (11)–(13), where W
k is replaced by W
^
k.
(iii)
The extended measurement ellipsoidE
(
0
,
V
^
k
+
1
) can be calculated by (36). Let y
^
k
+
1
=
h
(
x
^
k
+
1
∣
k
) and H
k
+
1
=
∂
h
(
x
k
+
1
)
/
∂
x
k
+
1
x
k
=
x
^
k
+
1
∣
k; then the updated ellipsoid E
x
^
k
+
1
,
σ
k
+
1
2
P
k
+
1 is given by (14)–(18), where V
k
+
1 is replaced by V
^
k
+
1 and the time index k is changed to k
+
1. And δ
k
+
1 is δ
k
+
1
=
y
k
+
1
-
h
(
x
^
k
+
1
∣
k
).
(iv)
Iterate recursive updates (i)–(iii) until the program is terminated.


## 4. Stability Analysis

In this section, the stability analysis of the EEOB-SME is presented based on analysing linearization error dynamics. Because the shape-defining matrix of ellipsoid is similar to the estimation error covariance matrix in KF, the way to the stability analysis is the following [22, 31]. The EEOB-SME can be shown to be asymptotically stable with no disturbances and has an upper bound for the nonzero disturbances case.Definition 9.
The nonlinear observability test is satisfied if(37)
O
x
^
k
=
∂
h
∂
x
x
k
∂
h
∂
x
x
k
+
1
∂
f
∂
x
x
k
⋮
∂
h
∂
x
x
k
+
n
-
1
∂
f
∂
x
x
k
+
n
-
2
⋯
∂
f
∂
x
x
khas rank n.Lemma 10 (see [32]).
Consider the system given by (24) and (25) without process disturbances. Then there are ∃
μ
>
0 such that F
k
=
∂
f
(
x
k
)
/
∂
x
k and H
k
+
1
=
∂
h
(
x
k
+
1
)
/
∂
x
k
+
1 satisfy the uniform observability test if x
k
-
x
^
k
≤
μ.Lemma 11 (see [33]).
If the pairF
k
,
H
k is uniformly observable, then there exist two real numbers s
_ and s
-, such that s
_
×
I
≤
P
k
+
1
∣
k
≤
s
-
×
I and s
_
×
I
≤
P
k
≤
s
-
×
I.
Defining the estimation error(38)
ζ
k
=
x
k
-
x
^
k
∣
k
-
1
,
ζ
k
+
1
=
x
k
+
1
-
x
^
k
+
1
∣
k
.
Let(39)
f
x
k
-
f
x
^
k
=
F
k
x
k
-
x
^
k
+
φ
x
k
,
x
^
k
,
(40)
h
x
k
-
h
x
^
k
∣
k
-
1
=
H
k
x
k
-
x
^
k
∣
k
-
1
+
χ
x
k
,
x
^
k
∣
k
-
1
.Then(41)
ζ
k
+
1
=
f
x
k
+
w
k
-
f
x
^
k
=
F
k
x
k
-
x
^
k
+
φ
x
k
,
x
^
k
+
w
k
=
F
k
x
k
-
x
^
k
∣
k
-
1
-
F
k
K
k
y
k
-
h
x
^
k
∣
k
-
1
+
φ
x
k
,
x
^
k
+
w
k
=
F
k
x
k
-
x
^
k
∣
k
-
1
-
F
k
K
k
h
x
k
+
v
k
-
h
x
^
k
∣
k
-
1
+
φ
x
k
,
x
^
k
+
w
k
=
F
k
ζ
k
-
F
k
K
k
H
k
x
k
-
x
^
k
∣
k
-
1
+
φ
x
k
,
x
^
k
-
F
k
K
k
χ
x
k
,
x
^
k
∣
k
-
1
+
w
k
-
F
k
K
k
v
k
=
F
k
I
-
K
k
H
k
ζ
k
+
r
k
+
w
k
-
F
k
K
k
v
k
,where(42)
r
k
=
φ
x
k
,
x
^
k
-
F
k
K
k
χ
x
k
,
x
^
k
∣
k
-
1
.Theorem 12.
Consider symmetric positive shape-defining matricesP
k and P
k
∣
k
-
1. Define Π
k and Π
k
∣
k
-
1 by Π
k
∣
k
-
1
=
P
k
∣
k
-
1
-
1 and  Π
k
=
P
k
-
1,  p
k
+
1
=
(
1
-
ρ
k
+
1
)
/
ρ
k
+
1, and assume F
k
-
1 and (
I
-
K
k
H
k
)
-
T exist for k
>
0. Then(43)
Π
k
+
1
∣
k
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
F
k
-
T
I
-
K
k
H
k
-
T
Π
k
∣
k
-
1
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
1
+
p
k
+
1
-
1
-
1
Π
k
+
σ
k
2
1
+
p
k
+
1
-
1
-
1
F
k
T
W
^
k
-
1
F
k
-
1
Π
k
∣
k
-
1
I
-
K
k
H
k
-
1
F
k
-
1
.Proof.
From (20), it is easy to obtain(44)
P
k
≥
1
1
-
λ
k
I
-
K
k
H
k
P
k
∣
k
-
1
I
-
K
k
H
k
T
. Taking the inverse of (44), we have(45)
Π
k
≤
1
-
λ
k
I
-
K
k
H
k
-
T
Π
k
∣
k
-
1
I
-
K
k
H
k
-
1
.From (12), we have(46)
P
k
+
1
∣
k
=
F
k
1
+
p
k
+
1
-
1
P
k
+
1
+
p
k
+
1
F
k
-
1
W
k
F
k
-
T
σ
k
∣
k
-
1
2
F
k
T
,and then(47)
Π
k
+
1
∣
k
=
F
k
-
T
1
+
p
k
+
1
-
1
P
k
+
1
+
p
k
+
1
F
k
-
1
W
k
F
k
-
T
σ
k
2
-
1
F
k
-
1
=
F
k
-
T
1
+
p
k
+
1
-
1
-
1
Π
k
-
1
+
p
k
+
1
-
1
-
1
Π
k
1
+
p
k
+
1
-
1
-
1
Π
k
+
σ
k
2
1
+
p
k
+
1
-
1
F
k
T
W
k
-
1
F
k
-
1
1
+
p
k
+
1
-
1
-
1
Π
k
F
k
-
1
.From (15), it is obvious that(48)
P
k
T
=
1
1
-
λ
k
P
k
∣
k
-
1
I
-
K
k
H
k
T
,and we obtain(49)
Π
k
=
1
-
λ
k
Π
k
∣
k
-
1
I
-
K
k
H
k
-
1
=
1
-
λ
k
I
-
K
k
H
k
-
T
Π
k
∣
k
-
1
.According to (45), we have(50)
Π
k
+
1
∣
k
≤
F
k
-
T
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
I
-
K
k
H
k
-
T
Π
k
∣
k
-
1
I
-
K
k
H
k
-
1
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
I
-
K
k
H
k
-
T
Π
k
∣
k
-
1
1
+
p
k
+
1
-
1
-
1
Π
k
+
σ
k
2
1
+
p
k
+
1
-
1
F
k
T
W
k
-
1
F
k
-
1
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
I
-
K
k
H
k
-
1
F
k
-
1
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
F
k
-
T
I
-
K
k
H
k
-
T
Π
k
∣
k
-
1
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
1
+
p
k
+
1
-
1
-
1
Π
k
+
σ
k
2
1
+
p
k
+
1
-
1
-
1
F
k
T
W
^
k
-
1
F
k
-
1
Π
k
∣
k
-
1
I
-
K
k
H
k
-
1
F
k
-
1
.The proof of Theorem 12 is completed.Theorem 13.
Assume the following assumptions hold:(i)
F
k
≤
a
-,  H
k
≤
c
-,   K
k
≤
k
-,  p
_
×
I
≤
P
k
≤
p
-
×
I,  p
_
×
I
≤
P
k
∣
k
-
1
≤
p
-
×
I.
(ii)
F
k is invertible for all k
≥
0.
(iii)
There are positive real numbersε
φ,  ε
χ,  κ
φ, and  κ
χ, such that nonlinear functions φ
(
·
) and χ
(
·
) in (39) and (40) are bounded as φ
(
x
k
,
x
^
k
)
≤
κ
φ
x
k
-
x
^
k
2 and χ
(
x
k
,
x
^
k
∣
k
-
1
)
≤
κ
χ
x
k
-
x
^
k
∣
k
-
1
2 for x
k,  x
^
k, and x
^
k
∣
k
-
1
∈
R
n with x
k
-
x
^
k
≤
ε
φ and x
k
-
x
^
k
∣
k
-
1
≤
ε
χ, respectively.
Then the EEOB-SME algorithm gives ellipsoidal estimates where the error between the centre of the ellipsoid and the true state converges to zero, when the disturbances are zero.Proof.
From (14) and (40),  x
k
-
x
^
k
=
x
k
-
x
^
k
∣
k
-
1
-
K
k
H
k
(
x
k
-
x
^
k
∣
k
-
1
)
-
K
k
χ
(
x
k
,
x
^
k
∣
k
-
1
)
-
K
k
v
k. When the disturbances v
k are zero, we have(51)
x
k
-
x
^
k
=
x
k
-
x
^
k
∣
k
-
1
-
K
k
H
k
x
k
-
x
^
k
∣
k
-
1
-
K
k
χ
x
k
,
x
^
k
∣
k
-
1
,According to the assumptions (i) and (iii) it is not difficult to see that(52)
x
k
-
x
^
k
≤
x
k
-
x
^
k
∣
k
-
1
+
k
-
c
-
x
k
-
x
^
k
∣
k
-
1
+
k
-
κ
χ
x
k
-
x
^
k
∣
k
-
1
2
≤
1
+
k
-
c
-
+
k
-
κ
χ
ε
χ
x
k
-
x
^
k
∣
k
-
1
.
From (42), we obtain(53)
r
k
≤
φ
x
k
,
x
^
k
+
a
-
k
-
χ
x
k
,
x
^
k
∣
k
-
1
.Choosing(54)
ε
=
min
⁡
ε
χ
,
ε
φ
1
+
k
-
c
-
+
k
-
κ
χ
ε
χ
,for any x
k
-
x
^
k
∣
k
-
1
≤
ε, it is easy to verify that(55)
r
k
≤
κ
φ
1
+
k
-
c
-
+
k
-
κ
χ
ε
χ
x
k
-
x
^
k
∣
k
-
1
2
+
a
-
k
-
κ
χ
x
k
-
x
^
k
∣
k
-
1
2
.Let κ
=
κ
φ
(
1
+
k
-
c
-
+
k
-
κ
χ
ε
χ
)
+
a
-
k
-
κ
χ; we have(56)
r
k
≤
κ
x
k
-
x
^
k
∣
k
-
1
2
.
Define the Lyapunov functionV
k
(
ζ
k
)
=
ζ
k
T
Π
k
∣
k
-
1
ζ
k; from the assumption (i), we obtain(57)
1
p
-
ζ
k
2
≤
V
k
ζ
k
≤
1
p
_
ζ
k
2
.When the disturbances are zero in (41), the estimation error is ζ
k
+
1
=
F
k
(
I
-
K
k
H
k
)
ζ
k
+
r
k and the following can be obtained(58)
V
k
+
1
ζ
k
+
1
=
ζ
k
+
1
T
Π
k
+
1
∣
k
ζ
k
+
1
=
ζ
k
T
I
-
K
k
H
k
T
F
k
T
Π
k
+
1
∣
k
F
k
I
-
K
k
H
k
+
2
r
k
T
Π
k
+
1
∣
k
F
k
I
-
K
k
H
k
ζ
k
+
r
k
T
Π
k
+
1
∣
k
r
k
≤
ζ
k
T
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
1
+
p
k
+
1
-
1
-
1
Π
k
+
σ
k
2
1
+
p
k
+
1
-
1
F
k
T
W
k
-
1
F
k
-
1
Π
k
∣
k
-
1
ζ
k
+
2
r
k
T
Π
k
+
1
∣
k
F
k
I
-
K
k
H
k
ζ
k
+
r
k
T
Π
k
+
1
∣
k
r
k
.Then (58) can be written as(59)
V
k
+
1
ζ
k
+
1
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
ζ
k
T
Π
k
∣
k
-
1
ζ
k
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
2
ζ
k
2
p
_
2
1
+
p
k
+
1
-
1
-
1
p
_
+
σ
k
2
1
+
p
k
+
1
a
-
2
/
w
_
+
2
κ
ζ
k
2
a
-
1
+
k
-
c
-
p
_
ζ
k
+
κ
ζ
k
2
κ
ε
p
_
ζ
k
.We obtain that(60)
V
k
+
1
ζ
k
+
1
-
V
k
ζ
k
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
-
1
V
k
+
1
ζ
k
+
1
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
2
p
_
2
1
+
p
k
+
1
-
1
-
1
p
_
+
σ
k
2
1
+
p
k
+
1
a
-
2
/
w
_
-
κ
′
ζ
k
ζ
k
2
,where κ
′
=
κ
[
a
-
(
1
+
k
-
c
-
)
+
κ
ε
]
/
p
_, because [
(
1
+
p
k
+
1
-
1
)
-
1
(
1
-
λ
k
)
-
1
]
=
(
-
λ
k
-
p
k
+
1
-
1
)
/
(
1
+
p
k
+
1
-
1
)
<
0, choosing (61)
ε
′
=
min
⁡
ε
,
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
2
κ
′
p
_
2
1
+
p
k
+
1
-
1
-
1
p
_
+
σ
k
2
1
+
p
k
+
1
a
-
2
/
w
_
.It follows that V
k
+
1
(
ζ
k
+
1
)
-
V
k
(
ζ
k
)
≤
0 holds for ζ
k
≤
ε
′. Then the estimation error will go to zero. The proof of Theorem 13 is completed.Theorem 14.
Under the same assumptions in Theorem13, the estimation error of EEOB-SME algorithm will acquire an upper bound, when the disturbances are nonzero.Proof.
When the disturbances are nonzero, the estimation error is described as(62)
ζ
k
+
1
=
F
k
I
-
K
k
H
k
ζ
k
+
r
k
+
w
k
-
F
k
K
k
v
k
.Then the following can be obtained(63)
V
k
+
1
ζ
k
+
1
=
ζ
k
+
1
T
Π
k
+
1
∣
k
ζ
k
+
1
≤
ζ
k
T
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
Π
k
∣
k
-
1
1
+
p
k
+
1
-
1
-
1
Π
k
+
σ
k
2
1
+
p
k
+
1
-
1
F
k
T
W
k
-
1
F
k
-
1
Π
k
∣
k
-
1
ζ
k
+
2
r
k
T
Π
k
+
1
∣
k
F
k
I
-
K
k
H
k
ζ
k
+
r
k
T
Π
k
+
1
∣
k
r
k
+
2
n
k
T
Π
k
+
1
∣
k
F
k
I
-
K
k
H
k
ζ
k
+
n
k
T
Π
k
+
1
∣
k
n
k
+
2
n
k
T
Π
k
+
1
∣
k
r
k
,where n
k
=
w
k
-
F
k
K
k
v
k. The upper bound of disturbances is defined as n
-
=
w
-
-
a
-
k
-
v
-. Thus we obtain(64)
V
k
+
1
ζ
k
+
1
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
ζ
k
T
Π
k
∣
k
-
1
ζ
k
-
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
2
ζ
k
2
p
_
2
1
+
p
k
+
1
-
1
-
1
p
_
+
σ
k
2
1
+
p
k
+
1
a
-
2
/
w
_
+
2
κ
ζ
k
2
a
-
1
+
k
-
c
-
p
_
ζ
k
+
κ
ζ
k
2
κ
ε
p
_
ζ
k
+
2
n
-
a
-
1
+
k
-
c
-
p
_
ζ
k
+
2
n
-
κ
p
_
ζ
k
2
+
n
-
2
p
_
.Then(65)
V
k
+
1
ζ
k
+
1
-
V
k
ζ
k
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
-
1
V
k
+
1
ζ
k
+
1
+
κ
1
ζ
k
3
+
κ
2
ζ
k
2
+
κ
3
ζ
k
+
κ
4
,where κ
i and ε
i are defined appropriately, and the following is obtained(66)
V
k
+
1
ζ
k
+
1
-
V
k
ζ
k
≤
1
+
p
k
+
1
-
1
-
1
1
-
λ
k
-
1
V
k
+
1
ζ
k
+
1
+
κ
4
.When ζ
k
≥
ε
4, the following holds: V
k
+
1
(
ζ
k
+
1
)
-
V
k
(
ζ
k
)
≤
0. It means estimation errors have an upper bound. The proof of Theorem 14 is completed.


## 5. Numerical Simulation

The following discrete-time Van der Pol equation within ellipsoidal bounds is to evaluate the performance of EEOB-SME with EKF, BA-SME [19], and AESMF [23]:(67)
x
1
,
k
+
1
x
2
,
k
+
1
=
x
1
,
k
+
h
x
2
,
k
x
2
,
k
+
h
-
9
x
1
,
k
+
μ
1
-
x
1
,
k
2
x
2
,
k
+
w
k
,
y
k
=
x
1
,
k
+
v
k
,which was studied in [21]. The initial conditions are h
=
0.02,  μ
=
2,  x
0
=
(
1,2
)
T,  P
0
=
diag
⁡
(
1,1
), and σ
0
2
=
1. The process and measurement disturbances are uniformly distributed in (
-
0.1,0.1
) inside bounding ellipsoids, which have shape-defining matrix W
=
diag
⁡
(
0.01,0.01
) and v
=
(
-
0.1,0.1
). Simulation contains M
=
100 Monte Carlo steps with independent noise sequences and N
=
200 recursive updates in each Monte Carlo step. The geometric centre of ellipsoid is considered as the point estimation result and used the trace criterion to compute parameter p
k in both SME algorithms. The averaged root mean square error (RMSE) is defined as R
M
S
E
i
=
∑
k
=
1
N
x
k
-
x
^
k
2
/
N
/
M,  i
=
1,2
,
3.Figure1 shows the UBB noises in ellipsoid bound for process noises. First, observation noises with uniform distribution are generated. Then an ellipsoid is plotted according to the corresponding shape-defining matrix. The process noises which are contained in the ellipsoid are used as UBB disturbances.Figure 1
Uniformly distribution in ellipsoidal bound for process disturbances.After 100 Monte Carlo simulations, the averaged root mean square errors (RMSE) between true states and estimated states are shown in Figure2. The point estimation accuracy of EEOB-SME is better than AESMF and KF. The RMSE of EEOB-SME for state x
1 are larger than BA-SME at the initial stage but are gradual close to the BA-SME, which are the most time consuming algorithm. For state x
2, the RMSE of EEOB-SME is equal to BA-SME and lower than AESMF and KF.Figure 2
Average RMS errors of states.
(a)
Statex
1
,
k
(b)
Statex
2
,
kPlots in Figure3 show averaged guaranteed bounds in each state variable. The bounds of EEOB-SME and BA-SME are close to AESMF for state x
1 but are lower than AESMF for state x
2. Notice that the bound of ellipsoids will not vanish and estimated results will not converge to single points with steps increasing.Figure 3
Guaranteed bounds and true values of states.
(a)
State boundsx
1
,
k
(b)
State boundsx
2
,
kFigure4 shows the trends of scalar variable σ
2 with recursive updates. The scalar variable σ
2 of EEOB-SMF monotonous decreases exponentially from initial value 1 to values less than 0.1. The decline speed of EEOB-SME is faster than BA-SME, and the average run time of EEOB-SME is equal to AESMF. The shape-defining matrix σ
k
2
P
k of ellipsoid will be reduced when the bounds of scalar variable σ
2 are decreasing. Notice that the smaller the value of scalar variable σ
2, the smaller the volume of ellipsoids, which can be seen from Figure 5. The values of scalar variable σ
2 in AESMF change a little after decreasing initial stage.Figure 4
The scalar variableσ
k
2.Figure 5
Bounding ellipsoids of the feasible sets.In Figure5, states x
1 are the horizontal axis and states x
2 are the ordinate axis. As the direct result of remainder terms, the state uncertainty ellipsoid for EEOB-SME and AESMF algorithms decreases with recursive updates. Although ellipsoid feasible sets of EEOB-SME are larger than AESMF at the initial stage, with the decreasing of scalar variable σ
k
2, the volumes of ellipsoid feasible sets for EEOB-SME are equal to AESMF. Near the states (
-
2
,
1
), ellipsoid feasible sets of AESMF do not contain true states of the system, but the ellipsoid feasible sets of EEOB-SME always contain true states. Because of larger linearization errors, ellipsoid feasible sets of EEOB-SME and AESMF do not contain true states of nonlinear system, which can be seen at k
=
100.The average RMSE and run time of EEOB-SME, BA-SME, AESMF, and Kalman Filter are summarized in Table1. To pay at the cost of computing time, the RMSE of BA-SME algorithm is minimal. The average RMSE of EEOB-SME is larger than BA-SME but the computing time of EEOB-SME is lower than BA-SME. The most time consuming algorithm is BA-SME, which is more than 2 ms at each recursive step. The average rum time of EEOB-SME, AESMF, and Kalman Filter is less than 0.6 ms and suitable for real-time application.Table 1
Average RMS errors of states and run time.
Method
RMSE
Run time (ms)
e
R
M
S
,
1
e
R
M
S
,
2
t
Kalman Filter
0.0485
0.2708
0.224
AESMF
0.0481
0.2256
0.396
BA-SME
0.0436
0.2161
2.220
EEOB-SME
0.0453
0.2173
0.525


## 6. Conclusion

Based on UBB disturbances, this paper proposes an EEOB-SME algorithm for nonlinear discrete-time systems. The nonlinear equations of process and measurement equations are linearized with the first-order terms about current state estimations. Using interval analysis, the high order terms, which are equal to linearization errors, are bounded by ellipsoids. The bounds of the linearization errors are combined together with process or measurement disturbances as new UBB disturbances. If the nonlinear process and measurement equations are observable, the EEOB-SME algorithm is stable and the estimation errors of the EEOB-SME are bounded. Simulations results show that the EEOB-SME has better RMSE performance compared to Kalman Filter under UBB disturbances, and the computation time of EEOB-SME is lower than BA-SME. In addition, the feasible sets of EEOB-SME contain more true states than AESMF. Thus, the real-time application of set-membership state estimation is improved by the EEOB-SME algorithms. Actually, the EEOB-SME algorithm makes a balance between the estimation accuracy and computational efficiency. However, the EEOB-SME does not acquire the minimal point estimation results, which is the future research direction.



---

*Source: 3918797-2016-05-11.xml*