# Soft Sensor of Vehicle State Estimation Based on the Kernel Principal Component and Improved Neural Network

Authors: Haorui Liu; Juan Yang; Heli Yang; Fengyan Yi
Journal: Journal of Sensors
 (2016)

---

## Abstract

In the car control systems, it is hard to measure some key vehicle states directly and accurately when running on the road and the cost of the measurement is high as well. To address these problems, a vehicle state estimation method based on the kernel principal component analysis and the improved Elman neural network is proposed. Combining with nonlinear vehicle model of three degrees of freedom (3 DOF), longitudinal, lateral, and yaw motion, this paper applies the method to the soft sensor of the vehicle states. The simulation results of the double lane change tested by Matlab/SIMULINK cosimulation prove the KPCA-IENN algorithm (kernel principal component algorithm and improved Elman neural network) to be quick and precise when tracking the vehicle states within the nonlinear area. This algorithm method can meet the software performance requirements of the vehicle states estimation in precision, tracking speed, noise suppression, and other aspects.


---

## Body

## 1. Introduction

Electronic control systems are increasingly being applied to modern vehicles to improve its safety, stability, and comfort. Electronic stability program (ESP), four wheel steering (4WS), and active steering control (ASC) improve the handling stability of a vehicle by controlling the body lateral and yawing motion. Active roll control (ARC) and active body control (ABC) improve the driving comfort by controlling the vertical movement and roll stability. The premise condition to realize the particular functions of these electronic control systems is to obtain accurate state parameters of vehicle when car is running on the road. Those parameters include vertical speed, lateral acceleration, yaw velocity, sideslip angle, and so on. Due to the measuring technology and its cost, it is quite a challenge to measure all the important state variables directly. At present, the soft sensor technology based on state estimation has been successfully applied to the estimation of vehicle dynamics and kinematics parameter information. Venhovens and Naab [1] and Gustafsson et al. [2] estimated the lateral acceleration, yaw velocity, tire force, and road tire friction coefficient by using Kalman filter (KF). Wenzel et al. [3, 4] estimate vehicle’s state variables and parametric variables by adopting dual extended Kalman filter parallel estimating method. Some other scholars use Luenberger observer and sliding mode observer to estimate sideslip angle and yawing force. Among all these estimation algorithms, the state estimation method based on KF is the most widely applied and has achieved relatively better results in field tests. However, the design difficulties of the KF algorithm are (1) the requirement of accurate knowledge for the model of the system observed; (2) the requirement of the statistical properties of the known system noise and the measurement noise.Principal component analysis (PCA) is a kind of linear algorithm. It only considers the second-order statistics and can only extract the linear relation of the data. When nonlinear relation exists among a large number of variables of a nonlinear system, the principal component analysis (PCA) will not meet the requirements any more. While the kernel principal component analysis (KPCA) is a nonlinear extension of the principal component analysis (PCA) [5–7]. Through nonlinear mapping, it transfers the original data from data space into feature space and then determines the principal components in high dimensional feature space through principal component analysis (PCA). Thus it has a strong capability of nonlinear approximation.Literature [8] did the clustering by altering the objective function in the FCM-AWA algorithm using kernel distance to improve the classification accuracy under noise circumstance. Literatures [9, 10] introduced Mexican hat wavelet function into the kernel principal component analysis (KPCA) and presented a feature reduction method based on wavelet kernel-PCA (WK-PCA). This method can identify and diagnose the rotor fault modes rapidly and efficiently. Literature [11] proposed the Bayes Support Vector Machine estimation method with high forecasting accuracy and robustness.Elman neural network is based on BP network. It improves the network’s processing capability of dynamic information by adding a context node. This thesis proposes a new vehicle state estimation method based on the modified Elman neural network. This method uses error analysis to adjust the gain factors in real time, thereby achieving real time updating of the network structure.The paper comes up with a soft sensor modeling method based on the kernel principal component analysis and the modified Elman neural network by combining Mahalanobis Distance, the kernel principal component analysis (KPCA), and the modified Elman neural network. When used in the soft sensor of the key states such as the vehicle’s yaw rate, this method is proved to have higher forecasting accuracy in simulation tests and satisfied the software performance requirements of the vehicle states estimator.


## 2. Vehicle Model and Principles of KPCA-IENN

### 2.1. Nonlinear Dynamic Model of Vehicle

The 2-DOF model used to analyze the vehicle’s yaw motion and lateral motion is a linear model, which is on the assumption that the vehicle is driving in uniform velocity. But in reality, longitudinal velocity is subject to change at any time and this changing longitudinal velocity has a significant impact on the yaw and lateral motion and constitutes a nonlinear relation among the state variables. This paper established the vehicle state estimation soft sensor model based on the longitudinal, lateral, and yaw 3-DOF nonlinear vehicle model. Figure1 is the 3-DOF vehicle dynamic model.Figure 1
3-DOF vehicle dynamic model.As is shown in Figure1, X
a
O
a
Y
a is an absolute coordinate system fixed in the horizontal plane, and the x
o
y is the vehicle coordinate fixed on the gravity center, where the x axis overlaps with the vehicle’s longitudinal axis and is positive toward the direction of the vehicle movement; y axis is through the vehicle gravity center o and is positive to the left. All the angles and torques within the plane of X
a
O
a
Y
a are positive counter-clockwise and all the components of vectors are positive with the axis direction. The state equations and measurement equations of vehicle nonlinear dynamic model of 3 DOF are shown as(1)
ω
˙
=
-
l
f
2
C
f
+
l
r
2
C
r
I
z
ω
˙
v
1
+
l
r
C
r
+
l
f
C
f
I
z
β
+
l
f
C
f
I
z
δ
f
,
β
˙
=
l
r
C
r
-
l
f
C
f
-
m
v
x
2
m
ω
˙
v
x
2
-
C
f
+
C
r
m
β
v
x
+
C
f
m
δ
f
v
x
,
v
˙
x
=
ω
β
v
x
+
a
x
,
a
y
=
l
r
C
r
-
l
f
C
f
m
ω
v
x
-
l
f
+
l
r
m
β
+
l
f
m
δ
f
.In the equation,ω is the yaw velocity; β is the sideslip angle; v
x is the longitudinal velocity; δ
f is the front wheel angle; a
y is the lateral acceleration; a
x is the longitudinal acceleration; m is the vehicle mass; I
z is the moment of inertia about the z-axis; l
f is front wheelbase; l
r is the rear wheelbase; C
f is the front wheel effective cornering stiffness; C
r is the rear wheel cornering stiffness.With the steering wheel angle as control input and the steering wheel to the front wheel angle transmission ratioi
=
16, we get(2)
δ
s
w
=
i
δ
f
.


