TY - JOUR
T1 - Representation of planar kinematic chains with multiple joints based on a modified graph and isomorphism identification
AU - Dong, Kaijie
AU - Li, Duanling
AU - Kong, Xianwen
N1 - Funding Information:
This study was co-supported National Natural Science Foundation of China (Grant No. 51,775,052 , 52,175,019 ), Beijing Natural Science Foundation (Grant No. 21C10109 ) and Beijing Municipal Key Laboratory of Space-ground Interconnection and Convergence of China.
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/6
Y1 - 2022/6
N2 - The representation and isomorphism identification of kinematic chains (KCs) with multiple joints are crucial issues to be solved in mechanism research. In this paper, a modified graph—planar face graph (PF graph), is proposed. As a key concept, “face” has been put forward to represent the case that a single, specific relationship is incident with multiple incidents. Some other basic concepts relating to PF graph are also explained in detail. PF graph is used to represent KCs with multiple joints and it reflects the uniqueness of KCs and realizes the one-to-one correspondence between KCs and adjacency and incident matrices. It also establishes relationships with other methods for representing KCs and it is proved to be suitable for complex mechanical systems. Moreover, the sufficient and necessary condition of isomorphism are derived, and two properties of permutation similarity are analysed. Based on them, the modified eigenvalue eigenvector method and the maximum path method are proposed, and they are integrated to form a new algorithm. In addition, the reliability and efficiency of the algorithm are proved.
AB - The representation and isomorphism identification of kinematic chains (KCs) with multiple joints are crucial issues to be solved in mechanism research. In this paper, a modified graph—planar face graph (PF graph), is proposed. As a key concept, “face” has been put forward to represent the case that a single, specific relationship is incident with multiple incidents. Some other basic concepts relating to PF graph are also explained in detail. PF graph is used to represent KCs with multiple joints and it reflects the uniqueness of KCs and realizes the one-to-one correspondence between KCs and adjacency and incident matrices. It also establishes relationships with other methods for representing KCs and it is proved to be suitable for complex mechanical systems. Moreover, the sufficient and necessary condition of isomorphism are derived, and two properties of permutation similarity are analysed. Based on them, the modified eigenvalue eigenvector method and the maximum path method are proposed, and they are integrated to form a new algorithm. In addition, the reliability and efficiency of the algorithm are proved.
KW - Eigenvalue eigenvector method
KW - Isomorphism identification
KW - Kinematic chains
KW - Multiple joints
KW - Permutation similarity
UR - http://www.scopus.com/inward/record.url?scp=85125455017&partnerID=8YFLogxK
U2 - 10.1016/j.mechmachtheory.2022.104793
DO - 10.1016/j.mechmachtheory.2022.104793
M3 - Article
AN - SCOPUS:85125455017
SN - 0094-114X
VL - 172
JO - Mechanism and Machine Theory
JF - Mechanism and Machine Theory
M1 - 104793
ER -