Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Although several estimation methods have been developed for improving the performance of vehi-
cle’s movement information, the accuracy of the latter is still a challenging issue. The main problem
is in the way noise disturbances are handled and the estimation methods which are not efficient.
This paper presents a two-task hierarchical method named hierarchical constrained tri-objective
optimization (HCTO) to improve the vehicle state accuracy. In this method, process and measure-
ment noises are first optimized separately and then, based on the obtained optimal solutions,
the upper bound for the state estimation error is addressed. These noises are assumed to fol-
low a generalized error distribution (GED) and the maximum likelihood estimation (MLE) model
is adopted with the intention of estimating sample parameters; thus reducing the computational
burden of HCTO. Moreover, the optimal solution of the bound which is defined in terms of linear
matrix inequality (LMI) approach is obtained via semi-definite programming (SDP) method. The per-
formance is analyzed with respect to real-world data collected using Smartphone-based vehicular
sensing model. The proposed method is On:
IP: 88.198.3.13 tested when
Thu, 09 noises are both
Aug 2018 Gaussian and non-Gaussian
04:56:53
distributed and also compared with the existing nonlinear estimation
Copyright: American Scientific Publishers methods. Experimental results
RESEARCH ARTICLE
5504 J. Comput. Theor. Nanosci. 2015, Vol. 12, No. 12 1546-1955/2015/12/5504/013 doi:10.1166/jctn.2015.4556
Havyarimana et al. A Two-Task HCTO Approach for Vehicle State Estimation Under Non-Gaussian Environment
RESEARCH ARTICLE
the constrained view leads to forcing the state error to the by Ingenta
Delivered phase with a critical performance without having com-
boundary. However, a major drawback of PF is related to
plete information of the global problem. In our method
the computational time, given that this technique requires
presented here, the first two sub-problems are respon-
an important amount of samples to be more accurate and
sible of addressing non-Gaussianity of the process and
this makes it more computer-intensive.12 Recently, Yang
measurement noises respectively. Generally, non-Gaussian
et al.13 presented the constrained method based optimiza-
noise is more difficult to treat than Gaussian noise hence,
tion for the target state estimation. Optimization prob- the generalized error distribution (GED)19 is adopted as
lems are often present in the numerical solution of control an approximation to non-Gaussian densities. The proba-
problems, non-linear approximation, engineering design, bility density function (PDF) of the random variable of
computational science, communication engineering, signal GED is represented by three parametric values such as
processing, and so forth. Based on the constraints and shape, location and scale parameters, where the shape
the objective function, the optimization problem can be parameter is assumed to be known. Besides, the maxi-
either linear or nonlinear. Moreover, if the problem com- mum likelihood estimation (MLE) method is employed,
prises multiple objective functions, this leads to the multi- in order to estimate the parameters such as the mean and
objective optimization (MOP)14 problem. the variance (or covariance matrix) related to both pro-
In general, to optimize several objective functions cess and measurement noises and thus decrease the com-
simultaneously requires not only one global optimum, but putational cost of the global problem. In this work, we
also a set of the so-called Pareto-points due to the pres- demonstrated that GED approaches the Gaussian distribu-
ence of multi criteria nature of such problems. Evolution- tion when the shape parameter tends to zero and; this not
ary algorithms such as fast and efficient multi-objective only forces the estimated variance (covariance matrix) to
evolutionary algorithm (FEMOEA),15 particle swarm opti- increase but also affects the vehicle state accuracy. More-
mization (PSO)16 ) and weighted-sum method17 have been over, in order to get the optimal solution for the process
proposed to solve the multi-objective optimization problem and measurement noises, the noise sequences are mini-
due to their ability to synchronously search for multiple mized subject to the constraints bounding the trace of the
Pareto optimal solutions. However, the main issues with estimated covariance matrices. Furthermore, the optimal
these MOP problems are related to the fact that it is dif- solution of the upper bound for the state estimation error
ficult (even impossible) to locate the phase with a critical which is defined in terms of linear matrix inequality (LMI)
approach is obtained via semi-definite programming (SDP) where the state transition matrix t ∈ I Rn×n and the mea-
method. 21
surement matrix
t ∈ I Rp×n (p ≥ n) are defined as t =
The proposed method was tested when the pro- t /Xt X̂t and
t = t /Xt X̂t respectively. We assume
cess and measurement noises are Gaussian and non- that the initial state X0 is such that:
Gaussian distributed and, was denoted “HCTO (gn)” and
“HCTO (non-gn)” respectively where “gn” stands for X0 − X̂0 X0 − X̂0 T ≤ G0 (3)
“gaussian noise” and “non-gn” represents “non-gaussian
where X̂0 is an estimate of X0 which is also supposed to be
noise.” Based on MLE method, zeroing the shape param-
known and G0 = GT0 ∈ I Rn×n is a known positive matrix.
eter increases the estimated noise variance (or covariance
The superscript (T ) stands for the transposition operator.
matrix) which in turn decreases the state accuracy through
In (2), t−1 and t represent the additive process noise and
the overall algorithm. In addition, we demonstrated that
measurement noise sequences. Moreover, the filter for the
HCTO (gn) and HCTO (non-gn) based MLE is computa-
system which is based on the current observation such that
tionally less demanding than the same algorithms without Ẑt−1 =
t−1 X̂t−1 is defined as:
MLE. In order to highlight its improvement, HCTO was
also compared with the existing (unconstrained) nonlin- X̂t = t X̂t−1 + Lt Zt−1 − Ẑt−1
ear estimation methods such as PF and Unscented Kalman
Filter (UKF). The results from experimental data and the = t X̂t−1 + Lt
t−1 Xt−1 + t−1 −
t−1 X̂t−1 (4)
statistical evaluation confirm that HCTO presents higher where Lt is the gain matrix to be determined later. Let us
accuracy estimation and lower root mean-squared error now consider that the following assumption holds:
(RMSE) for vehicle state when noises are particularly non-
Gaussian distributed. Assumption 1. Assume that the process noise t and the
The structure of this paper is as follows: Section 1 measurement noise t are non-Gaussian distributed and
presents the related works, the objectives and contribution. follow the generalized error distribution (GED).
The problem statement is described in Section 2, while In this paper, the GED is adopted as an approxi-
Section 3 is devoted to the multi-objective optimization mation to non-Gaussian densities with the intention of
problem introduction where the hierarchical technique for addressing the non-Gaussian noises. The main advantage
tri-objective optimization problem (TOP) solution and its of Aug
GED2018 relies on some important properties that are
IP: 88.198.3.13 On: Thu, 09 04:56:53
application on the state vehicle estimates are also involved. related to shape
Copyright: American Scientific Publishers parameter which, when varying, provides
RESEARCH ARTICLE
Figure 1 demonstrates the proposition in a graphical rep- that the symbol · stands for the Euclidean norm and the
resentation. We plot the curves showing different shape matrices R and Q are also assumed to be positive definite
values where when the shape value vanishes (g = 0), the noise covariance matrices and are relative to the system
non-Gaussian distribution, GED, approaches the Gaussian and measurement models respectively.
distribution and is represented in green color.
Based on (7) and Assumption 2, the resulting state esti-
On the other hand, the tail distribution gets thinner as g
mation problem can be formulated as a nonlinear program-
increases positively and gets thicker as g increases nega-
ming problem (NLP):
tively. For the proof of the Proposition 1, see Appendix A.
In general, comparing to Gaussian distribution, the ˆ =
min t + t + Gt (8)
non-Gaussian distributions do not have an analytically t t Xt
RESEARCH ARTICLE
functions and this stands for the multi-objective optimiza-
Delivered by Ingenta
tion problem (MOP).23
3. MULTI-OBJECTIVE OPTIMIZATION In this paper, we focus on a tri-objective optimization
PROBLEM problem (TOP), i.e., MOP with three objective functions
Consider also that the following assumption holds: where the hierarchical method to achieve this tri-objective
optimization is adopted. The hierarchical multi-objective
Assumption 2. Assume that the problem satisfying the optimization (HMO) efficiently solves problems with a
least square formulation is = t + t + Gt such hierarchical structure among the objectives thus; a Pareto
front is not needed because tradeoff information is not
required.24 In case of two objectives for example, the sec-
1.4
g = –0.8 ond objective is optimized while keeping the optimized
1.2 g=0 value of the first objective fixed as presented in the fol-
g=1 lowing formulation:25
g = 1.5
1 g=2
min / max 2 X1T
GED(α, g, µ, σ)
X1T
0.8 ⎧
⎪
⎪ f X X = 0 t = 1 T
0.6 ⎨ t t−1 t (9)
subject to ht Xt ≤ 0 t = 0 T − 1
⎪
⎪
0.4 ⎩ ∗
1 − 1 X1T ≤
0.2 where the parameter > 0 has the small value compared to
∗1 which is, in turn, the optimized value of 1 computed
0
–10 –5 0 5 10 from the primary objective optimization. In case of multi-
α ple objective functions (i.e., more than two), the problem
Fig. 1. The generalized error distribution with
= 0 = 1 and dif- optimization can be presented in this way: firstly, the opti-
ferent values of the shape b. The curve (g = 0) represents the Gaussian mizers of the first objective function are found; and then
distribution of the process noise t in −10 10, for example. the optimizers of the second most important objective are
searched for, and so on until all the objective functions matrices R and Q are estimated in this subsection via the
have been optimized on smaller sets.26 maximum likelihood estimation (MLE) method.
Hierarchical multi-objective optimization (HMO) is 3.1.1.1 Estimation of the Noise Sequences t and t
used as a benchmark method in this paper and is referred Using MLE Method. In this paper, the method of max-
to as the hierarchical constrained tri-objective optimiza- imum likelihood estimation (MLE) is adopted since for
tion (HCTO) given that the global problem, in our case a given set of data and underlying statistical model, the
includes three sub-objectives intending to optimize (mini- MLE picks out the set of values of the model parame-
mize) process and measurement noises as well as the state ters that maximizes the likelihood function. This method
error respectively. is the most attractive; thanks to its large sample or asymp-
totic properties27 comparing to other statistical estimation
3.1. Hierarchical Technique for Tri-Objective techniques.28 Moreover, MLE is a good estimator for the
Optimization Problem (TOP) Solution unknown but fixed parameters. For each sample D, con-
Based on previously stated Assumptions 1 and 2, the sider b a parameter value at which L b attains its
hierarchical method consists of minimizing the global maximum as function of . A maximum likelihood esti-
mator of the parameter based on D is b. ˆ Then, if
problem (8) which is divided into three smaller sub-
problems: 1 = t , 2 = t and 3 = Gt . These the likelihood function is C 2 , the MLE of i are them ’s
sub-problems are solved separately under a particular pri- which maximize the likelihood function and the necessary
ority as presented in the following system: conditions for an optimum are given by:
min = min 1 2 3 (10) L1 2 m b1 b2 bN = 0 (11)
X i
˘ 1T = min 1 1T = min t s.t. (8.2) (10.1) where b = b1 b2 bN T and = 1 2 m T and
such that
˘ 1T = min 2 1T = min t s.t. (8.3) (10.2)
L1 2 l b1 b2 bn
Ĝ1T = min 3 G1T = min Gt (10.3)
Gt >0
n
ăt − at ≤ at ∈ t ⊆ I R n MLE
(10.5) by Ingenta
Delivered is equivalent to the maximum log-likelihood estima-
tion which is provided by:
b̆t − bt ≤ bt ∈ t ⊆ I Rp (10.6)
l1 2 l b1 b2 bN
In order to achieve the optimal solution of our global prob-
n
lem (), we need to find the optimal solution of each = logf bi 1 2 m (13)
sub-problems (1 , 2 and 3 and then, through an effec- i=1
tive procedure, all these solutions are aggregated. Indeed, Let now determine the MLE of the mean
t under the
this technique allows us to first minimize the process noise assumption that g and t are known. According to (5a),
represented by 1 = t and then the measurement noise (5b), (11)–(13), the estimated mean
ˆ of
and
ˆ of
given by 2 = t subject to (8.2) and (8.3) and lastly 3
are given by:
will be considered. Then, by computing the sequence of
Gt 0 < t ≤ T − 1 in 3 , we want to find X̂t , the optimal
N
i
ˆ = t −
t 1−g/1+g for g = −1 1 (14a)
solution of our main problem. As one can see, in order i=1
to complete the characteristics of the hierarchical method,
N
the constraints (10.5) and (10.6) which are defined based i
ˆ = t −
t 1−g/1+g for g = −1 1 (14b)
on the obtained optimal solutions of 1 and 2 are added i=1
to the objective function 3 . The considered three-levels For the proofs of (14a) and (14b), see Appendix B.
(L1 , L2 and L3 of the hierarchical optimization problem Moreover, the estimated variances ˆ 2 and ˆ 2 of 2 ,
for the two main tasks is summarized in Figure 2. under the assumption that g and
t are known are
This importance order is motivated by the observation given by:
that the accuracy of state estimator is largely influenced i
by the process noise and the measurement covariance 2J g Ni=1 t −
ˆ 2/1+g
ˆ =
2
for g = −1 (15a)
matrices. N 1 + g
i
2J g Ni=1 t −
ˆ 2/1+g
3.1.1. Estimation of Process and Measurement Noises ˆ =
2
for g = −1 (15b)
Since the considered non-Gaussian distribution does not N 1 + g
have an analytically tractable solution, the weighting For the proofs of (15a) and (15b), see Appendix C.
⎛ 2 ⎞
From the above equations, it can be seen that the esti- ˆ
mated variance decreases as the shape parameter increases. ⎜ N 0 ⎟
= ⎜ ⎟ (17a)
1 2
Indeed, assume that g and g are two different shape ⎝ 2 ˆ 4 ⎠
1 2
parameters such that g < g , then, based on (15a) or (15b), 0
N
the variances are such that ˆ g21 > ˆ g22 , due to the presence
of g at the denominator of the fractions. This generates a var
ˆ cov
ˆ ˆ 2
direct impact on the covariance matrix and the latter will Q̂ =
be denoted thereafter variance-covariance matrix. The esti- cov
ˆ ˆ 2 varˆ 2
mated PDFs of the process and measurement noises are ⎛ 2 ⎞−1
logLt 2 logLt
IP: 88.198.3.13 On: Thu, 09 Aug 2018 04:56:53
⎜
ˆ
ˆ
therefore defined respectively by (16a) and (16b):
Copyright: American Scientific ⎜ Publishers
ˆ ˆ 2 ⎟ ⎟
RESEARCH ARTICLE
= ⎜ ⎟
lt −
ˆ t 2/1+g Delivered by Ingenta⎝ 2 logLt 2 logLt ⎠
pt g = Mg ˆ t exp −J g
−2 (16a)
ˆ t
ˆ ˆ 2 ˆ 2 ˆ 2
l ⎛ N ⎞−1 ⎛ ⎞−1
−
ˆ t 2/1+g N
pt g = Mg ˆ t−2 exp −J g t (16b) 0 0
ˆ t ⎜ ˆ 2
⎜
⎟
⎟
⎜ ˆ 2
⎜
⎟
⎟
=⎜ ⎟ = ⎜ ⎟
The variance-covariance matrix of the maximum likeli- ⎝ N ˆ 2
N ⎠ ⎝ N ⎠
0 − 4 0
hood estimates is the Hessian matrix which is the inverse ˆ
6
2ˆ 2ˆ
4
3.1.1.2 Complexity Analysis of ML Estimation. The constraints (8.3) and (8.4) and will be denoted ˘ and ˘
maximum likelihood (ML) discriminant function V in after optimization.
terms of the estimated mean vector
ˆ and variance- ˘ R̆ and ˘ ∼
Furthermore, the optimized ˘ ∼
˘ Q̆
covariance matrix R̂ for example, is provided by: will be taken into account for additional constraints of
3 where R̆ and Q̆ are the optimized variance-covariance
V R̂
ˆ = N logMg+logR̂−J g matrices related to the process and measurement noises.
k
where R̆ and Q̆ are the optimized covariance matrices from where k X̂t−1 = t Et−1 −Lt
t−1 Xt−1 −
t−1 X̂t−1 +
the previous objective 1 and 2 functions. In terms of In×1 − Lt Ip×1 and det stands for determinant. The proof of
the vector , these inequalities become: this assumption is similar to the one provided previously
for (19a). Specifically, from this assumption, we deduce
diag1 0 −R̆−1
t−1 0 ≥ 0
T
that (19a) can be interpreted as the linear combination of
(23) (27.1) and is provided by:
−1
diag1 0 0 −Q̆t−1 T ≥ 0
K
Based on (23) and the nonnegative scalars 1 and 2 , one B= k B k ≥ 0 (28)
can get the equivalence of (21) as follows: k=1
diag1 − 1 − 2 0 1 R̆−1 −1 where k ≥ 0 and Kk=1 k = 1.
t−1 2 Q̆t−1
Given that the inequalities (27.1) are linear to the param-
−X̂t−1 T T G−1
t X̂t−1 ≥ 0 (24) eters Gt , Lt , 1 and 2 , the problem (27) can be solved
by interior-point methods for semidefinite programming
Equation (24) is then equivalent to: (SDP).21 Finally, with the intention of getting the smallest
error for the state estimate, the determinant of the covari-
− X̂t−1 T G−1
t X̂t−1 ≥ 0 (25) ance matrix Gt is minimized at each time step.
Moreover, multiplying by Gt the two sides of (25) yields 3.2. The Proposed Hierarchical Constrained
Tri-Objective Algorithm for Vehicle
Gt − X̂t−1 X̂t−1 ≥ 0
T
(26)
State Estimates
Finally, applying Schur complements method on (26); 30 Our proposal aims to estimate the vehicle state using the
we get the LMI provided in (19.1): optimization of the process and measurement noises as
well as the error state via the hierarchical constrained tri-
objective optimization (HCTO) algorithm. Moreover, the
Gt X̂t−1
≥ 0 Q.E.D. input to HCTO is the initial set of values including dif-
X̂t−1 T ferent parameters related to the noises and the state error
IP: 88.198.3.13 On: Thu, 09 Aug 2018problems
optimization 04:56:53as well as the initial vehicle state
This proof follows a similar approachCopyright: to Ref. [1]American
except Scientific Publishers
RESEARCH ARTICLE
that comprises the longitude, latitude, velocity and accel-
that the considered system in our case does not contain Delivered
the byeration
Ingenta
provided by sensors embedded in the Smartphone.
uncertainty model. To summarize, we list the steps involved in HCTO algo-
Depending on the specific objective function, several rithm to compute the estimated vehicle state measurement
different optimization criteria, including the determinant, as t increases:
trace, and maximum eigenvalues of the covariance matrix; 1. Initialization: At time t = 0;
have been developed in the literature [13]. There are some 1.1. Set initial values X0
0
0 R0 Q0 G0 which
attractive relations between geometric properties of the represent the initial vehicle state, initial mean vectors
ellipsoid and algebraic properties of the covariance matrix. and covariance matrices related to the process and mea-
Indeed, the lengths of the axes for the ellipsoid are propor- surement noises and initial upper bound for the state
tional to the eigenvalues of the covariance matrix whereas estimation error respectively;
the trace of the covariance matrix is the sum of the length 1.2. Set the process and the measurement matrices
of the axes, and the determinant represents the volume of and
, time T , weight constraints associated with the
the ellipsoid. Since the constraint (10.4) that defines the noises and the shape parameter of GED g;
upper bound for the state estimation error is considered as 2. For t = 1 T , do
a positive definite, the determinant or trace can be cho- 1
3. Find ˘ t = ă1 ă1 T
˘ t = min 1 ˆ t =
31 n such that
sen as optimization criteria for the matrices measure. Let min ˆ t , via MLE of t subject to trRt−1 ≤ ;
us assume that the ellipsoid X̂t Gt parameterized by
4. Compute PDF pt g via ˘ t ∼ GED
˘ t R̆t−1
X̂t and Gt contains the polytope with K vertices; then the
using (5a);
optimization problem (19) subject to (19a) can be refor-
5. Find ˘ t = b̆1 b̆p2 T such that ˘ t = min 2 ˆ t =
2
mulated as follows:
min ˆ t , via MLE of t subject to trQt ≤ ;
˘3 = min detGt (27) 6. Compute PDF pt g via ˘ t ∼ GED
˘ t Q̆t using (5b);
Gt >0 Lt 1 ≥0 2 ≥0
7. Set the parameters Lt , t ,1 and 2 ;
G t k
X̂ t−1 8. Find the optimal X̆t such that 3 Gt = min detGt
s.t. B k = ≥ 0 subject to (28) using SDP;21
k X̂t−1 T 9. Explore the additional constraints (10.5) and (10.6)
k = 1K 271 according to (22);
10. Update detGt ; therefore called HCTO (non-gn) and HCTO (gn) respec-
11. End for tively, where “non-gn” stands for “non-Gaussian noise”
and “gn” for “Gaussian noise.” We also compared the
4. EXPERIMENTAL RESULTS performance of HCTO method by taking as references
the most nonlinear estimation methods extensively used in
In order to experimentally validate the effectiveness of
the literature such as Particle filter (PF)35 which does not
our proposed HCTO method, the vehicle state was esti-
require the noise to be Gaussian and Unscented Kalman
mated in real-setting experiments. Indeed, the test vehicle
Filter (KF)36 which is assumed to successfully approxi-
was driven along different roads in Hunan University area
mate a Gaussian distribution of the system.
(an open air environment) with different velocities for
Figures 3 and 4 present a comparison of the state esti-
about 5 minutes. A Smartphone, Samsung Galaxy S4, on
mation methods from the two alternatives as well as the PF
board the vehicle was with Android OS v4.2.2 as operating
and UKF. For simplicity, the experiments were conducted
system. This device not only comprises an Assisted-Global
only for PF and UKF when noises are non-Gaussian dis-
Positioning System (A-GPS) support and GLONASS but
tributed and Gaussian distributed in order to make bet-
it also includes the usual accelerometer, gyroscope, prox-
ter comparison with HCTO (non-gn) and HCTO (gn)
imity, compass and ambient light sensors for improv-
respectively.
ing urban navigation performance. Data from Smartphone
From Figures 3 and 4, one can see that defining the pro-
were uploaded into a Laptop computer and converted to
cess and measurement noises as non-Gaussian model in
excel spreadsheets.
HCTO (g = 2) increases notably the vehicle state accuracy
Moreover, although the device comprises two naviga-
because, in this case, the estimated variance-covariance
tion systems, data from different satellites in view were
matrix based MLE which represents the noise weight
collected using only A-GPS during the road experiments.
become smaller.
This new advanced technology based on mobile computing
In addition, even though UKF can favorably tackle the
system has gained a large popularity nowadays in various
32 Gaussian noises, HCTO (gn) presents better vehicle state
applications such as in target localization and tracking
accuracy. In fact, the constraints used for dealing the pro-
systems.33 Other benefits of choosing the sensors embed-
cess and measurement noises makes HCTO (gn) well con-
ded in Smartphone over the ones on-board the vehicle for
ditioned since the constrained view leads us to forcing
vehicle positioning can also be found in Ref. [4].33
IP: 88.198.3.13 On: Thu, 09theAugtrace2018
of the04:56:53
estimated noise covariance matrices to the
Copyright: American Scientific
boundary,Publishers
= 1. This allows it to increase the state accu-
RESEARCH ARTICLE
true
1129415 281827 34885 08200 as initial values 112.95
HCTO (non-gn)
HCTO(gn)
PF
which represent respectively the initial longitude [deg], 112.945 UKF
2
latitude [deg], velocity [m/s], and acceleration [m/s ].
112.94
This implies that the dimension of the state is n = 4.
112.935
To achieve the better accuracy using the proposed 0 50 100 150 200 250 300
method, different parameters are set as follows: the Time(s)
interval time t is set to 1 s,
0 =
0 to 01 01 28.2
true
Latitude(Deg)
2 2 2 2 HCTO (non-gn)
01 01, R0 to diag002 001 10 10 , Q0 to 28.195 HCTO(gn)
PF
2 2 2
diag01 10 002 002 , G0 to diag10 10 00 10 28.19 UKF
30 9
true
HCTO (non-gn) shape=0.5
Velocity(m/s)
20 HCTO(gn) shape=1
PF 8 shape=3
UKF shape=5
10 shape=8
7
0
6
–10
0 50 100 150 200 250 300
RMSE
5
Time(s)
40 4
Acceleration(m/s2)
true
HCTO (non-gn)
HCTO(gn) 3
20 PF
UKF
2
0
1
–20
0 50 100 150 200 250 300 0
Longitude Latitude Velocity Acceleration
Time(s)
Vehicle state
Fig. 4. It depicts the actual and the estimated vehicle state in terms of
velocity and acceleration using HCTO (non-gn), HCTO (gn), PF, and Fig. 6. Comparison of the vehicle state estimation in terms of RMSE
UKF. based on HCTO with different values of the shape.
RESEARCH ARTICLE
Figure 6 highlights the performance of different algo- byInIngenta
Delivered fact, given sufficient number of samples (1500 in our
rithms used in this work in terms of RMSE whereas case), PF can successfully handle the process and mea-
Figure 6 illustrates the comparison of the vehicle state esti- surement noise variance and this decreases the RMSE.37
mation based on HCTO with different values of the shape It should be specified however that in terms of computa-
parameter of GED. Figure 5 indeed plots the RMSE for tional time, the UKF is a considerably faster tool than the
all adopted estimation methods based on the components PF technique given that, the latter requires an important
of the vehicle position (latitude and longitude) as well as amount of samples to be more accurate and this makes
its velocity and acceleration. Recall that low RMSE imply it more computer-intensive.11 Furthermore, the difference
between HCTO (gn), g = 0 and HCTO (non-gn), g = 2 in
20 terms of RMSE is related to the estimated large process
Longitude (deg) and measurement noise variance (or covariance matrix)
18 Latitude (deg)
Velocity (ms–1)
of HCTO (gn) which makes the method inefficient and
16 therefore produces the large value of RMSE. What’s more,
Acceleration (ms–2)
14 notice that RMSE becomes smaller as the shape parameter
12
value increases.
To determine whether this conclusion is consistent
RMSE
10
across different values, we analyzed how the experimental
8 results vary when tackling other different values; more pre-
6 cisely, the behavior of HCTO by setting the shape param-
eter value g ∈ 05 1 3 5 8 was studied as illustrated
4
in Figure 6. Outstandingly, the performance improvements
2 of the proposed method in terms of RMSE for the vehi-
0 cle state are particularly important when handling larger
HCTO (non-gn) HCTO (gn) PF UKF
shape parameter values which in turn decrease the esti-
State estimation methods mated weight (covariance) of the process and measurement
Fig. 5. Comparison of the state estimation methods in terms of RMSE noises implemented in the first two objective functions of
related to the vehicle state. HCTO.
4.3. Computational Complexity obvious that the use of the latter for solving the vehicle
The influence of the generalized error distribution (GED) state estimation problems in non-Gaussian environment is
on HCTO algorithm is finally evaluated based on the time warranted.
complexity of MLE. The simulation was conducted using
MATLAB as the data processing software installed in an
5. CONCLUSION
X86-based PC with a CPU clock speed of 2.70 GHz and
This paper investigated the problem of using a hierarchical
2 GB of RAM. As specified in subsection 3.1.1. (b); thanks
tri-objective optimization method to estimate the vehicle
to the MLE, the cost of the original GED is reduced
from On2 ∗ N computation to On ∗ N where N = 500 state. The main advantage of the proposed method is that
represents the number of samples and n is the sample it can reduce the complexity of the problem by solving
dimension. several smaller sub-problems, which in turn yields a reduc-
Figure 7 in fact, illustrates the average execution times tion of the computational cost of the global problem. This
(in terms of CPU time) for estimating the vehicle state method was tested under the assumption that the process
using HCTO (non-gn) and HCTO (gn) in presence and and measurement noises are non-Gaussian and Gaussian
absence of MLE for different numbers of samples. From distributed and was also compared with the existing esti-
this comparison, two observations are made: mation methods. Experimental results confirm that HCTO
(1) The execution time associated to both HCTO (non-gn) presents higher accuracy estimation and lower RMSE for
and HCTO (gn) without MLE is more computer-intensive vehicle state when the process and measurement noises
than HCTO in presence of MLE; are particularly non-Gaussian distributed. Moreover, it was
(2) In presence of MLE, the execution time using HCTO demonstrated that the proposed method HCTO in presence
(non-gn) where the shape parameter g = 2 is less of MLE is computationally less demanding than HCTO
computer-intensive than HCTO (gn) where the shape without MLE and the value variation of the shape param-
parameter g = 0. eter of GED also influences the computational complexity.
This implies that the weight of the process and measure- Our proposed method was tested only in one scenario, on
ment noise expressed in terms of the estimated variance- vehicle information collected in outdoor environment. In
covariance (using MLE) influences the execution time of our future work, we plan to improve the proposed method
the proposed method. by taking into account another scenario, indoor environ-
IP: 88.198.3.13 On: Thu, 09 mentAug 2018GPS
where 04:56:53
signals are too weak or absent. In addi-
Finally, we find that the aforementioned results
Copyright: from Scientific
American Publishers
RESEARCH ARTICLE
HCTO (non-gn)
t −
t 2
HCTO (non-gn) without MLE −1
= M0t exp −J 0 (A.1)
t
2
1
where
0 √
0 50 100 150 200 250 300 350 400 450 500 3/21/2 1/2 1/2 1
Number of samples M0 = = √ 3/2 = √
1/23/2 2
5 shape = 0
× 10
4 and √
Execution time (s)
N × it −
t 2/1+g = 0
L= pit g t
t = p1t 2t Nt i=1
J g
i=1 N
1 N
t −
t 2/1+g ⇔− + i −
t 2/1+g = 0
−1 N
= Mgt exp −J g 2 1 + gt2 i=1 t
t
2 In case of the process noise, its estimated variance is there-
−
t 2/1+g fore given by
× exp −J g t
t 2J g
N
N ˆ 2 = i −
ˆ 2/1+g
t −
t 2/1+g N 1 + g i=1 t
× exp −J g
t as stated in (16a).
N i
t −
t 2/1+g Similarly, the estimated variance related to the measure-
−1 N
= Mgt exp −J g
i=1 t ment noise is given by:
2J g
N
The maximum log-likelihood estimation is defined as: ˆ 2 = i −
ˆ 2/1+g
i N 1 + g i=1 t
N −
t 2/1+g
log L = l = N logMgt−1 − J g t as stated in (16b). Q.E.D
i=1
t
The MLE of the means
and
related to the process Acknowledgment: This work was partly supported
and measurement noises are obtained by using (12): by National Natural Science Foundations of China
(Nos. 61272061 and 61301148), the fundamental
−1 research funds for the central universities of China
log L = N logMgt
(Nos. 531107040263, 531107040276), the Research Funds
IP: 2/1+g On: Thu, 09
88.198.3.13 for Aug
the 2018
Doctoral Program of Higher Education of
04:56:53
N −
t
i
−
J g t Copyright: =
American
0 Scientific Publishers
China (Nos. 20120161120019 and 20130161110002)
t
RESEARCH ARTICLE
i=1 Delivered byand
Ingenta
the Hunan Natural Science Foundations of China
N i 2/1+g (Nos. 10JJ5069 and 14JJ7023).
t −
t
⇔
i=1 t
References
N
1. F. Yang, Y. Li, and X. Liu, IEEE Signal Processing Letters 15, 930
= it −
t 1−g/1+g
=0 (2008).
i=1
2. K. György, A. Kelemen, and L. Dávid, Procedia Technology 12, 65
Then, the estimated means
ˆ and
ˆ of
and
(2014).
3. S. Rezaei and R. Sengupta, Proc. IEEE Int. Conf. Mechatronics
are provided by
ˆ = Ni=1 it −
t 1−g/1+g , and
ˆ =
N Autom., Niagara Falls, Canada, (2005), pp. 455–460.
i=1 t −
t , for g = −1 1 respectively as
i 1−g/1+g
4. J. Almazan, IEEE Intelligent Vehicles Symposium (IV), Gold Coast,
stated in (15a) and (15b). Q.E.D Australia (2013), pp. 1374–1381.
5. X. Chen, Applied Mathematics 3, 2056 (2012).
6. J. Chen, L. Cheng, and M. Gan, Acta Automatica Sinica 39, 1 (2013).
Appendix C: Proof of (16a) and (16b)
7. R. H. Mohseni, A. Baker, T. Z. Aziz, and P. Probert-Smith,
By using (12), the MLE of the variances 2 and 2 of NeuroImage 87, 444 (2014).
2 related to the process and measurement noises is as 8. A. F. Khan, S. Y. Muhammad, and B. B. Khalid, Computational and
follows: Mathematical Methods in Medicine 2015, 1 (2015).
9. A. R. A. Bacha, D. Gruyer, and A. Lambert, Positioning 4, 271
log L = N logMgt2 −1/2 (2013).
t2 t2 10. Z. Jing, L. Han-Wen, and J. Rong-hong, IEEE, Wireless Communi-
14. R. T. Marler and S. J. Arora, Struct. Multidisc. Optim. 41, 853 (2010). 26. M. Caramia and P. Dell’Olmo, Springer, New York (2008).
15. A. G. Arrondo, J. L. Redondo, J. Fernández, and P. M. Ortigosa, 27. L. Boccato, R. Krummenauer, R. Attux, and A. Lopes, Signal Pro-
Applied Mathematics and Computation 255, 114 (2015). cessing 92, 1338 (2012).
16. K. Khalili-Damghani, A. Abtahi, and M. Tavana, Reliability Engi- 28. J. Mazucheli, F. Louzada, and M. E. Ghitany, Applied Mathematics
neering and System Safety 11, 58 (2013). and Computation 220, 463 (2013).
17. H. Ishibuchi and Y. Nojima, Lecture Notes in Computer Science 29. M. Magdon-Ismail and T. Jonathan Purnell, Intelligent Data Engi-
4403, 51 (2007). neering and Automated Learning 6283, 300 (2010).
18. D. Xu, C. Shen, and F. Shen, IEEE Signal Processing Letters 21, 30 30. Y. Shao-Wen, Journal of Applied Mathematics 2013, 1 (2013).
(2014). 31. A. Benavoli, L Chisci, and F. Alfonso, IEEE Transactions on Signal
19. Z. Zhang, Journal of Applied Statistics 40, 1779 (2013). Processing 55, 1264 (2007).
20. W. Li and Y. Jiaa, Signal Processing 92, 2464 (2012). 32. S. Lee, Y. Chon, and H. Cha, Mobile Information Systems 9, 123
21. K. Ali, M. Malek-Mohammadia, M. Babaie-Zadeha, and (2013).
M. Skoglund, Signal Processing 108, 69 (2015). 33. O. Walter, J. Schmalenstroeer, A. Engler, and R. Haeb-Umbach,
22. W. H. William, L. Yong, and F. W. Tan, Linear Algebra and Its Smartphone-based sensor fusion for improved vehicular naviga-
Applications 416, 815 (2006). tion, 10th Workshop on Positioning Navigation and Communication,
23. A. Barolli, E. Spaho, L. Barolli, F. Xhafa, and M. Takizawa, Mobile Dresden, Germany, March (2013), pp. 1–6.
Information Systems 7, 169 (2011). 34. L. Guo and H. Wang, IEEE Trans. Autom. Control 51, 695 (2006).
24. H. Louie and K. Strunz, IEEE Transactions on Power Systems 35. J. Read, K. Achutegui, and J. Míguez, Signal Processing 98, 121
21, 1583 (2006). (2014).
25. R. M. Fonseca, O. Leeuwenburgh, P. M. J. Van den Hof, and J. D. 36. H. Zhang, G. Dai, J. Sun, and Y. Zhao, Optik 124, 4468 (2013).
Jansen, Computation Geosciences, Springer, Switzerland (2014), 37. L. Kung-Chung, A. Oka, E. Pollakis, and L. Lampe, Positioning
pp. 449–461. Navigation and Communication (2010), pp. 157–163.
Delivered by Ingenta