2014 IEEE International Conference on Robotics and Automation (ICRA) 2014
DOI: 10.1109/icra.2014.6907230
|View full text |Cite
|
Sign up to set email alerts
|

An efficiently solvable quadratic program for stabilizing dynamic locomotion

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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
139
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 179 publications
(139 citation statements)
references
References 20 publications
0
139
0
Order By: Relevance
“…Using these trajectories and a linear Time Variant LQR, the method solves for CoM dynamics over an arbitrary horizon and then CoM accelerations found are given to their low level active-set based QP solver to generate joint torques. The major difference of [11] with our method is the fact that we do not have any off-line optimization. Rather we optimize the next footstep positions on-line, considering the aforementioned constraints and a reference footstep pattern Fig.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations
“…Using these trajectories and a linear Time Variant LQR, the method solves for CoM dynamics over an arbitrary horizon and then CoM accelerations found are given to their low level active-set based QP solver to generate joint torques. The major difference of [11] with our method is the fact that we do not have any off-line optimization. Rather we optimize the next footstep positions on-line, considering the aforementioned constraints and a reference footstep pattern Fig.…”
Section: Introductionmentioning
confidence: 99%
“…Although the equality constraint of contact acceleration is considered in closed form solutions [19], one can not include inequality constraints like Center of Pressure (CoP), friction cones or joint torque limits easily. This motivates solving a quadratic constrained problem using fast QP solvers per time step where one can consider all constraints at the same time ( [6], [25], [24] and [11]). With such formulation of the joint controller, we can track desired trajectories at endeffectors with simple PD controllers while being compliant, maintaining balance and satisfying all constraints.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Drawing inspiration from other robotic fields (e.g., [13], [14]), in this paper we take advantage of a quadratic programming technique to solve several UAM tasks in real time, on board and subject to constraints. Specifically we use the online active set strategy ( [15], [16]) which analyses the constraints that are active at the current evaluation point, and gives us a subset of inequalities to watch while searching for the solution, which reduces the complexity of the search and thus the computation time.…”
mentioning
confidence: 99%