Real-Time QP Solvers: A Concise Review and Practical Guide Towards Legged Robots
Van Nam Dinh

TL;DR
This paper reviews and benchmarks quadratic programming solvers tailored for real-time legged robotics, providing practical guidance on solver selection based on performance, structure, and hardware considerations.
Contribution
It offers a comprehensive classification, analysis, and benchmarking of QP solvers for legged robots, highlighting their suitability for various control and planning tasks.
Findings
Sparse structured IPMs excel in long-horizon MPC.
Dense active-set methods are effective for high-frequency WBC.
Solver performance varies with problem structure and hardware constraints.
Abstract
Quadratic programming (QP) underpins real-time robotics by enabling efficient, constrained optimization in state estimation, motion planning, and control. In legged locomotion and manipulation, essential modules like inverse dynamics, Model Predictive Control (MPC), and Whole-Body Control (WBC) are inherently QP-based, demanding reliable solutions amid tight timing, energy, and computational resources on embedded platforms. This paper presents a comprehensive analysis and benchmarking study of QP solvers for legged robotics. We begin by formulating the standard convex QP and classify solvers into principal algorithmic approaches: interior-point methods, active-set strategies, operator-splitting schemes, and augmented Lagrangian/proximal approaches, while also discussing solver code generation for fixed-structure QPs. Each solver is examined in terms of algorithmic structure,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
