We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Robotics & Automation/Automatic Method for Enumeration of Complete Set of Kinematic Chains
PeriodicalsRobotics & Automation

Automatic Method for Enumeration of Complete Set of Kinematic Chains

Checking your access to this record.

Abstract & Overview

A fully automatic algorithm is developed to obtain the complete set of nonfractionated kinematic chains for each number of links and degrees of freedom. It is a contracted graph method programmed in LISP. The number synthesis is performed efficiently using the partitioning technique implemented in a recursive procedure. The enumeration of the contracted graphs or bases is computerized by the recurrent application of the contracted graph method. In order to avoid the possible sources of human error, a newly developed automatic algorithm for the detection of the embedded rigid structure is used. The obtained results using the developed algorithm for various numbers of links and degrees of freedom are presented.

Cite this record

Hwang-Jin Lee, Yong–San Yoon (1994). Automatic Method for Enumeration of Complete Set of Kinematic Chains. JSME international journal Ser C Dynamics control robotics design and manufacturing, 37(4), 812–818. https://doi.org/10.1299/jsmec1993.37.812

Copy in another style

Lee, H., & Yoon, Y. (1994). Automatic Method for Enumeration of Complete Set of Kinematic Chains. JSME international journal Ser C Dynamics control robotics design and manufacturing, 37(4), 812–818. https://doi.org/10.1299/jsmec1993.37.812
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.