SYSYSep 18, 2014

Minimum-Energy Distributed Filtering

arXiv:1409.529211 citationsh-index: 30
Originality Incremental advance
AI Analysis

It addresses the problem of distributed state estimation in sensor networks with unreliable local observability, offering a scalable solution for networked control systems.

The paper proposes a distributed filtering method using minimum-energy and H∞ filtering to ensure convergence even when individual sensors are unobservable, achieving guaranteed H∞ performance with minimal communication load.

The paper addresses the problem of distributed filtering with guaranteed convergence properties using minimum-energy filtering and $H_\infty$ filtering methodologies. A linear state space plant model is considered observed by a network of communicating sensors, in which individual sensor measurements may lead to an unobservable filtering problem. However, each filter locally shares estimates, that are subject to disturbances, with its respective neighboring filters to produce an estimate of the plant state. The minimum-energy strategy of the proposed local filter leads to a locally optimal time-varying filter gain facilitating the transient and the asymptotic convergence of the estimation error, with guaranteed $H_\infty$ performance. The filters are implementable using only the local measurements and information from the neighboring filters subject to disturbances. A key idea of the proposed algorithm is to locally approximate the neighboring estimates, that are not directly accessible, considering them as disturbance contaminated versions of the plant state. The proposed algorithm imposes minimal communication load on the network and is scalable to larger sensor networks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes