Type Synthesis of Baranov Truss With Multiple Joints and Multiple-Joint Links

1998 ◽  
Author(s):  
Jinkui Chu ◽  
Weiqing Cao ◽  
Tingli Yang
Keyword(s):  
Computer Program ◽  
Synthesis Process ◽  
Type Synthesis ◽  
Program System ◽  
Structural Synthesis ◽  
Open Chain ◽  
Synthesis Of Mechanisms

Abstract The method called Single-Open-Chain (SOC) proposed in the literature is a very effective one for structural synthesis of mechanisms; in particular the method suits the synthesis process with the computer. In this paper, a new representation for mechanisms, called Double-Color-Graph (DCG) is introduced. Application of the SOC concept with the help of DCG representation, a new procedure for type synthesis for multiple joints and multiple-joint links, is presented. Baranov Trusses are extensively studied, which results in the finding of 158 independent types of Baranov Trusses with the number of loops being (1–4). A computer program system has been developed to generate all these types.

An Algorithm for Automatic Sketching of Planar Kinematic Chains

1985 ◽  
Vol 107 (1) ◽  
pp. 106-111 ◽  
Author(s):  
D. G. Olson ◽  
T. R. Thompson ◽  
D. R. Riley ◽  
A. G. Erdman
Keyword(s):  
Graph Theory ◽  
Line Graph ◽  
Kinematic Chain ◽  
Graph Representation ◽  
Synthesis Process ◽  
Line Graphs ◽  
Type Synthesis ◽  
Kinematic Chains ◽  
Synthesis Of Mechanisms ◽  
Computer Aided

One of the problems encountered in attempting to computerize type synthesis of mechanisms is that of automatically generating a computer graphics display of candidate kinematic chains or mechanisms. This paper presents the development of a computer algorithm for automatic sketching of kinematic chains as part of the computer-aided type synthesis process. Utilizing concepts from graph theory, it can be shown that a sketch of a kinematic chain can be obtained from its graph representation by simply transforming the graph into its line graph, and then sketching the line graph. The fundamentals of graph theory as they relate to the study of mechanisms are reviewed. Some new observations are made relating to graphs and their corresponding line graphs, and a novel procedure for transforming the graph into its line graph is presented. This is the basis of a sketching algorithm which is illustrated by computer-generated examples.

The Topological Analysis of Compliant Mechanisms

1994 ◽  
Author(s):  
Morgan D. Murphy ◽  
Ashok Midha ◽  
Larry L. Howell
Keyword(s):  
Rigid Body ◽  
Systematic Approach ◽  
Compliant Mechanisms ◽  
Topological Analysis ◽  
Synthesis Process ◽  
Second Phase ◽  
Functional Requirements ◽  
Type Synthesis ◽  
Body Type ◽  
Synthesis Of Mechanisms

Abstract Following the topological synthesis of mechanisms, a topological analysis constitutes the second phase of the type-synthesis process. Topological analysis involves investigating distinct ways of specifying inputs, outputs and joint types to satisfy the functional requirements. For compliant mechanisms, the number of possible input combinations is typically much greater than for their rigid-body counterparts. Therefore, a systematic approach to input specification is required. This paper deals primarily with the development of a systematic input specification procedure for compliant mechanisms, while building on the rigid-body type-synthesis techniques and the terminology previously established for compliant elements. The techniques developed are straightforward and may be easily automated.

STRUCTURAL SYNTHESIS OF MECHANISMS KINEMATICS–TYPE DELTA

2020 ◽  
Vol 339 (1) ◽  
pp. 26-33
Author(s):  
N.A. SAPRYKINA ◽  
◽  
A.V. PROSKOKOV ◽  
A.A. SAPRYKIN ◽  
◽  
...  
Keyword(s):  
Structural Synthesis ◽  
Synthesis Of Mechanisms

scholarly journals A New Algorithm for Unique Representation and Isomorphism Detection of Planar Kinematic Chains with Simple and Multiple Joints

Processes ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 601
Author(s):  
Mahmoud Helal ◽  
Jong Wan Hu ◽  
Hasan Eleashy
Keyword(s):  
Degree Of Freedom ◽  
Synthesis Process ◽  
Structural Synthesis ◽  
Joint Configuration ◽  
Unique Representation ◽  
Kinematic Chains

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.

A Method for Type Synthesis of Mechanisms Using Phase Diagrams

1994 ◽  
Author(s):  
Sio-Hou Lei ◽  
Ying-Chien Tsai
Keyword(s):  
Phase Diagram ◽  
Degrees Of Freedom ◽  
Practical Application ◽  
Type Synthesis ◽  
Planar Mechanisms ◽  
Simple Loop ◽  
Single Degree Of Freedom ◽  
Single Degree ◽  
Spatial Mechanisms ◽  
Synthesis Of Mechanisms

Abstract A method for synthesizing the types of spatial as well as planar mechanisms is expressed in this paper by using the concept of phase diagram in metallurgy. The concept represented as a type synthesis technique is applied to (a) planar mechanisms with n degrees of freedom and simple loop, (b) spatial mechanisms with single degree of freedom and simple loop, to enumerate all the possible mechanisms with physically realizable kinematic pairs. Based on the technique described, a set of new reciprocating mechanisms is generated as a practical application.

The Degree Code—A New Mechanism Identifier

1993 ◽  
Vol 115 (3) ◽  
pp. 627-630 ◽  
Author(s):  
C. S. Tang ◽  
Tyng Liu
Keyword(s):  
Storage System ◽  
Graph Isomorphism ◽  
Critical Issue ◽  
Mathematical Representation ◽  
Structural Synthesis ◽  
Synthesis Of Mechanisms ◽  
Code Algorithm ◽  
Isomorphic Graphs ◽  
And Storage ◽  
Isomorphism Identification

An important step in the structural synthesis of mechanisms requires the identification of isomorphism between the graphs which represents the mechanism topology. Previously used methods for identifying graph isomorphism either yield incorrect results for some cases or their algorithms are computationally inefficient for this application. This paper describes a new isomorphism identification method which is well suited for the automated structural synthesis of mechanisms. This method uses a new and compact mathematical representation for a graph, called the Degree Code, to identify graph isomorphism. Isomorphic graphs have identical Degree Codes; nonisomorphic graphs have distinct Degree Codes. Therefore, by examining the Degree Codes of the graphs, graph isomorphism is easily and correctly identified. This Degree Code algorithm is simpler and more efficient than other methods for identifying isomorphism correctly. In addition, the Degree Code can serve as an effective nomenclature and storage system for graphs or mechanisms. Although this identification scheme was developed specifically for the structural synthesis of mechanisms, it can be applied to any area where graph isomorphism is a critical issue.

Type Synthesis of a 1T Symmetric Coupling Mechanism with the Method of Separation and Merger

2014 ◽  
Vol 635-637 ◽  
pp. 1290-1293
Author(s):  
Shou Li Zhang ◽  
Jing Fang Liu ◽  
Yue Qing Yu
Keyword(s):  
Linear Combination ◽  
Parallel Mechanism ◽  
Creative Design ◽  
Coupling Mechanism ◽  
Type Synthesis ◽  
Structural Synthesis ◽  
Hybrid Mechanism ◽  
Coupled Structures ◽  
Coupling Mechanisms

The structural synthesis is the primary and the most important issue in the process of mechanism creative design. In the paper, Firstly, select a 1T symmetric parallel mechanism, and the constraint and mobility of the branches can be analyzed. With the method of linear combination of the screws, the new branches are constructed. Then, using the measure of separation and merger, parts of the limbs of the parallel mechanism can be replaced by equivalent coupled structures, so corresponding symmetric coupling mechanisms with equal mobility are synthesized. Finally, solving the constraint screws of the branch of the coupling mechanism, in order to prove the hybrid mechanism is full-cycle or not.

Synthesis of planar kinematic chains with prismatic pairs based on a similarity recognition algorithm

2021 ◽  
pp. 1-13
Author(s):  
Rongjiang Cui ◽  
Zhizheng Ye ◽  
Shifu Xu ◽  
Chuan-yu Wu ◽  
Liang Sun
Keyword(s):  
Recognition Algorithm ◽  
Synthesis Process ◽  
Synthesis Methods ◽  
Structural Synthesis ◽  
Kinematic Chains

Abstract The structural synthesis of planar kinematic chains (KCs) with prismatic pairs (P-pairs) is the basis of innovating mechanisms containing P-pairs. In literature, only a little research has been carried out to synthesize planar KCs with P-pairs. Moreover, these synthesis methods for KCs with P-pairs involve all possible combinations of edges, resulting in a large number of isomorphic KCs and a low synthesis efficiency. In this study, our previous similarity recognition algorithm is improved and applied to synthesize planar KCs with P-pairs. Only a small number of isomorphic KCs are generated in the synthesis process, and the synthesis efficiency is greatly enhanced. Our method is applied to synthesize 9-link 2-DOF, 10-link 1-DOF, and 11-link 2-DOF KCs with one and two P-pairs. Our synthesis results are consistent with those of the existing literature. The present work is helpful to design mechanisms with P-pairs and can be extended to mechanisms with other types of kinematic pairs.

Computer analysis of two-dimensional gels: semi-automatic matching.

1982 ◽  
Vol 28 (4) ◽  
pp. 867-875 ◽  
Author(s):  
M J Miller ◽  
P K Vo ◽  
C Nielsen ◽  
E P Geiduschek ◽  
N H Xuong
Keyword(s):  
Computer Program ◽  
Quantitative Data ◽  
Computer Graphic ◽  
Automatic Method ◽  
Two Dimensional ◽  
Program System ◽  
Graphic Display ◽  
Set Up ◽  
Automatic Matching ◽  
Editing Process

Abstract We describe a computer program system for finding, quantitating, and matching the protein spots resolved on a two-dimensional electropherogram. The programs that locate and quantitate the incorporation of radioactivity into individual spots are totally automatic, as are the programs for matching protein spots between two exposures of the same gel. A semi-automatic method is used to match protein spots between different gels. This procedure is quite fast with the use of a computer-graphic display, which is also helpful in the editing process. A data base is set up and programs have been written to correlate matched protein spots from multi-gel experiments and to efficiently plot out quantitative data from sequences of equivalent spots from many gels or even many multi-gel experiments. The practical use of this system is discussed.

Sign in / Sign up

Export Citation Format

Share Document