Isomorphism Identification of Planar Multiple Joint Kinematic Chains by Circuit Analysis Method

2016 ◽  
pp. 889-899 ◽  
Author(s):  
Yanhuo Zou ◽  
Peng He ◽  
Dawei Xu ◽  
Jun Li
Keyword(s):  
Circuit Analysis ◽  
Analysis Method ◽  
Joint Kinematic ◽  
Kinematic Chains ◽  
Isomorphism Identification

scholarly journals An Algorithm for Identifying the Isomorphism of Planar Multiple Joint and Gear Train Kinematic Chains

2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Yanhuo Zou ◽  
Peng He
Keyword(s):  
Equivalent Circuit Model ◽  
Gear Train ◽  
Analysis Method ◽  
Kinematic Chains ◽  
Mathematical Algorithm ◽  
Structure Synthesis ◽  
Mathematical Problems ◽  
Node Voltage ◽  
Isomorphism Identification ◽  
Weighted Adjacency Matrix

Isomorphism identification of kinematic chains is one of the most important and challenging mathematical problems in the field of mechanism structure synthesis. In this paper, a new algorithm to identify the isomorphism of planar multiple joint and gear train kinematic chains has been presented. Firstly, the topological model (TM) and the corresponding weighted adjacency matrix (WAM) are introduced to describe the two types of kinematic chains, respectively. Then, the equivalent circuit model (ECM) of TM is established and solved by using circuit analysis method. The solved node voltage sequence (NVS) is used to determine the correspondence of vertices in two isomorphism identification kinematic chains, so an algorithm to identify two specific types of isomorphic kinematic chains has been obtained. Lastly, some typical examples are carried out to prove that it is an accurate, efficient, and easy mathematical algorithm to be realized by computer.

Sneak Circuit Partition Analysis Algorithm Based on Network Flow Simulation

2013 ◽  
Vol 846-847 ◽  
pp. 718-723
Author(s):  
Tao Zou ◽  
Yan Zhao ◽  
Guo Qiang Zhou ◽  
Lu Lu Chen
Keyword(s):  
Adjacency Matrix ◽  
Network Flow ◽  
Engineering Application ◽  
Flow Simulation ◽  
Circuit Analysis ◽  
Analysis Time ◽  
Analysis Method ◽  
Partition Analysis ◽  
Stratified Analysis ◽  
Cutting Point

Sneak circuit analysis method is moving to intelligent and automation direction, the method based on network flow simulation has some representation. With the expansion of the circuit system topology and the increasement of the component's amount, the analysis time increases and the efficiency is difficult to be guaranteed. To solve this situation, the circuit system can be divided into some blocks for analysis. Based on the network flow simulation model, the adjacency matrix of circuit system is established. The analysis matrix of circuit system is obtained by the simplification of the adjacency matrix; use the analysis matrix as the network model for circuit system partition analysis. Select appropriate point from the network cutting point as the partition point, the circuit system can be divided into some sub-blocks by removing these points. Circuit system stratified analysis principle is proposed; determine the division method and analysis objectives of each convention level. This method can correctly analysis sneak circuit problem for circuit system, effectively reduce the analysis time and improve the analysis efficiency. It can be taken as an effective complement of sneak circuit analysis method based on network flow simulation for engineering application.

Intelligent Design of Mechanism Kinematic Chains by Advanced Optimal Methods

2011 ◽  
Vol 201-203 ◽  
pp. 2182-2185
Author(s):  
Miao Zhang ◽  
Ning Bo Liao ◽  
Chen Zhou ◽  
Xi Tao
Keyword(s):  
Graph Theory ◽  
Intelligent Design ◽  
Kinematic Structure ◽  
Kinematic Chains ◽  
Complicated Problem ◽  
Optimal Methods ◽  
Advantages And Disadvantages ◽  
Mechanism Kinematic ◽  
Isomorphism Identification ◽  
Structure Enumeration

When using graph theory to conduct intelligent design for kinematic structure enumeration, the isomorphism identification of graphs is an important and complicated problem. In this paper, the methodology of transferring isomorphism identification into optimization issue was introduced. Then the recent development of applying advanced optimal methods for isomorphism identification was reviewed, the advantages and disadvantages of there methods were discussed.

scholarly journals Improved high-order adjacent vertex assignment sequence for similarity vertices and isomorphism identification of planar kinematic chains

2020 ◽  
Author(s):  
Liang Sun ◽  
Zhizheng Ye ◽  
Fuwei Lu ◽  
Rongjiang Cui ◽  
Chuanyu Wu
Keyword(s):  
Structural Features ◽  
High Order ◽  
Adjacent Vertex ◽  
Innovative Design ◽  
Kinematic Chains ◽  
Adjacent Point ◽  
Sequence Method ◽  
Definition Of ◽  
Isomorphism Identification ◽  
Specific Definition

Abstract Isomorphism identification is fundamental to synthesis and innovative design of kinematic chains (KCs). The identification can be performed accurately by using the similarity of KCs. However, there are very few researches on isomorphism identification based on the properties of similarity vertices. In this paper, an improved high-order adjacent vertex assignment (IHAVS) sequence method is proposed to seek out the similarity vertices and identify the isomorphism of the planar KCs. First, the specific definition of IHAVS is described. Through the calculation of the IHAVS, the adjacent point value sequence reflecting the uniqueness of the structural features is established. Based on the value sequence, all possible similarity vertices, corresponding relations and isomorphism discrimination can be realized. By checking the topological diagrams of KCs of different number of links, the correctness of the proposed method are verified. Finally, the method is used to find the similarity vertices of all the 9-link 2-DOF(degree of freedom) planar KCs.

Similarity recognition and isomorphism identification of planar kinematic chains

2020 ◽  
Vol 145 ◽  
pp. 103678 ◽  
Author(s):  
Liang Sun ◽  
Rongjiang Cui ◽  
Zhizheng Ye ◽  
Yuzhu Zhou ◽  
Yadan Xu ◽  
...  
Keyword(s):  
Kinematic Chains ◽  
Isomorphism Identification
Sign in / Sign up

Export Citation Format

Share Document