# Multisensory Prediction Fusion of Nonlinear Functions of the State Vector in Discrete-Time Systems

Authors: Ha Ryong Song; Il Young Song; Vladimir Shin
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

We propose two new multisensory fusion predictors for an arbitrary nonlinear function of the state vector in a discrete-time linear dynamic system. Nonlinear function of the state (NFS) represents a nonlinear multivariate functional of state variables, which can indicate useful information of the target system for automatic control. To estimate the NFS using multisensory information, we propose centralized and decentralized predictors. For multivariate polynomial NFS, we propose an effective closed-form computation procedure for the predictor design. For general NFS, the most popular procedure for the predictor design is based on the unscented transformation. We demonstrate the effectiveness and estimation accuracy of the fusion predictors on theoretical and numerical examples in multisensory environment.


---

## Body

## 1. Introduction

The integration of information from a combination of different types of sensors is often used in the design of high-accuracy control systems. Typical applications that benefit from usage of multiple sensors include industrial tasks, military commands, mobile robot navigation, multitarget tracking, and aircraft. One problem that arises from the use of multiple sensors is that if all local sensors observe the same target, the question then becomes how to effectively combine the corresponding local estimates. Several decentralized fusion architectures have been discussed and algorithms for estimation fusion have been developed in [1–4]. An important practical problem in the above systems and architectures is to find a fusion estimate to combine the information from various local estimates to produce a global (fusion) estimate. Optimal mean square linear fusion formulas, for an arbitrary number of local estimates with matrix and scalar weights, have been reported in [5–10].However, because of the lack of prior information, in general, the decentralized estimation using the fusion formula is globally suboptimal compared with optimal centralized estimation [11]. Nevertheless, in this case it has advantages of lower computational requirements, efficient communication costs, parallel implementation, and fault-tolerance [11–13]. Therefore, in spite of its limitations, the decentralized estimation has been widely used and is superior to the centralized estimation in real applications. The aforementioned papers [5–13] have not focused on the prediction problem, but most of them have considered only decentralized filtering of state variables in multisensory dynamic models. The decentralized prediction of the state requires special algorithms presented in [14, 15].Some applications require the estimation fusion of nonlinear function of the state variables, representing useful information for system control, for example, a quadratic form of a state vector, which can be interpreted as a current distance between targets or as the energy of an object [16, 17]. We refer to the nonlinear function as the nonlinear function of the state (NFS). In [17], we have not focused on the prediction of the NFS, considering instead only filtering. To the best of our knowledge, there are no methods reported in the literature for prediction fusion of the NFS in a multisensory environment. Direct generalization of the distributed fusion filtering algorithms to the prediction problem of the NFS is impossible.Therefore, in this paper, the prediction fusion problem of NFS is considered under a multisensory environment. The primary aim of this paper is to propose centralized and decentralized prediction fusion algorithms and analyze their statistical accuracies.This paper is organized as follows. Section2 presents a statement of the prediction fusion problem for NFS. In Section 3, the centralized global optimal predictor is derived. In Section 4, we propose the nonlinear decentralized prediction fusion algorithm for NFS. In Section 5, we propose effective closed-form computational procedure for prediction of multivariate polynomial functions. For prediction of a general NFS, we use the unscented transformation. In Section 6, we study the comparative analysis of the proposed fusion estimators via a theoretical example. In Section 7, the efficiency of the fusion predictors is studied for prediction of the instantaneous impact point of space launch vehicle. Finally, we conclude our results in Section 8.


## 2. Problem Statement

The general Kalman multisensory framework involves estimation of the state of a discrete-time linear dynamic system:(1)
x
k
+
1
=
F
k
x
k
+
G
k
w
k
,
k
=
0,1
,
2
,
…
,
x
0
~
N
x
-
0
,
P
0
,
y
k
i
=
H
k
i
x
k
+
v
k
i
,
i
=
1
,
…
,
L
,where x
k
∈
R
n and y
k
(
i
)
∈
R
m
i are unknown state and measurement vectors, respectively, and F
k
∈
R
n
×
n, G
k
∈
R
n
×
q, and H
k
(
i
)
∈
R
m
i
×
n.Assume thatL sensors are used to observe the state vector simultaneously. The process noise w
k
∈
R
q
~
N
0
,
Q
k and the measurement noises v
k
(
i
)
∈
R
m
i
~
N
0
,
R
k
(
i
), i
=
1
,
…
,
L, represent normally distributed uncorrelated random processes.Our goal is to find a fused prediction estimate of the NFS at future timek
+
s, s
≥
0, where(2)
z
k
+
s
=
f
x
k
+
s
:
R
n
⟶
Rbased on overall current sensor measurements, where(3)
Y
1
:
k
=
Y
1
:
k
1
,
…
,
Y
1
:
k
L
,
Y
1
:
k
i
=
y
1
i
,
y
2
i
,
…
,
y
k
i
,
i
=
1
,
…
,
L
.Typical examples of such NFS may be an arbitrary quadratic form f
x
k
=
x
k
T
Ω
k
x
k of the state vector or magnitude of position and velocity of three-dimensional state vectors f
x
k
=
x
1
,
k
2
+
x
2
,
k
2
+
x
3
,
k
2 and f
x
k
=
x
˙
1
,
k
2
+
x
˙
2
,
k
2
+
x
˙
3
,
k
2, respectively.In general, there are two fusion estimation approaches commonly used to process the overall measured data. If a central processor receives measurementsY
[
1
:
k
] from all local sensors directly and processes them in real time, the corresponding result is known ascentralized data processing. However, this approach has several serious drawbacks, including poor survivability and reliability, as well as heavy communication and computational burdens.The second approach is calleddecentralized estimation fusion, in which every local sensor is attached to a local processor. In this approach, the processor estimates the state of a system based on its own local measurements Y
[
1
:
k
]
(
i
) and then transmits its local linear x
^
k
+
s
∣
k
(
i
) or nonlinear z
^
k
+
s
∣
k
(
i
) predicted estimates to the fusion center. Finally, the fusion center predicts the state (object) x
k
+
s and NFS z
k
+
s
=
f
x
k
+
s based on all received local estimates. For this reason, the proposed estimation algorithm is referred to asdecentralized prediction fusion algorithm. Clearly, decentralized prediction has significant practical value, because it has greater survivability in extreme situations because it can estimate objects even though the fusion center is destroyed.We propose centralized and decentralized prediction fusion algorithms for NFS in the subsequent sections.


## 3. Centralized Multisensory Prediction Fusion: Global Optimal Predictor

In this section, the best global optimal (in the mean square error (MSE) sense) prediction algorithm for an NFS is derived. In the centralized fusion setup, a multisensory dynamic system (1) can be reformulated into a composite form:(4)
x
k
+
1
=
F
k
x
k
+
G
k
w
k
,
k
=
0,1
,
2
,
…
,
Y
k
=
H
k
x
k
+
v
k
,
Y
k
∈
R
m
,
m
=
m
1
+
⋯
+
m
L
,where(5)
Y
k
T
=
y
k
1
T
⋯
y
k
L
T
,
H
k
T
=
H
k
1
T
⋯
H
k
L
T
,
v
k
T
=
v
k
1
T
⋯
v
k
L
T
,
v
k
~
N
0
,
R
k
,
R
k
=
diag
⁡
R
k
1
,
…
,
R
k
L
.The optimal centralized Kalman predictor (CKP) x
^
k
+
s
∣
k
C
K
P
=
E
x
k
+
s
∣
Y
[
1
:
k
] of the state vector and its error covariance P
k
+
s
∣
k
C
K
P
=
c
o
v
e
k
+
s
∣
k
C
K
P
,
e
k
+
s
∣
k
C
K
P, e
k
+
s
∣
k
C
K
P
=
x
k
+
s
-
x
^
k
+
s
∣
k
C
K
P, are given by the Kalman predictor equations [18, 19]:(6)
x
^
k
+
s
∣
k
C
K
P
=
F
k
+
s
-
1
x
^
k
+
s
-
1
∣
k
C
K
P
,
P
k
+
s
∣
k
C
K
P
=
F
k
+
s
-
1
P
k
+
s
-
1
∣
k
C
K
P
F
k
+
s
-
1
T
+
Q
~
k
+
s
-
1
,
Q
~
k
+
s
-
1
=
G
k
+
s
-
1
Q
k
+
s
-
1
G
k
+
s
-
1
T
,
s
=
1,2
,
…
,or (7)
x
^
k
+
s
∣
k
C
K
P
=
F
k
+
s
-
1
x
^
k
+
s
-
1
∣
k
C
K
P
=
F
k
+
s
-
1
F
k
+
s
-
2
x
^
k
+
s
-
2
∣
k
C
K
P
=
⋯
=
Φ
k
+
s
,
k
x
^
k
∣
k
C
K
P
,
x
^
k
∣
k
C
K
P
≡
x
^
k
C
K
F
,
P
k
+
s
∣
k
C
K
P
=
Φ
k
+
s
,
k
P
k
∣
k
C
K
P
Φ
k
+
s
,
k
T
+
∑
j
=
0
s
-
1
Φ
k
+
s
,
k
+
j
+
1
Q
~
k
+
j
Φ
k
+
s
,
k
+
j
+
1
T
,
P
k
∣
k
C
K
P
≡
P
k
C
P
F
,
Φ
k
,
l
=
F
k
-
1
F
k
-
2
⋯
F
l
,
k
>
l
,
Φ
k
,
k
=
I
n
,where I
n is an n
×
n identity matrix, Φ
k
,
l is the transition matrix for the system model (1), and the initial conditions x
^
k
∣
k
C
K
P
≡
x
^
k
C
K
F and P
k
∣
k
C
K
F
≡
P
k
C
K
F are determined by the centralized Kalman filter (CKF) equations for the composite measurement models (4) and (5):(8)
x
^
k
+
1
C
K
F
=
F
k
x
^
k
C
K
F
+
K
k
+
1
Y
k
+
1
-
H
k
+
1
F
k
x
^
k
C
K
F
,
x
^
0
C
K
F
=
x
-
0
,
P
k
+
1
-
=
F
k
P
k
C
K
F
F
k
T
+
G
k
Q
k
G
k
T
,
P
0
C
K
F
=
P
0
,
K
k
+
1
=
P
k
+
1
-
H
k
+
1
T
H
k
+
1
P
k
+
1
-
H
k
+
1
T
+
R
k
+
1
-
1
,
P
k
+
1
C
K
F
=
I
n
-
K
k
+
1
H
k
+
1
P
k
+
1
-
,
k
=
0,1
,
2
,
…
.Note that the optimal Kalman predictor x
^
k
+
s
∣
k
C
K
P and filter x
^
k
C
K
F represent the centralized estimators, which simultaneously process theoverall measurements Y
k.Next, the global optimal mean square predictor of NFSz
k
+
s
=
f
x
k
+
s, based on the overall sensor measurements (3), also represents a conditional mean; that is,(9)
z
^
k
+
s
∣
k
o
p
t
=
E
z
k
+
s
∣
Y
1
:
k
=
∫
f
x
k
+
s
p
x
k
+
s
∣
Y
1
:
k
d
x
k
+
s
,
s
≥
0
,where p
x
k
+
s
∣
Y
[
1
:
k
]
=
N
x
^
k
+
s
∣
k
C
K
P
,
P
k
+
s
∣
k
C
K
P is a normal probability density function with conditional mean x
^
k
+
s
∣
k
C
K
P
=
E
x
k
+
s
∣
Y
[
1
:
k
] and covariance P
k
+
s
∣
k
C
K
P
=
c
o
v
e
k
+
s
∣
k
C
K
P
,
e
k
+
s
∣
k
C
K
P determined by the centralized Kalman predictor equations (6)–(8) for a composite linear model (4), including all sensor measurements.Thus, estimate (9) represents the optimal minimum mean square error (MMSE) centralized nonlinear predictor(10)
z
^
k
+
s
∣
k
o
p
t
=
z
^
k
+
s
∣
k
o
p
t
x
^
k
+
s
∣
k
C
K
P
,
P
k
+
s
∣
k
C
K
P
,
s
≥
0
,which depends on the centralized Kalman filter and predictor and their error covariances.Remark 1.
There is an alternative idea to estimate the NFS. In this case, the unknown NFSz
k
+
s
=
f
x
k
+
s is considered as additional state variable z
k which is determined by the nonlinear difference equation z
k
+
1
=
Φ
k
x
k
,
w
k, Φ
k
=
Φ
k
F
k
x
k
+
G
k
w
k, k
=
1,2
,
…. Including the variable z
k
=
f
x
k into the state vector of a system x
k
∈
R
n, we obtain nonlinear discrete-time system with the extended state x
k
/
=
[
x
k
T
z
k
]
∈
R
n
+
1. Thus, the problem of prediction of the unknown NFS is reduced to the nonlinear filtering problem by replacing real state vector x
k by the respective extended state vector x
k
/. And approximate nonlinear filters can be used for simultaneous prediction of the unknown state vector x
k
+
s and NFS z
k
+
s. Notice that, contrary to the proposed idea (6)–(10), in this case it is impossible to separate prediction of the state x
k
+
s from prediction of the NFS z
k
+
s. Many different approximate filters have been proposed in the literature. For instance, the most common one is the extended Kalman filter (EKF), obtained by linearizing the nonlinear model equations along the state. In this case, the EKF must perform the simultaneous calculation of equations determining x
^
k
/ and the auxiliary matrices P
k
/, P
k
(
-
)
/, and K
k. Also computational complexity of the nonlinear approximate filters is considerably greater than complexity of the linear Kalman estimators (6)–(8).In decentralized fusion, the fusion center tries to get the best prediction of an NFS with the processed data received from each local sensorY
[
1
:
k
]
(
i
)
=
y
1
(
i
)
,
…
,
y
k
(
i
), i
=
1
,
…
,
L. In Section 4, we propose decentralized multisensory prediction fusion algorithm based on the L local Kalman predictors of NFS z
k
+
s
=
f
x
k
+
s:(11)
z
^
k
+
s
∣
k
i
=
E
f
x
k
+
s
∣
Y
1
:
k
i
,
i
=
1
,
…
,
L
,which are available at the fusion center.


## 4. Decentralized Multisensory Prediction Fusion

### 4.1. Local Kalman Predictors for the State Vector

At first, according to (1), we have L unconnected dynamical subsystems i
=
1
,
…
,
L with the common state x
k and local sensor y
k
(
i
) such that(12)
x
k
+
1
=
F
k
x
k
+
G
k
v
k
,
y
k
i
=
H
k
i
x
k
+
w
k
i
,where i is the index of the subsystem, i
=
1
,
…
,
L.Then, the optimal mean square local prediction estimatex
^
k
+
s
∣
k
(
i
)
=
E
x
k
+
s
∣
Y
[
1
:
k
]
(
i
), filtering estimate x
^
k
(
i
)
=
E
x
k
∣
Y
[
1
:
k
]
(
i
), and corresponding error covariances P
k
+
s
∣
k
(
i
i
) and P
k
(
i
i
) are determined by recursive Kalman equations [18, 19]. We have(13)
x
^
k
+
s
∣
k
i
=
F
k
+
s
-
1
x
^
k
+
s
-
1
∣
k
i
,
x
^
k
∣
k
i
≡
x
^
k
i
,
P
k
+
s
∣
k
i
i
=
F
k
+
s
-
1
P
k
+
s
-
1
∣
k
i
i
F
k
+
s
-
1
T
+
Q
~
k
+
s
-
1
,
P
k
∣
k
i
i
≡
P
k
i
i
,
Q
~
k
+
s
-
1
=
G
k
+
s
-
1
Q
k
+
s
-
1
G
k
+
s
-
1
T
,
s
=
1,2
,
…
,
(14)
x
^
k
+
1
i
=
F
k
x
^
k
i
+
K
k
+
1
i
y
k
+
1
i
-
H
k
+
1
i
F
k
x
^
k
i
,
x
^
0
i
=
x
-
0
,
P
k
+
1
i
i
-
=
F
k
P
k
i
i
F
k
T
+
G
k
Q
k
G
k
T
,
P
0
i
i
=
P
0
,
K
k
+
1
i
=
P
k
+
1
i
i
-
H
k
+
1
i
T
H
k
+
1
i
P
k
+
1
i
i
-
H
k
+
1
i
T
+
R
k
+
1
i
-
1
,
P
k
+
1
i
i
=
I
n
-
K
k
+
1
i
H
k
+
1
i
P
k
+
1
i
i
-
,
k
=
0,1
,
2
,
…
.Thus, we have L local Kalman estimates x
^
k
(
i
) and x
^
k
+
s
∣
k
(
i
)
, and their corresponding error covariances P
k
(
i
i
)
=
c
o
v
e
k
(
i
)
,
e
k
(
i
) and P
k
+
s
∣
k
(
i
i
)
=
c
o
v
e
k
+
s
∣
k
(
i
)
,
e
k
+
s
∣
k
(
i
), e
k
(
i
)
=
x
k
-
x
^
k
(
i
) and e
k
+
s
∣
k
(
i
)
=
x
k
+
s
-
x
^
k
+
s
∣
k
(
i
) for i
=
1
,
…
,
L.


### 4.2. Local Predictors for Nonlinear Function of the State Vector

Then, the optimal local mean square prediction of NFSz
k
+
s
=
f
x
k
+
s, based on the local sensor measurements Y
[
1
:
k
]
(
i
), represents a conditional mean (11); that is,(15)
z
^
k
+
s
∣
k
i
=
E
f
x
k
+
s
∣
Y
1
:
k
i
=
∫
f
x
k
+
s
p
x
k
+
s
∣
Y
1
:
k
i
d
x
k
+
s
,where p
x
k
+
s
∣
Y
[
1
:
k
]
(
i
) is a normal conditional probability density function, p
x
k
+
s
∣
Y
[
1
:
k
]
(
i
)
=
N
x
^
k
+
s
∣
k
(
i
)
,
P
k
+
s
∣
k
(
i
i
). Therefore, the optimal local estimate z
^
k
+
s
∣
k
(
i
) in (15) represents a nonlinear function of the local Kalman predictor and its error covariance; that is,(16)
z
^
k
+
s
∣
k
i
=
z
^
k
+
s
∣
k
i
x
^
k
+
s
∣
k
i
,
P
k
+
s
∣
k
i
i
,
i
=
1
,
…
,
L
.


### 4.3. Multisensory Prediction Fusion Algorithm

