Reproduce “ElastiQP: An Always-Feasible QP Solver for Constrained Robot Control” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Daniel Morton, Jon Arrizabalaga, Zachary Manchester, Marco Pavone
ElastiQP makes quadratic programs return best-effort commands when inequality constraints conflict, assigning weighted violations while keeping dynamics equalities hard. It analytically eliminates slack variables within a warm-started dual active-set solver. In an infeasible humanoid test, it solved in 54 microseconds warm, versus 1,024 for ProxQP-sparse, and violated one inequality row versus 28 and 29 for two baselines under the tested setup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.