A comparison of Jacobian-based methods of inverse kinematics for serial robot manipulators

Open access

The objective of this paper is to present and make a comparative study of several inverse kinematics methods for serial manipulators, based on the Jacobian matrix. Besides the well-known Jacobian transpose and Jacobian pseudo-inverse methods, three others, borrowed from numerical analysis, are presented. Among them, two approximation methods avoid the explicit manipulability matrix inversion, while the third one is a slightly modified version of the Levenberg-Marquardt method (mLM). Their comparison is based on the evaluation of a short distance approaching the goal point and on their computational complexity. As the reference method, the Jacobian pseudo-inverse is utilized. Simulation results reveal that the modified Levenberg-Marquardt method is promising, while the first order approximation method is reliable and requires mild computational costs. Some hints are formulated concerning the application of Jacobian-based methods in practice.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • Ben-Isreal A. and Cohen D. (1966). On iterative computation of generalized inverses and associated projections SIAMJournal on Numerical Analysis 3(3): 410-419.

  • Ben-Isreal A. and Greville T. (2003). Generalized Inverses:Theory and Applications CMS Books in Mathematics 2nd Edn. Springer New York NY.

  • Chiacchio P. and Siciliano B. (1989). A closed-loop Jacobian transpose scheme for solving the inverse kinematics of nonredundant and redundant wrists Journal of RoboticSystems 6(5): 601-630.

  • D’Souza A. Vijaykumar S. and Schaal S. (2001). Learning inverse kinematics International Conference on IntelligentRobots and Systems Maui HI USA pp. 298-303.

  • Dulęba I. and Jagodzi´nski J. (2011). Motion representations for the Lafferriere-Sussmann algorithm for nilpotent control systems International Journal of Applied Mathematicsand Computer Science 21(3): 525-534 DOI: 10.2478/v10006-011-0041-y.

  • Dulęba I. and Sasiadek J. (2002). Modified Jacobian method of transversal passing through the smallest deficiency singularities for robot manipulators Robotica20(4): 405-415.

  • Golub G. and Van Loan C. (1996). Matrix Computations 3rd Edn. Johns Hopkins Baltimore MD.

  • Horn R. and Johnson C. (1986). Matrix Analysis Cambridge University Press New York NY.

  • Hunek W. and Latawiec K.J. (2011). A study on new right/left inverses of nonsquare polynomial matrices InternationalJournal of Applied Mathematics and Computer Science21(2): 331-348 DOI: 10.2478/v10006-011-0025-y.

  • Lee C. (1982). Robot arm kinematics dynamics and control Computer 15(12): 62-80.

  • Levenberg K. (1944). A method for the solution of certain problems in least squares Quarterly of Applied Mathematics2: 164-168.

  • Maciejewski A. and Klein C. (1989). The singular value decomposition: Computation and applications to robotics International Journal of Robotics Research 8(6): 63-79.

  • Marquardt D. (1963). An algorithm for least-squares estimation of nonlinear parameters SIAM Journal on Applied Mathematics11(2): 431-441.

  • Nakamura Y. (1991). Advanced Robotics: Redundancy andOptimization Addison Wesley New York NY.

  • Nearchou A. (1998). Solving the inverse kinematics problem of redundant robots operating in complex environments via a modified genetic algorithm Mechanism and Machine Theory33(3): 273-292.

  • Tchoń K. and Dul˛eba I. (1993). On inverting singular kinematics and geodesic trajectory generation for robot manipulators Journal of Intelligent and Robotic Systems8(3): 325-359.

  • Tchoń K. Dul˛eba I. Muszy´nski R. Mazur A. and Hossa R. (2000). Manipulators and Mobile Robots: Models MotionPlanning Control PLJ Warsaw (in Polish).

  • Tchoń K. Karpi´nska J. and Janiak M. (2009). Approximation of Jacobian inverse kinematics algorithms InternationalJournal of Applied Mathematics and Computer Science19(4): 519-531 DOI: 10.2478/v10006-009-0041-3.

  • Tejomurtula S. and Kak S. (1999). Inverse kinematics in robotics using neural networks Information Sciences116(2-4): 147-164.

Journal information
Impact Factor

IMPACT FACTOR 2018: 1.504
5-year IMPACT FACTOR: 1.553

CiteScore 2018: 2.09

SCImago Journal Rank (SJR) 2018: 0.493
Source Normalized Impact per Paper (SNIP) 2018: 1.361

Mathematical Citation Quotient (MCQ) 2018: 0.08

Cited By
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 347 156 6
PDF Downloads 134 77 6