File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Robust commutation time for switching polynomial systems

TitleRobust commutation time for switching polynomial systems
Authors
KeywordsCommutation time
LMI
Stability
Switching systems
Uncertain systems
Issue Date2007
Citation
Proceedings Of The Ieee Conference On Decision And Control, 2007, p. 6334-6339 How to Cite?
AbstractThis paper considers the stability analysis of switching polynomial systems. In particular, the problem of computing upper bounds of the minimum commutation time ensuring stability with respect to finite and infinite input sequences is dealt with. It is shown that such upper bounds can be established by solving LMI feasibility tests for given polynomial Lyapunov functions in the former case and homogeneous polynomial Lyapunov functions in the latter case. Lastly, the structure of the obtained tests is exploited to derive a search for less conservative upper bounds in a reduced number of variables through the solution of convex LMI optimizations at each iteration. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99085
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChesi, Gen_HK
dc.contributor.authorHung, YSen_HK
dc.date.accessioned2010-09-25T18:15:14Z-
dc.date.available2010-09-25T18:15:14Z-
dc.date.issued2007en_HK
dc.identifier.citationProceedings Of The Ieee Conference On Decision And Control, 2007, p. 6334-6339en_HK
dc.identifier.issn0191-2216en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99085-
dc.description.abstractThis paper considers the stability analysis of switching polynomial systems. In particular, the problem of computing upper bounds of the minimum commutation time ensuring stability with respect to finite and infinite input sequences is dealt with. It is shown that such upper bounds can be established by solving LMI feasibility tests for given polynomial Lyapunov functions in the former case and homogeneous polynomial Lyapunov functions in the latter case. Lastly, the structure of the obtained tests is exploited to derive a search for less conservative upper bounds in a reduced number of variables through the solution of convex LMI optimizations at each iteration. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofProceedings of the IEEE Conference on Decision and Controlen_HK
dc.subjectCommutation timeen_HK
dc.subjectLMIen_HK
dc.subjectStabilityen_HK
dc.subjectSwitching systemsen_HK
dc.subjectUncertain systemsen_HK
dc.titleRobust commutation time for switching polynomial systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChesi, G:chesi@eee.hku.hken_HK
dc.identifier.emailHung, YS:yshung@eee.hku.hken_HK
dc.identifier.authorityChesi, G=rp00100en_HK
dc.identifier.authorityHung, YS=rp00220en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/CDC.2007.4434128en_HK
dc.identifier.scopuseid_2-s2.0-62749156395en_HK
dc.identifier.hkuros139753en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-62749156395&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage6334en_HK
dc.identifier.epage6339en_HK
dc.identifier.scopusauthoridChesi, G=7006328614en_HK
dc.identifier.scopusauthoridHung, YS=8091656200en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats