Distributed Filter Design for Cooperative H-Infinity-Type Estimation

Frank Allg\"ower; Jingbo Wu; Li Li; Valery Ugrinovskii

REVIEW

Distributed Filter Design for Cooperative H-Infinity-Type Estimation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1509.05967 v1 pith:EXH4CSFQ submitted 2015-09-20 cs.SY cs.SY

Jingbo Wu , Li Li , Valery Ugrinovskii , Frank Allgöwer This is my paper

classification cs.SY

keywords designdistributedfilterproblemalgorithmanalyzedappliedcommunications

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Sign in to comment.

Pith tools