DocumentCode
183752
Title
Mode scheduling under dwell time constraints in switched-mode systems
Author
Hale, M. ; Wardi, Y.
Author_Institution
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
fYear
2014
fDate
4-6 June 2014
Firstpage
3954
Lastpage
3959
Abstract
This paper presents an algorithmic technique for optimal mode scheduling in switched-mode dynamical systems under the constraint of a minimum dwell time. The technique is based on an optimal control formulation of the problem and on narrowing the optimality gap associated with the maximum principle. It consists of the following four successive steps: (i) solving the relaxed optimal control problem; (ii) approximating the relaxed solution by a switched-mode control; (iii) modifying the switched-mode schedule to incorporate the dwell-time constraints; and (iv) improving on the solution obtained in (iii) by further modifying the switching times of the modes. The main innovations of the paper are in the incorporation of the dwell-time constraints in step (iii), and in combining all four steps in a coherent framework. Despite the growing literature on switched-mode optimal control there hardly have emerged general-purpose algorithms which address dwell-time constraints. This paper presents an initial study of our proposed approach and demonstrates its efficacy via simulation examples while deferring theoretical studies to future research.
Keywords
approximation theory; maximum principle; scheduling; time-varying systems; algorithmic technique; maximum principle; minimum dwell time constraints; optimal mode scheduling; optimality gap; relaxed optimal control problem; switched-mode dynamical systems; switched-mode optimal control; switching times; Approximation algorithms; Equations; Optimal control; Schedules; Switches; Time factors; Optimal control; Optimization algorithms; Switched systems;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference (ACC), 2014
Conference_Location
Portland, OR
ISSN
0743-1619
Print_ISBN
978-1-4799-3272-6
Type
conf
DOI
10.1109/ACC.2014.6858763
Filename
6858763
Link To Document