# Parallel Irregular Fusion Estimation Based on Nonlinear Filter for Indoor RFID Tracking System

Authors: Xue-Bo Jin; Chao Dou; Ting-li Su; Xiao-fen Lian; Yan Shi
Journal: International Journal of Distributed Sensor Networks
 (2016)

---

## Abstract

In practical RFID tracking systems, usually it is impossible that the readers are placed right with a “grid” structure, so effective estimation method is required to obtain the accurate trajectory. Due to the data-driven mechanism, measurement of RFID system is sampled irregularly; therefore the traditional recursive estimation may fail fromK to K
+
1 sampling point. Moreover, because the distribution density of the readers is nonuniform and multiple measurements might be implemented simultaneously, fusion of estimations also needs to be considered. In this paper, an irregular estimation strategy with parallel structure was developed, where the dynamic model update and states fusion estimation were processed synchronously to achieve real-time indoor RFID tracking. Two nonlinear estimation methods were proposed based on the extended Kalman filter (EKF) and unscented Kalman filter (UKF), respectively. The tracking performances were compared, and the simulation results show that the developed UKF method got lower covariance in indoor RFID tracking while the EKF one cost less calculating time.


---

## Body

## 1. Introduction

Unlike Global Positioning System (GPS) applied in the outdoor cases, radio frequency identification (RFID) can effectively get more accurate indoor location information. So RFID has been widely used in the indoor tracking systems [1–3], especially in the Internet of Things (IoT) system [4]. Location information is one of the most important and frequently used contexts in many significant indoor tracking applications, such as asset tracking, industrial automation, goods management, supply chain management, and healthcare systems [5].In the RFID system, once the tag gets close to the readers, the distance between the tag and readers can be extracted from the received signal strength information (RSSI), which follows a nonlinear relationship. Since the RSSI would be perturbed by some noise source, for example, the backscattered signal power propagated from nearby RFID tags, the measurement of RFID system is uncertain. And the data-driven mechanism leads to the irregular sampling interval.Furthermore, the number of the sensors is also significant in the RFID tracking system compared to other multisensor systems. In order to measure the distance, some regular placement such as the “grid” structure [6] (shown in Figure 1) will make the trilateration estimation simpler and more effective. However, it is not feasible in most practical applications. For example, in the supermarket, the readers are often placed where not interfering customers’ shopping (shown in Figure 2). Therefore in the practical indoor tracking system, the distribution density of the readers is usually nonuniform. When the target gets into a reader-intensive area, several readers may obtain distance information simultaneously, while no or few measurements will be executed in a reader-sparse area.Figure 1
Layout of square grid RFID reader network in [6].Figure 2
A RFID reader/fixed items where RFID readers can not be installed.In a word, measurements in the RFID tracking system have the following characteristics: nonlinear, uncertain, irregularly sampled, and multivariate. All these characteristics make the distance measurement in such kind of system quite novel and challenging.In order to locate the target, at least three measurements were required [6] by trigonometry relationship. If the trajectory of target is of concern, different location points could then be lined to form the trajectory. However, the obtained trajectory might be inaccurate, because the location measured by RFID readers was with the measurement noise. In this case, filters were introduced to solve this problem. Considering the nonlinearity feature mentioned above, nonlinear filters were considered, like the representative EKF and UKF [8–12]. Reference [10] had developed a square-root unscented Kalman filter- (SR-UKF-) based algorithm to determine the real-time location of a moving target in an IoT environment, where there exist quantities of sensors, by which the good performance was shown in estimation of both position and velocity of the target with either uniform linear motion or variable-speed curve motion. In [13], a hybrid method which combines PF with Weighted Centroid Localization (WCL) was proposed to achieve high accuracy and low computational cost, but there existed some limit on the mobile speed.Another reason possibly leading to an inaccurate trajectory is that sometimes not enough measurements could be obtained to locate the target in the sparse area with few readers. Therefore, effective estimation method was required to help complete the tracking process. A novel particle filter algorithm which used a moving direction estimation-based feature improvement scheme was proposed in [14] to enhance both relatively good accuracy and precision in passive RFID system, but there are requirements on distribution density of the tags which needs to be dense enough. Another related work could be found in [15], where a real-time portable RFID indoor positioning device and cost-effective scalable RFID indoor positioning infrastructure were demonstrated, based on Kalman-filter drift removal, Heron-bilateration location estimation, and four novel preprocessing/postprocessing techniques.Due to the irregular feature of the RFID system, the traditional recursive estimation fromK to K
+
1 sampling point was no longer directly applicable [16, 17]. One solution was to use the transform method to make the irregular sampling interval a time-varying parameter of the system, and the recursive method from t
i to t
i
-
1 was then used to estimate the target trajectory [18]. Note that the “current model” was used in [18] to describe the processing model of the maneuvering target, but it cannot fully reflect the dynamics of indoor targets.In authors’ previous work, an adaptive dynamic model was used, which can adapt the parameters of the system according to the dynamic features online [7]. Figure 3 depicts the structure of the system proposed in [7], including states estimation and update of the adaptive parameters and system model. In each step, the state was first estimated and the system parameters were updated on the basis of this; then the process was turned to the next step. Since the state estimation and update of the parameters and model were conducted alternatively, the process was actually in a serial mode.Figure 3
The serial structure of the adaptive model and the estimating method proposed in [7].However, for the RFID tracking system, the serial structure will result in the larger computing time cost and it will be difficult to carry out the online tracking. Therefore the parallel structure of the RFID tracking system should be considered. Reference [19] had developed a parallel structure for the adaptive model with its tracking, but the structure is actually a partial-parallel structure. Because the adaptive parameter is updated by the one-step-ahead prediction and the state estimation should be calculated before the updating adaptive parameter, the calculating time cost can not be shortened obviously.Evidently, issues of filter, estimation method, and the model structure should not be considered separately. They all need to be carefully chosen to produce better performance. Therefore in this paper, a totally parallel structure for the RFID tracking system was designed, and two centralized fusion estimation methods were proposed based on the extended Kalman filter (EKF) and unscented Kalman filter (UKF), respectively. It needs to be pointed out that the dynamic model of the target was also taken into account in the estimation methods, which provide more accurate trajectory for the RFID tracking system. The advantage is obvious:(
1
) the proposed estimation methods can eliminate the disturbance of the measurement noise and (
2
) movement of the target could still be predicted when not enough measurements were available. The performance of these two algorithms, such as the tracking covariance and the calculating time, was verified and comparison with some existing methods was also given.The following parts of the paper are organized as follows: Section2 built the RFID measurement model and target dynamic model under the irregular sampling interval. Section 3 stated the estimation methods based on EKF and UKF, respectively. Simulation of the proposed methods was provided in Section 4. Finally, some conclusion was given in Section 5.


