{"title":"A scheduling minmax predictive control algorithm for LPV systems subject to bounded rate parameters","authors":"A. Casavola, D. Famularo, G. Franzé","doi":"10.1109/CDC.2001.980615","DOIUrl":null,"url":null,"abstract":"A novel optimal receding horizon control strategy for input saturated linear time-varying (LTV) discrete-time systems with polytopic model uncertainties when the actual realization of the uncertain parameter is known and when bounded rate uncertain parameter variations are present, is proposed. The approach is based, on the updating at each step, in a binary tree fashion, of the closed convex hulls of all k-steps state trajectories originating from x at time 0 under a quadratically scheduling stabilizing state feedback. The solution is computed by solving an upper-bound on the \"worst-case\" infinite horizon quadratic cost under the constraint of steering the future state evolutions emanating from the current state into a feasible and positive invariant set. whose \"size\" depends on the rate variation of the uncertain parameter. Feasibility and closed loop stability of this strategy are here proved.","PeriodicalId":131411,"journal":{"name":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2001.980615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A novel optimal receding horizon control strategy for input saturated linear time-varying (LTV) discrete-time systems with polytopic model uncertainties when the actual realization of the uncertain parameter is known and when bounded rate uncertain parameter variations are present, is proposed. The approach is based, on the updating at each step, in a binary tree fashion, of the closed convex hulls of all k-steps state trajectories originating from x at time 0 under a quadratically scheduling stabilizing state feedback. The solution is computed by solving an upper-bound on the "worst-case" infinite horizon quadratic cost under the constraint of steering the future state evolutions emanating from the current state into a feasible and positive invariant set. whose "size" depends on the rate variation of the uncertain parameter. Feasibility and closed loop stability of this strategy are here proved.