Canghua Jiang, Dongming Zhang, Chi Yuan, K. L. Teo
{"title":"An active set solver for constrained $ H_\\infty $ optimal control problems with state and input constraints","authors":"Canghua Jiang, Dongming Zhang, Chi Yuan, K. L. Teo","doi":"10.3934/naco.2021056","DOIUrl":null,"url":null,"abstract":"This paper proposes an active set solver for \\begin{document}$ H_\\infty $\\end{document} min-max optimal control problems involving linear discrete-time systems with linearly constrained states, controls and additive disturbances. The proposed solver combines Riccati recursion with dynamic programming. To deal with possible degeneracy (i.e. violations of the linear independence constraint qualification), constraint transformations are introduced that allow the surplus equality constraints on the state at each stage to be moved to the previous stage together with their Lagrange multipliers. In this way, degeneracy for a feasible active set can be determined by checking whether there exists an equality constraint on the initial state over the prediction horizon. For situations when the active set is degenerate and all active constraints indexed by it are non-redundant, a vertex exploration strategy is developed to seek a non-degenerate active set. If the sampled state resides in a robust control invariant set and certain second-order sufficient conditions are satisfied at each stage, then a bounded \\begin{document}$ l_2 $\\end{document} gain from the disturbance to controlled output can be guaranteed for the closed-loop system under some standard assumptions. Theoretical analysis and numerical simulations show that the computational complexity per iteration of the proposed solver depends linearly on the prediction horizon.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"22 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algebra Control and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/naco.2021056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes an active set solver for \begin{document}$ H_\infty $\end{document} min-max optimal control problems involving linear discrete-time systems with linearly constrained states, controls and additive disturbances. The proposed solver combines Riccati recursion with dynamic programming. To deal with possible degeneracy (i.e. violations of the linear independence constraint qualification), constraint transformations are introduced that allow the surplus equality constraints on the state at each stage to be moved to the previous stage together with their Lagrange multipliers. In this way, degeneracy for a feasible active set can be determined by checking whether there exists an equality constraint on the initial state over the prediction horizon. For situations when the active set is degenerate and all active constraints indexed by it are non-redundant, a vertex exploration strategy is developed to seek a non-degenerate active set. If the sampled state resides in a robust control invariant set and certain second-order sufficient conditions are satisfied at each stage, then a bounded \begin{document}$ l_2 $\end{document} gain from the disturbance to controlled output can be guaranteed for the closed-loop system under some standard assumptions. Theoretical analysis and numerical simulations show that the computational complexity per iteration of the proposed solver depends linearly on the prediction horizon.
This paper proposes an active set solver for \begin{document}$ H_\infty $\end{document} min-max optimal control problems involving linear discrete-time systems with linearly constrained states, controls and additive disturbances. The proposed solver combines Riccati recursion with dynamic programming. To deal with possible degeneracy (i.e. violations of the linear independence constraint qualification), constraint transformations are introduced that allow the surplus equality constraints on the state at each stage to be moved to the previous stage together with their Lagrange multipliers. In this way, degeneracy for a feasible active set can be determined by checking whether there exists an equality constraint on the initial state over the prediction horizon. For situations when the active set is degenerate and all active constraints indexed by it are non-redundant, a vertex exploration strategy is developed to seek a non-degenerate active set. If the sampled state resides in a robust control invariant set and certain second-order sufficient conditions are satisfied at each stage, then a bounded \begin{document}$ l_2 $\end{document} gain from the disturbance to controlled output can be guaranteed for the closed-loop system under some standard assumptions. Theoretical analysis and numerical simulations show that the computational complexity per iteration of the proposed solver depends linearly on the prediction horizon.
期刊介绍:
Numerical Algebra, Control and Optimization (NACO) aims at publishing original papers on any non-trivial interplay between control and optimization, and numerical techniques for their underlying linear and nonlinear algebraic systems. Topics of interest to NACO include the following: original research in theory, algorithms and applications of optimization; numerical methods for linear and nonlinear algebraic systems arising in modelling, control and optimisation; and original theoretical and applied research and development in the control of systems including all facets of control theory and its applications. In the application areas, special interests are on artificial intelligence and data sciences. The journal also welcomes expository submissions on subjects of current relevance to readers of the journal. The publication of papers in NACO is free of charge.