Global inverse kinematics via mixed-integer convex optimization
<jats:p>In this paper, we present a novel formulation of the inverse kinematics (IK) problem with generic constraints as a mixed-integer convex optimization program. The proposed approach can solve the IK problem globally with generic task space constraints: a major improvement over existing a...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
SAGE Publications
2021
|
Online Access: | https://hdl.handle.net/1721.1/136519 |