## 2. System Model with the Irregularly Sampled Measurements

First, measurement model of RFID needs to be confirmed before constructing the description model of the tracking system. The distancez
n
(
t
i
) between the nth reader and the tag at sampling time t
i can be calculated by RSSI nominal value P
n
(
d
,
ϕ
,
t
i
) as(1)
z
n
t
i
=
d
0
1
0
P
r
d
0
-
P
n
d
,
ϕ
,
t
i
/
10
q
,where d
0 is the close-in reference distance, P
r
(
d
0
) is the RSSI in dBm units with the reference distance d
0, and q is the path loss exponent [20].Letx, x
˙, and x
¨ be the target location, velocity, and acceleration along the horizontal axis, while y, y
˙, and y
¨ are the corresponding variables along the longitudinal axis. Then the state variable of the system at time t
i can be expressed as(2)
x
t
i
=
x
t
i
x
˙
t
i
x
¨
t
i
y
t
i
y
˙
t
i
y
¨
t
i
.Assume d
n
(
t
i
) is the actual distance between the nth reader and the tag at sampling time t
i. By the measurement of the readers, it could be found that the actual distance d
n
(
t
i
) is the function of the state x
(
t
i
) as(3)
d
n
t
i
=
x
t
i
-
x
n
0
2
+
y
t
i
-
y
n
0
2
,where x
n
(
0
) and y
n
(
0
) are the horizontal and longitudinal coordinates of the nth reader, while x
(
t
i
) and y
(
t
i
) stand for the real location of the target in the 2D tracking space.In general, the measured distancez
n
(
t
i
) in (1) and the actual distance d
n
(
t
i
) are not identical, and the measurement error should be considered:(4)
z
n
t
i
=
d
n
t
i
+
v
n
t
i
,where v
n
(
t
i
) is the measurement noise of the nth reader at the sampling time t
i. And the measurement covariance satisfied v
n
(
t
i
)
/
d
n
(
t
i
)
~
N
(
0
,
0.2303
σ
p
/
γ
2
), where σ
p is the standard deviation, γ is the path loss exponent, and “/” means division calculation. Therefore the ratio of ranging error to the actual distance follows a normal distribution with a zero-mean and a standard deviation of 0.2303
σ
p
/
γ. Here σ
p can be fixed at 4 dB, which is the average reported standard deviations for wireless communications. And the path loss exponent γ is usually between 1.6 and 6.5 based on actual measurement [20]. Until now, the measurement model of RFID tracking system was obtained. Then the processing model under irregular sampling intervals was discussed: (5)
x
t
i
=
A
t
i
-
1
x
t
i
-
1
+
w
t
i
-
1
,where A
t
i
-
1
=
A
x
(
t
i
-
1
)
0
0
A
y
(
t
i
-
1
) and A
x
(
t
i
-
1
) and A
y
(
t
i
-
1
) are the state transition matrix in horizontal and longitudinal axis, respectively. w
(
t
i
-
1
)
=
w
x
(
t
i
-
1
)
w
y
(
t
i
-
1
)
T represents the processing noise in horizontal and longitudinal axes. Assume the noises of the two axes are independent of each other; then the covariance matrix can be defined as (6)
Q
t
i
-
1
=
Q
x
t
i
-
1
0
0
Q
y
t
i
-
1
.According to the adaptive statistics model in [18], the system parameters of the horizontal and longitudinal axis are as follows:(7)
A
η
t
i
-
1
=
1
T
0
α
η
t
h
i
-
1
+
e
-
α
η
t
h
i
α
2
0
1
1
-
e
-
α
η
t
h
i
α
η
0
0
e
-
α
η
t
h
i
,
Q
η
t
i
-
1
=
2
α
η
δ
α
η
2
q
11
q
12
q
13
q
12
q
22
q
23
q
13
q
23
q
33
,
q
11
=
1
2
α
η
5
1
-
e
-
2
α
η
t
h
i
+
2
α
η
t
h
i
+
2
α
η
3
t
h
i
3
3
-
2
α
η
2
t
h
i
2
-
4
α
η
t
h
i
e
-
α
η
t
h
i
,
q
12
=
1
2
α
η
4
e
-
2
α
η
t
h
i
+
1
-
2
e
-
α
η
t
h
i
+
2
α
η
T
0
e
-
α
η
t
h
i
-
2
α
η
t
h
i
+
α
η
2
t
h
i
2
,
q
13
=
1
2
α
η
3
1
-
e
-
2
α
η
t
h
i
-
2
α
η
t
h
i
e
-
α
η
t
h
i
,
q
22
=
1
2
α
η
3
4
e
-
α
η
t
h
i
-
3
-
e
-
2
α
η
t
h
i
+
2
α
η
t
h
i
,
q
23
=
1
2
α
η
2
e
-
2
α
η
t
h
i
+
1
-
2
α
η
t
h
i
,
q
33
=
1
2
α
η
1
-
e
-
2
α
η
t
h
i
,where t
h
i
=
t
i
-
t
i
-
1 describes the time-varying sampling interval and η
=
x
,
y represent the horizontal and the longitudinal axis, respectively. α
η is the maneuver frequency and δ
α
η
2 is the variance of Gaussian white noise.For our tracking system, the models of the horizontal and the longitudinal axis are decoupled, so update of parameters can be carried out by each axis, respectively. Assume the estimated accelerationa
^
(
t
i
) is obtained at each sampling time t
i. With the first-order stationary Markov process, the statistics relation between the autocorrelation functions could be described with β and δ
a
w
2 as r
(
0
)
r
(
1
)
r
(
1
)
r
(
0
)
1
-
β
=
δ
a
w
2
0, where r
(
0
) and r
(
1
) are autocorrelation functions of the acceleration:(8)
r
i
1
=
r
i
-
1
1
+
1
i
a
^
t
i
a
^
t
i
-
1
-
r
i
-
1
1
,
r
i
0
=
r
i
-
1
0
+
1
i
a
^
t
i
a
^
t
i
-
r
i
-
1
0and the parameters β and δ
a
w
2 are computed as(9)
β
=
r
i
1
r
i
0
,
δ
a
w
2
=
r
i
0
-
α
r
i
1
.Then we can use the relation equationδ
a
w
2
=
δ
a
2
(
1
-
β
2
) and β
=
e
-
α
t
h
i [7] to get the maneuver frequency α and the variance of Gaussian white noise δ
a
2 for each processing model of different axes. It should be mentioned that (8)–(9) represent the variable of the horizontal and the longitudinal axes α
η and δ
a
,
η
2 and the index η is omitted here.


