Convenient Optimization Strategy Implemented in Multivariable Predictive Control

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17450%2F18%3AA1901UVQ" target="_blank" >RIV/61988987:17450/18:A1901UVQ - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/70883521:28140/18:63519939

Výsledek na webu

<a href="https://www.matec-conferences.org/articles/matecconf/abs/2018/69/matecconf_cscc2018_02022/matecconf_cscc2018_02022.html" target="_blank" >https://www.matec-conferences.org/articles/matecconf/abs/2018/69/matecconf_cscc2018_02022/matecconf_cscc2018_02022.html</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1051/matecconf/201821002022" target="_blank" >10.1051/matecconf/201821002022</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Convenient Optimization Strategy Implemented in Multivariable Predictive Control

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Convenient Optimization Strategy Implemented in Multivariable Predictive Control

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

MATEC Web of Conferences (vol. 210)

ISBN

—

ISSN

2261-236X

e-ISSN

2261-236X

Počet stran výsledku

5

Strana od-do

—

Název nakladatele

EDP Sciences

Místo vydání

—

Místo konání akce

Majorca, Spain

Datum konání akce

14. 7. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—