Realizability and Internal Model Control on Networks

Anders Rantzer

REVIEW

Realizability and Internal Model Control on Networks

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 1812.07748 v2 pith:22ZH7IGR submitted 2018-12-19 math.OC

Realizability and Internal Model Control on Networks

Anders Rantzer This is my paper

classification math.OC

keywords networkclosedcontrolinternalloopmodelrealizabilitytransfer

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

It is proved that network realizability of controllers can be enforced without conservatism using convex constraints on the closed loop transfer function. Once a network realizable closed loop transfer matrix has been found, a corresponding controller can be implemented using a network structured version of Internal Model Control.

Realizability and Internal Model Control on Networks

discussion (0)