Convenient optimization strategy implemented in multivariable predictive control
Kubalcik Marek, Bobal Vladimir, Barot Tomas
MATEC Web of Conferences · 2018
doi:10.1051/matecconf/201821002022 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
A significantly important part of model predictive control (MPC) with constraints is a solution of an optimization task. 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. One suitable principle of precomputing operations was proposed by Wang, L. This general optimization strategy is further modified in this paper. Decreasing of the computational complexity of the optimization by using of the proposed modification is discussed.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.