The Compound Union Theory and Method of Type Synthesis of Geared Linkage Kinematic Chains

2000 ◽  
Author(s):  
Chuan-He Liu ◽  
Ting-Li Yang
Keyword(s):  
Kinematic Chain ◽  
Type Synthesis ◽  
Kinematic Chains ◽  
New Concepts ◽  
Type Code

Abstract The compound union theory and method of type synthesis of geared linkage kinematic chains is developed in this paper. The theory includes the new concepts, such as the basic geared kinematic chain, the compound union and the type code etc., the new constitution principle of geared linkage kinematic chains and four new theorems that are essential for type synthesis of geared linkage kinematic chains. One typical example and its results of the type synthesis are also given. It is proved that the compound union theory and method is systematic, strict, simple, practical and efficient.

Structure Types Synthesis of Multiloop Spatial Kinematic Chains With General Variable Constraints

1998 ◽  
Author(s):  
Yufeng Luo ◽  
Tingli Yang ◽  
Ali Seireg
Keyword(s):  
Kinematic Chain ◽  
Structure Type ◽  
Type Synthesis ◽  
Kinematic Chains ◽  
Systematic Procedure ◽  
Independent Loops

Abstract A systematic procedure is presented for the structure type synthesis of multiloop spatial kinematic chains with general variable constraints in this paper. The parameters and the structure types of the contracted graphs and the branch chains used to synthesize such kinematic chains are given for kinematic chains with up to four independent loops. The assignments for the constraints values of all the loops in a kinematic chain are discussed. Using these as the basis, the structure types of the multiloop spatial kinematic chains with hybrid constraints could be synthesized.

A Survey of One Class of 7-Jointed Serially Connected Robots: Type-Synthesis to Obtain Controllably Dexterous Workspace

1989 ◽  
Vol 111 (2) ◽  
pp. 163-175 ◽  
Author(s):  
J. K. Davidson
Keyword(s):  
Screw Theory ◽  
Kinematic Chain ◽  
Synthesis Process ◽  
Geometric Description ◽  
Type Synthesis ◽  
End Effector ◽  
Identification Process ◽  
Kinematic Chains ◽  
Five Axes

A type-synthesis process, which is based on screw theory and geometry, is developed to identify certain robots, each of which can provide controllably dexterous workspace of a tool-point. The identification process is confined to only those robots which control the motion of the end-effector with seven series-connected joints, the axes for the outermost three of which are concurrent. Forty six types of robots are so identified, and, for each, the results are (i) a suitable kinematic chain for the arm and (ii) suitable angle-dimensions for the links of the arm, where the angle-choices are limited to the values 0, ± π/2, and π. A geometric description of the dominant function for control is included. The same kinematic chains are surveyed for all possible parallel and right-angle arrangements of adjacent axes in the four links of the arm. Again utilizing screw theory, 160 robots are identified which do not posses full-cycle axis-dependence among some or all of the first five axes.

Evolutionary Design of Planar Kinematic Chains

1998 ◽  
Author(s):  
David R. Nielsen ◽  
Kazem Kazerounian
Keyword(s):  
Genetic Algorithm ◽  
Kinematic Chain ◽  
Type Synthesis ◽  
Kinematic Chains ◽  
Design Flexibility ◽  
Novel Approach ◽  
Chain Link ◽  
Synthesis Of Mechanisms ◽  
New Ideas ◽  
Crossover And Mutation

Abstract A procedure is developed to optimize planar mechanism type. A Genetic Algorithm is used to cycle populations of kinematic chain link adjacency matrices, through selection, crossover, and mutation. During this optimization, fit kinematic chains survive while unfit kinematic chains do not. Upon convergence, synthesized kinematic chains of high fitness remain. This technique was lead to be called the Genetic Algorithm for Type Synthesis (GATS). GATS introduces four new ideas for the type synthesis of mechanisms. First, it does not permute all possible kinematic chains. It searches for the best kinematic chains depending on a designer’s specifications. Second, larger size mechanisms can be generated because of the genetic algorithm’s evolutionary naturalness. Third, a novel approach was applied to genetic algorithms to allow the encodings to mutate in size. This allowed for addition or elimination of links in kinematic chains during evolution. Forth, a new property was deduced from mechanism topography that describes the mechanism design flexibility.

A Study on Determining Loops of Planar Kinematic Chains

1994 ◽  
Vol 208 (1) ◽  
pp. 59-63 ◽  
Author(s):  
W Li ◽  
Z Wang ◽  
H Li
Keyword(s):  
Kinematic Chain ◽  
Automatic Generation ◽  
Maximum Length ◽  
Small Length ◽  
Kinematic Chains ◽  
New Concepts ◽  
Large Length ◽  
First Time ◽  
Independent Loops

This paper presents for the first time a method for the automatic generation of independent and peripheral loops of planar kinematic chains. In order to implement this method, three laws are considered and some new concepts, for instance same-position link, similar loop, loop-link vector and loop-joint vector, are defined. By using structural matrices of planar kinematic chains, independent loops are generated in the order from those with small length to those with large length. Next, one peripheral loop with the maximum length is generated. Finally a loop-link matrix and a loop-joint matrix are obtained to express all independent loops and the peripheral loop in a planar kinematic chain.

Type Synthesis of 3-DOF Translational Parallel Manipulators Based on Screw Theory

2004 ◽  
Vol 126 (1) ◽  
pp. 83-92 ◽  
Author(s):  
Xianwen Kong ◽  
Cle´ment M. Gosselin
Keyword(s):  
Screw Theory ◽  
General Procedure ◽  
Linear Equations ◽  
Kinematic Chain ◽  
Parallel Manipulators ◽  
Type Synthesis ◽  
Displacement Analysis ◽  
Kinematic Chains ◽  
Small Joint ◽  
Actuated Joints

A method is proposed for the type synthesis of 3-DOF (degree-of-freedom) translational parallel manipulators (TPMs) based on screw theory. The wrench systems of a translational parallel kinematic chain (TPKC) and its legs are first analyzed. A general procedure is then proposed for the type synthesis of TPMs. The type synthesis of legs for TPKCs, the type synthesis of TPKCs as well as the selection of actuated joints of TPMs are dealt with in sequence. An approach to derive the full-cycle mobility conditions for legs for TPKCs is proposed based on screw theory and the displacement analysis of serial kinematic chains undergoing small joint motions. In addition to the TPKCs proposed in the literature, TPKCs with inactive joints are synthesized. The phenomenon of dependent joint groups in a TPKC is revealed systematically. The validity condition of actuated joints of TPMs is also proposed. Finally, linear TPMs, which are TPMs whose forward displacement analysis can be performed by solving a set of linear equations, are also revealed.

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.

Enumeration of kinematic chains and mechanisms

2008 ◽  
Vol 223 (4) ◽  
pp. 1017-1024 ◽  
Author(s):  
R Simoni ◽  
A P Carboni ◽  
D Martins
Keyword(s):  
Group Theory ◽  
Kinematic Chain ◽  
Equivalence Classes ◽  
New Method ◽  
Complete List ◽  
Planar Mechanisms ◽  
Group Of Automorphisms ◽  
Kinematic Chains ◽  
New Concepts

A problem still unsolved in kinematics is the enumeration of a complete list of kinematic chains and mechanisms without isomorphisms and without degenerate chains that operate in any screw system. In this paper, a method for the enumeration of kinematic chains without isomorphisms and degenerate chains for all screw systems and a new method of enumeration of kinematic chain inversions (i.e. mechanisms) based on group theory techniques are presented. New concepts of the group theory are introduced and a new method of enumeration of inversions is presented. Kinematic inversions are related to the symmetries of the chain which can be identified analysing the corresponding graph. The symmetry of a graph can be identified for the group of automorphisms of the graph and its orbits provides sets of vertices (links) that are in the same equivalence classes, i.e. they have the same properties of symmetry. The main definitions of group theory and examples of application of the new method of enumeration of inversions are presented. New results are obtained and divided in two classes: original results in non-planar screw systems (λ≠3) and results in agreement with a previously published list for planar kinematic chains and planar mechanisms (inversions). Two tables (1 and 3) are provided, which are up-to-date lists of kinematic chains and mechanisms for several screw systems.

Structure Based Grading of Kinematic Chains

2014 ◽  
Vol 575 ◽  
pp. 501-506 ◽  
Author(s):  
Shubhashis Sanyal ◽  
G.S. Bedi
Keyword(s):  
Structural Properties ◽  
Structural Property ◽  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Kinematic Chains ◽  
Structural Differences ◽  
The Individual ◽  
Independent Loops

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).

Combined Graph Layout Algorithms for Automated Sketching of Kinematic Chains

2012 ◽  
Author(s):  
Martín A. Pucheta ◽  
Nicolás E. Ulrich ◽  
Alberto Cardona
Keyword(s):  
Computational Cost ◽  
Kinematic Chain ◽  
Initial Position ◽  
Graph Representation ◽  
Combinatorial Algorithms ◽  
Graph Layout ◽  
Kinematic Chains ◽  
Aesthetic Characteristics ◽  
Edge Crossings ◽  
Independent Loops

The graph layout problem arises frequently in the conceptual stage of mechanism design, specially in the enumeration process where a large number of topological solutions must be analyzed. Two main objectives of graph layout are the avoidance or minimization of edge crossings and the aesthetics. Edge crossings cannot be always avoided by force-directed algorithms since they reach a minimum of the energy in dependence with the initial position of the vertices, often randomly generated. Combinatorial algorithms based on the properties of the graph representation of the kinematic chain can be used to find an adequate initial position of the vertices with minimal edge crossings. To select an initial layout, the minimal independent loops of the graph can be drawn as circles followed by arcs, in all forms. The computational cost of this algorithm grows as factorial with the number of independent loops. This paper presents a combination of two algorithms: a combinatorial algorithm followed by a force-directed algorithm based on spring repulsion and electrical attraction, including a new concept of vertex-to-edge repulsion to improve aesthetics and minimize crossings. Atlases of graphs of complex kinematic chains are used to validate the results. The layouts obtained have good quality in terms of minimization of edge crossings and maximization of aesthetic characteristics.

A Novel Method for Constructing Multi-Mode Deployable Polyhedron Mechanisms Using Symmetric Spatial RRR Compositional Units

2018 ◽  
Author(s):  
Jieyu Wang ◽  
Xianwen Kong
Keyword(s):  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Single Loop ◽  
Kinematic Chains ◽  
The Third ◽  
Motion Modes ◽  
3D Printed ◽  
Novel Method ◽  
Multi Mode ◽  
Motion Mode

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.

Sign in / Sign up

Export Citation Format

Share Document