Pith. sign in

REVIEW 1 cited by

Bilevel Optimization for Real-Time Control with Application to Locomotion Gait Generation

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 2409.12366 v1 pith:7FSWXWB6 submitted 2024-09-18 eess.SY cs.ROcs.SY

classification eess.SYcs.ROcs.SY
keywords controlreal-timealgorithmbilevelproblemcommonconvergenceenough
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Model Predictive Control (MPC) is a common tool for the control of nonlinear, real-world systems, such as legged robots. However, solving MPC quickly enough to enable its use in real-time is often challenging. One common solution is given by real-time iterations, which does not solve the MPC problem to convergence, but rather close enough to give an approximate solution. In this paper, we extend this idea to a bilevel control framework where a "high-level" optimization program modifies a controller parameter of a "low-level" MPC problem which generates the control inputs and desired state trajectory. We propose an algorithm to iterate on this bilevel program in real-time and provide conditions for its convergence and improvements in stability. We then demonstrate the efficacy of this algorithm by applying it to a quadrupedal robot where the high-level problem optimizes a contact schedule in real-time. We show through simulation that the algorithm can yield improvements in disturbance rejection and optimality, while creating qualitatively new gaits.

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. Sequential QCQP for Bilevel Optimization with Line Search

    math.OC 2025-05 conditional novelty 5.0 of 10

    A bilevel optimization algorithm uses a tilted QCQP and a control-barrier line search to guarantee anytime feasibility and an O(1/k) ergodic convergence rate.

Pith tools