首页 | 本学科首页   官方微博 | 高级检索  
     


Pre‐arrangement of solvability,complexity, stability and quality of GPC systems
Authors:Piotr Suchomski,Zdzis&#x  aw Kowalczuk
Affiliation:Piotr Suchomski,Zdzisław Kowalczuk
Abstract:A design problem of generalized predictive control (GPC) of plants characterized by discrete‐time models with a non‐zero transportation‐delay is considered. Conditions for the existence of the solution of the problem in terms of relevant design parameters (tuning knobs) are proposed and the system characteristics are discussed. Several design hints suitable for such plant models are proposed. Consequently, it is shown that by a suitable choice of the GPC tuning knobs a definite pre‐arrangement of the solvability, complexity, stability and quality (including robustness) of the resultant GPC control systems can be achieved. Some numerical examples are also given to illustrate the design problem and proposed methodology. Copyright © 2002 John Wiley & Sons, Ltd.
Keywords:predictive control  solvability  stability  performance  robustness  characteristic polynomial
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号