.png){kind=icon}
.png){kind=icon}
Return
Communication-Efficient Distributed Kalman Filtering Using ADMM
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2025.3615237.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article addresses the problem of optimal linear filtering in a network of local estimators, commonly referred to as distributed Kalman filtering (DKF). The DKF problem is formulated within a distributed optimization framework, where coupling constraints require the exchange of local state and covariance updates between neighboring nodes to achieve consensus. To address these constraints, the problem is transformed into an unconstrained optimization form using the augmented Lagrangian method. The distributed alternating direction method of multipliers is then applied to derive update steps that achieve the desired performance while exchanging only the primal variables. Notably, the proposed method enhances communication efficiency by eliminating the need for dual variable exchange. We show that the design parameters depend on the maximum eigenvalue of the network’s Laplacian matrix, yielding a significantly tighter bound compared to existing results. A rigorous convergence analysis is provided, proving that the state estimates converge to the true state and that the covariance matrices across all local estimators converge to a globally optimal solution. Numerical results are presented to validate the efficacy of the proposed approach.
Keywords:
Alternating direction method of multipliers (ADMM)
distributed filtering
Kalman filtering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W