Primary Method of Quadratic Programming in Multivariable Predictive Control with Constraints

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F14%3A43872399" target="_blank" >RIV/70883521:28140/14:43872399 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-07401-6_18" target="_blank" >http://dx.doi.org/10.1007/978-3-319-07401-6_18</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-07401-6_18" target="_blank" >10.1007/978-3-319-07401-6_18</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Primary Method of Quadratic Programming in Multivariable Predictive Control with Constraints

Popis výsledku v původním jazyce

General Predictive Control (GPC) is a modern method for process control which is appropriate for many characters of processes. In this paper there is proposed possibility of optimization, which is performed in each sampling period, in the GPC algorithm.Lower time of calculations is in general important for GPC control of multivariable systems with many constraints. An improvement of a primary method of quadratic programming task is proposed in this paper. Compu-tational time can be reduced by changes in details of the optimization method. Time reserves are analyzed in a case of a nonlinear constrained problem which is represented by the Active Set Method. The improved method is presented and re-sults are discussed in simulations.

Název v anglickém jazyce

Primary Method of Quadratic Programming in Multivariable Predictive Control with Constraints

Popis výsledku anglicky

General Predictive Control (GPC) is a modern method for process control which is appropriate for many characters of processes. In this paper there is proposed possibility of optimization, which is performed in each sampling period, in the GPC algorithm.Lower time of calculations is in general important for GPC control of multivariable systems with many constraints. An improvement of a primary method of quadratic programming task is proposed in this paper. Compu-tational time can be reduced by changes in details of the optimization method. Time reserves are analyzed in a case of a nonlinear constrained problem which is represented by the Active Set Method. The improved method is presented and re-sults are discussed in simulations.

Druh

D - Stať ve sborníku

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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

Advances in Intelligent Systems and Computing. 289

ISBN

978-3-319-07400-9

ISSN

2194-5357

e-ISSN

—

Počet stran výsledku

9

Strana od-do

185-193

Název nakladatele

Springer-Verlag Berlin

Místo vydání

Heidelberg

Místo konání akce

Ostrava

Datum konání akce

23. 6. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

—