A new algorithm of links labelling for the isomorphism detection of various kinematic chains using binary code
A new algorithm of links labelling for the isomorphism detection of various kinematic chains using binary code
复制标题
DOI：
10.1016/j.mechmachtheory.2018.09.010
复制
发表时间：
2019
影响因子：
5.2
通讯作者：
R. Rai;S. Punjabi
中科院分区：
文献类型：
--
作者：
R. Rai;S. Punjabi
运动链的同构问题一直是结构综合研究中的一个重要问题。因此，在过去的八十年里，许多著名的研究人员提出了各种方法，无论是简单的和/或多关节的KC。二进制码是这样的各种方法之一，但主要的问题在于链接标记的算法，这变得繁琐，特别是对于大的KC。本文提出了一个简单的算法的链接标记用于找出一个二进制序列，反过来，提供了一个最大的二进制码（链不变）。该算法是测试六，七，八，九，十，十一，十二和十五杆简单的关节，七，八杆KC与多关节，最后，周转轮系（EGT）与四，五，六个链接的效率和可靠性。计算结果与参考文献完全一致。本文还以独特的方式讨论了不同KC的二进制码的译码问题。
Isomorphism of kinematic chains (KCs) has always been a critical issue for the researchers dealing with structural synthesis. Consequently, many researchers of repute presented various methods during the last eight decades for the KCs with either simple and/or multiple joints. Binary code is one of such various methods, but the major problem lies in the algorithm of links labelling, which becomes cumbersome, in particular, for large KCs. The paper presents a simple algorithm of links labelling used to find out a binary sequence which, in turn, provides a maximum binary code (chain invariant). The algorithm is tested for six, seven, eight, nine, ten, eleven, twelve and fifteen links with simple joints, seven and eight links KCs with multiple joints and finally, the Epicyclic gear trains (EGTs) with four, five and six links for its efficiency and reliability. The results are in full agreement with the references taken for the purpose. The paper discusses, in a unique way, the decoding of the binary codes of different KCs also.