Designing Consensus-Based Distributed Filtering over Directed Graphs
This paper proposes a novel consensus-on-only-measurement distributed filter over directed graphs under the collectively observability condition. First, the distributed filter structure is designed with an augmented leader-following measurement fusion strategy. Subsequently, two parameter design methods are presented, and the consensus gain parameter is devised utilizing local information exclusively rather than global information. Additionally, the lower bound of the fusion step is derived to guarantee a uniformly upper bound of the estimation error covariance. Moreover, the lower bounds of the convergence rates of the steady-state performance gap between the proposed algorithm and the centralized filter are provided with the fusion step approaching infinity. The analysis demonstrates that the convergence rate is, at a minimum, as rapid as exponential convergence under the spectral norm condition of the communication graph. The transient performance is also analyzed with the fusion step tending to infinity. The inherent trade-off between the communication cost and the filtering performance is revealed from the analysis of the steady-state performance and the transient performance. Finally, the theoretical results are substantiated through the validation of two simulation examples.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Online Expectation-Maximization Based Frequency and Phase Consensus in Distributed Phased Arrays
Distributed phased arrays are comprised of separate, smaller antenna systems that coordinate with each other to support coherent beamforming towards a destination. However, due to the frequency drift and phase jitter of …
Learning the Exact Topology of Undirected Consensus Networks
In this article, we present a method to learn the interaction topology of a network of agents undergoing linear consensus updates in a non invasive manner. Our approach is based on multivariate Wiener filtering, which is…
Time SeriesTime Series AnalysisDistributed Cooperative Multi-Agent Reinforcement Learning with Directed Coordination Graph
Existing distributed cooperative multi-agent reinforcement learning (MARL) frameworks usually assume undirected coordination graphs and communication graphs while estimating a global reward via consensus algorithms for p…
Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Consensus optimization approach for distributed Kalman filtering: performance recovery of centralized filtering with proofs
This paper investigates the distributed Kalman filtering (DKF) from distributed optimization viewpoint. Motivated by the fact that Kalman filtering is a maximum a posteriori estimation (MAP) problem, which is a quadratic…
Distributed OptimizationDistributed Difference of Convex Optimization
In this article, we focus on solving a class of distributed optimization problems involving $n$ agents with the local objective function at every agent $i$ given by the difference of two convex functions $f_i$ and $g_i$ …
Distributed Optimization