### 2.2. Soft Sensor Technology

Soft sensor technology is also named soft instrument technology [7]. The basic principle is to get the estimation value of the primary variables through the establishment of the mathematical model by using those easily detectable assistant variables that are closely related to those primary variables of difficult detection. The commonly used methods for soft sensor technology include the mechanism analysis modeling, the regression analysis, state estimation, pattern recognition, neural networks, fuzzy mathematics, process tomography, the correlation analysis, and so forth. The state estimation based soft sensor technique adopted in this thesis deducted the estimation of the primary variables using detectable information and the algorithm (the kernel principal component analysis and the improved Elman neural network). The technique realized the measurement for the state parameters that are otherwise hard to measure by conventional method. Figure 2 is the vehicle state estimation system based on soft sensor technique. In Figure 2, w, v, and u represent measurable process noise, measurement noise, and control variable, respectively. y
(
k
) and y
^
(
k
) are the real value and estimated value of the object outputs, respectively. x
^
(
k
) is the estimated value of the object state with the discrete moments k
=
0
,
1
,
2
,
….Figure 2
Block diagram of vehicle state estimation system.


### 2.3. The Reduction of the Feature Parameters Based on the Kernel Principal Component Analysis

The basic idea of the kernel principal component analysis is to implicitly map the data in input space to feature space through kernel function and then to process the kernel principal component analysis in the feature space. This is a powerful approach of extracting nonlinear features, realizing the reduction of the feature parameters, reducing of data redundancy, and getting the primary feature vectors with low classification error rate and high sensitivity with the driving conditions.


#### 2.3.1. The Selection of Feature Parameters

There are many feature parameters that can be used to represent the vehicle status, such as average running time, the average acceleration time, the average deceleration time, the average time of driving at uniform velocity, the average idling time, the average running distance, the maximal driving speed, the average speed, the standard deviation of speed, the maximum vehicle acceleration, the maximum vehicle deceleration, the average acceleration during the acceleration period, the average deceleration during the deceleration period, the standard deviation of the acceleration, and the changing rate of the throttle opening. Firstly, this thesis reduces the feature parameters representing vehicle status via correlation analysis. In other words, it uses sequencesx
(
n
) and y
(
n
) to represent the feature parameters pair-wise respectively, in the equation, n
=
1,2
,
…
a
,
…
,
b
,
…. Choose any two time series when n
=
a
~
b and then compare the level of similarity of the two sequences according to (3)
r
=
∑
n
=
a
b
x
n
y
∗
n
∑
n
=
a
b
x
n
2
∑
n
=
a
b
y
n
2
1
/
2
.In the equation, “∗” is the conjugation of y
(
n
).Sort the above results of operation from highest irrelevance to the lowest and then make correlation analysis on the first 15 parameters and the categories of working condition. Then rate the correlation from high to low, and finally we get the 10 feature parameters as the classification standard for working conditions; they are the maximal driving speed, average speed, the minimum deceleration, the average acceleration, the uniform velocity time ratio, idling time ratio, the average acceleration during the acceleration period, the average deceleration during the deceleration period, the average degree of the throttle opening, and the time when the throttle opening degree is zero.


#### 2.3.2. The Reduction of the Feature Parameters Based on the Kernel Principal Component Analysis

Through nonlinear mappingφ, the kernel principal component analysis transfers the original data x
i
∈
R
q (i
=
1,2
,
…
,
M) from data space into the φ
(
x
i
) in a new high dimensional feature space F and then gets the nonlinear principal components which enables the original data to have better divisibility by using principal component analysis (PCA) on these after mapping data.The covariance matrix for the after mapping dataφ
(
x
i
) is as follows:(4)
C
=
1
M
∑
i
=
1
M
φ
x
i
φ
x
i
T
.If we set the eigenvalue for the covariance matrixC to be λ and the relative feature vector to be v, then(5)
λ
v
=
C
v
.For all thei
=
1,2
,
…
,
M, do dot-product of each after mapping sample φ
(
x
i
) with both sides of (5), respectively,(6)
λ
φ
x
i
·
v
=
φ
x
i
·
C
v
.Whenλ
≠
0, there is coefficient a
i (i
=
1,2
,
…
,
M); use linear combination of φ
(
x
i
) to represent feature vector v
(7)
v
=
∑
i
=
1
M
a
i
φ
x
i
.Substitute (4) and (7) into the above inner product formula, and then get(8)
λ
∑
i
=
1
M
a
i
φ
x
k
·
φ
x
i
=
1
M
∑
i
=
1
M
a
i
φ
x
k
·
∑
j
=
1
M
φ
x
j
φ
x
j
T
φ
x
i
.To avoid complex direct calculations, in the feature space, we define the elementsK
i
j of the symmetric matrix K as kernel function (9)
K
i
j
=
φ
x
i
·
φ
x
j
.In the equation,j
=
1
,
2
,
…
,
M.AsK is symmetric matrix, so (5) can be simplified as (10)
M
λ
a
=
K
a
.Solve (10); we will get the required eigenvalues λ
k and the feature vectors a
k (k
=
1,2
,
…
,
M). Reduce the system inputted feature parameters via the method of keeping the first p feature vectors. The eigenvalues of the diagonalized matrix K are denoted as λ
k
1
≥
λ
k
2
≥
⋯
≥
λ
k
M, if the number of the smallest nonzero eigenvalues for K is set to be p, and then with (9) and (10), we could get(11)
a
k
T
a
k
=
1
λ
k
.In the equation,k
=
1,2
,
…
,
p.The projection of the after mapping data on the feature vectorsv
k (k
=
1,2
,
…
,
p) is the nonlinear principal components of the original data x
i obtained through nonlinear mapping φ
(12)
ρ
k
=
v
k
·
φ
x
=
∑
i
=
1
M
a
i
k
φ
x
i
·
φ
x
=
∑
i
=
1
M
a
i
k
K
x
i
,
x
.In the equation,a
i
k is the ith coefficient of the kth eigenvalue of the matrix K for feature vector a
k.This thesis choosesK
i
j as Gaussian based radial basis function (13)
K
i
j
=
exp
⁡
-
x
i
-
x
j
2
2
σ
2
.In the equation,σ is the standard deviation.If the mapped data are non-zero mean, mean value method needs to be used on kernel function(14)
K
-
i
j
=
K
-
1
M
K
-
K
1
M
+
1
M
K
1
M
i
j
=
φ
x
i
·
φ
x
j
.In the equation,1
M are the M
×
M constant matrices with 1
/
M as its element; φ
(
x
i
) and φ
(
x
j
) are mapped data after being treated with mean value method.


