2014
DOI: 10.1016/j.sysconle.2014.08.012
|View full text |Cite
|
Sign up to set email alerts
|

Feasible parallel-update distributed MPC for uncertain linear systems sharing convex constraints

Abstract: A distributed MPC approach for linear uncertain systems sharing convex constraints is presented. The systems, which are dynamically decoupled but share constraints on state and/or inputs, optimize once, in parallel, at each time step and exchange plans with neighbours thereafter. Coupled constraint satisfaction is guaranteed, despite the simultaneous decision making, by extra constraint tightening in each local problem. Necessary and sufficient conditions are given on the margins for coupled constraint satisfa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Several approaches exist in the literature (Richards & How, 2007;Trodden, 2014;Trodden & Richards, 2010 but their performances depend on the choice of initial states and the ordering of systems used in the sequential optimization process. Among them, the single-update DMPC (SDMPC) approach (Trodden, 2014) appears to be less sensitive to initial state variations since an initialization process is used and is therefore chosen. Note that SDMPC optimizes only one agent at each time step, leaving the other agents to follow their respective predicted controls.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Several approaches exist in the literature (Richards & How, 2007;Trodden, 2014;Trodden & Richards, 2010 but their performances depend on the choice of initial states and the ordering of systems used in the sequential optimization process. Among them, the single-update DMPC (SDMPC) approach (Trodden, 2014) appears to be less sensitive to initial state variations since an initialization process is used and is therefore chosen. Note that SDMPC optimizes only one agent at each time step, leaving the other agents to follow their respective predicted controls.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The method of Richards and How (2007) ensures the satisfaction of (3) using a sequential process: one system is optimized at a time while all others stay constant; this is followed sequentially by another system so that all M systems are optimized once in M time steps. Another approach is known as the cooperative MPC method (Trodden, 2014;Trodden & Richards, 2010. While specific details vary, the basic idea is that all systems within a cooperating set (possibly a singleton) are optimized jointly (or in parallel) while systems outside the cooperating set follow their predicted states and predicted controls.…”
Section: Introductionmentioning
confidence: 99%
“…In [123], a DMPC algorithm is developed for the dynamically decoupled MAS with coupled constraints; only one agent calculates the locally optimal control inputs and updates the system states at each time instant. As reported in [145,147], all agents with coupled constraints are optimized jointly in a cooperative set, which may have a strong requirement on the communication networks. Another direction for coupled constraints [158,159] that achieves global optimality is to distributively solve the dual optimization problem, where dual variables related to the coupled constraints are treated as consensus variables in the distributed optimization problem.…”
Section: Dmpc With Coupled Constraintsmentioning
confidence: 99%
“…Digital Object Identifier 10.1109/TAC.2020.3021528 been reported in [4], allowing subsystems to carry out optimizations simultaneously. However, the global optimality of the overall system is not necessarily guaranteed under these methods.…”
Section: Introductionmentioning
confidence: 99%