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...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) Vol. 47; no. 1; pp. 1 - 13
Main Author: Ugrinovskii, V.
Format: Journal Article
Language:English
Published: Kidlington Elsevier Ltd 01.01.2011
Elsevier
Subjects:
ISSN:0005-1098, 1873-2836
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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