2019 IEEE 58th Conference on Decision and Control (CDC) 2019
DOI: 10.1109/cdc40024.2019.9029800
|View full text |Cite
|
Sign up to set email alerts
|

Towards a Modular Framework for Distributed Model Predictive Control of Nonlinear Neighbor-Affine Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…In the presented DMPC framework, the well-known ADMM algorithm (Boyd et al 2011) is employed in a continuous-time setting (Bestler and Graichen 2019). Note that the formulation of the algorithm is based on previous work (Burk et al 2019(Burk et al , 2020.…”
Section: Distributed Model Predictive Controlmentioning
confidence: 99%
See 2 more Smart Citations
“…In the presented DMPC framework, the well-known ADMM algorithm (Boyd et al 2011) is employed in a continuous-time setting (Bestler and Graichen 2019). Note that the formulation of the algorithm is based on previous work (Burk et al 2019(Burk et al , 2020.…”
Section: Distributed Model Predictive Controlmentioning
confidence: 99%
“…with the desired state It was shown in Burk et al (2019) that the computation time per agent is nearly independent of the system size, whereas in the central MPC case the computation time rises drastically. The simulation results for a system with 40 × 40 agents are given in Fig.…”
Section: Scalable Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…Further advantages like fast speed or even real-time capability are further described in [44]. The algorithmic side of GRAMPC is well documented in [47,48]. Now all required components necessary to facilitate predictive formation control that compensates for the effect of a distributed closed-loop network are realized.…”
Section: N]mentioning
confidence: 99%
“…It was shown in [27] that the computation time per agent is nearly independent of the system size, whereas in the central MPC case the computation time rises drastically. The simulation results for a system with 40 × 40 agents are given in Figure 4.…”
Section: Scalable Systemmentioning
confidence: 99%