Large problems are not necessarily hard: A case study on distributed NMPC paying off

A key motivation in the development of Distributed Model Predictive Control (DMPC) is to accelerate centralized Model Predictive Control (MPC) for large-scale systems. DMPC has the prospect of scaling well by parallelizing computations among subsystems. However, communication delays may deteriorate the performance of decentralized optimization, if excessively many iterations are required per control step. Moreover, centralized solvers often exhibit faster asymptotic convergence rates and, by parallelizing costly linear algebra operations, they can also benefit from modern multicore computing architectures. On this canvas, we study the computational performance of cooperative DMPC for linear and nonlinear systems. To this end, we apply a tailored decentralized real-time iteration scheme to frequency control for power systems. DMPC scales well for the considered linear and nonlinear benchmarks, as the iteration number does not depend on the number of subsystems. Comparisons with multi-threaded centralized solvers demonstrate competitive performance of the proposed decentralized optimization algorithms.

Authors

Institutions

Publication Details

Published
2025-06-24
DOI
https://doi.org/10.23919/ecc65951.2025.11187083
Citations
1
Primary Topic
Auction Theory and Applications
Type
article
Field-Weighted Citation Impact
2.11
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Large problems are not necessarily hard: A case study on distributed NMPC paying off

Gösta Stomberg, Timm Faulwasser, Alexander Engelmann, Maurice Raetsch
1 citations
Auction Theory and Applications
2.11
article

Large problems are not necessarily hard: A case study on distributed NMPC paying off

Gösta Stomberg, Timm Faulwasser, Alexander Engelmann, Maurice Raetsch
article en
1 citations

Abstract

A key motivation in the development of Distributed Model Predictive Control (DMPC) is to accelerate centralized Model Predictive Control (MPC) for large-scale systems. DMPC has the prospect of scaling well by parallelizing computations among subsystems. However, communication delays may deteriorate the performance of decentralized optimization, if excessively many iterations are required per control step. Moreover, centralized solvers often exhibit faster asymptotic convergence rates and, by parallelizing costly linear algebra operations, they can also benefit from modern multicore computing architectures. On this canvas, we study the computational performance of cooperative DMPC for linear and nonlinear systems. To this end, we apply a tailored decentralized real-time iteration scheme to frequency control for power systems. DMPC scales well for the considered linear and nonlinear benchmarks, as the iteration number does not depend on the number of subsystems. Comparisons with multi-threaded centralized solvers demonstrate competitive performance of the proposed decentralized optimization algorithms.

Universität Hamburg (DE), TU Dortmund University (DE), Hamburg University of Technology (DE)
Openalex Percentile: Top 10%
Auction Theory and Applications
2.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Large problems are not necessarily hard: A case study on distributed NMPC paying off — Gösta Stomberg, Timm Faulwasser, et al. · (2025) | TGRS Research Map | TGRS