Singularity-Robust Inverse Kinematics for Serial Manipulators
Authors
Abstract
This paper is a practical~guideline how to analyze and evaluate literature algorithms of singularity-robust inverse kinematics or to construct new ones. Additive, multiplicative and based on the Singularity Value
Decomposition (SVD) methods are examined to retrieve well conditioning of a matrix to be inverted in the Newton algorithm of inverse kinematics. It is shown that singularity avoidance can be performed
in two different, but equivalent, ways: either via properly modified manipulability matrix or not allowing to decreese the minimal singular value below a given threshold. It is discussed which method can always be used and which only when some pre-conditions are met. Selected methods are compared to with respect to the efficiency of coping with singularities based on a theoretical analysis as well as simulation results. Also some questions important for mathematically and/or practically oriented roboticians are stated and answered.
References
W. Cheney and D. Kincaid, Linear Algebra: Theory and Applications, Jones & Bartlett Publ., 2009.
I. Duleba. “Robust inverse kinematics at singular configurations”. In: A. Mazur and C. Zielinski, eds., Advances in Robotics, volume 197 of Electronics, 5–10. Publ. House of the Warsaw Univ. of Technology, 2022. in Polish.
I. Duleba, “A comparison of jacobian‐based methods of inverse kinematics for serial robot manipulators”, Int. Journal of Applied Mathematics and Computer Science, vol. 23, no. 2, 2013, 373–382.
I. Dulęba, “Channel algorithm of transversal passing through singularities for non‐redundant robot manipulators”. In: IEEE Int. Conf. on Robotics and Automation, vol. 2, San Francisco, CA, 2000, 1302–1307, 10.1109/ROBOT.2000.844778.
G. Golub and C. Reinsch, “Singular value decomposition and least squares solutions”, Numerische Mathematik, vol. 14, no. 5, 1970, 403–420.
B. Grossmann, “The product of two symmetric, positive semide inite matrices has non‐negative eigenvalues”. Mathematics Stack Exchange. URL:https://math.stackexchange.com/q/982822 (version: 2014‐10‐21).
R. Horn and C. Johnson, Matrix analysis, Cambridge Univ. Press, 2012.
C.‐G. Kang, “Online trajectory planning for a PUMA robot”, Int. Journal of Precision Enginnering and Manufacturing, vol. 8, no. 4, 2007, 16–21.
S. Lloyd, R. A. Irani, and M. Ahmadi, “Fast and robust inverse kinematics of serial robots using Halley’s method”, IEEE Transactions on Robotics, vol. 38, no. 5, 2022, 2768–2780, 10.1109/TRO.2022.3162954.
A. A. Maciejewski and C. Klein, “The singular value decomposition: Computation and applications to robotics”, Int. Journal of Robotics Research, vol. 8, 1989, 63–79.
Y. Nakamura, Advanced Robotics: Redundancy and Optimization, Addison‐Wesley, 1991.
A. Ratajczak, J. Ratajczak, and K. Tchoń , “Task‐priority motion planning of underactuated systems: an endogenous configuration space approach”, Robotica, vol. 28, no. 6, 2010, 885–892.
M. Spong and M. Vidyasagar, Robot Dynamics and Control, MIT Press.: Cambridge, 1989.
J. Sun, Y. Liu, and C. Ji, “Improved singular robust inverse solutions of redundant serial manipulators”, Int. Journal of Advanced Robotic Systems, vol. 17, no. 3, 2020, 1–12, 10.1177/1729881420932046.
K. Tchoń and J. Ratajczak, “Singularities of holonomic and non‐holonomic robotic systems: a normal form approach”, Journal of the Franklin Institute, vol. 358, no. 15, 2021, 7698–7713.
L. V. Vargas, A. C. Leite, and R. R. Costa, “Overcoming kinematic singularities with the filtered inverse approach”, IFAC Proceedings Volumes, vol. 47, no. 3, 2014, 8496–8502, 10.3182/20140824‐6‐ZA‐1003.01841, 19th IFAC World Congress.
Downloads
How to Cite
Copyright (c) 2023 Journal of Automation, Mobile Robotics and Intelligent Systems
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The authors wishing to publish in JAMRIS journal must sign the license to publish upon paper acceptance. The license governs in detail the commercial and non-commercial use of papers published by our journal and determines user and author rights.
