Generation and Sketching of Generalized Kinematic Chains

2008 ◽  
Author(s):  
Chiu-Fan Hsieh ◽  
Yii-Wen Hwang ◽  
Hong-Sen Yan
Keyword(s):  
Computer Program ◽  
Adjacency Matrix ◽  
Kinematic Chain ◽  
Kinematic Chains ◽  
A Chain

An algorithm of generalized kinematic chains and its computer program are developed in this paper. By this program, users can give the number of links and joints and then the link assortments and contracted link assortments can be calculated. The synthesis of multiple link adjacency matrix (MLAM) and the cut-link diagnosis are proposed to produce effectively the generalized kinematic chains. The algorithm can automatically determine the feature of a chain, which is connected, closed, non-isomorphism, without any cut-link (or cut-joint), and with simple joint only. Then, it can be called a generalized kinematic chain. Finally, various given number of links and joints, the nice looking atlas of generalized kinematic chains can also be generated. The developed computer program could help designers to be able to study and compare different devices in a very basic way.

A More Direct Method for Structural Synthesis of Simple-Jointed Planar Kinematic Chains

1994 ◽  
Author(s):  
Varada Raju Dharanipragada ◽  
Nagaraja Kumar Yenugadhati ◽  
A. C. Rao
Keyword(s):  
Graph Theory ◽  
Computer Program ◽  
Reliable Method ◽  
Direct Method ◽  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Structural Synthesis ◽  
Indirect Methods ◽  
Kinematic Chains ◽  
A Chain

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.

scholarly journals Structural synthesis of plane kinematic chain inversions without detecting isomorphism

2021 ◽  
Vol 12 (2) ◽  
pp. 1061-1071
Author(s):  
Jinxi Chen ◽  
Jiejin Ding ◽  
Weiwei Hong ◽  
Rongjiang Cui
Keyword(s):  
Mechanism Design ◽  
Adjacency Matrix ◽  
Synthesis Method ◽  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Synthesis Methods ◽  
Creative Design ◽  
Structural Synthesis ◽  
Kinematic Chains

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.

An Efficient Algorithm for Finding Optimum Code Under the Condition of Incident Degree

1992 ◽  
Author(s):  
T. J. Jongsma ◽  
W. Zhang
Keyword(s):  
Computer Program ◽  
Efficient Algorithm ◽  
Kinematic Chain ◽  
Isomorphism Problem ◽  
Kinematic Chains ◽  
Adjacency Matrices ◽  
Set Up

Abstract This paper deals with the identification of kinematic chains. A kinematic chain can be represented by a weighed graph. The identification of kinematic chains is thereby transformed into the isomorphism problem of graph. When a computer program has to detect isomorphism between two graphs, the first step is to set up the corresponding connectivity matrices for each graph, which are adjacency matrices when considering adjacent vertices and the weighed edges between them. Because these adjacency matrices are dependent of the initial labelling, one can not conclude that the graphs differ when these matrices differ. The isomorphism problem needs an algorithm which is independent of the initial labelling. This paper provides such an algorithm.

Identification of kinematic chains and distinct mechanisms using extended adjacency matrix

2007 ◽  
Vol 221 (1) ◽  
pp. 81-88 ◽  
Author(s):  
A Mohammad ◽  
R A Khan ◽  
V P Agrawal
Keyword(s):  
Adjacency Matrix ◽  
Kinematic Chain ◽  
Theoretic Approach ◽  
Kinematic Chains ◽  
Graph Theoretic ◽  
The Past ◽  
Graph Theoretic Approach ◽  
The Family ◽  
Eigen Value ◽  
Eigen Values

Development of the methods for generating distinct mechanisms derived from a given family of kinematic chains has been persued by a number of researchers in the past, as the distinct kinematic structures provide distinct performance characteristics. A new method is proposed to identify the distinct mechanisms derived from a given kinematic chain in this paper. Kinematic chains and their derived mechanisms are represented in the form of an extended adjacency matrix [EA] using the graph theoretic approach. Two structural invariants derived from the eigen spectrum of the [EA] matrix are the sum of absolute eigen values EA∑ and maximum absolute eigen value EAmax. These invariants are used as the composite identification number of a kinematic chain and mechanism and are tested to identify the all-distinct mechanisms derived from the family of 1-F kinematic chains up to 10 links. The identification of distinct kinematic chains and their mechanisms is necessary to select the best possible mechanism for the specified task at the conceptual stage of design.

Topological Synthesis and Analysis of Geared Linkages Based on Matrix Powers

1989 ◽  
Author(s):  
D. G. Olson ◽  
A. G. Erdman ◽  
D. R. Riley
Keyword(s):  
Adjacency Matrix ◽  
Digital Computer ◽  
Visual Inspection ◽  
Kinematic Chain ◽  
New Method ◽  
Graph Representation ◽  
Kinematic Chains ◽  
Degree Matrix ◽  
Topological Synthesis

Abstract A new method for transforming pin-jointed kinematic chains into geared linkages is introduced. The method utilizes the graph representation in the form of the adjacency matrix and the “degree matrix” [20], and the powers of these matrices. The method involves first determining the feasible locations for assigning gear pairs in a kinematic chain, followed by determining which of the choices are distinct, and finally, determining the distinct possible ways of assigning the ground link for each distinct “geared kinematic chain” so formed. Because the method is based on matrix manipulations and does not rely on visual inspection, it is easily implemented on a digital computer. The method is applied to an example class of geared mechanism, the single-dof geared seven-bar linkages.

The Novel Characteristic Representations of Kinematic Chains and Their Applications

2005 ◽  
Author(s):  
Z. Huang ◽  
H. F. Ding ◽  
Y. Cao
Keyword(s):  
Adjacency Matrix ◽  
Degree Sequence ◽  
Object Oriented ◽  
Kinematic Chain ◽  
Object Oriented Programming ◽  
The Novel ◽  
Topological Graphs ◽  
Kinematic Chains ◽  
Set Up ◽  
Oriented Programming Language

In this paper, based on perimeter topological graphs of kinematic chains, many novel topological concepts including the synthetic degree-sequence, the characteristic adjacency matrix and the characteristic representation code of kinematic chain are proposed. Both the characteristic adjacency matrix and the characteristic representation code are unique for any kinematic chain and easy to be set up. Therefore a quite effective isomorphism identification method is presented depending on the characteristic adjacency matrix. It high effectiveness is proved by many examples. With object-oriented programming language, a program which can sketch topological graphs of kinematic chains has been developed based on the characteristic representation code. Finally, an application software system establishing the atlas database of topological graphs is introduced. And some functions about the atlas database are also presented in this paper.

Structural Analysis of Kinematic Chains and Mechanisms Based on Matrix Representation

1979 ◽  
Vol 101 (3) ◽  
pp. 488-494 ◽  
Author(s):  
T. S. Mruthyunjaya ◽  
M. R. Raghavan
Keyword(s):  
Structural Analysis ◽  
Physical Meaning ◽  
Matrix Representation ◽  
Kinematic Chain ◽  
Kinematic Chains ◽  
Matrix Notation ◽  
The Matrix ◽  
Generalized Matrix ◽  
A Chain ◽  
Insight Into

A method based on Bocher’s formulae has been presented for determining the characteristic coefficients (which have recently been suggested [19] as an index of isomorphism) of the matrix associated with the kinematic chain. The method provides an insight into the physical meaning of these coefficients and leads to a possible way of arriving at the coefficients by an inspection of the chain. A modification to the matrix notation is proposed with a view to permit derivation of all possible mechanisms from a kinematic chain and distinguishing the structurally distinct ones. Algebraic tests are presented for determining whether a chain possesses total, partial or fractionated freedom. Finally a generalized matrix notation is proposed to facilitate representation and analysis of multiple-jointed chains.

Loop Based Detection of Isomorphism Among Chains, Inversions and Type of Freedom in Multi Degree of Freedom Chain

1999 ◽  
Vol 122 (1) ◽  
pp. 31-42 ◽  
Author(s):  
A. C. Rao ◽  
V. V. N. R. Prasad Raju Pathapati
Keyword(s):  
Unsolved Problem ◽  
Kinematic Chain ◽  
Computational Effort ◽  
Degree Of Freedom ◽  
Complete List ◽  
Structural Synthesis ◽  
Kinematic Chains ◽  
Adjacency Matrices ◽  
The Creation ◽  
A Chain

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]

The Topological Representation and Detection of Isomorphism Among Geared Linkage Kinematic Chains

1998 ◽  
Author(s):  
Tuan-Jie Li ◽  
Wei-Qing Cao ◽  
Jin-Kui Chu
Keyword(s):  
Computer Program ◽  
Kinematic Chain ◽  
Topological Representation ◽  
Kinematic Chains ◽  
Topological Relationship ◽  
Systematic Procedure ◽  
Topological Characteristics ◽  
Structural Invariants

Abstract Proceeded from the topological characteristics of Geared Linkage Mechanisms (GLM) structure, a fully new graph, combinatorial graph, which can be used to describe the topological relationship in a Geared Linkage Kinematic Chain (GLKC), is firstly proposed. Then the corresponding matrix, combinatorial matrix, and the structural invariants of GLKC are presented. Based on the structural invariants, this paper establishes a systematic procedure for detecting isomorphism among GLKCs using the powers of combinatorial matrix. A computer program based on the procedure has been applied successfully for detecting isomorphism among both the planar kinematic chains as well as GLKCs.

On The Performance of Kinematic Chains

1988 ◽  
Vol 12 (2) ◽  
pp. 99-103 ◽  
Author(s):  
A.C. Rao
Keyword(s):  
Kinematic Chain ◽  
Isomorphism Type ◽  
Kinematic Chains ◽  
Output Error ◽  
A Chain

A great deal has been reported by several investigators regarding detection of isomorphism, type of freedom etc., of kinematic chains based on their structure. The work reported so far will be meaningful only if some useful conclusions can be drawn from the structure of a chain, one of these being that the designer must be able to compare the structure of say, two kinematic chains and predict before completing dimensional synyhesis which of these will meet the motion requirements more accurately, in the sense of output error. The authors feel that his earlier work [1] in this direction needs to be supplemented to provide with (i) conviction that the entropy of a kinematic chain is representative of its ability to generate motion and (ii) clarification that the expression equivalent to entropy can be developed and used without resorting to probability considerations. The same is accomplished in this paper through illustrations.

Sign in / Sign up

Export Citation Format

Share Document