Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/98561
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.creatorXu, Wen_US
dc.creatorFeng, ZGen_US
dc.creatorLin, GHen_US
dc.creatorYiu, KFCen_US
dc.creatorYu, Len_US
dc.date.accessioned2023-05-10T02:00:19Z-
dc.date.available2023-05-10T02:00:19Z-
dc.identifier.issn0005-1098en_US
dc.identifier.urihttp://hdl.handle.net/10397/98561-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.rights© 2019 Elsevier Ltd. All rights reserved.en_US
dc.rights© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/.en_US
dc.rightsThe following publication Xu, W., Feng, Z. G., Lin, G. H., Yiu, K. F. C., & Yu, L. (2020). Optimal switching of switched systems with time delay in discrete time. Automatica, 112, 108696 is available at https://doi.org/10.1016/j.automatica.2019.108696.en_US
dc.subjectSwitched systemsen_US
dc.subjectTime delayen_US
dc.subjectOptimal switching problemen_US
dc.subjectBranch and bound techniqueen_US
dc.titleOptimal switching of switched systems with time delay in discrete timeen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume112en_US
dc.identifier.doi10.1016/j.automatica.2019.108696en_US
dcterms.abstractThis paper addresses a kind of optimal switching problem to minimize a quadratic cost functional for the discrete-time switched linear system with time delay. Since the dynamics is influenced by the switching sequence and the time delay, most existing gradient-based methods and relaxation techniques cannot be applied. In order to find the optimal solution, we first formulate the switched time-delay system into an equivalent switched system to separate the cross term of coefficient matrices. Based on the positive semi-definiteness of the system, we derive a series of lower bounds of the cost functional. By comparing them with the current optimal value, a depth-first branch and bound technique is proposed and the global optimal solution can be exactly obtained. Some numerical examples are demonstrated to verify the high efficiency of the method.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationAutomatica, Feb. 2020, v. 112, 108696en_US
dcterms.isPartOfAutomaticaen_US
dcterms.issued2020-02-
dc.identifier.scopus2-s2.0-85075795159-
dc.identifier.eissn1873-2836en_US
dc.identifier.artn108696en_US
dc.description.validate202305 bcchen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberAMA-0208-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextPolyUen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS15839076-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Yiu_Optimal_Switching_Switched.pdfPre-Published version839.54 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

81
Citations as of Apr 14, 2025

Downloads

70
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

21
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

16
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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