Hierarchical quadratic programming: Fast online humanoid-robot motion generation
-
- Adrien Escande
- JRL-CNRS/AIST, Tsukuba, Japan
-
- Nicolas Mansard
- LAAS-CNRS, University of Toulouse, Toulouse, France
-
- Pierre-Brice Wieber
- INRIA Grenoble, St Ismier, France
説明
<jats:p> Hierarchical least-square optimization is often used in robotics to inverse a direct function when multiple incompatible objectives are involved. Typical examples are inverse kinematics or dynamics. The objectives can be given as equalities to be satisfied (e.g. point-to-point task) or as areas of satisfaction (e.g. the joint range). This paper proposes a complete solution to solve multiple least-square quadratic problems of both equality and inequality constraints ordered into a strict hierarchy. Our method is able to solve a hierarchy of only equalities 10 times faster than the iterative-projection hierarchical solvers and can consider inequalities at any level while running at the typical control frequency on whole-body size problems. This generic solver is used to resolve the redundancy of humanoid robots while generating complex movements in constrained environments. </jats:p>
収録刊行物
-
- The International Journal of Robotics Research
-
The International Journal of Robotics Research 33 (7), 1006-1028, 2014-05-01
SAGE Publications