## 3. Tracking with Variable Number of RFID Readers

The parallel structure of the developed strategy was shown in Figure4. After the k
-
1 step estimation is obtained, parameters update and state estimation are processed simultaneously in k step. It needs to be pointed out that this parallel structure would significantly increase the efficiency of the system. It is important to note that the structure of the system is parallel, in which the updating step and the estimation step can be calculated simultaneously.Figure 4
The parallel structure of the system.


### 3.1. EKF-Based Method

The general EKF method linearizes the nonlinear system by Taylor series method and then applies the Kalman filter to obtain the state estimates. It has obtained much interest because of its relative simplicity and demonstrated efficacy in handling nonlinear systems.The proposed EKF-based tracking algorithm was implemented as follows.(1) State Updating.It is as follows:(10)
x
^
t
i
∣
t
i
-
1
=
A
t
i
-
1
x
^
t
i
-
1
∣
t
i
-
1
P
t
i
∣
t
i
-
1
=
A
t
i
-
1
P
t
i
-
1
∣
t
i
-
1
A
T
t
i
-
1
+
Q
t
i
-
1
,where P
t
i
-
1
∣
t
i
-
1 is the covariance of the state prediction. The state fusion estimation is obtained as(11)
x
^
t
i
∣
t
i
=
x
^
t
i
∣
t
i
-
1
+
∑
n
=
1
N
t
i
K
n
t
i
z
n
t
i
-
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
,where N
(
t
i
) is the number of readers at time t
i, and it might vary:(12)
K
n
t
i
=
P
t
i
∣
t
i
-
1
h
n
x
T
t
i
S
n
-
1
t
i
(13)
S
n
t
i
=
h
n
x
t
i
P
t
i
∣
t
i
-
1
h
n
x
T
t
i
+
R
t
i
(14)
P
-
1
t
i
∣
t
i
=
P
-
1
t
i
∣
t
i
-
1
+
∑
n
=
1
N
t
i
h
n
x
-
1
t
i
R
n
t
i
h
n
x
t
i
(15)
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
=
x
^
n
t
i
∣
t
i
-
1
-
x
n
0
2
+
y
^
n
t
i
∣
t
i
-
1
-
y
n
0
2
,where the Jacobi matrix of measurement function h
n
x
(
t
i
) is(16)
h
n
x
t
i
=
∇
x
h
n
′
t
i
x
=
x
^
t
i
∣
t
i
-
1
=
y
^
n
t
i
∣
t
i
-
1
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
0
0
x
^
n
t
i
∣
t
i
-
1
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
0
0
.(2) Parameter Adaptation. Set the estimation of acceleration a
^
η
(
t
i
) as a
^
x
(
t
i
)
=
x
¨
^
t
i
-
1
∣
t
i
-
1, a
^
y
(
t
i
)
=
y
¨
^
t
i
-
1
∣
t
i
-
1. When i
≤
K
0, where K
0 is an integer less than 10, δ
α
,
i
,
η
2 is estimated by (17)
δ
α
,
i
,
η
2
=
4
-
π
π
a
M
-
a
^
η
t
i
2
w
h
e
n
a
^
η
t
i
>
0
4
-
π
π
a
^
η
t
i
-
a
-
M
2
w
h
e
n
a
^
η
t
i
<
0
a
s
m
a
l
l
p
o
s
i
t
i
v
e
c
o
n
s
t
a
n
t
w
h
e
n
a
^
η
t
i
=
0
,where a
M and a
-
M are positive and negative value with the same absolute value a
M and the maneuver frequency α
i
,
η is set to be a positive.Wheni
>
K
0, estimation of δ
α
,
i
,
η
2 and α
i
,
η is obtained by(18)
r
i
,
η
1
=
r
i
-
1
,
η
1
+
1
i
a
^
η
t
i
a
^
η
t
i
-
1
-
r
i
-
1
,
η
1
r
i
,
η
0
=
r
i
-
1
,
η
0
+
1
i
a
^
η
t
i
a
^
η
t
i
-
r
i
-
1
,
η
0
β
i
,
η
=
r
i
,
η
1
r
i
,
η
0
δ
a
w
,
i
,
η
2
=
r
i
,
η
0
-
β
i
,
η
r
i
,
η
1
δ
a
,
i
,
η
2
=
δ
a
w
,
i
,
η
2
1
-
β
i
,
η
2
α
i
,
η
=
ln
⁡
β
i
,
η
-
t
h
i
.The updated δ
a
,
i
,
η
2 and α
i
,
η can be used in system matrix (7) at each sampling time t
i and system matrix (7) will be updated every sampling time.


### 3.2. UKF-Based Method

UKF propagates the so-called sigma points by function evaluations using the unscented transformation (UT), and this is at first glance very different from the standard EKF algorithm which is based on a linearized model. Suppose a set of points are constructed with a given mean and covariance. When another point with the same mean was added to the set, the mean of the set would be unaffected, but the remaining points would have to be scaled to maintain the given covariance. Then the following fusion estimation algorithm based on UKF was proposed.(1) State Updating. By convention, let W
(
0
) be the weight at the mean point, which is indexed as the 0th point. In order to preserve the normality, mean, and covariance of the original points set, a sigma point selection method was applied here:(19)
x
0
=
x
^
t
i
-
1
∣
t
i
-
1
0
N
w
0
N
v
T
=
x
x
0
x
w
0
x
v
0
T
W
0
=
W
0
x
i
=
x
0
+
N
x
1
-
W
0
P
t
i
-
1
∣
t
i
-
1
i
=
x
x
i
x
w
i
x
v
i
T
W
i
=
1
-
W
0
2
N
x
x
i
+
N
x
=
x
0
-
N
x
1
-
W
0
P
t
i
-
1
∣
t
i
-
1
i
=
x
x
i
+
N
x
x
w
i
+
N
x
x
v
i
+
N
x
T
W
i
+
N
x
=
1
-
W
0
2
N
x
,where 0
N
w and 0
N
v are column vector of zeros with the same dimension as the processing noise w
(
t
i
-
1
) and the measurement noise v
(
t
i
-
1
), respectively. N
x is the dimension of the system state and N
x
/
1
-
W
0
P
t
i
-
1
∣
t
i
-
1
i is the ith column of the principal square root of the matrix N
x
/
1
-
W
0
P
t
i
-
1
∣
t
i
-
1.The transformed set is given by instantiating each point through the processing model(20)
x
^
i
=
A
t
i
-
1
x
x
i
+
x
w
i
,
i
=
0,1
,
…
,
2
N
x
.The predicted mean is computed as(21)
μ
^
=
∑
i
=
0
2
N
x
x
^
i
W
i
.The predicted covariance is computed as(22)
P
t
i
∣
t
i
-
1
=
∑
i
=
0
2
N
x
W
i
x
^
i
-
μ
^
x
^
i
-
μ
^
T
+
Q
t
i
-
1
.Instantiate each of the prediction points through the measurement model(23)
z
^
n
i
=
h
n
t
i
,
x
^
i
+
x
v
i
.The predicted observation is calculated by(24)
z
^
n
=
∑
i
=
0
2
N
x
z
^
n
i
W
i
.The innovation covariance is(25)
S
n
t
i
=
∑
i
=
0
2
N
x
W
i
z
^
n
i
-
z
^
n
z
^
n
i
-
z
^
n
T
+
R
n
t
i
.The cross covariance matrix is determined by(26)
P
x
z
,
n
t
i
=
∑
i
=
0
2
N
x
W
i
x
^
i
-
μ
^
z
^
n
i
-
z
^
n
T
.Finally, the update can be performed using the fusion estimation(27)
x
^
t
i
∣
t
i
=
x
^
t
i
∣
t
i
-
1
+
∑
n
=
1
N
t
i
K
n
t
i
z
n
t
i
-
z
^
n
,where(28)
K
n
t
i
=
P
x
z
,
n
t
i
S
n
-
1
t
i
.The estimation covariance is(29)
P
t
i
∣
t
i
=
P
t
i
∣
t
i
-
1
-
∑
n
=
1
N
t
i
K
n
t
i
R
n
t
i
K
n
T
t
i
.(2) Parameter Adaptation (This Part is the Same as Step
(
2
)
, Parameter Adaptation, in Section3.1, EKF-Based Method). Note that, in Sections 3.1 and 3.2, the estimation of acceleration a
^
η
(
t
i
) is set as a
^
x
(
t
i
)
=
x
¨
^
t
i
-
1
∣
t
i
-
1, a
^
y
(
t
i
)
=
y
¨
^
t
i
-
1
∣
t
i
-
1, which means state update and parameter adaptation using these two methods can be calculated in parallel totally. And it needs to be pointed out that (11) and (27) are different from the basic EKF and UKF, in which the measurements are fused with the centralized fusion estimation. Similar situations can be found in filter gain (12) and (28) and estimation covariance (14) and (29).


## 3.1. EKF-Based Method

