Distributed MPC with parametric coordination

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00306464" target="_blank" >RIV/68407700:21230/16:00306464 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/ACC.2016.7526652" target="_blank" >http://dx.doi.org/10.1109/ACC.2016.7526652</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ACC.2016.7526652" target="_blank" >10.1109/ACC.2016.7526652</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Distributed MPC with parametric coordination

Popis výsledku v původním jazyce

The paper presents an effective coordination scheme for a distributed optimization based on dual decomposition. The targeted class of optimization problems are strictly convex quadratic functions with linear constraints, where the dual function with coupling equality constraints in Lagrangian is continuous piecewise quadratic. The coordination is based on multi-parametric programming - the subproblem solvers return their solution on a polyhedron around a given Lagrange multiplier value. Centralized coordinator constructs the gradient and Hessian of a dual function and reaches exact consensus in a finite number of iterations, while only some subproblems are queried for a new solution in each iteration. The algorithm is applied to the distributed model predictive control. The efficiency, in terms of optimization time and the number of iterations, is demonstrated on the distributed model predictive control of the Barcelona water distribution network

Název v anglickém jazyce

Distributed MPC with parametric coordination

Popis výsledku anglicky

The paper presents an effective coordination scheme for a distributed optimization based on dual decomposition. The targeted class of optimization problems are strictly convex quadratic functions with linear constraints, where the dual function with coupling equality constraints in Lagrangian is continuous piecewise quadratic. The coordination is based on multi-parametric programming - the subproblem solvers return their solution on a polyhedron around a given Lagrange multiplier value. Centralized coordinator constructs the gradient and Hessian of a dual function and reaches exact consensus in a finite number of iterations, while only some subproblems are queried for a new solution in each iteration. The algorithm is applied to the distributed model predictive control. The efficiency, in terms of optimization time and the number of iterations, is demonstrated on the distributed model predictive control of the Barcelona water distribution network

Druh

D - Stať ve sborníku

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

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

2016 American Control Conference ACC

ISBN

978-1-4673-8682-1

ISSN

0743-1619

e-ISSN

—

Počet stran výsledku

6

Strana od-do

6253-6258

Název nakladatele

IEEE

Místo vydání

Piscataway, NJ

Místo konání akce

Boston, MA

Datum konání akce

6. 7. 2016

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

WRD - Celosvětová akce

Kód UT WoS článku

000388376106051