Premium
Pre‐arrangement of solvability, complexity, stability and quality of GPC systems
Author(s) -
Suchomski Piotr,
Kowalczuk Zdzisław
Publication year - 2002
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.679
Subject(s) - robustness (evolution) , model predictive control , stability (learning theory) , mathematical optimization , control theory (sociology) , computer science , computational complexity theory , mathematics , control (management) , algorithm , artificial intelligence , machine learning , biochemistry , chemistry , gene
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.