ArXiv

Parallel Dynamic Programming for Conic Linear Quadratic Control

Authors
Luyao Zhang, Gabriel Bravo-Palacios, Brian Plancher...
Categories
math.OC, cs.RO
arXiv
https://arxiv.org/abs/2606.24632v1
PDF
https://arxiv.org/pdf/2606.24632v1

Brief

Parallel-in-time dynamic programming for conic Linear Quadratic (LQ) control reformulates ADMM's primal update as an LQ problem, splits the horizon, and derives a Riccati-like recursion so subproblems can be solved in parallel via dynamic programming. Benchmarks on two real-world tasks show up to 5x speedup on multi-core CPUs. Only the paper's abstract was available for this summary.

Why it matters

Introduces a parallel-in-time ADMM-based method for conic optimal control by formulating ADMM's inner primal update as an LQ problem, splitting along the time horizon, and deriving a variant of the Riccati recursion via dynamic programming to solve subproblems in parallel.

Key details

  • Numerical benchmarks on two real-world applications report up to a 5x speedup on multi-core CPU hardware versus existing related approaches; paper by Luyao Zhang, Gabriel Bravo-Palacios, Brian Plancher, and Sergio Grammatico, posted 2026-06-23 and accepted to IFAC World Congress 2026.
Source evidence

Abstract

Linear Quadratic (LQ) control problems are at the heart of linear control theory and Model Predictive Control (MPC). While performant, standard approaches to solving such problems are inherently serial, limiting real-time scalability despite the parallel computing power available on modern multi-core CPUs. Contributing to addressing this challenge and motivated by ``divide and conquer'' strategies, we present a parallel-in-time approach that solves computationally demanding conic optimal control problems through the use of the alternating direction method of multipliers (ADMM). In particular, we formulate the inner primal update of ADMM as an LQ problem and split the reformulated problem along the time horizon. This enables us to derive a variant of the Riccati recursion using dynamic programming to solve each subproblem in parallel. Numerical benchmarks on two real-world applications demonstrate as much as a 5x speedup compared to existing related approaches on multi-core CPU hardware.

Comment: This paper was accepted for presentation at the IFAC World Congress 2026 (IFAC WC 2026)