Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-18T21:07:34.012Z Has data issue: false hasContentIssue false

A new dynamic formulation for robot manipulators containing closed kinematic chains

Published online by Cambridge University Press:  01 May 1999

Xiang-Rong Xu
Affiliation:
Department of Mechanical Design and Manufacturing Chang-Won National University, Changwon 641-773 (Korea). E-mail: wjchung@sarim.changwon.ac.kr or: xuxr@263.net
Won-Jee Chung
Affiliation:
Department of Mechanical Design and Manufacturing Chang-Won National University, Changwon 641-773 (Korea). E-mail: wjchung@sarim.changwon.ac.kr or: xuxr@263.net
Young-Hyu Choi
Affiliation:
Department of Mechanical Design and Manufacturing Chang-Won National University, Changwon 641-773 (Korea). E-mail: wjchung@sarim.changwon.ac.kr or: xuxr@263.net
Xiang-Feng Ma
Affiliation:
Beijing University of Science and Technology, Beijing, 100083 (P.R. China)

Abstract

This paper presents a new recursive algorithm of robot dynamics based on the Kane's dynamic equations and Newton-Euler formulations. Differing from Kane's work, the algorithm is general-purpose and can be easily realized on computers. It is suited not only for robots with all rotary joints but also for robots with some prismatic joints. Formulations of the algorithm keep the recurrence characteristics of the Newton-Euler formulations, but possess stronger physical significance. Unlike the conventional algorithms, such as the Lagrange and Newton-Euler algorithm, etc., the algorithm can be used to deal with dynamics of robots containing closed chains without cutting the closed chains open. In addition, this paper makes a comparison between the algorithm and those conventional algorithms from the number of multiplications and additions.

Type
Research Article
Copyright
© 1999 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.)