2011
DOI: 10.1109/tase.2010.2061842
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Optimization for Model Predictive Control of Linear Dynamic Networks With Control-Input and Output Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
66
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 79 publications
(66 citation statements)
references
References 19 publications
0
66
0
Order By: Relevance
“…V 4 = |v [4] | ≤ 1.9 Algorithm 1 terminates in one iteration. The lower controllers LC i , i ∈ M, are synthesized using explicit MPC for system (8) based on the quadratic cost function The matrices Q i , R i and S i , i ∈ M have been computed so as to guarantee stability of the origin of (8) and (17).…”
Section: Numerical Examplementioning
confidence: 99%
See 1 more Smart Citation
“…V 4 = |v [4] | ≤ 1.9 Algorithm 1 terminates in one iteration. The lower controllers LC i , i ∈ M, are synthesized using explicit MPC for system (8) based on the quadratic cost function The matrices Q i , R i and S i , i ∈ M have been computed so as to guarantee stability of the origin of (8) and (17).…”
Section: Numerical Examplementioning
confidence: 99%
“…However, they require all-to-all communication between regulators and each MPC controller requires knowledge on how subsystem operations impact on the whole plant. Furthermore, existing solutions account for input constraints only with the exception of [4] where a DMPC scheme avoiding all-to-all communication and accounting for box constraints on inputs and outputs has been presented. Many other contributions [3,5,21,7,6] focused on non-cooperative schemes where each MPC controller minimizes a performance index local to each subsystem.…”
Section: Introductionmentioning
confidence: 99%
“…We consider the ordinary gradient method, Nesterov's method, and D-ADMM [8], which was designed to solve the more general problem (2), not (1). D-ADMM thus requires exchanging full solution estimates between the nodes.…”
Section: Simulationsmentioning
confidence: 99%
“…Although both problems have been studied extensively (see [1], [2], [3], [4] for centralized and distributed MPC, and [5], [6] for congestion control), their distributed implementation still relies on classical techniques, for example, the gradient algorithm [2], [5]. On the other hand, in the optimization field, it has recently been shown that the Alternating Direction Method of Multipliers (ADMM) is more appropriate for distributed or parallel implementations [7], [8], [9].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation