scholarly journals STRUCTURAL IDENTIFICATION OF DISTINCT INVERSIONS OF PLANAR KINEMATIC CHAINS

2011 ◽  
Vol 12 (3) ◽  
Author(s):  
Dr. Shubhashis Sanyal

Inversions are various structural possibilities of a kinematic chain. The number of inversions depends on the number of links of a kinematic chain. At the stage of structural synthesis, identification of distinct structural inversions of a particular type of kinematic chain is necessary. Various researchers have proposed methods for identification of distinct inversions. Present method based on Link joint connectivity is proposed to identify the distinct inversions of a planar kinematic chain. Method is tested successfully on single degree and multiple degree of freedom planar kinematic chains. ABSTRAK: Penyonsangan merupakan kebarangkalian pelbagai struktur suatu rangkaian kinematik. Jumlah songsangan bergantung kepada jumlah hubungan suatu rangkaian kinematik. Pada peringkat sintesis struktur, pengenalan songsangan struktur yang berbeza untuk suatu jenis rangkaian kinematik adalah perlu. Ramai penyelidik telah mencadangkan pelbagai kaedah pengenalan songsangan yang berbeza. Kaedah terkini berdasarkan hubungan kesambungan bersama telah dicadangkan untuk mengenalpasti songsangan yang berbeza dalam suatu satah rangkaian kinematik.

2021 ◽  
Vol 12 (2) ◽  
pp. 1061-1071
Author(s):  
Jinxi Chen ◽  
Jiejin Ding ◽  
Weiwei Hong ◽  
Rongjiang Cui

Abstract. A plane kinematic chain inversion refers to a plane kinematic chain with one link fixed (assigned as the ground link). In the creative design of mechanisms, it is important to select proper ground links. The structural synthesis of plane kinematic chain inversions is helpful for improving the efficiency of mechanism design. However, the existing structural synthesis methods involve isomorphism detection, which is cumbersome. This paper proposes a simple and efficient structural synthesis method for plane kinematic chain inversions without detecting isomorphism. The fifth power of the adjacency matrix is applied to recognize similar vertices, and non-isomorphic kinematic chain inversions are directly derived according to non-similar vertices. This method is used to automatically synthesize 6-link 1-degree-of-freedom (DOF), 8-link 1-DOF, 8-link 3-DOF, 9-link 2-DOF, 9-link 4-DOF, 10-link 1-DOF, 10-link 3-DOF and 10-link 5-DOF plane kinematic chain inversions. All the synthesis results are consistent with those reported in literature. Our method is also suitable for other kinds of kinematic chains.


Author(s):  
Varada Raju Dharanipragada ◽  
Nagaraja Kumar Yenugadhati ◽  
A. C. Rao

Abstract Structural synthesis of kinematic chains leans heavily on indirect methods, most of them based on Graph Theory, mainly because reliable isomorphism tests are not available. Recently however, the first and third authors have established the Secondary Hamming String of a kinematic chain as an excellent indicator of its isomorphism. In the present paper this Hamming String method was applied with slight modifications for synthesizing on a PC-386, distinct kinematic chains with given number of links and family description. The computer program, written in Pascal, generated both the six-bar and all 16 eight-bar chains as well as one sample family (2008) of ten-bar chains, verifying previously established results. Hence this paper presents a direct, quick and reliable method to synthesize planar simple-jointed chains, open or closed, with single- or multi-degree of freedom, containing any number of links. A spin-off of this paper is a simple, concise and unambiguous notation for representing a chain.


1999 ◽  
Vol 122 (1) ◽  
pp. 31-42 ◽  
Author(s):  
A. C. Rao ◽  
V. V. N. R. Prasad Raju Pathapati

Structural synthesis of kinematic chains usually involves the creation of a complete list of kinematic chains, followed by a isomorphism test to discard duplicate chains. A significant unsolved problem in structural synthesis is the guaranteed precise elimination of all isomorphs. Many methods are available to the kinematician to detect isomorphism among chains and inversions but each has its own shortcomings. Most of the study to detect isomorphism is based on link-adjacency matrices or their modification but the study based on loops is very scanty although it is very important part of a kinematic chain.  Using the loop concept a method is reported in this paper to reveal simultaneously chain is isomorphic, link is isomorphic, and type of freedom with no extra computational effort. A new invariant for a chain, called the chain loop string is developed for a planar kinematic chain with simple joints to detect isomorphism among chains. Another invariant called the link adjacency string is developed, which is a by-product of the same method to detect inversions of a given chain. The proposed method is also applicable to know the type of freedom of a chain in case of multi degree of freedom chains. [S1050-0472(00)70801-4]


Author(s):  
Jinkui Chu ◽  
Yanhuo Zou

Structural synthesis of kinematic chains is one of the most creative and important stages in mechanical design. It provides a number of optional structure types when new mechanisms are created. In this paper, a new algorithm for structural synthesis of planar simple and multiple joint kinematic chains has been proposed by subsequently adding single-kinematic-chain method. By this algorithm, the structure of multiple joint kinematic chains with specified degree-of-freedom, the number of links, and total multiple joint factors P can be synthesized in batch. When P = 0, the structure of simple joint kinematic chains with specified degree-of-freedom, and the number of links can also be generated. Finally, structural synthesis examples of planar simple and multiple joint kinematic chains have been studied to show effectiveness of this algorithm.


Processes ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 601
Author(s):  
Mahmoud Helal ◽  
Jong Wan Hu ◽  
Hasan Eleashy

