Name
Title | ||
|---|---|---|
All-in-one - Certifiable Optimal Distributed Kalman Filter under Unknown Correlations. |
Abstract | ||
|---|---|---|
The optimal fusion of estimates in a Distributed Kalman Filter (DKF) requires tracking of the complete network error covariance, which is a problem in terms of memory and communication bandwidth. A scalable alternative is to fuse estimates under unknown correlations, updating the local estimates and error covariance matrix as the solution of an optimisation problem. Unfortunately, this problem is NP-hard, forcing relaxations that lose optimality guarantees over the original problem. Motivated by this, we present the first Certifiable Optimal DKF (CO-DKF). Using only information from one-hop neighbours, CO-DKF solves the optimal fusion of estimates under unknown correlations by a tight Semidefinite Programming (SDP) relaxation. This particular relaxation allows to certify locally and in real time if the solution from the relaxed problem is the optimum of the original. In that case, we prove that CO-DKF is optimal in the Mean Square Error (MSE) sense. Additionally, we demonstrate that CO-DKF is a globally asymptotically stable estimator. Simulations show that CO-DKF outperforms other state-of-the-art DKF algorithms, specially in sparse, highly noisy setups. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/CDC45484.2021.9683348 | CDC |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eduardo Sebastián | 1 | 0 | 0.34 |
| Eduardo Montijano | 2 | 214 | 22.27 |
| Carlos Sagüés | 3 | 8 | 0.87 |