The general EKF method linearizes the nonlinear system by Taylor series method and then applies the Kalman filter to obtain the state estimates. It has obtained much interest because of its relative simplicity and demonstrated efficacy in handling nonlinear systems.The proposed EKF-based tracking algorithm was implemented as follows.(1) State Updating.It is as follows:(10)
x
^
t
i
∣
t
i
-
1
=
A
t
i
-
1
x
^
t
i
-
1
∣
t
i
-
1
P
t
i
∣
t
i
-
1
=
A
t
i
-
1
P
t
i
-
1
∣
t
i
-
1
A
T
t
i
-
1
+
Q
t
i
-
1
,where P
t
i
-
1
∣
t
i
-
1 is the covariance of the state prediction. The state fusion estimation is obtained as(11)
x
^
t
i
∣
t
i
=
x
^
t
i
∣
t
i
-
1
+
∑
n
=
1
N
t
i
K
n
t
i
z
n
t
i
-
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
,where N
(
t
i
) is the number of readers at time t
i, and it might vary:(12)
K
n
t
i
=
P
t
i
∣
t
i
-
1
h
n
x
T
t
i
S
n
-
1
t
i
(13)
S
n
t
i
=
h
n
x
t
i
P
t
i
∣
t
i
-
1
h
n
x
T
t
i
+
R
t
i
(14)
P
-
1
t
i
∣
t
i
=
P
-
1
t
i
∣
t
i
-
1
+
∑
n
=
1
N
t
i
h
n
x
-
1
t
i
R
n
t
i
h
n
x
t
i
(15)
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
=
x
^
n
t
i
∣
t
i
-
1
-
x
n
0
2
+
y
^
n
t
i
∣
t
i
-
1
-
y
n
0
2
,where the Jacobi matrix of measurement function h
n
x
(
t
i
) is(16)
h
n
x
t
i
=
∇
x
h
n
′
t
i
x
=
x
^
t
i
∣
t
i
-
1
=
y
^
n
t
i
∣
t
i
-
1
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
0
0
x
^
n
t
i
∣
t
i
-
1
h
n
t
i
,
x
^
t
i
∣
t
i
-
1
0
0
.(2) Parameter Adaptation. Set the estimation of acceleration a
^
η
(
t
i
) as a
^
x
(
t
i
)
=
x
¨
^
t
i
-
1
∣
t
i
-
1, a
^
y
(
t
i
)
=
y
¨
^
t
i
-
1
∣
t
i
-
1. When i
≤
K
0, where K
0 is an integer less than 10, δ
α
,
i
,
η
2 is estimated by (17)
δ
α
,
i
,
η
2
=
4
-
π
π
a
M
-
a
^
η
t
i
2
w
h
e
n
a
^
η
t
i
>
0
4
-
π
π
a
^
η
t
i
-
a
-
M
2
w
h
e
n
a
^
η
t
i
<
0
a
s
m
a
l
l
p
o
s
i
t
i
v
e
c
o
n
s
t
a
n
t
w
h
e
n
a
^
η
t
i
=
0
,where a
M and a
-
M are positive and negative value with the same absolute value a
M and the maneuver frequency α
i
,
η is set to be a positive.Wheni
>
K
0, estimation of δ
α
,
i
,
η
2 and α
i
,
η is obtained by(18)
r
i
,
η
1
=
r
i
-
1
,
η
1
+
1
i
a
^
η
t
i
a
^
η
t
i
-
1
-
r
i
-
1
,
η
1
r
i
,
η
0
=
r
i
-
1
,
η
0
+
1
i
a
^
η
t
i
a
^
η
t
i
-
r
i
-
1
,
η
0
β
i
,
η
=
r
i
,
η
1
r
i
,
η
0
δ
a
w
,
i
,
η
2
=
r
i
,
η
0
-
β
i
,
η
r
i
,
η
1
δ
a
,
i
,
η
2
=
δ
a
w
,
i
,
η
2
1
-
β
i
,
η
2
α
i
,
η
=
ln
⁡
β
i
,
η
-
t
h
i
.The updated δ
a
,
i
,
η
2 and α
i
,
η can be used in system matrix (7) at each sampling time t
i and system matrix (7) will be updated every sampling time.


## 3.2. UKF-Based Method

UKF propagates the so-called sigma points by function evaluations using the unscented transformation (UT), and this is at first glance very different from the standard EKF algorithm which is based on a linearized model. Suppose a set of points are constructed with a given mean and covariance. When another point with the same mean was added to the set, the mean of the set would be unaffected, but the remaining points would have to be scaled to maintain the given covariance. Then the following fusion estimation algorithm based on UKF was proposed.(1) State Updating. By convention, let W
(
0
) be the weight at the mean point, which is indexed as the 0th point. In order to preserve the normality, mean, and covariance of the original points set, a sigma point selection method was applied here:(19)
x
0
=
x
^
t
i
-
1
∣
t
i
-
1
0
N
w
0
N
v
T
=
x
x
0
x
w
0
x
v
0
T
W
0
=
W
0
x
i
=
x
0
+
N
x
1
-
W
0
P
t
i
-
1
∣
t
i
-
1
i
=
x
x
i
x
w
i
x
v
i
T
W
i
=
1
-
W
0
2
N
x
x
i
+
N
x
=
x
0
-
N
x
1
-
W
0
P
t
i
-
1
∣
t
i
-
1
i
=
x
x
i
+
N
x
x
w
i
+
N
x
x
v
i
+
N
x
T
W
i
+
N
x
=
1
-
W
0
2
N
x
,where 0
N
w and 0
N
v are column vector of zeros with the same dimension as the processing noise w
(
t
i
-
1
) and the measurement noise v
(
t
i
-
1
), respectively. N
x is the dimension of the system state and N
x
/
1
-
W
0
P
t
i
-
1
∣
t
i
-
1
i is the ith column of the principal square root of the matrix N
x
/
1
-
W
0
P
t
i
-
1
∣
t
i
-
1.The transformed set is given by instantiating each point through the processing model(20)
x
^
i
=
A
t
i
-
1
x
x
i
+
x
w
i
,
i
=
0,1
,
…
,
2
N
x
.The predicted mean is computed as(21)
μ
^
=
∑
i
=
0
2
N
x
x
^
i
W
i
.The predicted covariance is computed as(22)
P
t
i
∣
t
i
-
1
=
∑
i
=
0
2
N
x
W
i
x
^
i
-
μ
^
x
^
i
-
μ
^
T
+
Q
t
i
-
1
.Instantiate each of the prediction points through the measurement model(23)
z
^
n
i
=
h
n
t
i
,
x
^
i
+
x
v
i
.The predicted observation is calculated by(24)
z
^
n
=
∑
i
=
0
2
N
x
z
^
n
i
W
i
.The innovation covariance is(25)
S
n
t
i
=
∑
i
=
0
2
N
x
W
i
z
^
n
i
-
z
^
n
z
^
n
i
-
z
^
n
T
+
R
n
t
i
.The cross covariance matrix is determined by(26)
P
x
z
,
n
t
i
=
∑
i
=
0
2
N
x
W
i
x
^
i
-
μ
^
z
^
n
i
-
z
^
n
T
.Finally, the update can be performed using the fusion estimation(27)
x
^
t
i
∣
t
i
=
x
^
t
i
∣
t
i
-
1
+
∑
n
=
1
N
t
i
K
n
t
i
z
n
t
i
-
z
^
n
,where(28)
K
n
t
i
=
P
x
z
,
n
t
i
S
n
-
1
t
i
.The estimation covariance is(29)
P
t
i
∣
t
i
=
P
t
i
∣
t
i
-
1
-
∑
n
=
1
N
t
i
K
n
t
i
R
n
t
i
K
n
T
t
i
.(2) Parameter Adaptation (This Part is the Same as Step
(
2
)
, Parameter Adaptation, in Section3.1, EKF-Based Method). Note that, in Sections 3.1 and 3.2, the estimation of acceleration a
^
η
(
t
i
) is set as a
^
x
(
t
i
)
=
x
¨
^
t
i
-
1
∣
t
i
-
1, a
^
y
(
t
i
)
=
y
¨
^
t
i
-
1
∣
t
i
-
1, which means state update and parameter adaptation using these two methods can be calculated in parallel totally. And it needs to be pointed out that (11) and (27) are different from the basic EKF and UKF, in which the measurements are fused with the centralized fusion estimation. Similar situations can be found in filter gain (12) and (28) and estimation covariance (14) and (29).


