For at least the past five decades, structural synthesis has been used as a main means of finding better mechanisms with some predefined function. In structural synthesis, isomorphism identification is still a problem unsolved well, and to solve this problem is very significant to the design of new mechanisms. According to the given degree of freedom (DOF) and link connection property of planar closed chain mechanisms, vertex assortment is obtained. For solving the isomorphism problem, a method of the adding sub-chains is proposed with the detailed steps and algorithms in the synthesizing process. Employing this method, the identification code and formation code of every topological structure are achieved, therefore many isomorphic structures could be eliminated in time during structural synthesis by comparing those codes among different topological graphs, resulting in the improvement of synthesizing efficiency and accuracy, and the approach for eliminating rigid sub-chains in and after the synthesizing process is also presented. Some examples are given, including how to add sub-chains, how to detect simple rigid sub-chains and how to obtain identification codes and formulation codes et al. Using the adding sub-chain method, the relative information of some common topological graphs is given in the form of table. The comparison result is coincident with many literatures, so the correctness of the adding sub-chain method is convinced. This method will greatly improve the synthesizing efficiency and accuracy, and has a good potential for application.
[1]
Zhen Huang,et al.
A unique representation of the kinematic chain and the atlas database
,
2007
.
[2]
Ferdinand Freudenstein,et al.
Synthesis of kinematic structure of geared kinematic chains and other mechanisms
,
1970
.
[3]
Hong-Sen Yan,et al.
Linkage Characteristic Polynomials: Assembly Theorems, Uniqueness
,
1982
.
[4]
C. S. Tang,et al.
The Degree Code—A New Mechanism Identifier
,
1993
.
[5]
Nihon-Kikai-Gakkai.
JSME international journal
,
1992
.
[7]
Y. Yoon,et al.
Detection of Rigid Structure in Enumerating Basic Kinematic Chain by Sequential Removal of Binary Link String
,
1992
.
[8]
Ferdinand Freudenstein,et al.
An Application of Dual Graphs to the Automatic Generation of the Kinematic Structures of Mechanisms
,
1986
.
[9]
Daniel Martins,et al.
Variety and connectivity in kinematic chains
,
2008
.
[10]
Chris Hartman,et al.
Efficient enumeration and hierarchical classification of planar simple-jointed kinematic chains: Application to 12- and 14-bar single degree-of-freedom chains
,
2005
.
[11]
V. Agrawal,et al.
Canonical numbering of kinematic chains and isomorphism problem: min code
,
1987
.
[12]
D. B. Warnaar,et al.
Kinematic Synthesis of Deployable-Foldable Truss Structures Using Graph Theory, Part 1: Graph Generation
,
1995
.
[13]
E. R. Maki,et al.
The Creation of Mechanisms According to Kinematic Structure and Function
,
1979
.