Probabilistic performance of state estimation across a lossy network

Authors:
Michael Epstein;Ling Shi;Abhishek Tiwari;Richard M. Murray
Affiliations:
Control and Dynamical Systems, Caltech, Mail Code 107-81, Pasadena, CA 91125, United States;Control and Dynamical Systems, Caltech, Mail Code 107-81, Pasadena, CA 91125, United States;Control and Dynamical Systems, Caltech, Mail Code 107-81, Pasadena, CA 91125, United States;Control and Dynamical Systems, Caltech, Mail Code 107-81, Pasadena, CA 91125, United States
Venue:
Automatica (Journal of IFAC)
Year:
2008

Citing 0
Cited 7

An optimal control method for applications using wireless sensor/actuator networks

Computers and Electrical Engineering
Brief paper: State estimation for linear discrete-time systems using quantized measurements

Automatica (Journal of IFAC)
On the performance of Kalman filtering with intermittent observations: a geometric approach with fractals

ACC'09 Proceedings of the 2009 conference on American Control Conference
Minimum variance filter with packet dropouts in wireless sensor networks

ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Improved fractional Kalman filter and its application to estimation over lossy networks

Signal Processing
Mean square stability for Kalman filtering with Markovian packet losses

Automatica (Journal of IFAC)
On Kalman filtering over fading wireless channels with controlled transmission powers

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.15

Visualization

Abstract

We consider a discrete time state estimation problem over a packet-based network. In each discrete time step, a measurement packet is sent across a lossy network to an estimator unit consisting of a modified Kalman filter. Using the designed estimator algorithm, the importance of placing a measurement buffer at the sensor that allows transmission of the current and several previous measurements is shown. Previous pioneering work on Kalman filtering with intermittent observation losses is concerned with the asymptotic behavior of the expected value of the error covariance, i.e.E[P"k]~. We consider a different performance metric, namely a probabilistic statement of the error covariance Pr[P"k@?M]=1-@e, meaning that with high probability the error covariance is bounded above at any instant in time. Provided the estimator error covariance has an upper bound whenever a measurement packet arrives, we show that for any finite M this statement will hold so long as the probability of receiving a measurement packet is nonzero. We also give an explicit relationship between M and @e and provide examples to illustrate the theory.