Weighted hierarchical quadratic programming, assigning individual joint weights for each task priority

This paper proposes a novel method that computes the optimal solution of the weighted hierarchical optimization problem for both equality and inequality tasks. The method is developed to resolve the redundancy of robots with a large number of Degrees of Freedom (DoFs), such as a mobile manipulator or a humanoid, so that they can execute multiple tasks with differently weighted joint motion for each priority level. The proposed method incorporates the weighting matrix into the first-order optimality condition of the optimization problem and leverages an active-set method to handle equality and inequality constraints. In addition, it is computationally efficient because the solution is calculated in a weighted joint space with symmetric null-space projection matrices for propagating recursively to a low priority task. Consequently, robots that utilize the proposed method effectively show whole-body motions handling prioritized tasks with differently weighted joint spaces. The effectiveness of the proposed method was validated through experiments with a nonholonomic mobile manipulator as well as a humanoid.