Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/108950
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Applied Mathematics | en_US |
| dc.creator | Xu, W | en_US |
| dc.creator | Feng, Z | en_US |
| dc.creator | Yiu, KFC | en_US |
| dc.date.accessioned | 2024-09-11T08:33:51Z | - |
| dc.date.available | 2024-09-11T08:33:51Z | - |
| dc.identifier.issn | 1547-5816 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/108950 | - |
| dc.language.iso | en | en_US |
| dc.publisher | AIMS Press | en_US |
| dc.rights | JIMO 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.rights | This 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.subject | Branch and bound method | en_US |
| dc.subject | Lower bound analysis | en_US |
| dc.subject | Optimal switching | en_US |
| dc.subject | Switched system | en_US |
| dc.subject | Time-scaling transformation | en_US |
| dc.title | An alternative method for the optimal switching problem of linear quadratic switched system | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 8617 | en_US |
| dc.identifier.epage | 8632 | en_US |
| dc.identifier.volume | 19 | en_US |
| dc.identifier.issue | 12 | en_US |
| dc.identifier.doi | 10.3934/jimo.2023054 | en_US |
| dcterms.abstract | Optimal 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.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Journal of industrial and management optimization, Dec. 2023, v. 19, no. 12, p. 8617-8632 | en_US |
| dcterms.isPartOf | Journal of industrial and management optimization | en_US |
| dcterms.issued | 2023-12 | - |
| dc.identifier.scopus | 2-s2.0-85183914198 | - |
| dc.identifier.eissn | 1553-166X | en_US |
| dc.description.validate | 202409 bcch | en_US |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | a3186a | - |
| dc.identifier.SubFormID | 49743 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Xu_Alternative_Method_Optimal.pdf | Pre-Published version | 788.87 kB | Adobe PDF | View/Open |
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.



