Skip to Main Content
In this paper, redundancy resolution of a cable-driven parallel manipulator is performed through an analytic-iterative scheme. The redundancy resolution scheme is formulated as a convex optimization problem with inequality constraints that are imposed by manipulator structure and cable dynamics. The Karush-Kuhn-Tucker theorem is used to analyze the optimization problem and to draw an analytic-iterative solution for it. Subsequently, a tractable and iterative search algorithm is proposed to implement the redundancy resolution of such redundant manipulators. Furthermore, it is shown through simulations that the worst case and average elapsed time that is required to implement the proposed redundancy resolution scheme in a closed-loop implementation is considerably less than that of other numerical optimization methods.