Unified Topological Representation Models of Planar Kinematic Chains

2009 ◽  
Vol 131 (11) ◽  
Author(s):  
Huafeng Ding ◽  
Jing Zhao ◽  
Zhen Huang
Keyword(s):  
Conceptual Design ◽  
Topological Representation ◽  
Topological Graph ◽  
Planar Mechanisms ◽  
Topological Graphs ◽  
Joint Kinematic ◽  
Kinematic Chains ◽  
Mathematical Representations ◽  
Structure Synthesis ◽  
Topological Models

This paper attempts to establish unified topological models and corresponding mathematical representations for planar simple joint, multiple joint, and geared (cam) kinematic chains. First, the conventional topological representation models of kinematic chains are introduced. Then, new topological models of multiple joint and geared (cam) kinematic chains, which are derived from the topological model of simple joint kinematic chains, are presented. The characteristics of the new topological graphs and their associations with the topological graph of simple joint kinematic chains are also addressed. The most important merit of the new topological graphs is that it makes it much easier to undertake unified structure synthesis and further to establish conceptual design platform for various planar mechanisms. Synthesis examples of both multiple joint and geared chains are given, which show the effectiveness of the unified topological models.

The Establishment of Novel Structure Representation Models for Several Kinds of Mechanisms

2009 ◽  
Author(s):  
Huafeng Ding ◽  
Jing Zhao ◽  
Zhen Huang
Keyword(s):  
Topological Graph ◽  
Planar Mechanisms ◽  
Topological Graphs ◽  
Structure Representation ◽  
Joint Kinematic ◽  
Kinematic Chains ◽  
Mathematical Representations ◽  
Novel Structure ◽  
Structure Synthesis ◽  
Topological Models

This paper attempts to establish the unified topological models and corresponding mathematical representations for planar simple joint, multiple joint and geared (cam) kinematic chains. First, the conventional topological representation models of kinematic chains are introduced. Then new topological models of multiple joint and geared (cam) kinematic chains, which are derived from the topological graph of simple joint kinematic chains, are presented. The characteristics of the new topological graphs and their associations with the topological graph of simple joint kinematic chains are also addressed. The most important merit of the new topological graphs is that it makes it much easier to do unified structure synthesis and further establish conceptual design platform for various planar mechanisms of these kinds.

Generation of Planar Kinematic Chains With One Multiple Joint

2013 ◽  
Author(s):  
Huafeng Ding ◽  
Weijuan Yang ◽  
Peng Huang ◽  
Li Ma ◽  
Andrés Kecskeméthy
Keyword(s):  
Conceptual Design ◽  
Degrees Of Freedom ◽  
Characteristic Number ◽  
Automatic Method ◽  
Topological Graph ◽  
Topological Graphs ◽  
Systematic Method ◽  
Joint Kinematic ◽  
Kinematic Chains ◽  
First Time

It is very important to synthesize as many feasible kinematic structures of mechanisms as possible in the conceptual design of mechanisms. Besides simple joint mechanisms, multiple joint mechanisms are also widely used in various mechanical systems. This paper proposes an automatic method for the synthesis of planar multiple joint kinematic chains which are seldom addressed in literature. The bicolor topological graph and the bicolor contracted graph are adopted to represent the topological structures of multiple joint kinematic chains. The characteristic number string of bicolor topological graphs is proposed and used to detect efficiently isomorphism in the synthesis progress. A systematic method for the synthesis of kinematic chains with one multiple joint is proposed, and the whole families of multiple joint kinematic chains with up to 16 links and all possible degrees of freedom are obtained for the first time.

Automatic Structural Synthesis of Planar Multiple Joint Kinematic Chains

2013 ◽  
Vol 135 (9) ◽  
Author(s):  
Huafeng Ding ◽  
Weijuan Yang ◽  
Peng Huang ◽  
Andrés Kecskeméthy
Keyword(s):  
Degrees Of Freedom ◽  
Characteristic Number ◽  
Structural Synthesis ◽  
Topological Graph ◽  
Topological Graphs ◽  
Systematic Method ◽  
Joint Kinematic ◽  
Kinematic Chains ◽  
Mechanical Products ◽  
First Time

