Pith. sign in

REVIEW 1 cited by

An Efficiently Solvable Quadratic Program for Stabilizing Dynamic Locomotion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1311.1839 v2 pith:XPPVYSCO submitted 2013-11-07 cs.RO

classification cs.RO
keywords dynamicwalkingcontrolcontrollerdescribeprogramquadraticrobot
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We describe a whole-body dynamic walking controller implemented as a convex quadratic program. The controller solves an optimal control problem using an approximate value function derived from a simple walking model while respecting the dynamic, input, and contact constraints of the full robot dynamics. By exploiting sparsity and temporal structure in the optimization with a custom active-set algorithm, we surpass the performance of the best available off-the-shelf solvers and achieve 1kHz control rates for a 34-DOF humanoid. We describe applications to balancing and walking tasks using the simulated Atlas robot in the DARPA Virtual Robotics Challenge.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Benchmarking Different QP Formulations and Solvers for Dynamic Quadrupedal Walking

    cs.RO 2025-02 conditional novelty 6.0 of 10

    HPIPM with a sparse MPC formulation is the fastest solver, and the Jetson ARM board is the most power-efficient platform according to the new Solve Frequency per Watt metric.

Pith tools