Redundancy resolution of redundantly actuated cable-driven parallel robots (CDPRs) requires the computation of feasible and continuous cable tension distributions along a trajectory. This paper focuses on n-DOF CDPRs driven by n + 2 cables, since, for n = 6, these redundantly actuated CDPRs are relevant in many applications. The set of feasible cable tensions of n-DOF (n + 2)-cable CDPRs is a 2-D convex polygon. An algorithm that determines the vertices of this polygon in a clockwise or counterclockwise order is first introduced. This algorithm is efficient and can deal with infeasibility. It is then pointed out that straightforward modifications of this algorithm allow the determination of various (optimal) cable tension distributions. A self-contained and versatile tension distribution algorithm is thereby obtained. Moreover, the worst-case maximum number of iterations of this algorithm is established. Based on this result, its computational cost is analyzed in detail, showing that the algorithm is efficient and real-time compatible even in the worst case. Finally, experiments on two six-degree-of-freedom eight-cable CDPR prototypes are reported.

Tendon-based parallel manipulators with n d.o.f. use at least m = n + 1 tendons to guide the end effector along a given trajectory. Since tendons can only transmit limited and tractive forces, it is essential to apply a valid tendon force distribution. Due to safety and precision requirements, a combined position and force control is needed where the force calculation delivers the desired tendon force distributions. The high dynamic potential of the robot demands for realtime capable algorithms. To avoid steps in the motor torques the calculated tension force distributions also have to be continuous along the trajectory. In this paper, a new algorithm for tendon force distribution calculations capable for usage on a realtime system is proposed and its continuity is proven.

This article studies the trajectory planning for underactuated cable-driven parallel robots (CDPRs) in the case of rest-to-rest motions, when both the motion time and the path geometry are prescribed. For underactuated manipulators, it is possible to prescribe a control law only for a subset of the generalized coordinates of the system. However, if an arbitrary trajectory is prescribed for a suitable subset of these coordinates, the constraint deficiency on the end-effector leads to the impossibility of bringing the system at rest in a prescribed time. In addition, the behavior of the system may not be stable, that is, unbounded oscillatory motions of the end-effector may arise. In this article, we propose a novel trajectory-planning technique that allows the end effector to track a constrained geometric path in a specified time, and allows it to transition between stable static poses. The design of such a motion is based on the solution of a boundary value problem, aimed at a finding solution to the differential equations of motion with constraints on position and velocity at start and end times. To prove the effectiveness of such a method, the trajectory planning of a six-degrees-of-freedom spatial CDPR suspended by three cables is investigated. Trajectories of a reference point on the moving platform are designed so as to ensure that the assigned path is tracked accurately, and the system is brought to a static condition in a prescribed time. Experimental validation is presented and discussed.