Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T19:38:42.798Z Has data issue: false hasContentIssue false

High-speed manipulation by using parallel wire-driven robots

Published online by Cambridge University Press:  01 January 2000

Sadao Kawamura
Affiliation:
Department of Robotics, Faculty of Science and Engineering, Ritsumeikan University, Noji-cho, Kusatsu, Shiga, 525-0055 (Japan) kawamura@se.ritsumei.ac.jp
Hitoshi Kino
Affiliation:
Multi-media Center, Shiga University of Medical Science,Seta, Ohtsu, Shiga, 520-2192 (Japan) kino@belle.shiga-med.ac.jp
Choe Won
Affiliation:
FA Research Institute, Production Engineering Center, SAMSUNG Electronics Co. Ltd, 416 Maetan3-Dong, Paldal-Gu, Suwon, Gyonggi, 442-742 (Korea) wonchoe@srtf.sec.samsung.co.kr

Abstract

A new type of a parallel wire-driven robot is proposed in order to reach ultra-high speed. The driving principle of parallel wire systems is described. Since wires can only pull and not push on an object, at least n+1 wires are needed in order to move the object in a n-dimensional space. In this paper, taking account of the effect of such redundancy on actuation, the motion stability in wire length coordinates is analyzed by using a Lyapunov function. Using “Vector Closure”, it is proven that the hand position and orientation converge to the corresponding desired values and the internal force also converges to the desired one. Moreover, by making good use of non-linear elasticity of parallel wire driven robots, it is claimed that the internal force arising from redundant actuation can effectively reduce vibration when the high-speed robot stops at desired points. As a result, ultra-high speed with more than 40 g(g:gravitational acceleration) can be attained by using relatively small actuators.

Type
Research Article
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)