Metraipolis › archive › dc_ae893263e305
CUDA MPC: A GPU-Native Solver for Model Predictive Control — arXiv:2608.03051
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03051
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:32:07.338Z
- SHA-256 of the archived text
224d7f5f05ee532143bd177dd1be770ea5c63d773e0748a07fee7d0d89ca6ec5- Stable URL of this page
https://metraipolis.com/documento/dc_ae893263e305
How to cite
CUDA MPC: A GPU-Native Solver for Model Predictive Control — arXiv:2608.03051 — arXiv (en), https://arxiv.org/abs/2608.03051 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ae893263e305 (Metraipolis archive dc_ae893263e305, sha256 224d7f5f05ee532143bd177dd1be770ea5c63d773e0748a07fee7d0d89ca6ec5)
BibTeX
@misc{dcae893263e305,
title = {CUDA MPC: A GPU-Native Solver for Model Predictive Control — arXiv:2608.03051},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03051},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ae893263e305; sha256 224d7f5f05ee532143bd177dd1be770ea5c63d773e0748a07fee7d0d89ca6ec5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03051. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Model Predictive Control (MPC) delivers constraint-aware control, but its reliance on online optimization limits its use on systems with fast dynamics, high-dimensional models, or long horizons. Existing GPU implementations typically treat the device as a linear-algebra accelerator, leaving the optimization loop dependent on repeated kernel launches and high-latency memory transfers. This paper introduces CUDA MPC, a GPU-native MPC framework that co-designs the optimization algorithm, execution model, and memory architecture for CUDA hardware. CUDA MPC pairs a parallel-in-horizon alternating direction method of multipliers (ADMM) splitting with a fused CUDA kernel that runs the entire iterative solve on the device. Intermediate optimization variables stay in low-latency, on-chip shared memory, and a localized atomic-flag protocol synchronizes only adjacent horizon blocks, minimizing host intervention, kernel-dispatch overhead, and global-memory traffic. Across six nonlinear robotics benchmarks spanning increasing state dimension and constraint density, CUDA MPC sustains real-time rates at horizons one to two orders of magnitude longer than CPU solvers: it solves an optimization-based collision-avoidance parking problem with 100 s of lookahead within a 0.1 s sampling interval, and is the only solver evaluated that achieves both real-time execution and collision-free coordination for a centralized 10-agent swarm, where acados and CasADi return no feasible solution and require 3.5 s and 4.5 s per solve. Against tensor-framework implementations of the same ADMM splitting, the fused kernel is up to $965\times$ faster. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-05 in cs.DC). Categorie arXiv: Robotics (cs.RO) ; Distributed, Parallel, and Cluster Computing (cs.DC); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.03051 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:18:40.943Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).