Asynchronous Sensitivity-Based Distributed NMPC
Abstract
This paper presents a cooperative distributed model predictive control (MPC) scheme for nonlinear continuous-time systems. The centralized optimal control problem is solved asynchronously via a fixed number of sensitivity-based distributed programming (SBDP) iterations. The proposed scheme requires only neighbor-to-neighbor communication and no synchronization between agents during optimization. Under nominal MPC stability and bounded information delay, local exponential stability is established for a sufficiently large number of per-agent SBDP iterations. Numerical and hardware-in-the-loop results on both Ethernet and Wi-Fi demonstrate the benefits of an asynchronous execution, reducing execution times by over 60% while maintaining comparable closed loop performance.
Related
- Asynchronous Jacobi and randomized Gauss--Seidel methods in shared and distributed memory: A unified convergence-rate analysis
- Thermal management optimization of Battery Electric Vehicles via hierarchical NMPC with CMO-trained Neural Models
- A Spike-Driven Neuromorphic Framework for Asynchronous Population-Based Optimisation
- L2-error bounds for covariation estimation under asynchronous mixed time-space sampling
- Robustifying Asynchronous SGD via Soft Throttling
BibTeX
@misc{esch2026asynchronous,
title = {{Asynchronous Sensitivity-Based Distributed NMPC}},
author = {Maximilian Pierer von Esch and Andres Völz and Knut Graichen},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.03412},
eprint = {2607.03412},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.03412},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Asynchronous Sensitivity-Based Distributed NMPC
AU - Maximilian Pierer von Esch
AU - Andres Völz
AU - Knut Graichen
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2607.03412
UR - https://arxiv.org/abs/2607.03412
AB - This paper presents a cooperative distributed model predictive control (MPC) scheme for nonlinear continuous-time systems. The centralized optimal control problem is solved asynchronously via a fixed number of sensitivity-based distributed programming (SBDP) iterations. The proposed scheme requires only neighbor-to-neighbor communication and no synchronization between agents during optimization. Under nominal MPC stability and bounded information delay, local exponential stability is established for a sufficiently large number of per-agent SBDP iterations. Numerical and hardware-in-the-loop results on both Ethernet and Wi-Fi demonstrate the benefits of an asynchronous execution, reducing execution times by over 60% while maintaining comparable closed loop performance.
ER -