pith. sign in

arxiv: 1509.05967 · v1 · pith:EXH4CSFQnew · submitted 2015-09-20 · 💻 cs.SY

Distributed Filter Design for Cooperative H-Infinity-Type Estimation

classification 💻 cs.SY
keywords designdistributedfilterproblemalgorithmanalyzedappliedcommunications
0
0 comments X
read the original abstract

In this paper, we consider the distributed robust filtering problem, where estimator design is based on a set of coupled linear matrix inequalities (LMIs). We separate the problem and show that the method of multipliers can be applied to obtain a solution efficiently and in a decentralized fashion, i.e. all local estimators can compute their filter gains locally and iteratively, with communications restricted to their neighbours. The convergence properties of the iterative algorithm are analyzed and interpreted.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.