Computationally efficient implementation of the Gauss–Newton method for solving the forward kinematics of redundant cable‐driven parallel robots

Abstract: Cable‐driven parallel robots (CDPRs) are parallel robots in which cables are used instead of rigid connecting elements. An important task here, as in other areas of robotics, are kinematic calculations. The state of the CDPR can be described either in Cartesian workspace coordinates as a pose or in the joint space via the cable lengths. The calculation of the cable lengths from a given platform pose is relatively simple for CDPRs. In contrast, the forward kinematics, that is, the calculation of the pose from the cable lengths, is complex due to the parallel topology and often cannot be solved analytically. In addition, CDPR systems are often designed redundantly, with more cables than Cartesian degrees of freedom. This redundancy causes that the solution of the forward kinematics can be considered as a fitting problem, where for measured cable lengths, the solution with minimum error norm is sought. In this paper, an approach based on the Gauss–Newton method is presented. It is described how a computationally efficient implementation is possible when using quaternions under consideration of the unit quaternion constraints.

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Computationally efficient implementation of the Gauss–Newton method for solving the forward kinematics of redundant cable‐driven parallel robots ; day:17 ; month:09 ; year:2023 ; extent:8 ; Proceedings in applied mathematics and mechanics ; (17.09.2023) (gesamt 8)

Contributors, Places and Time

• Creator: Bieber, Jonas ; Pallmer, Steffen ; Beitelschmidt, Michael

Further information

• DOI: 10.1002/pamm.202300231
• URN: urn:nbn:de:101:1-2023091815020328493571
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 14.08.2025, 11:02 AM CEST