On observability and optimal gain design for distributed linear filtering and prediction
Not on the map. Why?
Abstract (arXiv)
This paper presents a new approach to distributed linear filtering and prediction. The problem under consideration consists of a random dynamical system observed by a multi-agent network of sensors where the network is sparse. Inspired by the consensus+innovations type of distributed estimation approaches, this paper proposes a novel algorithm that fuses the concepts of consensus and innovations. The paper introduces a definition of distributed observability, required by the proposed algorithm, which is a weaker assumption than that of global observability and connected network assumptions combined together. Following first principles, the optimal gain matrices are designed such that the mean-squared error of estimation is minimized at each agent and the distributed version of the algebraic Riccati equation is derived for computing the gains.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 39 references that are in the map. First posted on arXiv 7 Mar 2022.
Builds on
4 of 39 references.
References · 4
- 2022A Regret Minimization Approach to Multi-Agent Controlcited by 4
- 2016Consensus+Innovations Distributed Kalman Filter with Optimized Gainscited by 3
- 2021All-in-one: Certifiable Optimal Distributed Kalman Filter under Unknown Correlationscited by 2
- 2019Distributed Design of Robust Kalman Filters over Corrupted Channelscited by 1
Built on by
Citing papers per year: 2022: 1.
1 paper.