## 4. Experiment Results

A 2D simulation platform of tracking system with RFID readers was developed to simulate the measurement mechanism, such as the measurement noise and the uncertainty of RFID readers discussed in Section2. The relation of loss measurement is assumed to be detection rate inversely proportional to the distance to the RFID readers.


### 4.1. Performance of the Developed EKF and UKF Estimation Method

In this case, the two developed methods were compared to discuss the tracking covariance of EKF and UKF. Many researches have declared that the UKF gets better performance than EKF and this simulation will give a similar result.The state of the target in the 2D space isx
(
k
)
=
x
(
k
)
x
˙
(
k
)
x
¨
(
k
)
y
(
k
)
y
˙
(
k
)
y
¨
(
k
). The initial state estimate x
0 and covariance P
0 are assumed to be x
0
=
x
(
0
)
0
0
y
(
0
)
0
0
T and P
0
=
diag
⁡
10,10,10,10,10,10. The initial value of the maneuver frequency α
0
,
η is set to be α
0
=
1
/
20 and α
M
=
30, α
-
M
=
-
30. The initial weight of the mean point is W
x
(
0
)
=
κ
/
(
N
x
+
κ
), with the scale parameter κ
=
-
3 and N
x
=
6.In this case, 19 RFID readers (coordinate points are shown in Table1) were placed in the simulation platform and the measurement space of each reader with high detection rate was shown with circles (from inside to outside in contour map) in Figure 5. In the white area of the figure, the distance information of the target can only be obtained with low detection rate. The reference trajectory of the target is given with “black” asterisk in Figure 5.Table 1
The coordinate point of RFID readers.
Number
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Horizontal
22.46
13.94
25.92
43.66
48.27
9.56
11.41
52.41
80.76
68.77
65.09
74.77
87.90
92.28
91.82
61.17
34.678
5.64
95.05
Longitudinal
28.80
60.96
83.47
77.63
50.44
37.87
9.79
7.74
16.22
54.53
78.51
94.59
83.77
59.50
39.03
27.63
60.67
95.17
7.456Figure 5
The measurement space of RFID readers and the reference trajectory.From Figure5, we can see there are two low detection rate areas, which are circled by the black line in Figure 6 (with marked “①”). Table 2 gives the trajectory information in Figure 5 from 11.1 s to 12.1 s and “∖” means no measurements were obtained. From Table 2, it could be found that the sampling time is irregular, because no measurement data was obtained from 11.5 s to 11.7 s and from 11.8 s to 12.0 s. Moreover, because it was in the low detection rate area, only one measurement data is got at most times. Since the measurement got by RFID is the distance, it is impossible to infer the accurate target location with one measurement by the geometric relation [6]. However in this paper, the dynamic model of the target was used to estimate the trajectory when only few measurements can be obtained.Table 2
Measurements got by RFID readers system.
Readers
Sampling time
11.1
11.2
11.3
11.4
11.5
11.6
11.7
11.8
11.9
12.0
12.1
1
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
2
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
3
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
27.629
4
∖
20.502
∖
∖
∖
∖
∖
18.050
∖
20.269
∖
5
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
6
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
7
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
8
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
9
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
10
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
11
17.524
∖
∖
21.693
∖
∖
∖
∖
∖
∖
23.469
12
∖
20.297
25.370
∖
23.228
∖
∖
∖
∖
∖
27.779
13
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
14
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
15
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
16
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
17
∖
∖
∖
∖
∖
∖
37.689
∖
∖
∖
∖
18
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
19
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖Figure 6
The reference trajectory and the estimated trajectory obtained by UKF-based method.The EKF- and UKF-based methods were used to estimate the trajectory in Figure5. With the UKF-based method, estimation covariance of the estimated trajectory is 43.7320 in the horizontal axis and 30.1378 in the longitudinal axis, and the estimated result was shown in Figure 6. Result obtained through the EKF-based method was given in Figure 7, and corresponding estimation covariance is 38.1563 and 44.8470. The estimated trajectories and errors in horizontal and longitudinal axes are shown in Figures 8 and 9, respectively.Figure 7
The reference trajectory and the estimated trajectory obtained by EKF-based method.Figure 8
The estimations in horizontal and longitudinal axes by EKF and UKF.
(a)
(b)Figure 9
The error of tracking by EKF and UKF.
(a)
(b)From Figures6, 7, 8, and 9, it could be seen that the estimation obtained by variable number of readers was smooth without mutation, even when the number of readers suddenly varied. Additionally, in the low detection rate area, the approximate movement direction of the target could also be estimated. Once enough measurements were obtained, the estimation error reduced rapidly. For the UKF-based method, this was achieved because the update process could continue with the estimated velocity and acceleration when there is lack of measurement data. However, the EKF-based method did not perform well in such area. The reason is that the nonlinear measurement model has been linearized, and some measurement information has been lost; therefore the estimation might not be that accurate.


