On Boundedness of Error Covariances for Kalman Consensus Filtering Problems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

4 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)2654-2661
Journal / PublicationIEEE Transactions on Automatic Control
Volume65
Issue number6
Online published20 Sep 2019
Publication statusPublished - Jun 2020

Abstract

In this paper, the uniform bounds of error covariances for several types of Kalman consensus filters (KCFs) are investigated for a class of linear time-varying systems over sensor networks with given topologies. Rather than the traditional detectability assumption, a new concept called collectively uniform detectability (CUD) is proposed to address the detectability issues over sensor networks with relaxed restrictions. By using matrix inequality analysis techniques, the conditions for the newly proposed CUD concept are established and then the explicit expressions of the uniform upper/lower bounds are derived for error covariances of several commonly used KCF algorithms. Consequently, a comparison is conducted between the obtained bounds so as to reveal their relationships. Finally, a numerical example is provided to calculate and further compare the bounds of interest in order to demonstrate the practical usefulness of the developed theory.

Research Area(s)

  • collectively uniform detectability, Covariance matrices, Kalman consensus filters (KCFs), Kalman filters, Noise measurement, Robot sensing systems, sensor networks, Stability analysis, time-varying systems, uniform bounds