In this work, a new algorithm is proposed for a unique representation for simple and multiple joint planar kinematic chains (KCs) having any degree of freedom (DOF). This unique representation of KCs enhances the isomorphism detection during the structural synthesis process of KCs. First, a new concept of joint degree is generated for all joints of a given KC based on joint configuration. Then, a unified loop array (ULA) is obtained for each independent loop. Finally, a unified chain matrix (UCM) is established as a unique representation for a KC. Three examples are presented to illustrate the proposed algorithm procedures and to test its validity. The algorithm is applied to get a UCM for planar KCs having 7–10 links. As a result, a complete atlas database is introduced for 7–10-link non-isomorphic KCs with simple or/and multiple joints and their corresponding unified chain matrix.


2014 ◽  
Vol 575 ◽  
pp. 501-506 ◽  
Author(s):  
Shubhashis Sanyal ◽  
G.S. Bedi

Kinematic chains differ due to the structural differences between them. The location of links, joints and loops differ in each kinematic chain to make it unique. Two similar kinematic chains will produce similar motion properties and hence are avoided. The performance of these kinematic chains also depends on the individual topology, i.e. the placement of its entities. In the present work an attempt has been made to compare a family of kinematic chains based on its structural properties. The method is based on identifying the chains structural property by using its JOINT LOOP connectivity table. Nomenclature J - Number of joints, F - Degree of freedom of the chain, N - Number of links, L - Number of basic loops (independent loops plus one peripheral loop).


Author(s):  
L.K. Patel ◽  
A.C. Rao

This paper presents a computationally simple and efficient method for identification of distinct mechanisms of a planar kinematic chain having a single degree of freedom. It is proposed that velocity diagrams for all the inversions of a chain be drawn and the possible isomorphism among these velocity diagrams be detected. From the velocity diagram, a motion transfer point matrix can be prepared resulting in the development of a numerical scheme to be associated with a mechanism. Identical schemes lead to detection of isomorphism between mechanisms. The main advantage of this method is that, apart form detecteing isomorphism, it indicates which of the inversions is better kinematically e.g. higher the total number of vectors, better is the mechanism.


Author(s):  
Jieyu Wang ◽  
Xianwen Kong

A novel construction method is proposed to construct multimode deployable polyhedron mechanisms (DPMs) using symmetric spatial RRR compositional units, a serial kinematic chain in which the axes of the first and the third revolute (R) joints are perpendicular to the axis of the second R joint. Single-loop deployable linkages are first constructed using RRR units and are further assembled into polyhedron mechanisms by connecting single-loop kinematic chains using RRR units. The proposed mechanisms are over-constrained and can be deployed through two approaches. The prism mechanism constructed using two Bricard linkages and six RRR limbs has one degree-of-freedom (DOF). When removing three of the RRR limbs, the mechanism obtains one additional 1-DOF motion mode. The DPMs based on 8R and 10R linkages also have multiple modes, and several mechanisms are variable-DOF mechanisms. The DPMs can switch among different motion modes through transition positions. Prototypes are 3D-printed to verify the feasibility of the mechanisms.


Author(s):  
S. Shubhashis ◽  
M. Choubey ◽  
A.C. Rao

There is no dearth of methods to test isomorphism amongst kinematic chains. Search for a computationally easier, logically simple and unique method is still on. Present work is in quest of a reliable test to detect isomorphism among kinematic chains. Work presented here is more versatile as it incorporates more features of the kinematic chain which were not included earlier such as number and type of links, their relative dispositions in the kinematic chain, nature of adjacent links etc. The method proposed is based on the concept of pseudo-probability (pseudo means it appears to be, but not exactly. The approach does not follow in-toto the principles of probability and considerable liberty has been taken in interpreting the word probability hence the word pseudo is used along with the probability schemes). Using the resemblance of different coloured balls in an urn for the number and type of links in a kinematic chain, a matrix (named P-Matrix) representing the kinematic chain in totality is generated. For the sake of comparison a numerical scheme named, pseudo probability scheme, P-Scheme, is developed from the above P-Matrix and is used for testing isomorphism. In fact the method is more powerful in the sense that each row of the proposed P-Matrix is capable of representing the respective kinematic chain distinctly and can be used to compare the kinematic chains with same link assortments, uniquely. The proposed method, besides possessing the potential of testing the isomorphism among simple-joint, single degree of freedom kinematic chains is also capable of multi degrees of freedom and multiple-joint kinematic chains.


Author(s):  
Rajesh Pavan Sunkari ◽  
Linda C. Schmidt

Mobility analysis is one of the fundamental problems of structural studies of kinematic chains. Degeneracy testing, an important step in structural synthesis, can be considered as a part of the mobility analysis due to the similarity of the two problems. One common error in the algorithms for these two problems is the assumption that the graph of a planar kinematic chain is a planar graph. This work shows that almost all the mobility analysis algorithms, except that of Lee and Yoon, have this error. This work also critically reviews the two most efficient algorithms on degeneracy testing, those by Hwang and Hwang, and Lee and Yoon. It is shown that due to the errors in the Hwang and Hwang’s algorithm, it failed to identify some of the degenerate chains. Furthermore, the accuracy of the Lee and Yoon’s algorithms for mobility analysis and degeneracy testing is proved by providing the mathematical justification of the individual steps of the algorithms.


Sign in / Sign up

Export Citation Format

Share Document