Distributed robust filtering with H∞ consensus of estimates

The paper addresses a problem of design of distributed robust filters using the recent vector dissipativity theory. The main result is a sufficient condition which guarantees a suboptimal H∞ level of disagreement of estimates in a network of filters. It involves solving a convex optimization/feasibi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Automatica (Oxford) Jg. 47; H. 1; S. 1 - 13
1. Verfasser: Ugrinovskii, V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kidlington Elsevier Ltd 01.01.2011
Elsevier
Schlagworte:
ISSN:0005-1098, 1873-2836
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The paper addresses a problem of design of distributed robust filters using the recent vector dissipativity theory. The main result is a sufficient condition which guarantees a suboptimal H∞ level of disagreement of estimates in a network of filters. It involves solving a convex optimization/feasibility problem subject to LMI constraints. The special case of balanced interconnection graphs is also considered. A gradient descent type algorithm is presented which allows the nodes to compute their estimator parameters in a decentralized manner. The proposed approach is applied to the problem of observer-based robust synchronization of a nonlinear network to an isolated node.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2010.10.002