Derivation of Kalman Filter from Chi-Square Minimization, Study Guides, Projects, Research of Computer Science

How the kalman filter can be derived from the desire to minimize the mean squared error of a signal prediction. It also shows how the kalman filter can be thought of as a chi-squared minimizer by deriving an alternative form of the filter. The document concludes by discussing the limitations of the kalman filter and introducing a new statistical approach to the solution of these problems.

Typology: Study Guides, Projects, Research

Pre 2010

Uploaded on 08/05/2009

koofers-user-q3p
koofers-user-q3p 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
11.8 Alternative Kalman equations
Having shown that the covariance matrix can be updated via the previous equation it is possible to
formulate an alternative Kalman gain, as follows;
K
k
=
P
0
k
H
T
,
HP
0
k
H
T
+
R
,
1
(11.53)
Inserting
P
k
P
,
1
k
and
R
R
,
1
;
K
k
=
P
k
P
,
1
k
P
0
k
H
T
R
,
1
R
,
HP
0
k
H
T
+
R
,
1
=
P
k
P
,
1
k
P
0
k
H
T
R
,
1
,
HP
0
k
H
T
R
,
1
+
I
,
1
=
P
k
,
I
+
H
T
R
,
1
HP
0
k
H
T
R
,
1
,
HP
0
k
H
T
R
,
1
+
I
,
1
=
P
k
H
T
R
,
1
,
I
+
H
T
R
,
1
HP
0
k
,
I
+
HP
0
k
H
T
R
,
1
,
1
=
P
k
H
T
R
,
1
(11.54)
Replacing
P
k
with the inverse of equation 11.50;
K
k
=
HR
,
1
H
T
+
P
0,
1
k
,
1
H
T
R
,
1
(11.55)
Which is the same as the gain calculated from the chi-square equations, conrming that the gains are
indeed equivalent.
Although an alternative recursive algorithm has been developed the ob jectivewas to demonstrate the
relationship between the Kalman lter and the chi-square statistic, showing how the Kalman lter em-
bodies this statistic. The diagram of gure
??
shows how the alternative set of lter equations maybe
used to implement a Kalman lter. This form of the lter may be attractive due to the simplied gain
calculation and some authors have been able to use this form of the lter in a distributed implementa-
tion [
?
]. However in this form the lter requires two matrix inversions which can be a computational
burden, particularly when large matrices are involved. Thus the preferred implementation here is that
given in gure 11.5.
11.9 Conclusions
This tutorial has shown how the Kalman lter may be derived from the desire to minimise the mean
squared error of a signal prediction. Several points in the derivation have been emphasised;
The minimisation of the mean squared error is shown to be applicable when the expected errors
on the signal are distribution as a Gaussian. Under such conditions the minimisation of the mean
squared error between the data and the data prediction leads to the developmentofa
maximum
likelihood statistic
It has been shown how the Kalman lter can be thought of in terms of a chi-squared minimiser
by deriving an alternative form of the Kalman lter which highlights its statistical constructs
including the processes of error propagation and data combination. This derivation leads to a
common, alternative set of lter equations.
In summary, although the Kalman lter is optimal in the mean-squared error sense, it is limited, prac-
tically by the quality and accuracy of the model which is embedded within it. However, without an
appropriate model the lter is unable to perform the task for which it is designed. The following sections
describe a new statistical approach to the solution of this problem.
141
pf3

Partial preview of the text

Download Derivation of Kalman Filter from Chi-Square Minimization and more Study Guides, Projects, Research Computer Science in PDF only on Docsity!

11.8 Alternative Kalman equations

Having shown that the covariance matrix can b e up dated via the previous equation it is p ossible to formulate an alternative Kalman gain, as follows;

Kk = P (^) k^0 H T^

H P (^) k^0 H T^ + R

Inserting Pk  P (^) k 1 and R  R ^1 ;

Kk = Pk P (^) k 1 P (^) k^0 H T^ R ^1 R

H P (^) k^0 H T^ + R

= Pk P (^) k 1 P (^) k^0 H T^ R ^1

H P (^) k^0 H T^ R ^1 + I

= Pk

I + H T^ R ^1 H P (^) k^0

H T^ R ^1

H P (^) k^0 H T^ R ^1 + I

= Pk H T^ R ^1

I + H T^ R ^1 H P (^) k^0

I + H P (^) k^0 H T^ R ^1

= Pk H T^ R ^1

Replacing Pk with the inverse of equation 11.50;

Kk =

H R ^1 H T^ + P (^) k0^1

H T^ R ^1 (11.55)

Which is the same as the gain calculated from the chi-square equations, con rming that the gains are indeed equivalent.

Although an alternative recursive algorithm has b een develop ed the ob jective was to demonstrate the relationship b etween the Kalman lter and the chi-square statistic, showing how the Kalman lter em- b o dies this statistic. The diagram of gure ?? shows how the alternative set of lter equations may b e used to implement a Kalman lter. This form of the lter may b e attractive due to the simpli ed gain calculation and some authors have b een able to use this form of the lter in a distributed implementa- tion [?]. However in this form the lter requires two matrix inversions which can b e a computational burden, particularly when large matrices are involved. Thus the preferred implementation here is that given in gure 11.5.

11.9 Conclusions

This tutorial has shown how the Kalman lter may b e derived from the desire to minimise the mean squared error of a signal prediction. Several p oints in the derivation have b een emphasised;

 The minimisation of the mean squared error is shown to b e applicable when the exp ected errors on the signal are distribution as a Gaussian. Under such conditions the minimisation of the mean squared error b etween the data and the data prediction leads to the development of a maximum likelihood statistic  It has b een shown how the Kalman lter can b e thought of in terms of a chi-squared minimiser by deriving an alternative form of the Kalman lter which highlights its statistical constructs including the pro cesses of error propagation and data combination. This derivation leads to a common, alternative set of lter equations.

In summary, although the Kalman lter is optimal in the mean-squared error sense, it is limited, prac- tically by the quality and accuracy of the mo del which is emb edded within it. However, without an appropriate mo del the lter is unable to p erform the task for which it is designed. The following sections describ e a new statistical approach to the solution of this problem.

Project into k+

Projected Estimates

Update Estimate

Kalman Gain

Covariance & Invert

Compute Inverse

Initial Estimates

Updated State Estimates

Measurements

Description Equation

Compute Inverse Covariance P k 1 = H R ^1 H T^ + P k0^1

Kalman Gain Kk = Pk H T^ R ^1

Up date Estimate x^k = x^^0 k + Kk (zk H x^^0 k )

Pro ject into k + 1 x^^0 k +1 =  x^k

Pk +1 = Pk T^ + Q

Figure 11.2: Alternative Kalman lter recursive algorithm