Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T01:13:46.170Z Has data issue: false hasContentIssue false

Tracking control of linear switched systems

Published online by Cambridge University Press:  17 February 2009

R. Li
Affiliation:
Center for Control Theory and Guidance Technology Harbin Institute of TechnologyHarbinhitlirui@gmail.com
Z.G. Feng
Affiliation:
College of Mathematics and Computer Science Chongqing Normal UniversityChongqing, P.R.China
K.L. Teo
Affiliation:
Department of Mathematics & Statistics Curtin University of TechnologyPerth, WA 6845, AustraliaK.L.Teo@curtin.edu.au.
G.R. Duan
Affiliation:
Center for Control Theory and Guidance Technology Harbin Institute of TechnologyHarbinhitlirui@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper deals with the optimal tracking problem for switched systems, where the control input, the switching times and the switching index are all design variables. We propose a three-stage method for solving this problem. First, we fix the switching times and switching index sequence, which leads to a linear tracking problem, except different subsystems are defined in their respective time intervals. The optimal control and the corresponding cost function obtained depend on the switching signal. This gives rise to an optimal parameter selection problem for which the switching instants and the switching index are to be chosen optimally. In the second stage, the switching index is fixed. A reverse time transformation followed by a time scaling transform are introduced to convert this subproblem into an equivalent standard optimal parameter selection problem. The gradient formula of the cost function is derived. Then the discrete filled function is used in the third stage to search for the optimal switching index. On this basis, a computational method, which combines a gradient-based method, a local search algorithm and a filled function method, is developed for solving this problem. A numerical exampleis solved, showing the effectiveness of the proposed approach.

Information

Type
Articles
Copyright
Copyright © Australian Mathematical Society 2007