Using all optimal local nonlinear predictorsz
^
k
+
s
∣
k
(
1
)
,
…
,
z
^
k
+
s
∣
k
(
L
) and fusion formula with scalar weights [8, 9], we obtain the decentralized multisensory fusion predictor for an NFS:(17)
z
^
k
+
s
∣
k
f
u
s
=
∑
i
=
1
L
a
k
+
s
i
z
^
k
+
s
∣
k
i
,
∑
i
=
1
L
a
k
+
s
i
=
1
,where the scalar weights a
k
+
s
(
i
)
∈
R are defined as(18)
a
k
+
s
=
1
L
T
P
~
z
,
k
+
s
-
1
1
L
T
P
~
z
,
k
+
s
-
1
1
L
,
1
L
=
1
⋯
1
T
∈
R
L
,
a
k
+
s
=
a
k
+
s
1
⋯
a
k
+
s
L
∈
R
L
,
P
~
z
,
k
+
s
=
t
r
P
z
,
k
+
s
∣
k
i
j
i
,
j
=
1
L
∈
R
L
×
L
,
where
P
z
,
k
+
s
∣
k
i
j
=
c
o
v
e
z
,
k
+
s
∣
k
i
,
e
z
,
k
+
s
∣
k
j
,
e
z
,
k
+
s
i
=
z
k
+
s
-
z
^
k
+
s
∣
k
i
,
i
,
j
=
1
,
…
,
L
.Remark 2.
Equations (17) and (18) require additional computations of the local cross-covariances P
z
,
k
+
s
∣
k
(
i
j
)
=
c
o
v
e
z
,
k
+
s
∣
k
(
i
)
,
e
z
,
k
+
s
∣
k
(
j
), which depend on the NFS z
k
+
s
=
f
x
k
+
s, the local Kalman covariances P
k
+
s
∣
k
(
i
i
)
=
c
o
v
e
k
+
s
∣
k
(
i
)
,
e
k
+
s
∣
k
(
i
) determined by the Riccati equations (9), and the local cross-covariances P
k
+
s
∣
k
(
i
j
)
=
c
o
v
e
k
+
s
∣
k
(
i
)
,
e
k
+
s
∣
k
(
j
), i
≠
j, which can be obtained by the Riccati-like recursive equations [14]:(19)
P
k
+
s
∣
k
i
j
=
Φ
k
+
s
,
k
P
k
∣
k
i
j
Φ
k
+
s
,
k
T
+
∑
h
=
0
s
-
1
Φ
k
+
s
,
k
+
h
+
1
Q
~
k
+
h
Φ
k
+
s
,
k
+
h
+
1
T
,
s
≥
0
,
i
≠
j
,
P
k
∣
k
i
j
=
I
n
-
K
k
i
H
k
i
F
k
-
1
P
k
-
1
∣
k
-
1
i
j
F
k
-
1
T
+
Q
~
k
-
1
I
n
-
K
k
j
H
k
j
T
,
P
0
∣
0
i
j
≡
P
0
,where Φ
k
,
l is the transition matrix and the filter gains K
k
(
i
), i
=
1
,
…
,
L, are determined by the local Kalman filter equations (14).In the following, we discuss effective computational algorithms for the evaluation of local nonlinear predictorsz
^
k
+
s
∣
k
(
i
) and cross-covariances P
z
,
k
+
s
∣
k
(
i
j
) in (15) and (18), respectively, depending on the type of NFS.


## 4.1. Local Kalman Predictors for the State Vector

At first, according to (1), we have L unconnected dynamical subsystems i
=
1
,
…
,
L with the common state x
k and local sensor y
k
(
i
) such that(12)
x
k
+
1
=
F
k
x
k
+
G
k
v
k
,
y
k
i
=
H
k
i
x
k
+
w
k
i
,where i is the index of the subsystem, i
=
1
,
…
,
L.Then, the optimal mean square local prediction estimatex
^
k
+
s
∣
k
(
i
)
=
E
x
k
+
s
∣
Y
[
1
:
k
]
(
i
), filtering estimate x
^
k
(
i
)
=
E
x
k
∣
Y
[
1
:
k
]
(
i
), and corresponding error covariances P
k
+
s
∣
k
(
i
i
) and P
k
(
i
i
) are determined by recursive Kalman equations [18, 19]. We have(13)
x
^
k
+
s
∣
k
i
=
F
k
+
s
-
1
x
^
k
+
s
-
1
∣
k
i
,
x
^
k
∣
k
i
≡
x
^
k
i
,
P
k
+
s
∣
k
i
i
=
F
k
+
s
-
1
P
k
+
s
-
1
∣
k
i
i
F
k
+
s
-
1
T
+
Q
~
k
+
s
-
1
,
P
k
∣
k
i
i
≡
P
k
i
i
,
Q
~
k
+
s
-
1
=
G
k
+
s
-
1
Q
k
+
s
-
1
G
k
+
s
-
1
T
,
s
=
1,2
,
…
,
(14)
x
^
k
+
1
i
=
F
k
x
^
k
i
+
K
k
+
1
i
y
k
+
1
i
-
H
k
+
1
i
F
k
x
^
k
i
,
x
^
0
i
=
x
-
0
,
P
k
+
1
i
i
-
=
F
k
P
k
i
i
F
k
T
+
G
k
Q
k
G
k
T
,
P
0
i
i
=
P
0
,
K
k
+
1
i
=
P
k
+
1
i
i
-
H
k
+
1
i
T
H
k
+
1
i
P
k
+
1
i
i
-
H
k
+
1
i
T
+
R
k
+
1
i
-
1
,
P
k
+
1
i
i
=
I
n
-
K
k
+
1
i
H
k
+
1
i
P
k
+
1
i
i
-
,
k
=
0,1
,
2
,
…
.Thus, we have L local Kalman estimates x
^
k
(
i
) and x
^
k
+
s
∣
k
(
i
)
, and their corresponding error covariances P
k
(
i
i
)
=
c
o
v
e
k
(
i
)
,
e
k
(
i
) and P
k
+
s
∣
k
(
i
i
)
=
c
o
v
e
k
+
s
∣
k
(
i
)
,
e
k
+
s
∣
k
(
i
), e
k
(
i
)
=
x
k
-
x
^
k
(
i
) and e
k
+
s
∣
k
(
i
)
=
x
k
+
s
-
x
^
k
+
s
∣
k
(
i
) for i
=
1
,
…
,
L.


## 4.2. Local Predictors for Nonlinear Function of the State Vector

Then, the optimal local mean square prediction of NFSz
k
+
s
=
f
x
k
+
s, based on the local sensor measurements Y
[
1
:
k
]
(
i
), represents a conditional mean (11); that is,(15)
z
^
k
+
s
∣
k
i
=
E
f
x
k
+
s
∣
Y
1
:
k
i
=
∫
f
x
k
+
s
p
x
k
+
s
∣
Y
1
:
k
i
d
x
k
+
s
,where p
x
k
+
s
∣
Y
[
1
:
k
]
(
i
) is a normal conditional probability density function, p
x
k
+
s
∣
Y
[
1
:
k
]
(
i
)
=
N
x
^
k
+
s
∣
k
(
i
)
,
P
k
+
s
∣
k
(
i
i
). Therefore, the optimal local estimate z
^
k
+
s
∣
k
(
i
) in (15) represents a nonlinear function of the local Kalman predictor and its error covariance; that is,(16)
z
^
k
+
s
∣
k
i
=
z
^
k
+
s
∣
k
i
x
^
k
+
s
∣
k
i
,
P
k
+
s
∣
k
i
i
,
i
=
1
,
…
,
L
.


## 4.3. Multisensory Prediction Fusion Algorithm

Using all optimal local nonlinear predictorsz
^
k
+
s
∣
k
(
1
)
,
…
,
z
^
k
+
s
∣
k
(
L
) and fusion formula with scalar weights [8, 9], we obtain the decentralized multisensory fusion predictor for an NFS:(17)
z
^
k
+
s
∣
k
f
u
s
=
∑
i
=
1
L
a
k
+
s
i
z
^
k
+
s
∣
k
i
,
∑
i
=
1
L
a
k
+
s
i
=
1
,where the scalar weights a
k
+
s
(
i
)
∈
R are defined as(18)
a
k
+
s
=
1
L
T
P
~
z
,
k
+
s
-
1
1
L
T
P
~
z
,
k
+
s
-
1
1
L
,
1
L
=
1
⋯
1
T
∈
R
L
,
a
k
+
s
=
a
k
+
s
1
⋯
a
k
+
s
L
∈
R
L
,
P
~
z
,
k
+
s
=
t
r
P
z
,
k
+
s
∣
k
i
j
i
,
j
=
1
L
∈
R
L
×
L
,
where
P
z
,
k
+
s
∣
k
i
j
=
c
o
v
e
z
,
k
+
s
∣
k
i
,
e
z
,
k
+
s
∣
k
j
,
e
z
,
k
+
s
i
=
z
k
+
s
-
z
^
k
+
s
∣
k
i
,
i
,
j
=
1
,
…
,
L
.Remark 2.
Equations (17) and (18) require additional computations of the local cross-covariances P
z
,
k
+
s
∣
k
(
i
j
)
=
c
o
v
e
z
,
k
+
s
∣
k
(
i
)
,
e
z
,
k
+
s
∣
k
(
j
), which depend on the NFS z
k
+
s
=
f
x
k
+
s, the local Kalman covariances P
k
+
s
∣
k
(
i
i
)
=
c
o
v
e
k
+
s
∣
k
(
i
)
,
e
k
+
s
∣
k
(
i
) determined by the Riccati equations (9), and the local cross-covariances P
k
+
s
∣
k
(
i
j
)
=
c
o
v
e
k
+
s
∣
k
(
i
)
,
e
k
+
s
∣
k
(
j
), i
≠
j, which can be obtained by the Riccati-like recursive equations [14]:(19)
P
k
+
s
∣
k
i
j
=
Φ
k
+
s
,
k
P
k
∣
k
i
j
Φ
k
+
s
,
k
T
+
∑
h
=
0
s
-
1
Φ
k
+
s
,
k
+
h
+
1
Q
~
k
+
h
Φ
k
+
s
,
k
+
h
+
1
T
,
s
≥
0
,
i
≠
j
,
P
k
∣
k
i
j
=
I
n
-
K
k
i
H
k
i
F
k
-
1
P
k
-
1
∣
k
-
1
i
j
F
k
-
1
T
+
Q
~
k
-
1
I
n
-
K
k
j
H
k
j
T
,
P
0
∣
0
i
j
≡
P
0
,where Φ
k
,
l is the transition matrix and the filter gains K
k
(
i
), i
=
1
,
…
,
L, are determined by the local Kalman filter equations (14).In the following, we discuss effective computational algorithms for the evaluation of local nonlinear predictorsz
^
k
+
s
∣
k
(
i
) and cross-covariances P
z
,
k
+
s
∣
k
(
i
j
) in (15) and (18), respectively, depending on the type of NFS.


