{"title":"描述符系统的模型预测控制","authors":"Komeil Nosrati;Juri Belikov;Aleksei Tepljakov;Eduard Petlenkov","doi":"10.1109/LCSYS.2024.3448310","DOIUrl":null,"url":null,"abstract":"While model predictive control (MPC) is widely used in the process industry for its ability to handle constraints and address complex dynamics, its conventional formulations often encounter challenges when dealing with descriptor systems. These formulations rely on system transformations that are applicable only to regular systems in specific scenarios, along with additional index assumptions. This letter formulates the MPC problem of discrete-time linear descriptor systems directly in their original state-space representation. Using the penalized weighted least-squares approach, we derive a quadratic cost function subject to the descriptor system over a finite prediction horizon. Through backward dynamic programming within each horizon, we then solve the constrained optimization problem to construct control inputs for forward-shifted prediction horizons. To accomplish this, we deal with the convergence and stability analysis of the proposed algorithm. Numerical simulations demonstrate its effectiveness compared to traditional techniques, alleviating the need for regularity and index assumptions.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Model Predictive Control of Descriptor Systems\",\"authors\":\"Komeil Nosrati;Juri Belikov;Aleksei Tepljakov;Eduard Petlenkov\",\"doi\":\"10.1109/LCSYS.2024.3448310\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"While model predictive control (MPC) is widely used in the process industry for its ability to handle constraints and address complex dynamics, its conventional formulations often encounter challenges when dealing with descriptor systems. These formulations rely on system transformations that are applicable only to regular systems in specific scenarios, along with additional index assumptions. This letter formulates the MPC problem of discrete-time linear descriptor systems directly in their original state-space representation. Using the penalized weighted least-squares approach, we derive a quadratic cost function subject to the descriptor system over a finite prediction horizon. Through backward dynamic programming within each horizon, we then solve the constrained optimization problem to construct control inputs for forward-shifted prediction horizons. To accomplish this, we deal with the convergence and stability analysis of the proposed algorithm. Numerical simulations demonstrate its effectiveness compared to traditional techniques, alleviating the need for regularity and index assumptions.\",\"PeriodicalId\":37235,\"journal\":{\"name\":\"IEEE Control Systems Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2024-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Control Systems Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10643558/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10643558/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
While model predictive control (MPC) is widely used in the process industry for its ability to handle constraints and address complex dynamics, its conventional formulations often encounter challenges when dealing with descriptor systems. These formulations rely on system transformations that are applicable only to regular systems in specific scenarios, along with additional index assumptions. This letter formulates the MPC problem of discrete-time linear descriptor systems directly in their original state-space representation. Using the penalized weighted least-squares approach, we derive a quadratic cost function subject to the descriptor system over a finite prediction horizon. Through backward dynamic programming within each horizon, we then solve the constrained optimization problem to construct control inputs for forward-shifted prediction horizons. To accomplish this, we deal with the convergence and stability analysis of the proposed algorithm. Numerical simulations demonstrate its effectiveness compared to traditional techniques, alleviating the need for regularity and index assumptions.