Similarity recognition and isomorphism identification of planar kinematic chains

Similarity recognition and isomorphism identification of planar kinematic chains
复制标题

平面运动链的相似识别与同构识别

DOI:
10.1016/j.mechmachtheory.2019.103678
复制
发表时间:
2020
影响因子:
5.2
通讯作者:
Wu Chuanyu
Wu Chuanyu
中科院分区:
工程技术1区
文献类型:
--
作者:
Sun Liang;Cui Rongjiang;Ye Zhizheng;Zhou Yuzhu;Xu Yadan;Wu Chuanyu

文献摘要

被引文献

相似文献

运动链的相似识别和同构识别是运动链创新再生设计和构型综合的关键问题。虽然已经提出了各种检测方法,但大多数都是基于拓扑特征或某些编码,这些方法只适用于单一类型的KC,并且在某些情况下会产生错误识别。在这项研究中,一组SRII方法提出了基于图论定义的相似性和同构。这些适用于平面单关节和多关节KC、行星齿轮系(PGT)、收缩图和双曲线图。在10-bar、15-bar、21-bar、28-bar和42-bar单关节KC、4-bar三色拓扑图和8-bar收缩图上评估了算法的计算复杂度和有效性。所得结果与文献中的结果一致,表明了多杆单铰KC在同构识别效率上的优势。最后,通过辨识程序对所有8杆单自由度、9杆两自由度平面单铰KC、所有8杆带两个多铰的单自由度KC以及所有6杆单自由度旋转图进行了SRII,为算法的应用提供参考。
Similarity recognition and isomorphism identification (SRII) of kinematic chains (KCs) are key problems facing their innovative regenerative design and configuration synthesis. Although various detection methods have been proposed, most of them are based on topological characteristics or some codings, which are only suitable for single type KC and error identification is generated in some cases. In this study, a set of SRII methods is proposed based on the graph theory definition of similarity and isomorphism. These are appropriate for planar single and multiple joints KCs, planetary gear trains (PGTs), contracted graphs, and multicolor graphs. The computational complexity and effectiveness of the algorithm are assessed on 10-bar, 15-bar, 21-bar, 28-bar, and 42-bar single-joint KCs, 4-bar tricolor topological graphs, and 8-bar contracted graphs. All the results are in agreement with those in the cited literature, and the advantage in isomorphism identification efficiency of the multibar single-hinged KC is evident. Finally, SRII are performed for all 8-bar one-degree-of-freedom (1-DOF) and 9-bar 2-DOF planar single-hinged KCs, all 8-bar 1-DOF KCs with two multiple joints, and all 6-bar 1-DOF rotation graphs through identification program, with the aim to provide a reference for the application of the algorithm.