File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Reachable set estimation for switched positive systems

TitleReachable set estimation for switched positive systems
Authors
KeywordsDiscrete-time systems
Hyper-pyramid
Lyapunov methods
Reachable set estimation
Switched positive systems
Issue Date2018
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207721.asp
Citation
International Journal of Systems Science, 2018, v. 49 n. 11, p. 2341-2352 How to Cite?
AbstractThis paper focuses on the problem of reachable set estimation for discrete-time switched positive systems under two possible classes of exogenous disturbance. The multiple linear copositive Lyapunov function approach is applied to determine the bounding hyper-pyramids for the reachable set. Based on some Lyapunov-based inequalities and the linear version of the S-procedure technique, the bounding hyper-pyramids for the reachable set can be determined by solving a set of inequalities. Two optimisation methods are adopted to make the bounding hyper-pyramids as small as possible. Genetic Algorithm (GA) is utilised to search for the optimal value of the decision variables in the obtained inequalities. Finally, numerical examples are given to illustrate the effectiveness of the theoretical findings.
Persistent Identifierhttp://hdl.handle.net/10722/272270
ISSN
2019 Impact Factor: 2.149
2015 SCImago Journal Rankings: 1.083
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChen, Y-
dc.contributor.authorLam, J-
dc.contributor.authorShen, J-
dc.contributor.authorDu, B-
dc.contributor.authorLi, P-
dc.date.accessioned2019-07-20T10:39:00Z-
dc.date.available2019-07-20T10:39:00Z-
dc.date.issued2018-
dc.identifier.citationInternational Journal of Systems Science, 2018, v. 49 n. 11, p. 2341-2352-
dc.identifier.issn0020-7721-
dc.identifier.urihttp://hdl.handle.net/10722/272270-
dc.description.abstractThis paper focuses on the problem of reachable set estimation for discrete-time switched positive systems under two possible classes of exogenous disturbance. The multiple linear copositive Lyapunov function approach is applied to determine the bounding hyper-pyramids for the reachable set. Based on some Lyapunov-based inequalities and the linear version of the S-procedure technique, the bounding hyper-pyramids for the reachable set can be determined by solving a set of inequalities. Two optimisation methods are adopted to make the bounding hyper-pyramids as small as possible. Genetic Algorithm (GA) is utilised to search for the optimal value of the decision variables in the obtained inequalities. Finally, numerical examples are given to illustrate the effectiveness of the theoretical findings.-
dc.languageeng-
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207721.asp-
dc.relation.ispartofInternational Journal of Systems Science-
dc.subjectDiscrete-time systems-
dc.subjectHyper-pyramid-
dc.subjectLyapunov methods-
dc.subjectReachable set estimation-
dc.subjectSwitched positive systems-
dc.titleReachable set estimation for switched positive systems-
dc.typeArticle-
dc.identifier.emailLam, J: jlam@hku.hk-
dc.identifier.authorityLam, J=rp00133-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/00207721.2018.1501518-
dc.identifier.scopuseid_2-s2.0-85050907375-
dc.identifier.hkuros299321-
dc.identifier.volume49-
dc.identifier.issue11-
dc.identifier.spage2341-
dc.identifier.epage2352-
dc.identifier.isiWOS:000444258700006-
dc.publisher.placeUnited Kingdom-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats