Inverse Kinematics is defined as the problem of determining a set of appropriate joint configurations for which the end effectors move to desired positions as smoothly, rapidly, and as accurately as possible. However, many of the currently available methods suffer from high computational cost and production of unrealistic poses. In this paper, a novel heuristic method, called Forward And Backward Reaching Inverse Kinematics (FABRIK), is described and compared with some of the most popular existing methods regarding reliability, computational cost and conversion criteria. FABRIK avoids the use of rotational angles or matrices, and instead finds each joint position via locating a point on a line. Thus, it converges in few iterations, has low computational cost and produces visually realistic poses. Constraints can easily be incorporated within FABRIK and multiple chains with multiple end effectors are also supported.
Description
FABRIK: A fast, iterative solver for the Inverse Kinematics problem - ScienceDirect
%0 Journal Article
%1 ARISTIDOU2011243
%A Aristidou, Andreas
%A Lasenby, Joan
%D 2011
%J Graphical Models
%K 2011 graphics inverse-kinematics robot-arm robotics
%N 5
%P 243 - 260
%R https://doi.org/10.1016/j.gmod.2011.05.003
%T FABRIK: A fast, iterative solver for the Inverse Kinematics problem
%U http://www.sciencedirect.com/science/article/pii/S1524070311000178
%V 73
%X Inverse Kinematics is defined as the problem of determining a set of appropriate joint configurations for which the end effectors move to desired positions as smoothly, rapidly, and as accurately as possible. However, many of the currently available methods suffer from high computational cost and production of unrealistic poses. In this paper, a novel heuristic method, called Forward And Backward Reaching Inverse Kinematics (FABRIK), is described and compared with some of the most popular existing methods regarding reliability, computational cost and conversion criteria. FABRIK avoids the use of rotational angles or matrices, and instead finds each joint position via locating a point on a line. Thus, it converges in few iterations, has low computational cost and produces visually realistic poses. Constraints can easily be incorporated within FABRIK and multiple chains with multiple end effectors are also supported.
@article{ARISTIDOU2011243,
abstract = {Inverse Kinematics is defined as the problem of determining a set of appropriate joint configurations for which the end effectors move to desired positions as smoothly, rapidly, and as accurately as possible. However, many of the currently available methods suffer from high computational cost and production of unrealistic poses. In this paper, a novel heuristic method, called Forward And Backward Reaching Inverse Kinematics (FABRIK), is described and compared with some of the most popular existing methods regarding reliability, computational cost and conversion criteria. FABRIK avoids the use of rotational angles or matrices, and instead finds each joint position via locating a point on a line. Thus, it converges in few iterations, has low computational cost and produces visually realistic poses. Constraints can easily be incorporated within FABRIK and multiple chains with multiple end effectors are also supported.},
added-at = {2018-04-23T19:14:58.000+0200},
author = {Aristidou, Andreas and Lasenby, Joan},
biburl = {https://www.bibsonomy.org/bibtex/2e10b58fcc1d783feed5a1f3e97aac4f5/achakraborty},
description = {FABRIK: A fast, iterative solver for the Inverse Kinematics problem - ScienceDirect},
doi = {https://doi.org/10.1016/j.gmod.2011.05.003},
interhash = {d9dd0899f562c9d1699d335ded10473e},
intrahash = {e10b58fcc1d783feed5a1f3e97aac4f5},
issn = {1524-0703},
journal = {Graphical Models},
keywords = {2011 graphics inverse-kinematics robot-arm robotics},
number = 5,
pages = {243 - 260},
timestamp = {2018-04-23T19:14:58.000+0200},
title = {FABRIK: A fast, iterative solver for the Inverse Kinematics problem},
url = {http://www.sciencedirect.com/science/article/pii/S1524070311000178},
volume = 73,
year = 2011
}