### 2.4. Improved Elman Neural Network

#### 2.4.1. Modified Elman Neural Network

Elman regression neural network is a kind of typical dynamic neural network. Based on the feed forward neural network, it adds one more node, the context node. Through the delay and storage of the output of the hidden node by the context node, the output of the hidden node can self-link to the input of the hidden node, thereby enabling the network to be sensitive to the historical data, increasing the capacity of the network’s processing capability of dynamic information and realizing dynamic modeling.The characteristics of the existing modified Elman neural network is an added self-feedback connection with a fixed gain asα, so that the output of the context node at the time k equals the output of the hidden node at time k
-
1 plus α times of the output of the context node at the time k
-
1 [12]. Figure 3 shows the network structure. The difference between the original and the improved Elman network is the different values for α. But both are fixed values. This thesis proposes a determination method for variable gain α based on real time error analysis, which gives the network a better real time performance.Figure 3
Modified Elman neural network.Comparing with the standard Elman network, the modified Elman network not only has a more flexible approximation to high order system essentially but can also achieve the same effect as gained by the standard Elman network when it adopts dynamic BP algorithm training.The expressions between each layer of the modified Elman neural network are(15)
x
k
=
f
w
I
1
x
c
k
+
w
I
2
u
k
-
1
,
x
c
k
=
a
x
c
k
-
1
+
x
k
-
1
,
y
k
=
g
w
I
3
x
k
.In the equation, connection weightw
I
1 is the connection weight matrix of the context node and the hidden node; w
I
2 is the connection weight matrix of the input node and the hidden node; w
I
3 is the connection weight matrix of the hidden node and the output node; x
c
(
k
) and x
(
k
) represent the output of context node and the hidden node, respectively; y
(
k
) represents the output of the output node, with 0
≤
α
≤
1 as the self–join feedback gain factor. f
(
x
) and g
(
x
) are often hyperbolic tangent functions or sigmoid functions.


#### 2.4.2. Theα Value Determination of the Modified Elman Neural Network

