Towards Finding the Critical Value for Kalman Filtering with Intermittent Observations

Details Towards Finding the Critical Value for Kalman Filtering with Intermittent Observations Towards Finding the Critical Value for Kalman Filtering with Intermittent Observations

2010-05-14

arxiv.org/abs/1005.2442v1

Mathematics

Optimization and Control

Scientific paper

In [1], Sinopoli et al. analyze the problem of optimal estimation for linear Gaussian systems where packets containing observations are dropped according to an i.i.d. Bernoulli process, modeling a memoryless erasure channel. In this case the authors show that the Kalman Filter is still the optimal estimator, although boundedness of the error depends directly upon the channel arrival probability, p. In particular they also prove the existence of a critical value, pc, for such probability, below which the Kalman filter will diverge. The authors are not able to compute the actual value of this critical probability for general linear systems, but provide upper and lower bounds. They are able to show that for special cases, i.e. C invertible, such critical value coincides with the lower bound. This paper computes the value of the critical arrival probability, under minimally restrictive conditions on the matrices A and C.

Affiliated with

Also associated with

No associations

Rating

Towards Finding the Critical Value for Kalman Filtering with Intermittent Observations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards Finding the Critical Value for Kalman Filtering with Intermittent Observations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Finding the Critical Value for Kalman Filtering with Intermittent Observations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518668