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.2000 Mathematics subject classification: primary 49N90; secondary 90C11,93C95.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.