TurboMPC: Fast, Scalable, and Differentiable Model Predictive Control on the GPU

• URL: http://arxiv.org/abs/2606.24039v1
• Date: Tue, 23 Jun 2026 00:42:33 GMT
• Title: TurboMPC: Fast, Scalable, and Differentiable Model Predictive Control on the GPU
• Abstract summary: TurboMPC is a differentiable MPC solver that runs entirely on the GPU.<n>TurboMPC supports state and control constraints, implicit, cross-time-coupled costs, and slack variables.<n>We validate TurboMPC on constrained planning, humanoid imitation learning, and reinforcement learning with neural-network cost function tasks.
• Score: 7.225671751980973
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Robotics increasingly relies on GPUs for parallel simulation, large-scale learning, and neural-network inference. For model predictive control (MPC) to scale with this paradigm, solvers must run efficiently on this hardware while remaining fast, differentiable, and compatible with expressive MPC formulations used in robotics. We present TurboMPC, a differentiable MPC solver that runs entirely on the GPU and supports state and control inequality constraints, implicit integrators, cross-time-coupled costs, and slack variables. TurboMPC combines sequential quadratic programming (SQP), an alternating direction method of multipliers (ADMM) inner solver, implicit differentiation, and a co-designed JAX-CUDA implementation for efficiency and ease of use. In simulation, we validate TurboMPC on constrained planning, humanoid imitation learning, and reinforcement learning with neural-network cost function tasks, achieving up to $15\times$ and $58\times$ speedups over state-of-the-art CPU and GPU differentiable solvers, respectively. We deploy TurboMPC on a full-scale car for minimum-time racing and find that batched, GPU-accelerated tuning of MPC parameters via Bayesian optimization yields significantly faster driving than a hand-tuned baseline. TurboMPC also scales to planning horizons of over $8000$ knot points while maintaining control of the vehicle. We open-source TurboMPC at: https://github.com/ToyotaResearchInstitute/turbompc

Related papers

• WarpMPC: Large-Batch MPC on GPU via ADMM with Unrolled $LDL^\ op$ Factorization [19.701591585846014]
  This paper introduces numerical optimizations for maximizing throughput on GPU when solving large batches of sequential quadratic programming (SQP) iterations.<n>The optimizations are implemented in a toolbox WarpMPC for model-predictive control (MPC) in JAX and Warp.<n>We achieve throughputs of 8,000 to 250,000 SQP iterations per second on nonlinear cartpole, quadrotor, and humanoid robot benchmarks.
  arXiv  Detail & Related papers  (2026-07-13T14:27:47Z)
• UniLab: A Heterogeneous Architecture for Robot RL Beyond GPU-Dominant Paradigms [68.40808444348735]
  In simulation-dominated robot control, the essential question is not which processor runs physics, but whether simulation throughput, policy learning, and runtime synchronization form an efficient end-to-end loop.<n>We present UniLab, a heterogeneous CPU-resident / GPU-learning architecture that decouples CPU-parallel simulation from GPU policy updates through a unified runtime for data movement, buffering, and synchronization.
  arXiv  Detail & Related papers  (2026-05-28T17:53:50Z)
• PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training [47.80717552769429]
  We present PRISM (Polynomial-fitting and Randomized Iterative Sketching for Matrix functions), a framework for accelerating computing algorithms for matrix functions.<n> PRISM combines adaptive approximation with randomized sketching: at each iteration, it fits a surrogate to the current spectrum via a sketched least-squares problem.<n>Unlike prior methods, PRISM requires no explicit spectral bounds or singular value estimates; and it adapts automatically to the evolving spectrum.
  arXiv  Detail & Related papers  (2026-01-29T18:55:46Z)
• Real-Time, Energy-Efficient, Sampling-Based Optimal Control via FPGA Acceleration [8.086534156824486]
  We present an FPGA-optimized MPPI design that exposes fine-grained parallelism and eliminates synchronization bottlenecks.<n>This results in an average 3.1x to 7.5x speedup over optimized implementations on an embedded GPU and CPU, respectively, while simultaneously achieving a 2.5x to 5.4x reduction in energy usage.
  arXiv  Detail & Related papers  (2026-01-23T23:47:09Z)
• Differentiable Model Predictive Control on the GPU [2.9273915933729047]
  Differentiable model predictive control (MPC) offers a powerful framework for combining learning and control.<n>In this work, we tackle this bottleneck by introducing a GPU-accelerated differentiable optimization tool for MPC.<n>We demonstrate substantial speedups over CPU- and GPU-based baselines, significantly improving upon state-of-the-art training times.
  arXiv  Detail & Related papers  (2025-10-07T17:42:17Z)
• Energy-efficient Task Adaptation for NLP Edge Inference Leveraging Heterogeneous Memory Architectures [68.91874045918112]
  adapter-ALBERT is an efficient model optimization for maximal data reuse across different tasks. We demonstrate the advantage of mapping the model to a heterogeneous on-chip memory architecture by performing simulations on a validated NLP edge accelerator.
  arXiv  Detail & Related papers  (2023-03-25T14:40:59Z)
• A Length Adaptive Algorithm-Hardware Co-design of Transformer on FPGA Through Sparse Attention and Dynamic Pipelining [28.336502115532905]
  This paper proposes a coherent sequence length adaptive algorithm-hardware co-design for Transformer acceleration. We develop a hardware-friendly sparse attention operator and a length-aware hardware resource scheduling algorithm. Our design has very small accuracy loss and has 80.2 $times$ and 2.6 $times$ speedup compared to CPU and GPU implementation.
  arXiv  Detail & Related papers  (2022-08-07T05:48:38Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)
• Spatiotemporal Costmap Inference for MPC via Deep Inverse Reinforcement Learning [27.243603228431564]
  We propose a new IRLRL algorithm that learns a goal-conditionedtemporal reward function. The resulting costmap is used by Model Predictive Controllers (MPCs) to perform a task.
  arXiv  Detail & Related papers  (2022-01-17T17:36:29Z)
• Lettuce: PyTorch-based Lattice Boltzmann Framework [0.0]
  The lattice Boltzmann method (LBM) is an efficient simulation technique for computational fluid mechanics and beyond. Here, we introduce Lettuce, a PyTorch-based LBM code with a threefold aim.
  arXiv  Detail & Related papers  (2021-06-24T11:44:21Z)
• Edge Federated Learning Via Unit-Modulus Over-The-Air Computation (Extended Version) [64.76619508293966]
  This paper proposes a unit-modulus over-the-air computation (UM-AirComp) framework to facilitate efficient edge federated learning. It uploads simultaneously local model parameters and updates global model parameters via analog beamforming. We demonstrate the implementation of UM-AirComp in a vehicle-to-everything autonomous driving simulation platform.
  arXiv  Detail & Related papers  (2021-01-28T15:10:22Z)
• MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models [96.1052289276254]
  This work introduces a new MAP-solver, based on the popular Dual Block-Coordinate Ascent principle. Surprisingly, by making a small change to the low-performing solver, we derive the new solver MPLP++ that significantly outperforms all existing solvers by a large margin.
  arXiv  Detail & Related papers  (2020-04-16T16:20:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.