Sierotowicz M, Aparna A, Chattaraj R (2024)
Publication Type: Conference contribution
Publication year: 2024
Publisher: IEEE Computer Society
Pages Range: 1721-1726
Conference Proceedings Title: Proceedings of the IEEE RAS and EMBS International Conference on Biomedical Robotics and Biomechatronics
Event location: Heidelberg, DEU
ISBN: 9798350386523
DOI: 10.1109/BioRob60516.2024.10719844
In soft robotics, hyper-redundant kinematic chains can be an effective way of modeling compliant objects and structures. Unfortunately, increasing the number of joints, the computational complexity of the calculations needed to solve the inverse kinematics problem for such systems increases sharply, especially when adopting traditional algorithms for IK solving, such as the Jacobian pseudo-inverse method. A computational procedure with a potentially lower complexity as a function of joint amount is one based on the tractrix curve. More recently, this same algorithm was formalized to function in three dimensions, but its time complexity was not adequately evaluated for cases where additional constraints are added to the kinematic solver, such as the chain being bound to a mechanical ground. Here we present the results of an empirical evaluation of the time requirements for convergence.
APA:
Sierotowicz, M., Aparna, A., & Chattaraj, R. (2024). Empirical Time Complexity Analysis of Tractrix-Based Inverse Kinematics Algorithms. In Proceedings of the IEEE RAS and EMBS International Conference on Biomedical Robotics and Biomechatronics (pp. 1721-1726). Heidelberg, DEU: IEEE Computer Society.
MLA:
Sierotowicz, Marek, A. Aparna, and Ritwik Chattaraj. "Empirical Time Complexity Analysis of Tractrix-Based Inverse Kinematics Algorithms." Proceedings of the 10th IEEE RAS/EMBS International Conference for Biomedical Robotics and Biomechatronics, BioRob 2024, Heidelberg, DEU IEEE Computer Society, 2024. 1721-1726.
BibTeX: Download