## 5. Calculation of Fusion Predictor for Nonlinear Functions of the State

### 5.1. Multivariate Polynomial Functions

First, we consider an arbitrary multivariate polynomial function of the form(20)
z
=
f
x
=
∑
0
≤
i
1
+
⋯
+
i
n
≤
n
D
i
1
i
2
⋯
i
n
x
1
i
1
x
2
i
2
⋯
x
n
i
n
,
i
1
,
…
,
i
n
≥
0
.In this case, the proposed algorithm for the calculation of fusion predictors z
^
k
+
s
∣
k
o
p
t and z
^
k
+
s
∣
k
f
u
s has a closed-form because conditional expectations E
f
x
k
+
s
∣
Y
[
1
:
k
] and E
f
x
k
+
s
∣
Y
[
1
:
k
]
(
i
) depend on high-order moments m
^
h
1
h
2
⋯
h
n
(
i
)
≡
E
x
1
h
1
x
2
h
2
⋯
x
n
h
n
∣
Y
[
1
:
k
]
(
i
) and m
h
1
h
2
⋯
h
n
≡
E
x
1
h
1
x
2
h
2
⋯
x
n
h
n of a multivariate normal distribution, which can be calculated explicitly in terms of first- and second-order moments x
^
k
+
s
∣
k
(
i
) and P
k
+
s
∣
k
(
i
j
), i, j
=
1
,
…
,
L, using recursive formulas [20–22]. The following example illustrates the idea.Consider an arbitrary quadratic cost function(21)
z
k
+
s
=
f
x
k
+
s
=
x
k
+
s
T
Ω
x
k
+
s
,
Ω
T
=
Ω
,
Ω
>
0
.Show that optimal local nonlinear predictor (15) can be calculated explicitly in terms of a local Kalman predictor and its error covariance. Using formula E
x
T
Ω
x
=
t
r
Ω
P
+
m
m
T, m
=
E
x, P
=
c
o
v
x
,
x [21], we obtain an optimal local predictor for the quadratic function(22)
z
^
k
+
s
∣
k
i
=
E
x
k
+
s
T
Ω
x
k
+
s
∣
Y
1
:
k
i
=
t
r
Ω
P
k
+
s
∣
k
i
+
x
^
k
+
s
∣
k
i
x
^
k
+
s
∣
k
i
T
,where the local Kalman predictor and error covariance x
^
k
+
s
∣
k
(
i
)
,
P
k
+
s
∣
k
(
i
i
) satisfy (13) and (14).In a special case of a polynomial NFS (20), the local cross-covariances P
z
,
k
+
s
∣
k
(
i
j
)
=
c
o
v
e
z
,
k
+
s
∣
k
(
i
)
,
e
z
,
k
+
s
∣
k
(
j
) in (18) are also calculated for a multivariate normal distribution of composite random vector U
k
+
s
(
i
j
)
T
=
[
x
k
+
s
T
x
^
k
+
s
∣
k
(
i
)
T
x
^
k
+
s
∣
k
(
j
)
T
] via the recursive formulas [20–22].


### 5.2. General Nonlinear Function and Unscented Transformation

The unscented transformation (UT) makes it much easier to calculate statistics of the transformed random variable, for example, the mean and covariance [23, 24]. The UT has become a powerful approach for designing new filtering and control algorithms for nonlinear dynamic models [23–26]. Following this, the UT procedure to calculate the best local predictor of an NFS (conditional mean)(23)
z
^
k
+
s
∣
k
i
=
E
f
x
k
+
s
∣
Y
1
:
k
ican be summarised as follows.Generate the sigma pointsU
h
,
k
+
s
h
=
0
2
n with corresponding weights W
h
h
=
0
2
n:(24)
U
0
,
k
+
s
i
=
x
^
k
+
s
∣
k
i
,
W
0
=
l
n
+
l
,
U
h
,
k
+
s
i
=
x
^
k
+
s
∣
k
i
+
n
+
l
P
k
+
s
∣
k
i
i
h
,
W
h
=
1
2
n
+
l
,
h
=
1
,
…
,
n
,
U
h
+
n
,
k
+
s
i
=
x
^
k
+
s
∣
k
i
-
n
+
l
P
k
+
s
∣
k
i
i
h
,
W
h
+
n
=
1
2
n
+
l
,where P
k
+
s
∣
k
(
i
i
)
h is the hth column of the matrix square root of P
k
+
s
∣
k
(
i
i
) and l is the scaling parameter influencing the spread of points in the state-space and, thus, the accuracy of the approximation [26]. Propagate each of these sigma points through the original nonlinear function as(25)
ξ
h
,
k
+
s
i
=
f
U
h
,
k
+
s
i
,
h
=
0,1
,
…
,
2
nand the resulting best local estimate of the NFS is given as(26)
z
^
k
+
s
∣
k
i
=
∑
h
=
0
2
n
W
h
ξ
h
,
k
+
s
i
,
i
=
1
,
…
,
L
.Similar to (23)–(26), the local cross-covariance P
z
,
k
+
s
∣
k
(
i
j
) also can be calculated based on the UT:(27)
P
z
,
k
+
s
∣
k
i
j
=
∑
h
=
0
2
n
W
h
ξ
h
,
k
+
s
i
-
z
^
k
+
s
∣
k
ξ
h
,
k
+
s
j
-
z
^
k
+
s
∣
k
T
.Therefore, z
^
k
+
s
∣
k
(
i
) and P
z
,
k
+
s
∣
k
(
i
j
) are represented by the known functions of the local Kalman predictors x
^
k
+
s
∣
k
(
i
) and covariances P
k
+
s
∣
k
(
i
i
), i
,
j
=
1
,
…
,
L.


### 5.3. Discussion

(1)
The local covariancesP
k
+
s
∣
k
(
i
j
) and P
z
,
k
+
s
∣
k
(
i
j
) and weights a
k
+
s
(
i
) can be precomputed, because they do not depend on the sensor measurements y
k
(
i
), i
=
1
,
…
,
L, but only on the noise statistics Q
k and R
k
(
i
), the system matrices F
k, G
k, and H
k
(
i
), and the initial conditions x
-
0 and P
0, which are the part of system models (1) and (2). Thus, once the measurement schedule has been settled, the real-time implementation of the fusion estimators requires only the computation of the local predictors x
^
k
+
s
∣
k
(
i
) and z
^
k
+
s
∣
k
(
i
) and the final fusion predictor z
^
k
+
s
∣
k
f
u
s
.
(2)
The implementation of the decentralized predictor consists of two stages:offline andonline. The offline stage is more complex than the online stage. This is because it requires the computation of the local covariances P
z
,
k
+
s
∣
k
(
i
j
) and the fusion weights a
k
+
s
(
i
) which depend on NFS z
k
+
s
=
f
x
k
+
s
. However, it is not essential, because this stage can be precomputed. The online stage (real-time implementation) requires the computation of only the local and fusion estimates (predictors). To compute z
^
k
+
s
∣
k
o
p
t, the centralized predictor requires all sensor measurements together at each time instant k
=
1,2
,
…, whereas the decentralized predictor computes z
^
k
+
s
∣
k
f
u
s sequentially.To demonstrate the performance of the proposed centralized and decentralized predictors, they will be evaluated in the next section for the theoretical example originating from [7].


## 5.1. Multivariate Polynomial Functions

First, we consider an arbitrary multivariate polynomial function of the form(20)
z
=
f
x
=
∑
0
≤
i
1
+
⋯
+
i
n
≤
n
D
i
1
i
2
⋯
i
n
x
1
i
1
x
2
i
2
⋯
x
n
i
n
,
i
1
,
…
,
i
n
≥
0
.In this case, the proposed algorithm for the calculation of fusion predictors z
^
k
+
s
∣
k
o
p
t and z
^
k
+
s
∣
k
f
u
s has a closed-form because conditional expectations E
f
x
k
+
s
∣
Y
[
1
:
k
] and E
f
x
k
+
s
∣
Y
[
1
:
k
]
(
i
) depend on high-order moments m
^
h
1
h
2
⋯
h
n
(
i
)
≡
E
x
1
h
1
x
2
h
2
⋯
x
n
h
n
∣
Y
[
1
:
k
]
(
i
) and m
h
1
h
2
⋯
h
n
≡
E
x
1
h
1
x
2
h
2
⋯
x
n
h
n of a multivariate normal distribution, which can be calculated explicitly in terms of first- and second-order moments x
^
k
+
s
∣
k
(
i
) and P
k
+
s
∣
k
(
i
j
), i, j
=
1
,
…
,
L, using recursive formulas [20–22]. The following example illustrates the idea.Consider an arbitrary quadratic cost function(21)
z
k
+
s
=
f
x
k
+
s
=
x
k
+
s
T
Ω
x
k
+
s
,
Ω
T
=
Ω
,
Ω
>
0
.Show that optimal local nonlinear predictor (15) can be calculated explicitly in terms of a local Kalman predictor and its error covariance. Using formula E
x
T
Ω
x
=
t
r
Ω
P
+
m
m
T, m
=
E
x, P
=
c
o
v
x
,
x [21], we obtain an optimal local predictor for the quadratic function(22)
z
^
k
+
s
∣
k
i
=
E
x
k
+
s
T
Ω
x
k
+
s
∣
Y
1
:
k
i
=
t
r
Ω
P
k
+
s
∣
k
i
+
x
^
k
+
s
∣
k
i
x
^
k
+
s
∣
k
i
T
,where the local Kalman predictor and error covariance x
^
k
+
s
∣
k
(
i
)
,
P
k
+
s
∣
k
(
i
i
) satisfy (13) and (14).In a special case of a polynomial NFS (20), the local cross-covariances P
z
,
k
+
s
∣
k
(
i
j
)
=
c
o
v
e
z
,
k
+
s
∣
k
(
i
)
,
e
z
,
k
+
s
∣
k
(
j
) in (18) are also calculated for a multivariate normal distribution of composite random vector U
k
+
s
(
i
j
)
T
=
[
x
k
+
s
T
x
^
k
+
s
∣
k
(
i
)
T
x
^
k
+
s
∣
k
(
j
)
T
] via the recursive formulas [20–22].


## 5.2. General Nonlinear Function and Unscented Transformation

The unscented transformation (UT) makes it much easier to calculate statistics of the transformed random variable, for example, the mean and covariance [23, 24]. The UT has become a powerful approach for designing new filtering and control algorithms for nonlinear dynamic models [23–26]. Following this, the UT procedure to calculate the best local predictor of an NFS (conditional mean)(23)
z
^
k
+
s
∣
k
i
=
E
f
x
k
+
s
∣
Y
1
:
k
ican be summarised as follows.Generate the sigma pointsU
h
,
k
+
s
h
=
0
2
n with corresponding weights W
h
h
=
0
2
n:(24)
U
0
,
k
+
s
i
=
x
^
k
+
s
∣
k
i
,
W
0
=
l
n
+
l
,
U
h
,
k
+
s
i
=
x
^
k
+
s
∣
k
i
+
n
+
l
P
k
+
s
∣
k
i
i
h
,
W
h
=
1
2
n
+
l
,
h
=
1
,
…
,
n
,
U
h
+
n
,
k
+
s
i
=
x
^
k
+
s
∣
k
i
-
n
+
l
P
k
+
s
∣
k
i
i
h
,
W
h
+
n
=
1
2
n
+
l
,where P
k
+
s
∣
k
(
i
i
)
h is the hth column of the matrix square root of P
k
+
s
∣
k
(
i
i
) and l is the scaling parameter influencing the spread of points in the state-space and, thus, the accuracy of the approximation [26]. Propagate each of these sigma points through the original nonlinear function as(25)
ξ
h
,
k
+
s
i
=
f
U
h
,
k
+
s
i
,
h
=
0,1
,
…
,
2
nand the resulting best local estimate of the NFS is given as(26)
z
^
k
+
s
∣
k
i
=
∑
h
=
0
2
n
W
h
ξ
h
,
k
+
s
i
,
i
=
1
,
…
,
L
.Similar to (23)–(26), the local cross-covariance P
z
,
k
+
s
∣
k
(
i
j
) also can be calculated based on the UT:(27)
P
z
,
k
+
s
∣
k
i
j
=
∑
h
=
0
2
n
W
h
ξ
h
,
k
+
s
i
-
z
^
k
+
s
∣
k
ξ
h
,
k
+
s
j
-
z
^
k
+
s
∣
k
T
.Therefore, z
^
k
+
s
∣
k
(
i
) and P
z
,
k
+
s
∣
k
(
i
j
) are represented by the known functions of the local Kalman predictors x
^
k
+
s
∣
k
(
i
) and covariances P
k
+
s
∣
k
(
i
i
), i
,
j
=
1
,
…
,
L.


## 5.3. Discussion

(1)
The local covariancesP
k
+
s
∣
k
(
i
j
) and P
z
,
k
+
s
∣
k
(
i
j
) and weights a
k
+
s
(
i
) can be precomputed, because they do not depend on the sensor measurements y
k
(
i
), i
=
1
,
…
,
L, but only on the noise statistics Q
k and R
k
(
i
), the system matrices F
k, G
k, and H
k
(
i
), and the initial conditions x
-
0 and P
0, which are the part of system models (1) and (2). Thus, once the measurement schedule has been settled, the real-time implementation of the fusion estimators requires only the computation of the local predictors x
^
k
+
s
∣
k
(
i
) and z
^
k
+
s
∣
k
(
i
) and the final fusion predictor z
^
k
+
s
∣
k
f
u
s
.
(2)
The implementation of the decentralized predictor consists of two stages:offline andonline. The offline stage is more complex than the online stage. This is because it requires the computation of the local covariances P
z
,
k
+
s
∣
k
(
i
j
) and the fusion weights a
k
+
s
(
i
) which depend on NFS z
k
+
s
=
f
x
k
+
s
. However, it is not essential, because this stage can be precomputed. The online stage (real-time implementation) requires the computation of only the local and fusion estimates (predictors). To compute z
^
k
+
s
∣
k
o
p
t, the centralized predictor requires all sensor measurements together at each time instant k
=
1,2
,
…, whereas the decentralized predictor computes z
^
k
+
s
∣
k
f
u
s sequentially.To demonstrate the performance of the proposed centralized and decentralized predictors, they will be evaluated in the next section for the theoretical example originating from [7].


## 6. Theoretical Comparison of Estimation Accuracy

Consider a simple example of an application of the obtained results. We predict the quadratic functionz
=
θ
2 of a random constant θ
~
N
0
,
σ
θ
2, given two single measurements y
(
1
) and y
(
2
) of θ corrupted by Gaussian white noises ε
(
1
) and ε
(
2
), respectively. The system and measurement equations describing this situation are(28)
System:
θ
s
+
1
=
θ
s
,
θ
s
≡
θ
,
s
=
0,1
,
2
,
…
Sensor 1:
y
1
=
θ
+
ε
1
,
ε
1
~
N
0
,
r
1
Sensor 2:
y
2
=
θ
+
ε
2
,
ε
2
~
N
0
,
r
2
.Here, we derive precise formula for the MSE for the proposed fusion estimators and demonstrate a comparative analysis.


### 6.1. Centralized Optimal Estimator for Quadratic Function

In this case,L
=
2, k
=
1, and s
=
1,2
,
…. Using (22) at Ω
=
1, the optimal centralized estimator z
^
k
+
s
∣
k
o
p
t
=
z
^
1
+
s
∣
1
o
p
t
≡
z
^
s
o
p
t of the quadratic function z
s
=
θ
s
2
≡
θ
2 takes the form(29)
z
^
s
o
p
t
=
E
θ
s
2
∣
y
1
,
y
2
=
∫
θ
s
2
N
θ
^
s
C
K
P
,
P
s
C
K
P
d
θ
s
=
P
s
C
K
P
+
θ
^
s
C
K
P
2
,
s
≥
1
,where θ
^
s
C
K
P
=
E
θ
s
∣
y
(
1
)
,
y
(
2
), s
≥
1, is the centralized Kalman estimator (the best global MMSE estimate) of an unknown constant state θ
s
≡
θ based on the two single sensor measurements Y
T
=
[
y
(
1
)
y
(
2
)
] and P
s
C
K
P
=
E
θ
s
-
θ
^
s
C
K
P
2 is its centralized error variance such that [7](30)
θ
^
1
C
K
P
=
r
2
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
y
1
+
r
1
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
y
2
,
P
1
C
K
P
=
r
1
r
2
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
,
θ
^
s
C
K
P
=
θ
^
1
C
K
P
,
P
s
C
K
P
=
P
1
C
K
P
for
s
>
1
.Thus, (28) and (29) represent the exact formulas for the centralized fusion estimator of the quadratic function z
s
=
θ
2. The error between the unknown θ
2 and the centralized estimator z
^
s
o
p
t
=
P
s
C
K
P
+
θ
^
s
C
K
P
2 can be measured in terms of the MSE P
s
o
p
t
=
E
θ
2
-
z
^
s
o
p
t
2, s
≥
1. Using the result that the 4th-order moment μ
4
=
E
θ
4 of a normal random variable θ
~
N
0
,
σ
θ
2 is equal to μ
4
=
3
σ
θ
4, we obtain(31)
P
s
o
p
t
=
3
1
-
ρ
2
2
σ
θ
4
+
P
s
C
K
P
2
+
2
3
ρ
2
-
1
σ
θ
2
d
+
3
d
2
-
2
1
-
ρ
2
P
s
C
K
P
σ
θ
2
+
2
P
s
C
K
P
d
,
s
≥
1
,
where
ρ
=
W
1
+
W
2
,
d
=
W
1
2
r
1
+
W
2
2
r
2
,
W
1
=
r
2
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
,
W
2
=
r
1
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
.Together with the centralized estimator (29), we apply the decentralized fusion estimator developed in Section 4.


### 6.2. Decentralized Fusion Estimator for Quadratic Function

The local MMSE estimatorθ
^
s
(
i
)
=
E
θ
s
∣
y
(
i
), s
≥
1, of the unknown θ
s
≡
θ based on the single measurement y
(
i
), the corresponding error variances P
s
(
i
i
)
=
E
θ
-
θ
^
s
(
i
)
2, and the cross-covariance P
s
(
12
)
=
E
θ
-
θ
^
s
(
1
)
θ
-
θ
^
s
(
2
) take the following forms [7]:(32)
θ
^
1
i
=
σ
θ
2
r
i
+
σ
θ
2
y
i
,
P
1
i
i
=
r
i
σ
θ
2
r
i
+
σ
θ
2
,
P
1
12
=
r
1
r
2
σ
θ
2
r
1
+
σ
θ
2
r
2
+
σ
θ
2
,
θ
^
s
i
=
θ
^
1
i
,
P
s
i
i
=
P
1
i
i
,
P
s
12
=
P
1
12
,
i
=
1,2
,
s
>
1
.Next the first stage gives two optimal local nonlinear estimators of the quadratic function z
s
=
θ
2:(33)
z
^
s
i
=
E
θ
2
∣
y
i
=
∫
θ
2
N
θ
^
s
i
,
P
s
i
i
d
θ
=
P
s
i
i
+
θ
^
s
i
2
,
i
=
1,2
;
s
≥
1
,where θ
^
s
(
i
) and P
s
(
i
i
) are calculated by (32).In the second stage, using fusion formula (17), we obtain(34)
z
^
s
f
u
s
=
a
s
1
z
^
s
1
+
a
s
2
z
^
s
2
,
a
s
1
+
a
s
2
=
1
,
s
=
1,2
,
…
,
where
a
s
1
=
P
z
,
s
22
-
P
z
,
s
12
P
z
,
s
11
-
2
P
z
,
s
12
+
P
z
,
s
22
,
a
s
2
=
P
z
,
s
11
-
P
z
,
s
12
P
z
,
s
11
-
2
P
z
,
s
12
+
P
z
,
s
22
,
P
z
,
s
i
j
≡
E
z
s
-
z
^
s
i
z
s
-
z
^
s
j
,
z
s
=
θ
2
,
i
,
j
=
1,2
.Calculating the cross-covariances P
z
,
s
(
i
j
), i
,
j
=
1,2, using the formulas for high-order moments of a normal distribution, we get(35)
P
z
,
1
i
i
=
3
1
-
ω
i
2
2
σ
θ
4
+
2
3
ω
i
2
-
1
ω
i
2
σ
θ
2
r
i
+
3
ω
i
4
r
i
2
,
ω
i
=
σ
θ
2
r
i
+
σ
θ
2
,
P
z
,
1
12
=
3
1
-
ω
1
2
1
-
ω
2
2
σ
θ
4
-
ω
1
2
1
-
ω
2
2
σ
θ
2
r
1
-
ω
2
2
1
-
ω
1
2
σ
θ
2
r
2
+
ω
1
2
ω
2
2
r
1
r
2
,
P
z
,
s
i
j
=
P
z
,
1
i
j
,
i
=
1,2
;
s
>
1
.Then, the overall MSE P
s
f
u
s
=
E
θ
2
-
z
^
s
f
u
s
2 can be evaluated as(36)
P
s
f
u
s
=
a
s
1
2
P
z
,
s
11
+
a
s
2
2
P
z
,
s
22
+
2
a
s
1
a
s
2
P
z
,
s
12
,
s
=
1,2
,
…
,
where
P
z
,
s
i
i
=
3
1
-
ω
i
2
2
σ
θ
4
+
P
s
i
i
+
2
3
ω
i
2
-
1
ω
i
2
σ
θ
2
r
i
+
3
ω
i
4
r
i
2
-
2
1
-
ω
i
2
σ
θ
2
P
s
i
i
+
2
ω
i
2
r
i
P
s
i
i
,
i
=
1,2
,
P
z
,
s
12
=
3
1
-
ω
1
2
1
-
ω
2
2
σ
θ
4
-
ω
1
2
1
-
ω
2
2
σ
θ
2
r
1
-
ω
2
2
1
-
ω
1
2
σ
θ
2
r
2
+
P
s
11
P
s
22
-
1
-
ω
2
2
σ
θ
2
P
s
11
-
1
-
ω
1
2
σ
θ
2
P
s
22
+
ω
2
2
r
2
P
s
11
+
ω
1
2
r
1
P
s
22
+
ω
1
2
ω
2
2
r
1
r
2
.


### 6.3. Comparative Analysis of Estimators

The MSE is an important value that can be used to reflect the accuracy of state estimation. Table1 illustrates the exact values of the MSEs for the centralized P
s
o
p
t
=
P
1
o
p
t, s
≥
1 (see (31)), and decentralized P
s
f
u
s
=
P
1
f
u
s, s
≥
1, estimators (see (32)–(36)) for the different model parameters σ
θ
2, r
1, and r
2
. Table 1 shows the relative errors for the decentralized estimator with respect to the global optimal centralized estimator, Δ
s
=
P
s
f
u
s
-
P
s
o
p
t
/
P
s
o
p
t
×
100
%.Table 1
Comparison of MSEs and relative errors.
Model parameters
MSE
Relative error
P
s
fus
⁡
P
s
opt
Δ
s
σ
θ
2
=
4;  r
1
=
1; r
2
=
1
7.833
6.716
16.6%
σ
θ
2
=
10; r
1
=
1; r
2
=
1
20.36
18.59
9.5%
σ
θ
2
=
4; r
1
=
0.1; r
2
=
0.3
1.214
1.167
4.0%
σ
θ
2
=
4; r
1
=
0.1; r
2
=
1.0
1.460
1.406
3.8%
σ
θ
2
=
1; r
1
=
1; r
2
=
1
1.312
1.111
18%
σ
θ
2
=
1; r
1
=
2; r
2
=
4
1.760
1.632
7.8%Not surprisingly, Table1 illustrates that the centralized estimator P
s
o
p
t exhibits a performance that is completely superior to the decentralized estimator P
s
f
u
s. Thus, the theoretical relation P
s
o
p
t
<
P
s
f
u
s between the two estimators z
^
s
o
p
t and z
^
s
f
u
s is obvious.


## 6.1. Centralized Optimal Estimator for Quadratic Function

In this case,L
=
2, k
=
1, and s
=
1,2
,
…. Using (22) at Ω
=
1, the optimal centralized estimator z
^
k
+
s
∣
k
o
p
t
=
z
^
1
+
s
∣
1
o
p
t
≡
z
^
s
o
p
t of the quadratic function z
s
=
θ
s
2
≡
θ
2 takes the form(29)
z
^
s
o
p
t
=
E
θ
s
2
∣
y
1
,
y
2
=
∫
θ
s
2
N
θ
^
s
C
K
P
,
P
s
C
K
P
d
θ
s
=
P
s
C
K
P
+
θ
^
s
C
K
P
2
,
s
≥
1
,where θ
^
s
C
K
P
=
E
θ
s
∣
y
(
1
)
,
y
(
2
), s
≥
1, is the centralized Kalman estimator (the best global MMSE estimate) of an unknown constant state θ
s
≡
θ based on the two single sensor measurements Y
T
=
[
y
(
1
)
y
(
2
)
] and P
s
C
K
P
=
E
θ
s
-
θ
^
s
C
K
P
2 is its centralized error variance such that [7](30)
θ
^
1
C
K
P
=
r
2
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
y
1
+
r
1
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
y
2
,
P
1
C
K
P
=
r
1
r
2
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
,
θ
^
s
C
K
P
=
θ
^
1
C
K
P
,
P
s
C
K
P
=
P
1
C
K
P
for
s
>
1
.Thus, (28) and (29) represent the exact formulas for the centralized fusion estimator of the quadratic function z
s
=
θ
2. The error between the unknown θ
2 and the centralized estimator z
^
s
o
p
t
=
P
s
C
K
P
+
θ
^
s
C
K
P
2 can be measured in terms of the MSE P
s
o
p
t
=
E
θ
2
-
z
^
s
o
p
t
2, s
≥
1. Using the result that the 4th-order moment μ
4
=
E
θ
4 of a normal random variable θ
~
N
0
,
σ
θ
2 is equal to μ
4
=
3
σ
θ
4, we obtain(31)
P
s
o
p
t
=
3
1
-
ρ
2
2
σ
θ
4
+
P
s
C
K
P
2
+
2
3
ρ
2
-
1
σ
θ
2
d
+
3
d
2
-
2
1
-
ρ
2
P
s
C
K
P
σ
θ
2
+
2
P
s
C
K
P
d
,
s
≥
1
,
where
ρ
=
W
1
+
W
2
,
d
=
W
1
2
r
1
+
W
2
2
r
2
,
W
1
=
r
2
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
,
W
2
=
r
1
σ
θ
2
r
1
r
2
+
r
1
+
r
2
σ
θ
2
.Together with the centralized estimator (29), we apply the decentralized fusion estimator developed in Section 4.


## 6.2. Decentralized Fusion Estimator for Quadratic Function

The local MMSE estimatorθ
^
s
(
i
)
=
E
θ
s
∣
y
(
i
), s
≥
1, of the unknown θ
s
≡
θ based on the single measurement y
(
i
), the corresponding error variances P
s
(
i
i
)
=
E
θ
-
θ
^
s
(
i
)
2, and the cross-covariance P
s
(
12
)
=
E
θ
-
θ
^
s
(
1
)
θ
-
θ
^
s
(
2
) take the following forms [7]:(32)
θ
^
1
i
=
σ
θ
2
r
i
+
σ
θ
2
y
i
,
P
1
i
i
=
r
i
σ
θ
2
r
i
+
σ
θ
2
,
P
1
12
=
r
1
r
2
σ
θ
2
r
1
+
σ
θ
2
r
2
+
σ
θ
2
,
θ
^
s
i
=
θ
^
1
i
,
P
s
i
i
=
P
1
i
i
,
P
s
12
=
P
1
12
,
i
=
1,2
,
s
>
1
.Next the first stage gives two optimal local nonlinear estimators of the quadratic function z
s
=
θ
2:(33)
z
^
s
i
=
E
θ
2
∣
y
i
=
∫
θ
2
N
θ
^
s
i
,
P
s
i
i
d
θ
=
P
s
i
i
+
θ
^
s
i
2
,
i
=
1,2
;
s
≥
1
,where θ
^
s
(
i
) and P
s
(
i
i
) are calculated by (32).In the second stage, using fusion formula (17), we obtain(34)
z
^
s
f
u
s
=
a
s
1
z
^
s
1
+
a
s
2
z
^
s
2
,
a
s
1
+
a
s
2
=
1
,
s
=
1,2
,
…
,
where
a
s
1
=
P
z
,
s
22
-
P
z
,
s
12
P
z
,
s
11
-
2
P
z
,
s
12
+
P
z
,
s
22
,
a
s
2
=
P
z
,
s
11
-
P
z
,
s
12
P
z
,
s
11
-
2
P
z
,
s
12
+
P
z
,
s
22
,
P
z
,
s
i
j
≡
E
z
s
-
z
^
s
i
z
s
-
z
^
s
j
,
z
s
=
θ
2
,
i
,
j
=
1,2
.Calculating the cross-covariances P
z
,
s
(
i
j
), i
,
j
=
1,2, using the formulas for high-order moments of a normal distribution, we get(35)
P
z
,
1
i
i
=
3
1
-
ω
i
2
2
σ
θ
4
+
2
3
ω
i
2
-
1
ω
i
2
σ
θ
2
r
i
+
3
ω
i
4
r
i
2
,
ω
i
=
σ
θ
2
r
i
+
σ
θ
2
,
P
z
,
1
12
=
3
1
-
ω
1
2
1
-
ω
2
2
σ
θ
4
-
ω
1
2
1
-
ω
2
2
σ
θ
2
r
1
-
ω
2
2
1
-
ω
1
2
σ
θ
2
r
2
+
ω
1
2
ω
2
2
r
1
r
2
,
P
z
,
s
i
j
=
P
z
,
1
i
j
,
i
=
1,2
;
s
>
1
.Then, the overall MSE P
s
f
u
s
=
E
θ
2
-
z
^
s
f
u
s
2 can be evaluated as(36)
P
s
f
u
s
=
a
s
1
2
P
z
,
s
11
+
a
s
2
2
P
z
,
s
22
+
2
a
s
1
a
s
2
P
z
,
s
12
,
s
=
1,2
,
…
,
where
P
z
,
s
i
i
=
3
1
-
ω
i
2
2
σ
θ
4
+
P
s
i
i
+
2
3
ω
i
2
-
1
ω
i
2
σ
θ
2
r
i
+
3
ω
i
4
r
i
2
-
2
1
-
ω
i
2
σ
θ
2
P
s
i
i
+
2
ω
i
2
r
i
P
s
i
i
,
i
=
1,2
,
P
z
,
s
12
=
3
1
-
ω
1
2
1
-
ω
2
2
σ
θ
4
-
ω
1
2
1
-
ω
2
2
σ
θ
2
r
1
-
ω
2
2
1
-
ω
1
2
σ
θ
2
r
2
+
P
s
11
P
s
22
-
1
-
ω
2
2
σ
θ
2
P
s
11
-
1
-
ω
1
2
σ
θ
2
P
s
22
+
ω
2
2
r
2
P
s
11
+
ω
1
2
r
1
P
s
22
+
ω
1
2
ω
2
2
r
1
r
2
.


## 6.3. Comparative Analysis of Estimators

The MSE is an important value that can be used to reflect the accuracy of state estimation. Table1 illustrates the exact values of the MSEs for the centralized P
s
o
p
t
=
P
1
o
p
t, s
≥
1 (see (31)), and decentralized P
s
f
u
s
=
P
1
f
u
s, s
≥
1, estimators (see (32)–(36)) for the different model parameters σ
θ
2, r
1, and r
2
. Table 1 shows the relative errors for the decentralized estimator with respect to the global optimal centralized estimator, Δ
s
=
P
s
f
u
s
-
P
s
o
p
t
/
P
s
o
p
t
×
100
%.Table 1
Comparison of MSEs and relative errors.
Model parameters
MSE
Relative error
P
s
fus
⁡
P
s
opt
Δ
s
σ
θ
2
=
4;  r
1
=
1; r
2
=
1
7.833
6.716
16.6%
σ
θ
2
=
10; r
1
=
1; r
2
=
1
20.36
18.59
9.5%
σ
θ
2
=
4; r
1
=
0.1; r
2
=
0.3
1.214
1.167
4.0%
σ
θ
2
=
4; r
1
=
0.1; r
2
=
1.0
1.460
1.406
3.8%
σ
θ
2
=
1; r
1
=
1; r
2
=
1
1.312
1.111
18%
σ
θ
2
=
1; r
1
=
2; r
2
=
4
1.760
1.632
7.8%Not surprisingly, Table1 illustrates that the centralized estimator P
s
o
p
t exhibits a performance that is completely superior to the decentralized estimator P
s
f
u
s. Thus, the theoretical relation P
s
o
p
t
<
P
s
f
u
s between the two estimators z
^
s
o
p
t and z
^
s
f
u
s is obvious.


## 7. Experimental Analysis of Fusion Predictors

A comparative experimental analysis of the proposed predictors is considered in an example of the prediction of the instantaneous impact point (IIP) of a space launch vehicle (SLV). In the space rocket launch, a precise and real-time prediction of the IIP plays an important role for the range safety operations. Hence, online IIP prediction is carried out during rocket launch to follow the expected touch down point for a rocket body.The dynamic model of a SLV, in general, varies from linear model to nonlinear model. Typical nonlinear model considers comprehensive factors such as thrust, gravity, drag coefficient, March number, and air density [27]. Although the nonlinear model precisely describes a motion of SLV, it needs complex prior information concerning a SLV flight environment. In case of the linear dynamic model, on the other hand, a constant acceleration (CA) model with multiple hypotheses which takes advantage of Singer’s model [28] is introduced in [29]. In [29], to describe motion of a sounding rocket using the CA model, the rocket motion is separated into two parts, propelled flight and free fall flight phase by utilizing empirically tuned, independent probability density function. This multiple model approach is suitable for the sounding rocket which has relatively short propelled flight phase with large free fall flight phase. In contrast, most of the SLV flight phases fall into the propelled flight. Therefore, for simplicity, we can reduce the dynamic model of the SLV to a CA model. To apply the proposed algorithm for prediction of IIP, a discretized CA model for motion of SLV takes the following form:(37)
X
k
+
1
=
F
k
X
k
+
w
k
,
X
k
=
x
p
,
k
x
υ
,
k
x
a
,
k
y
p
,
k
y
υ
,
k
y
a
,
k
z
p
,
k
z
υ
,
k
z
a
,
k
T
,
w
k
=
w
p
x
,
k
w
υ
x
,
k
w
a
x
,
k
w
p
y
,
k
w
υ
y
,
k
w
a
y
,
k
w
p
z
,
k
w
υ
z
,
k
w
a
z
,
k
T
,where the state vector X
k
∈
R
9 consists of the position, velocity, and acceleration components along the x-axis, y-axis, and z-axis, respectively, F
k
∈
R
9
×
9 is the system matrix, and w
k
∈
R
9 is the white Gaussian noise, w
k
~
N
0
,
Q
k:(38)
F
k
=
1
Δ
t
Δ
t
2
2
0
0
0
0
0
0
0
1
Δ
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
1
Δ
t
Δ
t
2
2
0
0
0
0
0
0
0
1
Δ
t
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
Δ
t
Δ
t
2
2
0
0
0
0
0
0
0
1
Δ
t
0
0
0
0
0
0
0
0
1
,
Q
k
=
σ
2
Q
x
0
3
×
3
0
3
×
3
0
3
×
3
Q
y
0
3
×
3
0
3
×
3
0
3
×
3
Q
z
,
Q
x
=
Q
y
=
Q
z
=
Δ
t
5
20
Δ
t
4
8
Δ
t
2
6
Δ
t
4
8
Δ
t
3
3
Δ
t
2
2
Δ
t
3
6
Δ
t
2
2
Δ
t
,where Δ
t is the discretization interval.Next radar sensor observes the range (ρ), azimuth (φ), and elevation (θ) of the SLV. In general, due to reliability reason of the SLV, tracking system uses multiple radar to cover large trajectory. Let us assume that L radars simultaneously observe trajectory of the SLV within joint radar coverage. Then, the nonlinear multisensory measurement equations are given by(39)
Z
k
i
=
h
X
k
+
v
s
,
k
i
,
Z
k
i
∈
R
3
,
v
s
,
k
i
∈
R
3
,
i
=
1
,
…
,
L
,
or
Z
k
i
=
ρ
m
,
k
i
φ
m
,
k
i
θ
m
,
k
i
=
x
p
,
k
2
+
y
p
,
k
2
+
z
p
,
k
2
t
a
n
-
1
y
p
,
k
x
p
,
k
t
a
n
-
1
y
p
,
k
x
p
,
k
2
+
y
p
,
k
2
+
v
ρ
i
v
φ
i
v
θ
i
,where v
s
,
k
(
i
)
~
N
0
,
R
s
,
k
(
i
), R
s
,
k
(
i
)
=
diag
⁡
[
σ
ρ
2
σ
φ
2
σ
θ
2
], and i is index of radar (i
=
1
,
…
,
L).Using 3D debiased converted measurement form [30], we can transform the original nonlinear equations (39) into linear form as(40)
Z
k
i
=
H
k
X
k
+
v
c
,
k
i
,
v
c
,
k
i
∈
R
3
,
i
=
1
,
…
,
L
,
or
Z
k
i
=
x
m
,
k
i
y
m
,
k
i
z
m
,
k
i
=
1
0
1
×
5
0
1
×
3
0
1
×
3
1
0
1
×
5
0
1
×
5
1
0
1
×
2
X
k
+
v
x
,
k
i
v
y
,
k
i
v
z
,
k
i
.Here v
c
,
k
(
i
) is the converted measurement noise expressed in terms of Cartesian coordinates; that is, v
c
,
k
(
i
)
~
N
0
,
R
c
,
k
(
i
),(41)
R
c
,
k
i
=
R
c
,
x
x
i
R
c
,
x
y
i
R
c
,
x
z
i
R
c
,
y
x
i
R
c
,
y
y
i
R
c
,
y
z
i
R
c
,
z
x
i
R
c
,
z
y
i
R
c
,
z
z
i
,
i
=
1
,
…
,
L
.By the Keplerian motion [31], the IIP can be represented as nonlinear function of the unit vectors of the position e
p
,
k and velocity e
υ
,
k. Therefore, in this case, the IIP prediction problem is reduced to estimation of the following unit vectors:(42)
e
p
,
k
=
e
p
x
,
k
e
p
y
,
k
e
p
z
,
k
T
,
e
υ
,
k
=
e
υ
x
,
k
e
υ
y
,
k
e
υ
z
,
k
T
,
e
p
x
,
k
=
x
p
,
k
x
p
,
k
2
+
y
p
,
k
2
+
z
p
,
k
2
,
e
p
y
,
k
=
y
p
,
k
x
p
,
k
2
+
y
p
,
k
2
+
z
p
,
k
2
,
e
p
z
,
k
=
z
p
,
k
x
p
,
k
2
+
y
p
,
k
2
+
z
p
,
k
2
,
e
υ
x
,
k
=
x
υ
,
k
x
υ
,
k
2
+
y
υ
,
k
2
+
z
υ
,
k
2
,
e
υ
y
,
k
=
y
υ
,
k
x
υ
,
k
2
+
y
υ
,
k
2
+
z
υ
,
k
2
,
e
υ
z
,
k
=
z
υ
,
k
x
υ
,
k
2
+
y
υ
,
k
2
+
z
υ
,
k
2
,
e
p
,
k
=
e
υ
,
k
=
1
for
k
=
1,2
,
…
,where x
p
,
k
,
…
,
z
υ
,
k are the position and velocity components of the state vector X
k
∈
R
9 described by (37) and (38).As the unit vectors in (42) represent an NFS, we apply the UT (Section 5.2) to calculate the local predicted estimates e
^
p
,
k
+
s
∣
k
(
i
)
=
E
e
p
,
k
+
s
(
i
)
∣
Z
[
1
:
k
]
(
i
), e
^
υ
,
k
+
s
∣
k
(
i
)
=
E
e
υ
,
k
+
s
(
i
)
∣
Z
[
1
:
k
]
(
i
), their local error covariances, and the final centralized e
^
p
,
k
+
s
∣
k
o
p
t
,
e
^
υ
,
k
+
s
∣
k
o
p
t and decentralized e
^
p
,
k
+
s
∣
k
f
u
s
,
e
^
υ
,
k
+
s
∣
k
f
u
s fusion predictors. Since the fusion predictors of the unit vectors are not normalized (i.e., e
^
p
,
k
+
s
∣
k
o
p
t
≠
1
,
…
,
e
^
υ
,
k
+
s
∣
k
f
u
s
≠
1 for k
=
1,2
,
…), we correct the obtained predictors(43)
e
~
p
x
,
k
+
s
∣
k
i
=
e
^
p
x
,
k
+
s
∣
k
i
e
^
p
,
k
+
s
∣
k
i
,
e
~
p
y
,
k
+
s
∣
k
i
=
e
^
p
y
,
k
+
s
∣
k
i
e
^
p
y
,
k
+
s
∣
k
i
,
e
~
p
z
,
k
+
s
∣
k
i
=
e
^
p
z
,
k
+
s
∣
k
i
e
^
p
,
k
+
s
∣
k
i
,
e
~
υ
x
,
k
+
s
∣
k
i
=
e
^
υ
x
,
k
+
s
∣
k
i
e
^
υ
,
k
+
s
∣
k
i
,
e
~
υ
y
,
k
+
s
∣
k
i
=
e
^
υ
y
,
k
+
s
∣
k
i
e
^
υ
,
k
+
s
∣
k
i
,
e
~
υ
z
,
k
+
s
∣
k
i
=
e
^
υ
z
,
k
+
s
∣
k
i
e
^
υ
,
k
+
s
∣
k
i
,
e
~
p
,
k
+
s
∣
k
i
=
e
~
p
x
,
k
+
s
∣
k
i
e
~
p
y
,
k
+
s
∣
k
i
e
~
p
z
,
k
+
s
∣
k
i
T
,
e
~
p
,
k
+
s
∣
k
i
=
1
for
k
=
1,2
,
…
,
e
~
υ
,
k
+
s
∣
k
i
=
e
~
υ
x
,
k
+
s
∣
k
i
e
~
υ
y
,
k
+
s
∣
k
i
e
~
υ
x
,
k
+
s
∣
k
i
T
,
e
~
υ
,
k
+
s
∣
k
i
=
1
for
k
=
1,2
,
…
.To compare the MSEs for x-component, y-component and z-component of the centralized and decentralized fusion predictors e
^
p
,
k
+
s
∣
k
o
p
t
,
e
^
υ
,
k
+
s
∣
k
o
p
t and e
^
p
,
k
+
s
∣
k
f
u
s
,
e
^
υ
,
k
+
s
∣
k
f
u
s, the Monte Carlo method with 1000 runs was performed.The SLV model parameters, noise statistics, initial conditions, and prediction lead were taken to(44)
Δ
t
=
0.1
;
k
T
=
20
s
;
L
=
2
;
σ
=
0.1
;
σ
ρ
=
10
m
;
σ
φ
=
0.01
°
;
σ
θ
=
0.01
°
;
s
=
5
;
x
-
0
=
1000
m
;
0.1
m
/
s
;
0
m
/
s
2
;
1000
m
;
-
0.1
m/s
;
0
m
/
s
2
;
100
m
;
1
m
/
s
;
0
m
/
s
2
T
,
P
0
=
diag
⁡
100
;
1
;
0.01
;
100
;
1
;
0.01
;
100
;
1
;
0.01
.Figures 1 and 2 show the global optimal and fusion prediction MSEs:(45)
P
p
x
,
k
+
s
∣
k
o
p
t
=
E
e
p
x
,
k
+
s
-
e
~
p
x
,
k
+
s
∣
k
o
p
t
2
,
P
p
x
,
k
+
s
∣
k
f
u
s
=
E
e
p
x
,
k
+
s
-
e
~
p
x
,
k
+
s
∣
k
f
u
s
2
,
P
υ
x
,
k
+
s
∣
k
o
p
t
=
E
e
υ
x
,
k
+
s
-
e
~
υ
x
,
k
+
s
∣
k
o
p
t
2
,
P
υ
x
,
k
+
s
∣
k
f
u
s
=
E
e
υ
x
,
k
+
s
-
e
~
υ
x
,
k
+
s
∣
k
f
u
s
2
,for the unit vectors e
p
x
,
k
+
s and e
υ
x
,
k
+
s along the x-axis for position and velocity, respectively. In Figures 1 and 2, we can observe that the global optimal MSEs P
p
x
,
k
+
s
∣
k
o
p
t and P
υ
x
,
k
+
s
∣
k
o
p
t are smaller than the decentralized fusion MSEs P
p
x
,
k
+
s
∣
k
f
u
s and P
υ
x
,
k
+
s
∣
k
f
u
s; however, the difference between MSEs of these predictors is negligible. Analogously with Figures 3–6, comparison analysis of the MSEs for the y-component and z-component of the unit vectors e
p
,
k and e
υ
,
k represents similar results shown in Figures 1 and 2.Figure 1
Centralized and decentralized MSEs of fusion predictors fore
p
x
,
k
+
s.Figure 2
Centralized and decentralized MSEs of fusion predictors fore
υ
x
,
k
+
s.Figure 3
Centralized and decentralized MSEs of fusion predictors fore
p
y
,
k
+
s.Figure 4
Centralized and decentralized MSEs of fusion predictors fore
υ
y
,
k
+
s.Figure 5
Centralized and decentralized MSEs of fusion predictors fore
p
z
,
k
+
s.Figure 6
Centralized and decentralized MSEs of fusion predictors fore
υ
z
,
k
+
s.In addition, Figure7 illustrates the relative errors between the optimal and fusion prediction MSEs:(46)
Δ
p
x
,
k
+
s
∣
k
=
P
p
x
,
k
+
s
∣
k
f
u
s
-
P
p
x
,
k
+
s
∣
k
o
p
t
P
p
x
,
k
+
s
∣
k
o
p
t
×
100
%
,
Δ
p
y
,
k
+
s
∣
k
=
P
p
y
,
k
+
s
∣
k
f
u
s
-
P
p
y
,
k
+
s
∣
k
o
p
t
P
p
y
,
k
+
s
∣
k
o
p
t
×
100
%
,
Δ
p
z
,
k
+
s
∣
k
=
P
p
z
,
k
+
s
∣
k
f
u
s
-
P
p
z
,
k
+
s
∣
k
o
p
t
P
p
z
,
k
+
s
∣
k
o
p
t
×
100
%for position along x-axis, y-axis, and z-axis, respectively. Analogously, Figure 8 illustrates the relative errors Δ
υ
x
,
k
+
s
∣
k, Δ
υ
y
,
k
+
s
∣
k, and Δ
υ
z
,
k
+
s
∣
k for velocity components.Figure 7
Relative errors for position components.Figure 8
Relative errors for velocity components.Figure7 shows that the relative errors Δ
p
x
,
k
+
s
∣
k and Δ
p
y
,
k
+
s
∣
k are very close and their values are ranging from 0.1% to 18% at k
>
1. The relative error Δ
p
z
,
k
+
s
∣
k along z-axis varies from 3% to 9%. However, all relative errors for position display a tendency around 5.5% at k
>
15. Figure 8 illustrates similar results for velocity components. The values Δ
υ
x
,
k
+
s
∣
k and Δ
υ
y
,
k
+
s
∣
k are ranging from 0.1% to 7.3%, and Δ
υ
z
,
k
+
s
∣
k varies from 0.1% to 5.8%. At k
>
15, the relative errors for velocity change around 5.5~6.2%. So the results in Figures 7 and 8 demonstrate that for our example the application of the proposed decentralized predictor can produce good results for a long time period.


## 8. Conclusion

In some control problems, nonlinear functionals of state variables are interpreted as cost functions, which denote useful information of the target systems for control. To predict an NFS under a multisensory environment, prediction fusion algorithms are proposed and their estimation accuracies are discussed. In general, the centralized fusion algorithm is considered the most accurate. However, owing to the inherent drawbacks of centralized processing, here the decentralized algorithm is found to be the best between fusion prediction algorithms. To show performance of the fusion predictors for NFS by practical application, multisensory fusion prediction of unit vector of position and velocity under constant acceleration motion of SLV is considered. In the example part, the comparative analysis and simulation results show that the proposed decentralized fusion predictor for NFS has competitive performance in an aspect of MSE and relative errors.



---

*Source: 249857-2015-11-11.xml*