To justify the need of automated tuning of EKF, the speed estimation algorithm of the extended Kalman filter tunned by a trial-and-error-process is tested on our test bench presented below.
6.2. Experimental results
The covariance matrices used in the EKF algorithm and tuned by a trial-and-error method until satisfactory estimation performance is obtained are
with and ,
and the error covariance matrix is initiallized as
Figure 3 and
Figure 4 show the estimated currents
and
, respectively, using trial-and-error method
whereas
Figure 5 shows the estimated speed of the EKF using trial-and-error method
As we can see in the above figure, the estimated speed is very noisy. This can be justified by the coefficient, which is very large.
In order to minimize the effect of the noise in the estimated speed, the coefficient has to be reduced. However, smaller value of leads to innacurate estimation of the motor speed. In fact, the process noise covariance matrix Q, represents the uncertainty in the system dynamics and reflects the model accuracy in predicting the state evolution of the system. The values of the elements in the process noise covariance matrix determine how much the filter trusts the predicted state versus the measured state. Higher values indicate higher uncertainty in the system, leading to more reliance on the measurements. Furthermore, the error between the estimated and measured speed is more significant in the time interval of .
A second attempt is now made to estimate the speed with the same noise covariance matrices of the first test
Figure 7.
estimation using EKF tunned by a trial-and-error method-Second test.
Figure 7.
estimation using EKF tunned by a trial-and-error method-Second test.
As it is shown in the
Figure 8, the speed estimation using the same covariance matrices is innacurate in the time interval of
. Therefore, the noise matrices must be modified each time.
Consequently, manual tuning of the EKF using trial-and-error-process is proven to be inefficient. It is time-consuming and requires significant effort from an experienced operator. Moreover, it involves the configuration of multiple parameters of the noise covariance matrices.
To overcome this difficulty, the noise covariance matrices are determined with a subspace model identification approach.
Because the model used to estimate the rotor speed is nonlinear and the subspace model identification method requires linear time invariant state space representation, the nonlinear model is linearized around the known nominal rotor speed.
In addition, system identification requires exciting the inputs and outputs of the system (voltages and currents respectively). To this end and from the same test bench, a pseudo random binary sequence (PRBS) is applied as a desired speed (
Figure 9) and is varying around the nominal speed (2920 rpm)
Excited voltages and currents are then used to identify a discrete time linear state space of the system.
Figure 10 gives the block diagram of experimental setup used to estimate the noise covariance matrices
The identification efficiency is evaluated by comparing the identified and actual currents (system outputs) as shown in
Figure 11 and
Figure 12
The best fits obtained by comparing the identified and actual currents are for and for .
In fact, mathematical models are often simplified approximations of reality and may not always capture all the details of the system’s behavior or take into account the nonlinearities.
The noise covariance matrices are now determined using the modified subspace model identification
We can now reconstruct the process noise covariance matrix as
Using this identified process noise covariance matrix Q and measurement noise covariance matrix R to estimate the rotor speed of the same test bench described before and by varying the coefficient until a satisfactory result, the resulting estimations are presented in the below Figures
Figure 13.
estimation with EKF using noise covariance matrices estimation-First test.
Figure 13.
estimation with EKF using noise covariance matrices estimation-First test.
Figure 14.
estimation with EKF using noise covariance matrices estimation-First test.
Figure 14.
estimation with EKF using noise covariance matrices estimation-First test.
Figure 15.
IM speed estimation with EKF using noise covariance matrices estimation-First test.
Figure 15.
IM speed estimation with EKF using noise covariance matrices estimation-First test.
The accurate speed estimation is obtained for .
The speed estimation error has decreased comparing to the trial-and-error process tuning.
Figure 16.
estimation with EKF using noise covariance matrices estimation-Second test.
Figure 16.
estimation with EKF using noise covariance matrices estimation-Second test.
Figure 17.
estimation with EKF using noise covariance matrices estimation-First test.
Figure 17.
estimation with EKF using noise covariance matrices estimation-First test.
Figure 18.
IM speed estimation with EKF using noise covariance matrices estimation-Second test.
Figure 18.
IM speed estimation with EKF using noise covariance matrices estimation-Second test.
We apply now the same noise covariance matrices to the second test
As we can see, the identified noise covariance matrices are valid for both tests, unlike the trial-and-error-process method where the noise covariance matrices have to be set each time.
Furthermore,
Figure 19 shows a comparison between measured speed, estimated speed using manual tuning and estimated speed using modified subspace identification approach of the first test
As it’s shown, the effect of noise has been minimized using automated tuning of the covariance matrices.
Finally, the table below provides a comparison between the mean squared error of the estimated speed for both the trial-and-error process method and automated tuning of the EKF
The mean squared error between the actual rotor speed and the estimated speed is defined as
with
n is the number of samples,
s is the actual speed and
e is the estimated speed.
It is observed that the estimation has significantly improved for both first and second test.