### 4.2. Covariance Comparison with Trilateration Estimation

In this case, different 2D simulation trajectories were used to further verify the performance of the developed methods. Though hundreds of different trajectories were applied in the verification process, in order to show the results clearly, only nine of them were selected here as shown in Figure10, each of which illustrates one simulated tracking system with several readers. The reference trajectory of each target is shown with “black asterisks” in the subfigures. The readers are placed in the center of each circle, which represents the measurement space of each RFID reader. Note that all the target trajectories are different from each other, and each of them has passed at least one sparse area.Figure 10
Nine simulated trajectories to be tracked.The previously mentioned trilateration estimation [6] was compared with the developed methods in this part, and results show that the developed methods perform better than the trilateration estimation especially in the system with sparse readers. The tracking covariance was defined as c
o
v
=
X
c
o
v
2
+
Y
c
o
v
2, where X
c
o
v and Y
c
o
v are the estimation covariance of horizontal and longitudinal axis, respectively. Figures 11 and 12 give the comparison of the developed methods with the trilateration estimation [6], in which horizontal axis is the sequence number of the nine trajectories, from number 1 to number 9. Because the covariances of the UKF and EKF are very close in Figure 12, a more obvious comparison was given in Figure 11.Figure 11
The covariance comparison of the developed methods UKF and EKF.Figure 12
The covariance comparison of the developed method with the trilateration estimation [6].It is clear that the covariance of the trilateration method is much larger than the developed methods. This is because at least three measurements were required by the method in [6], yet with sparse readers, not enough location information could be obtained. Therefore the estimation covariance of the trilateration estimation becomes large.It also needs to be pointed out that the covariance of the UKF-based method was smaller than the EKF-based method for most trajectories (5 in 9, including numbers 1, 2, 3, 4, 7, and 8), and the biggest difference existed in number 7 trajectory. The reason is that the trajectory covered too much sparse area, and the performance of the estimation was affected due to the linearization.


### 4.3. Evaluation of Calculating Time of Three Different Structures

In this case, calculating time and estimation performance of three different structures were considered, including the serial [7], partial-parallel [19], and totally parallel structure developed here. Five methods are compared: the traditional EKF and UKF serial estimation methods [7], the partial-parallel UKF estimation method [19], and the newly developed EKF and UKF estimation methods. Evaluation results were shown in Figure 13, where the horizontal axes are the covariance and calculating time, respectively, and the longitudinal axes are both the sequence number of the nine simulated trajectories.Figure 13
The comparison of the calculating time between different structures.Judging by the algorithm type, the EKF-related methods cost obviously less calculating time than the UKF methods in Figure13. If we consider the structure influence, the totally parallel structure costs less time obviously. So the developed EKF with totally parallel structure cost the least calculating time, which proves that the proposed method has high calculating capability.


## 4.1. Performance of the Developed EKF and UKF Estimation Method

