Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/108950
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.creatorXu, Wen_US
dc.creatorFeng, Zen_US
dc.creatorYiu, KFCen_US
dc.date.accessioned2024-09-11T08:33:51Z-
dc.date.available2024-09-11T08:33:51Z-
dc.identifier.issn1547-5816en_US
dc.identifier.urihttp://hdl.handle.net/10397/108950-
dc.language.isoenen_US
dc.publisherAIMS Pressen_US
dc.rightsJIMO is published by the American Institute of Mathematical Sciences and sponsored by Curtin University, Zhejiang University, and Chongqing Normal University. All rights reserved.en_US
dc.rightsThis article has been published in a revised form in Journal of Industrial and Management Optimization, https://doi.org/10.3934/jimo.2023054. This version is free to download for private research and study only. Not for redistribution, re-sale or use in derivative works.en_US
dc.subjectBranch and bound methoden_US
dc.subjectLower bound analysisen_US
dc.subjectOptimal switchingen_US
dc.subjectSwitched systemen_US
dc.subjectTime-scaling transformationen_US
dc.titleAn alternative method for the optimal switching problem of linear quadratic switched systemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage8617en_US
dc.identifier.epage8632en_US
dc.identifier.volume19en_US
dc.identifier.issue12en_US
dc.identifier.doi10.3934/jimo.2023054en_US
dcterms.abstractOptimal switching is a special class of optimal control problems for hybrid dynamic systems. In this paper, we consider the optimal switching problem of linear-quadratic switched systems. The aim is to design a suitable switching strategy with the constraint on the number of switchings so that the quadratical performance achieves the minimum value. This problem is difficult to be solved because of the tight coupling between the continuous switching time and the discrete switching sequence. In our method, we first divide this hybrid optimization problem into two subproblems. In each of them, only one type of variable is considered. Then, we develop a gradient-based method with the time-scaling transformation to process the optimal switching time problem and a branch and bound method based on a series of exact lower bounds to handle the optimal switching sequence problem, respectively. By solving these two subproblems alternatively, the optimal switching strategy satisfying the constraint on the number of switchings can be obtained. Numerical examples are given to demonstrate the efficiency of the proposed method.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of industrial and management optimization, Dec. 2023, v. 19, no. 12, p. 8617-8632en_US
dcterms.isPartOfJournal of industrial and management optimizationen_US
dcterms.issued2023-12-
dc.identifier.scopus2-s2.0-85183914198-
dc.identifier.eissn1553-166Xen_US
dc.description.validate202409 bcchen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera3186a-
dc.identifier.SubFormID49743-
dc.description.fundingSourceRGCen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Xu_Alternative_Method_Optimal.pdfPre-Published version788.87 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

97
Citations as of Feb 9, 2026

Downloads

56
Citations as of Feb 9, 2026

Google ScholarTM

Check

Altmetric


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