Automatic synthesis of the complete set of contracted graphs for planar kinematic chains with up to seven independent loops. (February 2021)

• Record Type: Journal Article
• Authors: Sun, Liang; Cui, Rongjiang; Yang, Wenjian; Ye, Zhizheng; Zhou, Yuzhu; Wu, Chuanyu
• Is Part Of: Mechanism and machine theory. Volume 156(2021)
• Publication Date: 2021-02
• Subjects: Structural synthesis -- Contracted graph -- Kinematic chain -- Isomorphism -- Similarity; Machine theory -- Periodicals; Machinery -- Periodicals; Machines -- Périodiques; Génie mécanique -- Périodiques; Machine theory; Machinery; Periodicals; 621.81
• DOI: 10.1016/j.mechmachtheory.2020.104144
• Languages: English
• ISSNs: 0094-114X

Abstract

Highlights: An automatic method is presented to synthesize contracted graphs of planar kinematic chains. The vertex degree sequence equation of contracted graph is presented. A compound topologicassl invariant based method is proposed to detect isomorphism. The important characteristics of similarity and planarity in contracted graphs are discussed. Non-fractionated contracted graphs with up to seven independent loops are synthesized. Abstract: The contracted graph reflects the primary topology of kinematic chains (KCs) and the synthesis of contracted graphs is the foundation for the structural synthesis of KCs. This paper presents an automatic method to synthesize contracted graphs of planar non-fractionated KCs. First, according to the range of the number of vertices in a contracted graph, the vertex degree sequence (VDS) equation of contracted graph is established to derive all possible VDSs. Then, the process of solving the synthesis equation set of contracted graphs is developed, based on which all candidate contracted graphs are generated. Finally, unconnected and fractionated contracted graphs are detected, and a compound topological invariant ( CTI ) based method is proposed to detect isomorphic contracted graphs. The complete set of non-fractionated contracted graphs with up to seven independent loops are synthesized. All the contracted graphs are classified into planar and non-planar graphs, and similar vertices in each contracted graph are determined, which can improve the efficiency of KC synthesis.