Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/80405
DC FieldValue
dc.titleEvolutionary L ∞ identification and model reduction for robust control
dc.contributor.authorTan, K.C.
dc.contributor.authorLi, Y.
dc.date.accessioned2014-10-07T02:57:11Z
dc.date.available2014-10-07T02:57:11Z
dc.date.issued2000
dc.identifier.citationTan, K.C.,Li, Y. (2000). Evolutionary L ∞ identification and model reduction for robust control. Proceedings of the Institution of Mechanical Engineers. Part I, Journal of systems and control engineering 214 (3) : 231-237. ScholarBank@NUS Repository.
dc.identifier.issn09596518
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/80405
dc.description.abstractAn evolutionary approach for modern robust control oriented system identification and model reduction in the frequency domain is proposed. The technique provides both an optimized nominal model and a `worst-case' additive or multiplicative uncertainty bounding function which is compatible with robust control design methodologies. In addition, the evolutionary approach is applicable to both continuous- and discrete-time systems without the need for linear parametrization or a confined problem domain for deterministic convex optimization. The proposed method is validated against a laboratory multiple-input multiple-output (MIMO) test rig and benchmark problems, which show a higher fitting accuracy and provides a tighter L ∞ error bound than existing methods in the literature do.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleProceedings of the Institution of Mechanical Engineers. Part I, Journal of systems and control engineering
dc.description.volume214
dc.description.issue3
dc.description.page231-237
dc.description.codenPMJEE
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.

Google ScholarTM

Check


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