Please use this identifier to cite or link to this item: https://doi.org/10.1109/9.566667
DC FieldValue
dc.titleRobust decoupling of discrete systems using ℓ1 optimization
dc.contributor.authorQuek, C.K.
dc.contributor.authorLoh, A.P.
dc.date.accessioned2014-10-07T03:04:49Z
dc.date.available2014-10-07T03:04:49Z
dc.date.issued1997
dc.identifier.citationQuek, C.K.,Loh, A.P. (1997). Robust decoupling of discrete systems using ℓ1 optimization. IEEE Transactions on Automatic Control 42 (4) : 549-553. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/9.566667" target="_blank">https://doi.org/10.1109/9.566667</a>
dc.identifier.issn00189286
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/81114
dc.description.abstractIn this paper, we address a control design problem related to decoupling, namely robust decoupling. The idea of robust decoupling is defined and shown to be equivalent to robust performance of a Hadamard-weighted ℓ1 performance measure. A necessary and sufficient condition to determine if a compensator satisfies robust performance of a Hadamard-weighted ℓ1 performance measure in the presence of structured uncertainty is given. This condition can be used to determine if a compensator robustly decouples a plant. Finally, an iterative scheme for synthesizing a robust decoupling controller is discussed.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/9.566667
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.doi10.1109/9.566667
dc.description.sourcetitleIEEE Transactions on Automatic Control
dc.description.volume42
dc.description.issue4
dc.description.page549-553
dc.description.codenIETAA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Jun 15, 2019

Page view(s)

46
checked on Jun 14, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.