By analyzing the equation (15), we know that the bigger the α value is, the greater the influence the output of the context node at time k
-
1 has on the output of the node at time k. Suppose the calculation result is y
(
k
) at the time k, and the true value is y
d
(
k
-
1
) and y
d
(
k
) at the time k
-
1 and the time k, respectively; then discuss the following 3 circumstances:(1)
wheny
d
(
k
-
1
)
<
y
d
(
k
): if y
(
k
)
<
y
d
(
k
-
1
), make a
(
k
+
1
)
=
0; if y
d
(
k
-
1
)
<
y
(
k
)
<
y
d
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
); if y
d
(
k
)
<
y
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1,
(2)
wheny
d
(
k
-
1
)
<
y
d
(
k
): if y
(
k
)
<
y
d
(
k
-
1
), make a
(
k
+
1
)
=
0; if y
d
(
k
-
1
)
<
y
(
k
)
<
y
d
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
); if y
d
(
k
)
<
y
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1,
(3)
wheny
d
(
k
-
1
)
=
y
d
(
k
): if y
(
k
)
<
y
d
(
k
), a
(
k
+
1
)
=
y
(
k
)
/
y
d
(
k
)
a
(
k
); if y
(
k
)
>
y
d
(
k
), a
(
k
+
1
)
=
y
(
k
)
/
y
d
(
k
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1.


#### 2.4.3. The Modified Elman Neural Network Learning Algorithm

The modified Elman neural network overall error objective function can be expressed as(16)
E
k
=
∑
p
=
1
m
E
p
k
,
E
p
k
=
1
2
y
d
k
-
y
k
T
y
d
k
-
y
k
.Calculating the partial derivatives ofE
p
(
k
) to weight values w
I
3, w
I
2, and w
I
1, we can get the gradient descent algorithm of the modified Elman neural network:(17)
Δ
ω
i
j
I
3
=
η
3
δ
i
0
x
j
k
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
,
Δ
ω
j
q
I
2
=
η
2
δ
j
h
u
q
k
-
1
j
=
1,2
,
…
,
n
;
q
=
1,2
,
…
,
r
,
Δ
ω
j
l
I
1
=
η
1
∑
i
=
1
m
δ
i
0
ω
i
j
I
3
∂
x
j
k
∂
ω
j
l
I
1
j
=
1,2
,
…
,
n
;
l
=
1,2
,
…
,
n
,
δ
i
0
=
y
d
,
i
k
-
y
i
k
g
i
′
·
δ
j
h
=
∑
i
=
1
m
δ
i
0
ω
i
j
I
3
f
j
′
·
∂
x
j
k
∂
ω
j
l
I
1
=
f
j
′
·
x
l
k
-
1
+
a
∂
x
j
k
-
1
∂
w
j
l
I
1
j
=
1,2
,
…
,
n
;
l
=
1,2
,
…
,
n
.In the equation,η
1, η
2, and η
3 are the learning steps of w
I
1, w
I
2, and w
I
3, respectively.


### 2.5. Modeling Based on Kernel Principal Component Analysis and Modified Elman Neural Network

Combining the Mahalonobis distance, kernel principal component analysis (KPCA), and improved Elman neural network, after Mahalonobis distance getting rid of the fault data among the sampling data, we can select the kernel principal components using KPCA and establish the neural network.Specific steps are shown in Figure4 and as follows: (1) generate the sample data set (
x
1
,
x
2
,
…
,
x
n
) and preprocess the sample data (the data transform and error handling); (2) calculate the Mahalonobis distance x
d
i between each sample data point and the nearest point, and the distance set of all the nearest points is expressed with {
x
d
i
}, where i
=
1
,
2
,
…
,
n. Then calculate the median value m
d of {
x
d
i
} and compare each value of {
x
d
i
} with 2
m
d; if any x
d
i
>
2
m
d, then the sample contains gross error data; otherwise the sample is normal. Sort the gross error data out from the new sample data set. (3) Select principle components by KPCA. There are total n principle components, when the accumulative contribution rate accounted for over 90%, and choose the first k principle components. (4) Use the k principle components as the input of the neural network, initialize parameters to be (w
i
j
(
1
)
,
w
i
j
(
2
)
,
c
i
j
,
σ
i
j), and choose a batch of data to train the neural network. (5) Use the last batch of data as prediction set. Keep the best parameters when the predicting error satisfies the requirements. Substitute these parameters (driving state) into the measurement and control applications. Use them as the initial weights of the network model (driving state) and get into the on-line learning.Figure 4
Path of double lane change test.


## 2.1. Nonlinear Dynamic Model of Vehicle

The 2-DOF model used to analyze the vehicle’s yaw motion and lateral motion is a linear model, which is on the assumption that the vehicle is driving in uniform velocity. But in reality, longitudinal velocity is subject to change at any time and this changing longitudinal velocity has a significant impact on the yaw and lateral motion and constitutes a nonlinear relation among the state variables. This paper established the vehicle state estimation soft sensor model based on the longitudinal, lateral, and yaw 3-DOF nonlinear vehicle model. Figure1 is the 3-DOF vehicle dynamic model.Figure 1
3-DOF vehicle dynamic model.As is shown in Figure1, X
a
O
a
Y
a is an absolute coordinate system fixed in the horizontal plane, and the x
o
y is the vehicle coordinate fixed on the gravity center, where the x axis overlaps with the vehicle’s longitudinal axis and is positive toward the direction of the vehicle movement; y axis is through the vehicle gravity center o and is positive to the left. All the angles and torques within the plane of X
a
O
a
Y
a are positive counter-clockwise and all the components of vectors are positive with the axis direction. The state equations and measurement equations of vehicle nonlinear dynamic model of 3 DOF are shown as(1)
ω
˙
=
-
l
f
2
C
f
+
l
r
2
C
r
I
z
ω
˙
v
1
+
l
r
C
r
+
l
f
C
f
I
z
β
+
l
f
C
f
I
z
δ
f
,
β
˙
=
l
r
C
r
-
l
f
C
f
-
m
v
x
2
m
ω
˙
v
x
2
-
C
f
+
C
r
m
β
v
x
+
C
f
m
δ
f
v
x
,
v
˙
x
=
ω
β
v
x
+
a
x
,
a
y
=
l
r
C
r
-
l
f
C
f
m
ω
v
x
-
l
f
+
l
r
m
β
+
l
f
m
δ
f
.In the equation,ω is the yaw velocity; β is the sideslip angle; v
x is the longitudinal velocity; δ
f is the front wheel angle; a
y is the lateral acceleration; a
x is the longitudinal acceleration; m is the vehicle mass; I
z is the moment of inertia about the z-axis; l
f is front wheelbase; l
r is the rear wheelbase; C
f is the front wheel effective cornering stiffness; C
r is the rear wheel cornering stiffness.With the steering wheel angle as control input and the steering wheel to the front wheel angle transmission ratioi
=
16, we get(2)
δ
s
w
=
i
δ
f
.


## 2.2. Soft Sensor Technology

Soft sensor technology is also named soft instrument technology [7]. The basic principle is to get the estimation value of the primary variables through the establishment of the mathematical model by using those easily detectable assistant variables that are closely related to those primary variables of difficult detection. The commonly used methods for soft sensor technology include the mechanism analysis modeling, the regression analysis, state estimation, pattern recognition, neural networks, fuzzy mathematics, process tomography, the correlation analysis, and so forth. The state estimation based soft sensor technique adopted in this thesis deducted the estimation of the primary variables using detectable information and the algorithm (the kernel principal component analysis and the improved Elman neural network). The technique realized the measurement for the state parameters that are otherwise hard to measure by conventional method. Figure 2 is the vehicle state estimation system based on soft sensor technique. In Figure 2, w, v, and u represent measurable process noise, measurement noise, and control variable, respectively. y
(
k
) and y
^
(
k
) are the real value and estimated value of the object outputs, respectively. x
^
(
k
) is the estimated value of the object state with the discrete moments k
=
0
,
1
,
2
,
….Figure 2
Block diagram of vehicle state estimation system.


## 2.3. The Reduction of the Feature Parameters Based on the Kernel Principal Component Analysis

The basic idea of the kernel principal component analysis is to implicitly map the data in input space to feature space through kernel function and then to process the kernel principal component analysis in the feature space. This is a powerful approach of extracting nonlinear features, realizing the reduction of the feature parameters, reducing of data redundancy, and getting the primary feature vectors with low classification error rate and high sensitivity with the driving conditions.


### 2.3.1. The Selection of Feature Parameters

There are many feature parameters that can be used to represent the vehicle status, such as average running time, the average acceleration time, the average deceleration time, the average time of driving at uniform velocity, the average idling time, the average running distance, the maximal driving speed, the average speed, the standard deviation of speed, the maximum vehicle acceleration, the maximum vehicle deceleration, the average acceleration during the acceleration period, the average deceleration during the deceleration period, the standard deviation of the acceleration, and the changing rate of the throttle opening. Firstly, this thesis reduces the feature parameters representing vehicle status via correlation analysis. In other words, it uses sequencesx
(
n
) and y
(
n
) to represent the feature parameters pair-wise respectively, in the equation, n
=
1,2
,
…
a
,
…
,
b
,
…. Choose any two time series when n
=
a
~
b and then compare the level of similarity of the two sequences according to (3)
r
=
∑
n
=
a
b
x
n
y
∗
n
∑
n
=
a
b
x
n
2
∑
n
=
a
b
y
n
2
1
/
2
.In the equation, “∗” is the conjugation of y
(
n
).Sort the above results of operation from highest irrelevance to the lowest and then make correlation analysis on the first 15 parameters and the categories of working condition. Then rate the correlation from high to low, and finally we get the 10 feature parameters as the classification standard for working conditions; they are the maximal driving speed, average speed, the minimum deceleration, the average acceleration, the uniform velocity time ratio, idling time ratio, the average acceleration during the acceleration period, the average deceleration during the deceleration period, the average degree of the throttle opening, and the time when the throttle opening degree is zero.


### 2.3.2. The Reduction of the Feature Parameters Based on the Kernel Principal Component Analysis

Through nonlinear mappingφ, the kernel principal component analysis transfers the original data x
i
∈
R
q (i
=
1,2
,
…
,
M) from data space into the φ
(
x
i
) in a new high dimensional feature space F and then gets the nonlinear principal components which enables the original data to have better divisibility by using principal component analysis (PCA) on these after mapping data.The covariance matrix for the after mapping dataφ
(
x
i
) is as follows:(4)
C
=
1
M
∑
i
=
1
M
φ
x
i
φ
x
i
T
.If we set the eigenvalue for the covariance matrixC to be λ and the relative feature vector to be v, then(5)
λ
v
=
C
v
.For all thei
=
1,2
,
…
,
M, do dot-product of each after mapping sample φ
(
x
i
) with both sides of (5), respectively,(6)
λ
φ
x
i
·
v
=
φ
x
i
·
C
v
.Whenλ
≠
0, there is coefficient a
i (i
=
1,2
,
…
,
M); use linear combination of φ
(
x
i
) to represent feature vector v
(7)
v
=
∑
i
=
1
M
a
i
φ
x
i
.Substitute (4) and (7) into the above inner product formula, and then get(8)
λ
∑
i
=
1
M
a
i
φ
x
k
·
φ
x
i
=
1
M
∑
i
=
1
M
a
i
φ
x
k
·
∑
j
=
1
M
φ
x
j
φ
x
j
T
φ
x
i
.To avoid complex direct calculations, in the feature space, we define the elementsK
i
j of the symmetric matrix K as kernel function (9)
K
i
j
=
φ
x
i
·
φ
x
j
.In the equation,j
=
1
,
2
,
…
,
M.AsK is symmetric matrix, so (5) can be simplified as (10)
M
λ
a
=
K
a
.Solve (10); we will get the required eigenvalues λ
k and the feature vectors a
k (k
=
1,2
,
…
,
M). Reduce the system inputted feature parameters via the method of keeping the first p feature vectors. The eigenvalues of the diagonalized matrix K are denoted as λ
k
1
≥
λ
k
2
≥
⋯
≥
λ
k
M, if the number of the smallest nonzero eigenvalues for K is set to be p, and then with (9) and (10), we could get(11)
a
k
T
a
k
=
1
λ
k
.In the equation,k
=
1,2
,
…
,
p.The projection of the after mapping data on the feature vectorsv
k (k
=
1,2
,
…
,
p) is the nonlinear principal components of the original data x
i obtained through nonlinear mapping φ
(12)
ρ
k
=
v
k
·
φ
x
=
∑
i
=
1
M
a
i
k
φ
x
i
·
φ
x
=
∑
i
=
1
M
a
i
k
K
x
i
,
x
.In the equation,a
i
k is the ith coefficient of the kth eigenvalue of the matrix K for feature vector a
k.This thesis choosesK
i
j as Gaussian based radial basis function (13)
K
i
j
=
exp
⁡
-
x
i
-
x
j
2
2
σ
2
.In the equation,σ is the standard deviation.If the mapped data are non-zero mean, mean value method needs to be used on kernel function(14)
K
-
i
j
=
K
-
1
M
K
-
K
1
M
+
1
M
K
1
M
i
j
=
φ
x
i
·
φ
x
j
.In the equation,1
M are the M
×
M constant matrices with 1
/
M as its element; φ
(
x
i
) and φ
(
x
j
) are mapped data after being treated with mean value method.


## 2.3.1. The Selection of Feature Parameters

There are many feature parameters that can be used to represent the vehicle status, such as average running time, the average acceleration time, the average deceleration time, the average time of driving at uniform velocity, the average idling time, the average running distance, the maximal driving speed, the average speed, the standard deviation of speed, the maximum vehicle acceleration, the maximum vehicle deceleration, the average acceleration during the acceleration period, the average deceleration during the deceleration period, the standard deviation of the acceleration, and the changing rate of the throttle opening. Firstly, this thesis reduces the feature parameters representing vehicle status via correlation analysis. In other words, it uses sequencesx
(
n
) and y
(
n
) to represent the feature parameters pair-wise respectively, in the equation, n
=
1,2
,
…
a
,
…
,
b
,
…. Choose any two time series when n
=
a
~
b and then compare the level of similarity of the two sequences according to (3)
r
=
∑
n
=
a
b
x
n
y
∗
n
∑
n
=
a
b
x
n
2
∑
n
=
a
b
y
n
2
1
/
2
.In the equation, “∗” is the conjugation of y
(
n
).Sort the above results of operation from highest irrelevance to the lowest and then make correlation analysis on the first 15 parameters and the categories of working condition. Then rate the correlation from high to low, and finally we get the 10 feature parameters as the classification standard for working conditions; they are the maximal driving speed, average speed, the minimum deceleration, the average acceleration, the uniform velocity time ratio, idling time ratio, the average acceleration during the acceleration period, the average deceleration during the deceleration period, the average degree of the throttle opening, and the time when the throttle opening degree is zero.


## 2.3.2. The Reduction of the Feature Parameters Based on the Kernel Principal Component Analysis

Through nonlinear mappingφ, the kernel principal component analysis transfers the original data x
i
∈
R
q (i
=
1,2
,
…
,
M) from data space into the φ
(
x
i
) in a new high dimensional feature space F and then gets the nonlinear principal components which enables the original data to have better divisibility by using principal component analysis (PCA) on these after mapping data.The covariance matrix for the after mapping dataφ
(
x
i
) is as follows:(4)
C
=
1
M
∑
i
=
1
M
φ
x
i
φ
x
i
T
.If we set the eigenvalue for the covariance matrixC to be λ and the relative feature vector to be v, then(5)
λ
v
=
C
v
.For all thei
=
1,2
,
…
,
M, do dot-product of each after mapping sample φ
(
x
i
) with both sides of (5), respectively,(6)
λ
φ
x
i
·
v
=
φ
x
i
·
C
v
.Whenλ
≠
0, there is coefficient a
i (i
=
1,2
,
…
,
M); use linear combination of φ
(
x
i
) to represent feature vector v
(7)
v
=
∑
i
=
1
M
a
i
φ
x
i
.Substitute (4) and (7) into the above inner product formula, and then get(8)
λ
∑
i
=
1
M
a
i
φ
x
k
·
φ
x
i
=
1
M
∑
i
=
1
M
a
i
φ
x
k
·
∑
j
=
1
M
φ
x
j
φ
x
j
T
φ
x
i
.To avoid complex direct calculations, in the feature space, we define the elementsK
i
j of the symmetric matrix K as kernel function (9)
K
i
j
=
φ
x
i
·
φ
x
j
.In the equation,j
=
1
,
2
,
…
,
M.AsK is symmetric matrix, so (5) can be simplified as (10)
M
λ
a
=
K
a
.Solve (10); we will get the required eigenvalues λ
k and the feature vectors a
k (k
=
1,2
,
…
,
M). Reduce the system inputted feature parameters via the method of keeping the first p feature vectors. The eigenvalues of the diagonalized matrix K are denoted as λ
k
1
≥
λ
k
2
≥
⋯
≥
λ
k
M, if the number of the smallest nonzero eigenvalues for K is set to be p, and then with (9) and (10), we could get(11)
a
k
T
a
k
=
1
λ
k
.In the equation,k
=
1,2
,
…
,
p.The projection of the after mapping data on the feature vectorsv
k (k
=
1,2
,
…
,
p) is the nonlinear principal components of the original data x
i obtained through nonlinear mapping φ
(12)
ρ
k
=
v
k
·
φ
x
=
∑
i
=
1
M
a
i
k
φ
x
i
·
φ
x
=
∑
i
=
1
M
a
i
k
K
x
i
,
x
.In the equation,a
i
k is the ith coefficient of the kth eigenvalue of the matrix K for feature vector a
k.This thesis choosesK
i
j as Gaussian based radial basis function (13)
K
i
j
=
exp
⁡
-
x
i
-
x
j
2
2
σ
2
.In the equation,σ is the standard deviation.If the mapped data are non-zero mean, mean value method needs to be used on kernel function(14)
K
-
i
j
=
K
-
1
M
K
-
K
1
M
+
1
M
K
1
M
i
j
=
φ
x
i
·
φ
x
j
.In the equation,1
M are the M
×
M constant matrices with 1
/
M as its element; φ
(
x
i
) and φ
(
x
j
) are mapped data after being treated with mean value method.


## 2.4. Improved Elman Neural Network

### 2.4.1. Modified Elman Neural Network

Elman regression neural network is a kind of typical dynamic neural network. Based on the feed forward neural network, it adds one more node, the context node. Through the delay and storage of the output of the hidden node by the context node, the output of the hidden node can self-link to the input of the hidden node, thereby enabling the network to be sensitive to the historical data, increasing the capacity of the network’s processing capability of dynamic information and realizing dynamic modeling.The characteristics of the existing modified Elman neural network is an added self-feedback connection with a fixed gain asα, so that the output of the context node at the time k equals the output of the hidden node at time k
-
1 plus α times of the output of the context node at the time k
-
1 [12]. Figure 3 shows the network structure. The difference between the original and the improved Elman network is the different values for α. But both are fixed values. This thesis proposes a determination method for variable gain α based on real time error analysis, which gives the network a better real time performance.Figure 3
Modified Elman neural network.Comparing with the standard Elman network, the modified Elman network not only has a more flexible approximation to high order system essentially but can also achieve the same effect as gained by the standard Elman network when it adopts dynamic BP algorithm training.The expressions between each layer of the modified Elman neural network are(15)
x
k
=
f
w
I
1
x
c
k
+
w
I
2
u
k
-
1
,
x
c
k
=
a
x
c
k
-
1
+
x
k
-
1
,
y
k
=
g
w
I
3
x
k
.In the equation, connection weightw
I
1 is the connection weight matrix of the context node and the hidden node; w
I
2 is the connection weight matrix of the input node and the hidden node; w
I
3 is the connection weight matrix of the hidden node and the output node; x
c
(
k
) and x
(
k
) represent the output of context node and the hidden node, respectively; y
(
k
) represents the output of the output node, with 0
≤
α
≤
1 as the self–join feedback gain factor. f
(
x
) and g
(
x
) are often hyperbolic tangent functions or sigmoid functions.


### 2.4.2. Theα Value Determination of the Modified Elman Neural Network

By analyzing the equation (15), we know that the bigger the α value is, the greater the influence the output of the context node at time k
-
1 has on the output of the node at time k. Suppose the calculation result is y
(
k
) at the time k, and the true value is y
d
(
k
-
1
) and y
d
(
k
) at the time k
-
1 and the time k, respectively; then discuss the following 3 circumstances:(1)
wheny
d
(
k
-
1
)
<
y
d
(
k
): if y
(
k
)
<
y
d
(
k
-
1
), make a
(
k
+
1
)
=
0; if y
d
(
k
-
1
)
<
y
(
k
)
<
y
d
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
); if y
d
(
k
)
<
y
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1,
(2)
wheny
d
(
k
-
1
)
<
y
d
(
k
): if y
(
k
)
<
y
d
(
k
-
1
), make a
(
k
+
1
)
=
0; if y
d
(
k
-
1
)
<
y
(
k
)
<
y
d
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
); if y
d
(
k
)
<
y
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1,
(3)
wheny
d
(
k
-
1
)
=
y
d
(
k
): if y
(
k
)
<
y
d
(
k
), a
(
k
+
1
)
=
y
(
k
)
/
y
d
(
k
)
a
(
k
); if y
(
k
)
>
y
d
(
k
), a
(
k
+
1
)
=
y
(
k
)
/
y
d
(
k
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1.


### 2.4.3. The Modified Elman Neural Network Learning Algorithm

The modified Elman neural network overall error objective function can be expressed as(16)
E
k
=
∑
p
=
1
m
E
p
k
,
E
p
k
=
1
2
y
d
k
-
y
k
T
y
d
k
-
y
k
.Calculating the partial derivatives ofE
p
(
k
) to weight values w
I
3, w
I
2, and w
I
1, we can get the gradient descent algorithm of the modified Elman neural network:(17)
Δ
ω
i
j
I
3
=
η
3
δ
i
0
x
j
k
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
,
Δ
ω
j
q
I
2
=
η
2
δ
j
h
u
q
k
-
1
j
=
1,2
,
…
,
n
;
q
=
1,2
,
…
,
r
,
Δ
ω
j
l
I
1
=
η
1
∑
i
=
1
m
δ
i
0
ω
i
j
I
3
∂
x
j
k
∂
ω
j
l
I
1
j
=
1,2
,
…
,
n
;
l
=
1,2
,
…
,
n
,
δ
i
0
=
y
d
,
i
k
-
y
i
k
g
i
′
·
δ
j
h
=
∑
i
=
1
m
δ
i
0
ω
i
j
I
3
f
j
′
·
∂
x
j
k
∂
ω
j
l
I
1
=
f
j
′
·
x
l
k
-
1
+
a
∂
x
j
k
-
1
∂
w
j
l
I
1
j
=
1,2
,
…
,
n
;
l
=
1,2
,
…
,
n
.In the equation,η
1, η
2, and η
3 are the learning steps of w
I
1, w
I
2, and w
I
3, respectively.


## 2.4.1. Modified Elman Neural Network

Elman regression neural network is a kind of typical dynamic neural network. Based on the feed forward neural network, it adds one more node, the context node. Through the delay and storage of the output of the hidden node by the context node, the output of the hidden node can self-link to the input of the hidden node, thereby enabling the network to be sensitive to the historical data, increasing the capacity of the network’s processing capability of dynamic information and realizing dynamic modeling.The characteristics of the existing modified Elman neural network is an added self-feedback connection with a fixed gain asα, so that the output of the context node at the time k equals the output of the hidden node at time k
-
1 plus α times of the output of the context node at the time k
-
1 [12]. Figure 3 shows the network structure. The difference between the original and the improved Elman network is the different values for α. But both are fixed values. This thesis proposes a determination method for variable gain α based on real time error analysis, which gives the network a better real time performance.Figure 3
Modified Elman neural network.Comparing with the standard Elman network, the modified Elman network not only has a more flexible approximation to high order system essentially but can also achieve the same effect as gained by the standard Elman network when it adopts dynamic BP algorithm training.The expressions between each layer of the modified Elman neural network are(15)
x
k
=
f
w
I
1
x
c
k
+
w
I
2
u
k
-
1
,
x
c
k
=
a
x
c
k
-
1
+
x
k
-
1
,
y
k
=
g
w
I
3
x
k
.In the equation, connection weightw
I
1 is the connection weight matrix of the context node and the hidden node; w
I
2 is the connection weight matrix of the input node and the hidden node; w
I
3 is the connection weight matrix of the hidden node and the output node; x
c
(
k
) and x
(
k
) represent the output of context node and the hidden node, respectively; y
(
k
) represents the output of the output node, with 0
≤
α
≤
1 as the self–join feedback gain factor. f
(
x
) and g
(
x
) are often hyperbolic tangent functions or sigmoid functions.


## 2.4.2. Theα Value Determination of the Modified Elman Neural Network

By analyzing the equation (15), we know that the bigger the α value is, the greater the influence the output of the context node at time k
-
1 has on the output of the node at time k. Suppose the calculation result is y
(
k
) at the time k, and the true value is y
d
(
k
-
1
) and y
d
(
k
) at the time k
-
1 and the time k, respectively; then discuss the following 3 circumstances:(1)
wheny
d
(
k
-
1
)
<
y
d
(
k
): if y
(
k
)
<
y
d
(
k
-
1
), make a
(
k
+
1
)
=
0; if y
d
(
k
-
1
)
<
y
(
k
)
<
y
d
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
); if y
d
(
k
)
<
y
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1,
(2)
wheny
d
(
k
-
1
)
<
y
d
(
k
): if y
(
k
)
<
y
d
(
k
-
1
), make a
(
k
+
1
)
=
0; if y
d
(
k
-
1
)
<
y
(
k
)
<
y
d
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
); if y
d
(
k
)
<
y
(
k
), make a
(
k
+
1
)
=
y
(
k
)
-
y
d
(
k
-
1
)
/
y
d
(
k
)
-
y
d
(
k
-
1
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1,
(3)
wheny
d
(
k
-
1
)
=
y
d
(
k
): if y
(
k
)
<
y
d
(
k
), a
(
k
+
1
)
=
y
(
k
)
/
y
d
(
k
)
a
(
k
); if y
(
k
)
>
y
d
(
k
), a
(
k
+
1
)
=
y
(
k
)
/
y
d
(
k
)
a
(
k
), if a
(
k
+
1
)
>
1, make a
(
k
+
1
)
=
1.


## 2.4.3. The Modified Elman Neural Network Learning Algorithm

The modified Elman neural network overall error objective function can be expressed as(16)
E
k
=
∑
p
=
1
m
E
p
k
,
E
p
k
=
1
2
y
d
k
-
y
k
T
y
d
k
-
y
k
.Calculating the partial derivatives ofE
p
(
k
) to weight values w
I
3, w
I
2, and w
I
1, we can get the gradient descent algorithm of the modified Elman neural network:(17)
Δ
ω
i
j
I
3
=
η
3
δ
i
0
x
j
k
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
,
Δ
ω
j
q
I
2
=
η
2
δ
j
h
u
q
k
-
1
j
=
1,2
,
…
,
n
;
q
=
1,2
,
…
,
r
,
Δ
ω
j
l
I
1
=
η
1
∑
i
=
1
m
δ
i
0
ω
i
j
I
3
∂
x
j
k
∂
ω
j
l
I
1
j
=
1,2
,
…
,
n
;
l
=
1,2
,
…
,
n
,
δ
i
0
=
y
d
,
i
k
-
y
i
k
g
i
′
·
δ
j
h
=
∑
i
=
1
m
δ
i
0
ω
i
j
I
3
f
j
′
·
∂
x
j
k
∂
ω
j
l
I
1
=
f
j
′
·
x
l
k
-
1
+
a
∂
x
j
k
-
1
∂
w
j
l
I
1
j
=
1,2
,
…
,
n
;
l
=
1,2
,
…
,
n
.In the equation,η
1, η
2, and η
3 are the learning steps of w
I
1, w
I
2, and w
I
3, respectively.


## 2.5. Modeling Based on Kernel Principal Component Analysis and Modified Elman Neural Network

Combining the Mahalonobis distance, kernel principal component analysis (KPCA), and improved Elman neural network, after Mahalonobis distance getting rid of the fault data among the sampling data, we can select the kernel principal components using KPCA and establish the neural network.Specific steps are shown in Figure4 and as follows: (1) generate the sample data set (
x
1
,
x
2
,
…
,
x
n
) and preprocess the sample data (the data transform and error handling); (2) calculate the Mahalonobis distance x
d
i between each sample data point and the nearest point, and the distance set of all the nearest points is expressed with {
x
d
i
}, where i
=
1
,
2
,
…
,
n. Then calculate the median value m
d of {
x
d
i
} and compare each value of {
x
d
i
} with 2
m
d; if any x
d
i
>
2
m
d, then the sample contains gross error data; otherwise the sample is normal. Sort the gross error data out from the new sample data set. (3) Select principle components by KPCA. There are total n principle components, when the accumulative contribution rate accounted for over 90%, and choose the first k principle components. (4) Use the k principle components as the input of the neural network, initialize parameters to be (w
i
j
(
1
)
,
w
i
j
(
2
)
,
c
i
j
,
σ
i
j), and choose a batch of data to train the neural network. (5) Use the last batch of data as prediction set. Keep the best parameters when the predicting error satisfies the requirements. Substitute these parameters (driving state) into the measurement and control applications. Use them as the initial weights of the network model (driving state) and get into the on-line learning.Figure 4
Path of double lane change test.


## 3. Results and Discussion

To validate the KPC-IENN algorithm to be accurate and reliable, the double lane change test is adopted. Using SUV’s real vehicle parameters, virtual simulation of the sharp double lane change test is based on the ISO3888-1-1999 standard with sampling period of 0.025 s. During the test, the vehicle passes quickly through the benchmarks set on the road, and the passage is shown in Figure5. Turn the steering wheel, with the observation of lateral acceleration to estimate the yaw velocity, the sideslip angle, and so on.Figure 5
Path of double lane change test.To stimulate the external disturbances that affect the vehicle, suppose the vehicle was affected by an instantaneous crosswinds gust shown in Figure6 when passing through the double lane.Figure 6
Crosswind spectrum.The samples were analyzed by KPCA. The accumulative contribution rate has already reached 90.09% as seen in Table1. O
(
N
2
) is the complexity to compute the kernel principal components.Table 1
Cumulative contribution ratio of different principles.
Principle number
Eigenvalues
Difference value
Percent variance (%)
Cumulative contribution ratio (%)
Z
1
5.123895
2.960055
47.4027
47.4027
Z
2
2.16384
0.56343
21.19649
68.59919
Z
3
1.60041
1.006635
15.67728
84.27647
Z
4
0.59367
0.2184
5.815851
90.09232
Z
5
0.375375
0.088725
3.676731
93.76905
Z
6
0.286545
0.128625
2.807074
96.57613
Z
7
0.15792
0.05124
1.547177
98.1233
Z
8
0.106785
0.04179
1.045749
99.16905
Z
9
0.06489
0.03822
0.588857
99.75791
Z
10
0.02667
0
0.242095
100Figures7 and 8 are the estimated results of the vehicle longitudinal velocity, the yaw velocity, the sideslip angle, and other key state parameters based on the KPC-IENN algorithm, and and then compare them with the actual output of the stimulation.Figure 7
Comparison of yaw rate between estimated value and simulated value (a) vehicle states note affected by crosswind (b) vehicle states affected by crosswind.
(a)
(b)Figure 8
Comparison of side slip angle between estimated value and simulated value (a) vehicle states note affected by crosswind (b) vehicle states affected by crosswind.
(a)
(b)Judging from Figures7 and 8, the vehicle nonlinear state based on the KPC-IENN algorithm is in line with the reality. The estimated values of this algorithm are very close to the stimulation values and the errors are under control. When t = 4~10 s, the vehicle is entering into the lane driving state. The vehicle longitudinal velocity, the yaw velocity, the sideslip angle, and other state parameters change drastically in this time interval. Judging from Figures 6, 7, and 8, the KPC-IENN algorithm used multiple suboptimal fading factor to force the estimated residual to have orthogonality and increased the tracking efficiency for the states with abrupt changes, thereby tracking the changing state values effectively.


## 4. Conclusions

This thesis proposed a KPC-IENN algorithm which is applicable to the states with abrupt changes and established a soft sensor method for the key states needed in the controlling of the lateral, longitudinal, and yaw stability of the vehicle body. In the sharp double lane change test, the estimated values gained by the KPC-IENN algorithm were proved to be highly accurate and satisfied the software performance requirements of the vehicle state estimators. The stimulation results of the Matlab/SIMULINK cosimulation showed that the KPC-IENN algorithm can estimate the speed, sideslip angle, and yaw velocity with accuracy and strong real time performance as well as an effective tracking speed and an outstanding property of restraining noises. It is suitable for online estimation of vehicle states. This thesis validated the accuracy and effectiveness of the KPC-IENN soft sensor algorithm using real vehicle parameters in stimulated environment. The next step is to use the established soft sensor model and the estimation algorithm in field test through hardware in loop simulation technique, which can further verify its practicability and reliability.



---

*Source: 9568785-2016-09-29.xml*