Combined Gradient and Newton Projection Quadratic Programming Solver for MPC

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00182522" target="_blank" >RIV/68407700:21230/11:00182522 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.ifac-papersonline.net/Detailed/49311.html" target="_blank" >http://www.ifac-papersonline.net/Detailed/49311.html</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3182/20110828-6-IT-1002.02573" target="_blank" >10.3182/20110828-6-IT-1002.02573</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Combined Gradient and Newton Projection Quadratic Programming Solver for MPC

Popis výsledku v původním jazyce

The objective of this paper is to present an effective on-line solver for simple constrained quadratic programming (QP) which arises in linear model predictive control (MPC) framework. In MPC, the QP is solved at each sampling time, thus a fast solver must be used for short sampling times in real-time applications. The multi-parametric quadratic programming (mp-QP) approach (explicit solution) is impossible to use for larger systems due to the memory limitation. On the other hand, the presented approachis well suitable even for medium scale systems with short sampling time, since it is based on combination of gradient and Newton projection algorithm which is very close to optimum in a very few iterations and the computation of the Newton step is not involved at each iteration.

Název v anglickém jazyce

Combined Gradient and Newton Projection Quadratic Programming Solver for MPC

Popis výsledku anglicky

The objective of this paper is to present an effective on-line solver for simple constrained quadratic programming (QP) which arises in linear model predictive control (MPC) framework. In MPC, the QP is solved at each sampling time, thus a fast solver must be used for short sampling times in real-time applications. The multi-parametric quadratic programming (mp-QP) approach (explicit solution) is impossible to use for larger systems due to the memory limitation. On the other hand, the presented approachis well suitable even for medium scale systems with short sampling time, since it is based on combination of gradient and Newton projection algorithm which is very close to optimum in a very few iterations and the computation of the Newton step is not involved at each iteration.

Druh

D - Stať ve sborníku

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

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

Proceedings of the 18th IFAC World Congress, 2011

ISBN

978-3-902661-93-7

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

5567-5572

Název nakladatele

IFAC

Místo vydání

Bologna

Místo konání akce

Milano

Datum konání akce

28. 8. 2011

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

WRD - Celosvětová akce

Kód UT WoS článku

—