It is of great importance in the conceptual creative design of mechanical systems to synthesize as many feasible kinematic structures of mechanisms as possible. However, the methods for the structural synthesis of multiple joint kinematic chains are seldom addressed in literature even though they are widely used in various mechanical products. This paper proposes an automatic method to synthesize planar multiple joint kinematic chains. First, the bicolor topological graph and the bicolor contracted graph are introduced to represent the topological structures of multiple joint kinematic chains. Then, the characteristic number string of bicolor topological graphs is proposed and used to efficiently detect isomorphism in the synthesis progress. Finally, a systematic method for the synthesis of kinematic chains with one multiple joint is proposed, and the whole families of multiple joint kinematic chains with up to 16 links and all possible degrees of freedom are synthesized for the first time.

Studying the Optimal Layout of Topological Graphs to Facilitate the Automatic Sketching of Kinematic Chains

2017 ◽  
Vol 139 (8) ◽  
Author(s):  
Wenjian Yang ◽  
Huafeng Ding ◽  
Yong He ◽  
Min Wu
Keyword(s):  
Conceptual Design ◽  
Low Complexity ◽  
New Method ◽  
Computer Language ◽  
Optimal Layout ◽  
Topological Graph ◽  
Topological Graphs ◽  
Kinematic Chains ◽  
Two Parameters

The sketching of kinematic chains is important in the conceptual design of mechanisms. In general, the process of sketching kinematic chains can be divided into two steps, namely sketching topological graphs and converting them into the corresponding kinematic chains. This paper proposes a new method to automatically sketch topological graphs including both planar and nonplanar graphs. First, two parameters called moving sign (MS) and moving sign string (MSS) are defined, based on which a new algorithm is proposed to acquire all feasible layouts of the contracted graph by moving inner edges. All topological graphs synthesized from the same contracted graph are identified to have the shared feasible layouts, and another algorithm is proposed to determine the optimal layout for each topological graph. Then, topological graphs are sketched automatically by determining the location of vertices. The method has low complexity and is easy to be programmed using computer language.

An Automatic Method for Sketching of Planar Simple and Multiple Joint Kinematic Chains

2015 ◽  
Author(s):  
Huafeng Ding ◽  
Peng Huang ◽  
Zhen Huang ◽  
Andrés Kecskeméthy
Keyword(s):  
Mechanical Design ◽  
Kinematic Chain ◽  
Design Stage ◽  
Automatic Method ◽  
Topological Graph ◽  
Joint Kinematic ◽  
Kinematic Chains ◽  
Visual Understanding ◽  
Fully Automatic ◽  
Edge Crossings

The sketching of mechanisms (kinematic chains) shows designers a visual understanding of the interrelationship among links and joints in mechanical design, but sketching of mechanisms in manually in conceptual design stage is time-consuming and inefficient. In this paper, a fully-automatic method for sketching of planar simple and multiple joint kinematic chains is proposed. First, the complete sets of the topological structures (topological graphs and contracted graphs) of both simple and multiple joint kinematic chains are introduced. Then an algorithm for the layouts of the contracted graphs with minimal edge crossings is proposed. Third, the expression set of binary sub-paths derived from a topological graph is obtained for the sketching of the simple joint kinematic chain, and based on the sketching of the simple joint kinematic chains the sketching of corresponding multiple joint kinematic chains is obtained. Finally, both simple and multiple joint kinematic chains with numbers of links and numbers of basic loops are provided in batch as examples to show the effectiveness of the method.

Composition Principle Based on Single-Open-Chain Unit for General Spatial Mechanisms and Its Application—In Conjunction With a Review of Development of Mechanism Composition Principles

