Task Priority Matrix Under Hard Joint Constraints

摘要

We propose an extension to the Task Priority Matrix (TPM) method for redundancy resolution that includes also hard inequality joint constraints. This is done by combining TPM with a modified version of the basic Saturation in the Null Space (SNS) algorithm. Comparative simulations are reported for the 21-DOFs Romeo humanoid robot.