Contact Us | Language: čeština English
Title: | Modifications of optimization algorithms applied in multivariable predictive control | ||||||||||
Author: | Kubalčík, Marek; Bobál, Vladimír; Barot, Tomáš | ||||||||||
Document type: | Peer-reviewed article (English) | ||||||||||
Source document: | WSEAS Transactions on Systems and Control. 2018, vol. 13, p. 497-505 | ||||||||||
ISSN: | 1991-8763 (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
Abstract: | Non-linear optimization, particularly quadratic programming (QP), is a mathematical method which is widely applicable in model predictive control (MPC). It is significantly important if constraints of variables are considered in MPC and the optimization task is then computationally demanding. The result of the optimization is a vector of future increments of a manipulated variable. The first element of this vector is applied in the next sampling period of MPC in the framework of a receding horizon strategy. In practical realization of a multivariable MPC, the optimization is characterized by higher computational complexity. Therefore, reduction of the computational complexity of the optimization methods has been widely researched. Besides the generally used numerical Hildreth’s method of QP, a possible suitable modification is based on precomputing operations proposed by Wang, L. This general optimization strategy is further modified. Two modifications, which could be applied separately each, were interconnected in this paper. The first modification was published previously; however, its application can be more efficient in connection with the second proposed approach, which modifies precomputing operations. Decreasing of the computational complexity of the optimization by using of the proposal is discussed and analyzed by measurements of floating point operations and control quality criterions using hypotheses tests – paired T-test and Wilcoxon test. © 2018, World Scientific and Engineering Academy and Society. All rights reserved. | ||||||||||
Show full item record |