Convex Optimisation for Inverse Kinematics

10/24/2019
by   Tarun Yenamandra, et al.
0

We consider the problem of inverse kinematics (IK), where one wants to find the parameters of a given kinematic skeleton that best explain a set of observed 3D joint locations. The kinematic skeleton has a tree structure, where each node is a joint that has an associated geometric transformation that is propagated to all its child nodes. The IK problem has various applications in vision and graphics, for example for tracking or reconstructing articulated objects, such as human hands or bodies. Most commonly, the IK problem is tackled using local optimisation methods. A major downside of these approaches is that, due to the non-convex nature of the problem, such methods are prone to converge to unwanted local optima and therefore require a good initialisation. In this paper we propose a convex optimisation approach for the IK problem based on semidefinite programming, which admits a polynomial-time algorithm that globally solves (a relaxation of) the IK problem. Experimentally, we demonstrate that the proposed method significantly outperforms local optimisation methods using different real-world skeletons.

READ FULL TEXT
research
07/24/2020

Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator

The Inverse Kinematics (IK) problem is to nd robot control parameters to...
research
11/29/2017

Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems

In this work we study convex relaxations of quadratic optimisation probl...
research
09/20/2019

Inverse Kinematics for Serial Kinematic Chains via Sum of Squares Optimization

Inverse kinematics is a fundamental problem for articulated robots: fast...
research
10/16/2020

Strengthened SDP Verification of Neural Network Robustness via Non-Convex Cuts

There have been major advances on the design of neural networks, but sti...
research
10/29/2014

Efficient optimisation of structures using tabu search

This paper presents a novel approach to the optimisation of structures u...
research
09/30/2021

Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation

We address the non-convex optimisation problem of finding a sparse matri...
research
09/29/2017

Optimisation of photometric stereo methods by non-convex variational minimisation

Estimating shape and appearance of a three dimensional object from a giv...

Please sign up or login with your details

Forgot password? Click here to reset