2018 ◽  
Vol 10 (5) ◽  
Author(s):  
Ting-Li Yang ◽  
Anxin Liu ◽  
Huiping Shen ◽  
Lubin Hang ◽  
Qiaode Jeffery Ge
Keyword(s):  
Dynamic Analysis ◽  
General Procedure ◽  
Planar Mechanisms ◽  
Open Chain ◽  
Kinematic Chains ◽  
Spatial Mechanism ◽  
Spatial Mechanisms ◽  
Structure Synthesis ◽  
General Method ◽  
Dimension Number

Based on the general degree-of-freedom (DOF) formula for spatial mechanisms proposed by the author in 2012, the early single open chain (SOC)-based composition principle for planar mechanisms is extended to general spatial mechanisms in this paper. First, three types of existing mechanism composition principle and their characteristics are briefly discussed. Then, the SOC-based composition principle for general spatial mechanisms is introduced. According to this composition principle, a spatial mechanism is first decomposed into Assur kinematic chains (AKCs) and an AKC is then further decomposed into a group of ordered SOCs. Kinematic (dynamic) analysis of a spatial mechanism can then be reduced to kinematic (dynamic) analysis of AKCs and finally to kinematic (dynamic) analysis of ordered SOCs. The general procedure for decomposing the mechanism into ordered SOCs and the general method for determining AKC(s) contained in the mechanism are also given. Mechanism's kinematic (dynamic) analysis can be reduced to the lowest dimension (number of unknowns) directly at the topological structure level using the SOC-based composition principle. The SOC-based composition principle provides a theoretical basis for the establishment of a unified SOC-based method for structure synthesis and kinematic (dynamic) analysis of general spatial mechanisms.

The Establishment of the Canonical Perimeter Topological Graph of Kinematic Chains and Isomorphism Identification

2006 ◽  
Vol 129 (9) ◽  
pp. 915-923 ◽  
Author(s):  
Huafeng Ding ◽  
Zhen Huang
Keyword(s):  
Adjacency Matrix ◽  
Degree Sequence ◽  
Topological Graph ◽  
Topological Graphs ◽  
Kinematic Chains ◽  
New Concepts ◽  
Element Number ◽  
One To One ◽  
Descriptive Method ◽  
Isomorphism Identification

Some new concepts, such as the perimeter loop, the maximum perimeter degree-sequence, and the perimeter topological graph, are first presented in this paper, and the method for obtaining the perimeter loop is also involved. Then, based on the perimeter topological graph and some rules for relabeling its vertices canonically, a one-to-one descriptive method, the canonical adjacency matrix set of kinematic chains, is proposed. Another very important characteristic of the descriptive method is that in the canonical adjacency matrix set the element number is reduced dramatically, usually to only one. After that, an effective method to identify isomorphism of kinematic chains is given. Finally, some typical examples of isomorphism identification including two 28-vertex topological graphs are presented in this paper.

scholarly journals Similar Vertices and Isomorphism Detection for Planar Kinematic Chains Based on Ameliorated Multi-Order Adjacent Vertex Assignment Sequence

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Liang Sun ◽  
Zhizheng Ye ◽  
Fuwei Lu ◽  
Rongjiang Cui ◽  
Chuanyu Wu
Keyword(s):  
Degree Of Freedom ◽  
Adjacent Vertex ◽  
Topological Graph ◽  
Innovative Design ◽  
Kinematic Chains ◽  
Effectiveness And Efficiency ◽  
Definition Of ◽  
Specific Definition

AbstractIsomorphism detection is fundamental to the synthesis and innovative design of kinematic chains (KCs). The detection can be performed accurately by using the similarity of KCs. However, there are very few works on isomorphism detection based on the properties of similar vertices. In this paper, an ameliorated multi-order adjacent vertex assignment sequence (AMAVS) method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs. First, the specific definition of AMAVS is described. Through the calculation of the AMAVS, the adjacent vertex value sequence reflecting the uniqueness of the topology features is established. Based on the value sequence, all possible similar vertices, corresponding relations, and isomorphism discrimination can be realized. By checking the topological graph of KCs with a different number of links, the effectiveness and efficiency of the proposed method are verified. Finally, the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-DOF(degree of freedom) planar KCs.

Sign in / Sign up

Export Citation Format

Share Document