File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Robust deadbeat pole assignment with gain constraints: An LMI optimization approach

TitleRobust deadbeat pole assignment with gain constraints: An LMI optimization approach
Authors
KeywordsConvex Optimization
Deadbeat Control
Linear Matrix Inequality
Robust Pole Assignment
Issue Date2000
PublisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/2133
Citation
Optimal Control Applications And Methods, 2000, v. 21 n. 6, p. 243-256 How to Cite?
AbstractThis paper considers a kind of robust pole assignment problem for discrete-time systems. A recently developed a posteriori measure of closed-loop eigenvalue sensitivity suitable for MIMO deadbeat regulator design is minimized during the search of the state feedback gain. The problem is cast into an LMI-based convex optimization task in which constraints on the size of feedback gain can be catered naturally. The proposed pole assignment algorithm can also be used to find the minimum feedback gain with respect to different norms. A numerical example is then employed to illustrate the effectiveness of the method.
Persistent Identifierhttp://hdl.handle.net/10722/156558
ISSN
2015 Impact Factor: 1.097
2015 SCImago Journal Rankings: 0.834
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorTam, HKen_US
dc.contributor.authorLam, Jen_US
dc.date.accessioned2012-08-08T08:42:58Z-
dc.date.available2012-08-08T08:42:58Z-
dc.date.issued2000en_US
dc.identifier.citationOptimal Control Applications And Methods, 2000, v. 21 n. 6, p. 243-256en_US
dc.identifier.issn0143-2087en_US
dc.identifier.urihttp://hdl.handle.net/10722/156558-
dc.description.abstractThis paper considers a kind of robust pole assignment problem for discrete-time systems. A recently developed a posteriori measure of closed-loop eigenvalue sensitivity suitable for MIMO deadbeat regulator design is minimized during the search of the state feedback gain. The problem is cast into an LMI-based convex optimization task in which constraints on the size of feedback gain can be catered naturally. The proposed pole assignment algorithm can also be used to find the minimum feedback gain with respect to different norms. A numerical example is then employed to illustrate the effectiveness of the method.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/2133en_US
dc.relation.ispartofOptimal Control Applications and Methodsen_US
dc.subjectConvex Optimizationen_US
dc.subjectDeadbeat Controlen_US
dc.subjectLinear Matrix Inequalityen_US
dc.subjectRobust Pole Assignmenten_US
dc.titleRobust deadbeat pole assignment with gain constraints: An LMI optimization approachen_US
dc.typeArticleen_US
dc.identifier.emailLam, J:james.lam@hku.hken_US
dc.identifier.authorityLam, J=rp00133en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1002/oca.676en_US
dc.identifier.scopuseid_2-s2.0-0034312968en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034312968&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume21en_US
dc.identifier.issue6en_US
dc.identifier.spage243en_US
dc.identifier.epage256en_US
dc.identifier.isiWOS:000167797000001-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridTam, HK=7101835047en_US
dc.identifier.scopusauthoridLam, J=7201973414en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats