A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks. (September 2018)

• Record Type: Journal Article
• Authors: Wu, Zongze; Fu, Minyue; Xu, Yong; Lu, Renquan
• Is Part Of: Automatica. Volume 95(2018)
• Page Start: 63
• Page End: 72
• Publication Date: 2018-09
• Subjects: Distributed estimation -- Distributed Kalman filtering -- Sensor networks -- Maximum likelihood estimation -- Weighted least-squares estimation -- Distributed field estimation; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2018.05.012
• Languages: English
• ISSNs: 0005-1098

Abstract

Abstract: This paper proposes a new distributed algorithm for Kalman filtering. It is assumed that a linear discrete-time dynamic system is monitored by a network of sensors with some being active and some idle. The goal of distributed state estimation is to devise a distributed algorithm such that each node can independently compute the optimal state estimate by using its local measurements and information exchange with its neighbours. The proposed algorithm applies to acyclic network graphs (i.e., tree graphs) with fast finite-time convergence, but is also applicable to cyclic graphs by combining it with a distributed loop removal algorithm. The proposed algorithm enjoys low complexities, robustness against transmission adversaries and asynchronous implementability. The proposed distributed algorithm also applies to maximum likelihood estimation and weighted least-squares estimation, as special cases. With simple modifications, the proposed algorithm also applies to an important problem in signal processing called distributed field estimation.