Distributing the Kalman Filter for Large-Scale Systems
Usman A. Khan, Jose M. F. Moura

TL;DR
This paper introduces a distributed Kalman filter for large-scale, sparsely connected systems, enabling local processing and minimal communication while maintaining accuracy comparable to centralized filters.
Contribution
It develops a novel distributed Kalman filtering approach with an Lth order Gauss-Markovian approximation and a new DICI algorithm for efficient local computation.
Findings
Achieves full distribution of the Kalman filter with minimal communication.
Maintains accuracy comparable to centralized Kalman filter.
Provides a criterion for sub-system selection based on the approximation order.
Abstract
This paper derives a \emph{distributed} Kalman filter to estimate a sparsely connected, large-scale, dimensional, dynamical system monitored by a network of sensors. Local Kalman filters are implemented on the (dimensional, where ) sub-systems that are obtained after spatially decomposing the large-scale system. The resulting sub-systems overlap, which along with an assimilation procedure on the local Kalman filters, preserve an th order Gauss-Markovian structure of the centralized error processes. The information loss due to the th order Gauss-Markovian approximation is controllable as it can be characterized by a divergence that decreases as . The order of the approximation, , leads to a lower bound on the dimension of the sub-systems, hence, providing a criterion for sub-system selection. The assimilation procedure is carried out on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
