An algorithm to exhaustively enumerate and structurally classify planar simple-jointed kinematic chains using the hierarchical representation of Fang and Freudenstein is proposed in which all isomorphic chains are automatically eliminated in the enumeration procedure such that isomorphism testing on
Enumeration of basic kinetic chains with simple and multiple joints
โ Scribed by Cheng-Ho Hsu
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 801 KB
- Volume
- 329
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper presents a simple method, based on the concept of contracted graphs, for the enumeration of basic kinematic chains with simple and multiple joints. AN possible acceptable contracted graphs are listed according to the numbers of links and degrees of freedom of basic kinematic chains. Next, vertices of degree two are added to each contracted graph to generate all possible kinematic chains. Then, degenerate and isomorphic kinematic chains are identcfied and deleted to obtain nonisomorphic, basic kinematic chains. The enumeration of one degree-of-freedom, eight-link basic kinematic chains is used as an example to illustrate the enumeration process. The result of this work is beneJiciaI to the creative design of mechanisms.
๐ SIMILAR VOLUMES