In this case, the two developed methods were compared to discuss the tracking covariance of EKF and UKF. Many researches have declared that the UKF gets better performance than EKF and this simulation will give a similar result.The state of the target in the 2D space isx
(
k
)
=
x
(
k
)
x
˙
(
k
)
x
¨
(
k
)
y
(
k
)
y
˙
(
k
)
y
¨
(
k
). The initial state estimate x
0 and covariance P
0 are assumed to be x
0
=
x
(
0
)
0
0
y
(
0
)
0
0
T and P
0
=
diag
⁡
10,10,10,10,10,10. The initial value of the maneuver frequency α
0
,
η is set to be α
0
=
1
/
20 and α
M
=
30, α
-
M
=
-
30. The initial weight of the mean point is W
x
(
0
)
=
κ
/
(
N
x
+
κ
), with the scale parameter κ
=
-
3 and N
x
=
6.In this case, 19 RFID readers (coordinate points are shown in Table1) were placed in the simulation platform and the measurement space of each reader with high detection rate was shown with circles (from inside to outside in contour map) in Figure 5. In the white area of the figure, the distance information of the target can only be obtained with low detection rate. The reference trajectory of the target is given with “black” asterisk in Figure 5.Table 1
The coordinate point of RFID readers.
Number
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Horizontal
22.46
13.94
25.92
43.66
48.27
9.56
11.41
52.41
80.76
68.77
65.09
74.77
87.90
92.28
91.82
61.17
34.678
5.64
95.05
Longitudinal
28.80
60.96
83.47
77.63
50.44
37.87
9.79
7.74
16.22
54.53
78.51
94.59
83.77
59.50
39.03
27.63
60.67
95.17
7.456Figure 5
The measurement space of RFID readers and the reference trajectory.From Figure5, we can see there are two low detection rate areas, which are circled by the black line in Figure 6 (with marked “①”). Table 2 gives the trajectory information in Figure 5 from 11.1 s to 12.1 s and “∖” means no measurements were obtained. From Table 2, it could be found that the sampling time is irregular, because no measurement data was obtained from 11.5 s to 11.7 s and from 11.8 s to 12.0 s. Moreover, because it was in the low detection rate area, only one measurement data is got at most times. Since the measurement got by RFID is the distance, it is impossible to infer the accurate target location with one measurement by the geometric relation [6]. However in this paper, the dynamic model of the target was used to estimate the trajectory when only few measurements can be obtained.Table 2
Measurements got by RFID readers system.
Readers
Sampling time
11.1
11.2
11.3
11.4
11.5
11.6
11.7
11.8
11.9
12.0
12.1
1
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
2
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
3
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
27.629
4
∖
20.502
∖
∖
∖
∖
∖
18.050
∖
20.269
∖
5
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
6
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
7
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
8
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
9
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
10
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
11
17.524
∖
∖
21.693
∖
∖
∖
∖
∖
∖
23.469
12
∖
20.297
25.370
∖
23.228
∖
∖
∖
∖
∖
27.779
13
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
14
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
15
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
16
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
17
∖
∖
∖
∖
∖
∖
37.689
∖
∖
∖
∖
18
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
19
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖
∖Figure 6
The reference trajectory and the estimated trajectory obtained by UKF-based method.The EKF- and UKF-based methods were used to estimate the trajectory in Figure5. With the UKF-based method, estimation covariance of the estimated trajectory is 43.7320 in the horizontal axis and 30.1378 in the longitudinal axis, and the estimated result was shown in Figure 6. Result obtained through the EKF-based method was given in Figure 7, and corresponding estimation covariance is 38.1563 and 44.8470. The estimated trajectories and errors in horizontal and longitudinal axes are shown in Figures 8 and 9, respectively.Figure 7
The reference trajectory and the estimated trajectory obtained by EKF-based method.Figure 8
The estimations in horizontal and longitudinal axes by EKF and UKF.
(a)
(b)Figure 9
The error of tracking by EKF and UKF.
(a)
(b)From Figures6, 7, 8, and 9, it could be seen that the estimation obtained by variable number of readers was smooth without mutation, even when the number of readers suddenly varied. Additionally, in the low detection rate area, the approximate movement direction of the target could also be estimated. Once enough measurements were obtained, the estimation error reduced rapidly. For the UKF-based method, this was achieved because the update process could continue with the estimated velocity and acceleration when there is lack of measurement data. However, the EKF-based method did not perform well in such area. The reason is that the nonlinear measurement model has been linearized, and some measurement information has been lost; therefore the estimation might not be that accurate.


## 4.2. Covariance Comparison with Trilateration Estimation

In this case, different 2D simulation trajectories were used to further verify the performance of the developed methods. Though hundreds of different trajectories were applied in the verification process, in order to show the results clearly, only nine of them were selected here as shown in Figure10, each of which illustrates one simulated tracking system with several readers. The reference trajectory of each target is shown with “black asterisks” in the subfigures. The readers are placed in the center of each circle, which represents the measurement space of each RFID reader. Note that all the target trajectories are different from each other, and each of them has passed at least one sparse area.Figure 10
Nine simulated trajectories to be tracked.The previously mentioned trilateration estimation [6] was compared with the developed methods in this part, and results show that the developed methods perform better than the trilateration estimation especially in the system with sparse readers. The tracking covariance was defined as c
o
v
=
X
c
o
v
2
+
Y
c
o
v
2, where X
c
o
v and Y
c
o
v are the estimation covariance of horizontal and longitudinal axis, respectively. Figures 11 and 12 give the comparison of the developed methods with the trilateration estimation [6], in which horizontal axis is the sequence number of the nine trajectories, from number 1 to number 9. Because the covariances of the UKF and EKF are very close in Figure 12, a more obvious comparison was given in Figure 11.Figure 11
The covariance comparison of the developed methods UKF and EKF.Figure 12
The covariance comparison of the developed method with the trilateration estimation [6].It is clear that the covariance of the trilateration method is much larger than the developed methods. This is because at least three measurements were required by the method in [6], yet with sparse readers, not enough location information could be obtained. Therefore the estimation covariance of the trilateration estimation becomes large.It also needs to be pointed out that the covariance of the UKF-based method was smaller than the EKF-based method for most trajectories (5 in 9, including numbers 1, 2, 3, 4, 7, and 8), and the biggest difference existed in number 7 trajectory. The reason is that the trajectory covered too much sparse area, and the performance of the estimation was affected due to the linearization.


## 4.3. Evaluation of Calculating Time of Three Different Structures

In this case, calculating time and estimation performance of three different structures were considered, including the serial [7], partial-parallel [19], and totally parallel structure developed here. Five methods are compared: the traditional EKF and UKF serial estimation methods [7], the partial-parallel UKF estimation method [19], and the newly developed EKF and UKF estimation methods. Evaluation results were shown in Figure 13, where the horizontal axes are the covariance and calculating time, respectively, and the longitudinal axes are both the sequence number of the nine simulated trajectories.Figure 13
The comparison of the calculating time between different structures.Judging by the algorithm type, the EKF-related methods cost obviously less calculating time than the UKF methods in Figure13. If we consider the structure influence, the totally parallel structure costs less time obviously. So the developed EKF with totally parallel structure cost the least calculating time, which proves that the proposed method has high calculating capability.


## 5. Conclusions

It is necessary to consider the maneuvering target in the RFID tracking system. When the tag is within the RFID measurement space, the distance between the tag and readers can be extracted from RSSI. Because of the characteristics of the measurement process in the indoor RFID tracking system, the distances obtained by RFID are multivariate, irregularly sampled, uncertain, and nonlinear.This paper has proposed the EKF- and UKF-based fusion estimation algorithms with the totally parallel structure, which update the model and estimate the state simultaneously online. The estimation covariance and the calculating time of the proposed methods are considered in detail. Simulation results show that, in most cases, the UKF method can provide better estimation performance, even when the target steps into the low detection rate area, while the EKF method with totally parallel structure cost the least calculating time and is suitable for fast online tracking.



---

*Source: 1472930-2016-05-23.xml*