Optimal State Estimation

Chapter 9.3 - Fixed-Lag Smoothing

9.3 FIXED-LAG SMOOTHING

In fixed-lag smoothing we want to obtain an estimate of the state at time (k - N) given measurements up to and including time k, where the time index k continually changes as we obtain new measurements, but the lag N is a constant. In other words, at each time point we have N future measurements available for our state estimate. We therefore want to obtain k-N, k for k = N, N + 1, …, where N is a fixed positive integer. This could be the case, for example, if a satellite is continually taking photographs that are to be displayed or transmitted N time steps after the photograph is taken. In this case, since the photograph is processed N time steps after it is taken, we have N additional measurements after each photograph that are available to update the estimate of the satellite state and hence improve the quality of the photograph. In this section we use the notation

09_03_Optimal_State_Estimation-1.jpg

Note that the notation has changed slightly from the previous section. In the previous section we used the notation k, m to refer to the estimate of xk given measurements up to and including time (m — 1). In this section (and in the remainder of this chapter) we use k, m to refer to the estimate of xk given measurements up to and including time m.

Let us define xk, m as the statexk - m propagated with an identity transition matrix and zero process noise to time k. With this definition we see that

09_03_Optimal_State_Estimation-2.jpg

We can therefore define the augmented system

09_03_Optimal_State_Estimation-3.jpg

The Kalman filter estimates of the components of this augmented state vector are given as

09_03_Optimal_State_Estimation-4.jpg

We see that if we can use a Kalman filter to estimate the states of the augmented system (using measurements up to and including time k), then the estimate of the last element of the augmented state vector, xk+1, N+1 equal to the estimate of xk-N given measurements up to and including time k. This is the estimate that we are looking for in fixed-lag smoothing. This idea is illustrated in Figure 9.7.

09_03_Optimal_State_Estimation-5.jpg

Figure 9.7 This illustrates the idea that is used to obtain the fixed-lag smoother. A fictitious state variable xk, m is initialized as xk, m = xk-m and from that point on has an identity state transition matrix. The a posteriori estimate of xk+m, m is then equal to k-m, k.

From Equation (9.10) we can write the Kalman filter for the augmented system of Equation (9.41) as follows:

09_03_Optimal_State_Estimation-6.jpg

where the Lk, i matrices are components of the smoother gain that will be determined in this section. Note that L k, 0 is the standard Kalman gain. The smoother gain Lk is defined as

09_03_Optimal_State_Estimation-7.jpg

From Equation (9.10) we see that the Lk gain matrix is given by

09_03_Optimal_State_Estimation-8.jpg

where the covariance matrices are defined as

09_03_Optimal_State_Estimation-9.jpg

The Lkexpression above can be simplified to

09_03_Optimal_State_Estimation-10.jpg

Prom Equation (9.10) we see that the covariance-update equation for the Kalman filter for our augmented system can be written as

09_03_Optimal_State_Estimation-11.jpg

Substituting for Lkfrom Equation (9.47) and multiplying out gives

09_03_Optimal_State_Estimation-12.jpg

This gives us the update equations for the P matrices. The equations for the first column of the P matrix are as follows:

09_03_Optimal_State_Estimation-13.jpg

The equations for the diagonal elements of the P matrix are as follows:

09_03_Optimal_State_Estimation-14.jpg

These equations give us the formulas that we can use for fixed-lag smoothing. This gives us the estimate E(xk-N y1 , …, yk ) for a fixed N as k continually increments. The fixed-lag smoother is summarized as follows.

The fixed-lag smoother

  1. Run the standard Kalman filter of Equation (9.10) to obtain 09_03_Optimal_State_Estimation-15.jpg , Lk , and 09_03_Optimal_State_Estimation-15.jpg.

  2. Initialize the fixed-lag smoother as follows:
  3. 09_03_Optimal_State_Estimation-16.jpg

  4. For i = l, …, N + l, perform the following:
  5. 09_03_Optimal_State_Estimation-17.jpg
    Note that the first time through this loop is the measurement update of the standard Kalman filter. At the end of this loop we have the smoothed estimates of each state with delays between 0 and N, given measurements up to and including time k. These estimates are denoted k, k , … , k-N, k .We also have the estimation-error covariances, denoted

The percent improvement due to smoothing can be computed as

09_03_Optimal_State_Estimation-19.jpg

EXAMPLE 9.2

Consider the same two state system as described in Example 9.1. Suppose we are trying to estimate the state of the system with a fixed time lag. The discretization time step T = 0.1 and the standard deviation of the acceleration noise is 10. Figure 9.8 shows the percent improvement in state estimation that is available with fixed-lag smoothing. The figure shows percent improvement as a function of lag size, and for two different values of measurement noise. The values on the plot are based on the theoretical estimation-error covariance. As expected, the improvement in estimation accuracy is more dramatic as the measurement noise decreases. This was discussed at the end of Section 9.2.

09_03_Optimal_State_Estimation-20.jpg

Figure 9.8 This shows the percent improvement of the trace of the estimation-error covariance of the smoothed estimate of the state (relative to the standard Kalman filter) for Example 9.2. As the number of lag intervals increases, the estimation error of the smoother decreases and the percent improvement increases. Also, as the measurement noise decreases, the improvement due to smoothing is more dramatic.

UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Category: Engineering Consulting Services
Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.