A dual problem in ℌ2 decentralized control subject to delays

It has been shown that the decentralized ℌ 2 model matching problem subject to delay can be solved by decomposing the controller into a centralized, but delayed, component and a decentralized FIR component, the latter of which can be solved for via a linearly constrained quadratic program. In this p...

Full description

Saved in:
Bibliographic Details
Published in2013 American Control Conference pp. 5772 - 5777
Main Authors Matni, Nikolai, Doyle, John C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2013
Subjects
Decentralized control
Delays
Dynamic programming
Finite impulse response filters
Optimization
Routing
Online AccessGet full text
ISBN1479901776
9781479901777
ISSN0743-1619
DOI10.1109/ACC.2013.6580742

Cover

More Information
Summary:It has been shown that the decentralized ℌ 2 model matching problem subject to delay can be solved by decomposing the controller into a centralized, but delayed, component and a decentralized FIR component, the latter of which can be solved for via a linearly constrained quadratic program. In this paper, we derive the dual to this optimization problem, show that strong duality holds, and exploit this to further analyze properties of the control problem. Namely, we determine a priori upper and lower bounds on the optimal ℌ 2 cost, and obtain further insight into the structure of the optimal FIR component. Furthermore, we show how the optimal dual variables can be used to inform communication graph augmentation, and illustrate this idea with a routing problem.
ISBN:1479901776
9781479901777
ISSN:0743-1619
DOI:10.1109/ACC.2013.6580742