🤖 AI Summary
Selecting appropriate quadratic programming (QP) solvers for real-time control of legged robots remains challenging due to poor solver selection guidelines and weak embedded-system compatibility. Method: This work systematically benchmarks mainstream convex QP algorithms—interior-point, active-set, operator-splitting, and augmented Lagrangian methods—across representative tasks including inverse dynamics, model predictive control (MPC), and whole-body control. It introduces a novel four-category taxonomy of QP solvers tailored to legged robotics and conducts structured empirical evaluation using structure-aware warm-starting, sparse-matrix optimizations, and multi-platform benchmarking on public datasets. Contribution/Results: We identify hardware–task–algorithm co-design principles—for instance, sparse interior-point methods suit long-horizon MPC, while dense active-set methods excel in high-frequency whole-body control—and extend insights to nonconvex and distributed QP settings. Quantitative metrics include computation latency, constraint satisfaction accuracy, and disturbance robustness. The study delivers a reusable, empirically grounded solver selection guide enabling millisecond-level response, low-power operation, and high-reliability autonomous locomotion.
📝 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 limits on embedded platforms. This paper presents a comprehensive analysis and benchmarking study of cutting-edge QP solvers for legged robotics. We begin by formulating the standard convex QP and classify solvers into four principal algorithmic approaches, including interior-point methods, active-set strategies, operator splitting schemes, and augmented Lagrangian approaches. Each solver is examined in terms of algorithmic structure, computational characteristics, and its ability to exploit problem structure and warm-starting. Performance is evaluated using publicly available benchmarks, focusing on metrics such as computation time, constraint satisfaction, and robustness under perturbations. Feature tables and comparisons yield practical guidance for solver selection, underscoring trade-offs in speed, accuracy, and energy efficiency. Our findings emphasize the synergy between solver, task, and hardware, sparse IPMs for long-horizon MPC, and dense active-set for high frequency WBC to advance agile, autonomous legged systems, with emerging extensions to nonconvex and distributed QP.