A random dynamical systems approach to filtering in large-scale networks

The paper studies the problem of filtering a discrete-time linear system observed by a network of sensors. The sensors share a common communication medium to the estimator and transmission is bit and power budgeted. Under the assumption of conditional Gaussianity of the signal process at the estimator (which may be ensured by observation packet acknowledgements), the conditional prediction error covariance of the optimum mean-squared error filter is shown to evolve according to a random dynamical system (RDS) on the space of non-negative definite matrices. Our RDS formalism does not depend on the particular medium access protocol (randomized) and, under a minimal distributed observability assumption, we show that the sequence of random conditional prediction error covariance matrices converges in distribution to a unique invariant distribution (independent of the initial filter state), i.e., the conditional error process is shown to be ergodic. Under broad assumptions on the medium access protocol, we show that the conditional error covariance sequence satisfies a Markov-Feller property, leading to an explicit characterization of the support of its invariant measure. The methodology adopted in this work is sufficiently general to envision this application to sample path analysis of more general hybrid or switched systems, where existing analysis is mostly moment-based.

[1]  O. Kallenberg Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[2]  Richard M. Murray,et al.  On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage , 2006, Autom..

[3]  R. Zaharopol Invariant Probabilities of Markov-Feller Operators and Their Supports , 2005 .

[4]  Gerry Leversha,et al.  Foundations of modern probability (2nd edn), by Olav Kallenberg. Pp. 638. £49 (hbk). 2002. ISBN 0 387 95313 2 (Springer-Verlag). , 2004, The Mathematical Gazette.

[5]  Soummya Kar,et al.  Kalman Filtering With Intermittent Observations: Weak Convergence to a Stationary Distribution , 2009, IEEE Transactions on Automatic Control.

[6]  Soummya Kar,et al.  Kalman Filtering with Intermittent Observations: Weak Convergence and Moderate Deviations , 2009, ArXiv.

[7]  L. Arnold,et al.  Order-preserving random dynamical systems: equilibria, attractors, applications , 1998 .

[8]  Subhrakanti Dey,et al.  Stability of Kalman filtering with Markovian packet losses , 2007, Autom..

[9]  Bruno Sinopoli,et al.  Kalman filtering with intermittent observations , 2004, IEEE Transactions on Automatic Control.

[10]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Statistics of random processes , 1977 .

[11]  Ueli Maurer Random Systems: Theory and Applications , 2007, ICITS.

[12]  Lihua Xie,et al.  Stability of a random Riccati equation with Markovian binary switching , 2007, 2007 46th IEEE Conference on Decision and Control.

[13]  I. Chueshov Monotone Random Systems Theory and Applications , 2002 .

[14]  Panganamala Ramana Kumar,et al.  Sending the most recent observation is not optimal in networked control: Linear temporal coding and towards the design of a control specific transport protocol , 2007, 2007 46th IEEE Conference on Decision and Control.

[15]  A. Goldsmith,et al.  Kalman filtering with partial observation losses , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[16]  V. Araújo Random Dynamical Systems , 2006, math/0608162.

[17]  J.P. Hespanha,et al.  Estimation under uncontrolled and controlled communications in Networked Control Systems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[18]  Francesco Bullo,et al.  On Kalman Filtering for Detectable Systems With Intermittent Observations , 2009, IEEE Transactions on Automatic Control.