Workspace analysis of redundant cable robots

This paper presents analysis of the workspace of planar and spatial redundant cable robots by using two analytical approaches. The first one is based on linear algebra; it can include the upper limits for tension in cables as an important factor in optimum design of cable robots in order to find the largest possible workspace. The second approach is based on a variant of Blandpsilas pivot rule; by virtue of this method we leave out the use of successive determinates to compute workspace resulting in less computation time. Both approaches provide all poses (positions/orientations) reachable by the cable robot platform for all types of cable robots with any number of redundancy.

[1]  James S. Albus,et al.  The NIST robocrane , 1993, J. Field Robotics.

[2]  Sunil K. Agrawal,et al.  Cable suspended robots: design, planning and control , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[3]  Jim Hefferon,et al.  Linear Algebra , 2012 .

[4]  Sunil K. Agrawal,et al.  Workspace and Design Analysis of Cable-Suspended Planar Parallel Robots , 2002 .

[5]  Paolo Gallina,et al.  Planar Cable-Direct-Driven Robots: Design for Wrench Exertion , 2002, J. Intell. Robotic Syst..

[6]  Aiguo Ming,et al.  Study on multiple degree-of-freedom positioning mechanism using wires. II: Development of a planar completely restrained positioning mechanism , 1994 .

[7]  Imme Ebert-Uphoff,et al.  Wrench-based analysis of cable-driven robots , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[8]  Manfred Hiller,et al.  On design of a redundant wire-driven parallel robot WARP manipulator , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[9]  W. Greub.  Linear Algebra , 1981 .

[10]  Vijay R. Kumar,et al.  Workspaces of Cable-Actuated Parallel Manipulators , 2006 .

[11]  David Avis,et al.  Solving Inequalities and Proving Farkas's Lemma Made Easy , 2002, Am. Math. Mon..