Type Synthesis of Vehicle Planar Suspension Mechanism Using Graph Theory

1993 ◽  
Vol 115 (3) ◽  
pp. 652-657 ◽  
Author(s):  
T. S. Liu ◽  
C. C. Chou
Keyword(s):  
Graph Theory ◽  
Kinematic Chain ◽  
Value Theory ◽  
Vehicle Suspension ◽  
Rule Base ◽  
Type Synthesis ◽  
Labeled Graphs ◽  
Optimum Type ◽  
Variance Calculation

This paper presents a graph theory-based approach to optimum type synthesis of vehicle suspension mechanisms using an expert system. Kinematic chain isomorphism is identified, using an extended degree method to facilitate the enumeration of kinematic structures. Rules representing design criteria and the flow value theory based on energy loss calculation are incorporated in the rule base to evaluate and select mechanisms among those that are enumerated in the database. Statistical variance calculation serves to complement the flow value theory. A new method called the extended flow value method is devised for isomorphism checking of labeled graphs. In the spirit of increasing emphasis on the riding quality of vehicles, several novel suspension configurations are created to ensure maintenance ease and vibration damping efficiency.

Type Synthesis and Application of Gear Linkage Transplanting Mechanisms Based on Graph Theory

2019 ◽  
Vol 62 (2) ◽  
pp. 515-528
Author(s):  
Liang Sun ◽  
Yuzhu Zhou ◽  
Xuan Chen ◽  
Chuanyu Wu
Keyword(s):  
Graph Theory ◽  
Structural Characteristics ◽  
Synthesis Method ◽  
Kinematic Chain ◽  
Gear Train ◽  
Type Synthesis ◽  
Linkage Mechanism ◽  
Topological Graph ◽  
Labeled Graphs ◽  
Motion Characteristics

Abstract. Type synthesis is an important step when designing innovations in mechanisms. To overcome the limitation of traditional gear train transplanting mechanisms in realizing a specific trajectory, a swinging linkage mechanism is introduced into the design of the transplanting mechanism. To design a crop-transplanting gear linkage mechanism (GLM), an automatic synthesis method based on graph theory is proposed in this article. First, the numbers of loops, links, joints and other parameters, along with unlabeled graphs, are calculated based on the structural characteristics of the GLM. The labeled graphs that correspond to the kinematic chain (KC) are then obtained by thickening the edges of the unlabeled graphs, and physically reasonable labeled graphs are derived from identification of the structural rationality of the corresponding structures. Based on the relative motion characteristics of the input and output links of the transplanting mechanisms, criteria for screening the gear linkage mechanisms represented by the labeled graphs are formulated, and the labeled graphs that are suitable for transplanting are calculated to enrich the configurations of the transplanting mechanisms. Finally, two examples are tested to verify the effectiveness of the proposed type synthesis method. Keywords: Gear linkage, Screening, Topological graph, Transplanting mechanism, Type synthesis.

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.

scholarly journals Denavit-Hartenberg Coordinate System for Robots with Tree-like Kinematic Structure

2016 ◽  
Vol 5 (4) ◽  
pp. 244
Author(s):  
Alexander Kovalchuk ◽  
F. Akhmetova
Keyword(s):  
Graph Theory ◽  
Coordinate System ◽  
Kinematic Chain ◽  
Kinematics And Dynamics ◽  
Kinematic Structure ◽  
Coordinate Systems ◽  
Reachability Graph ◽  
Joint Application ◽  
Linear Chains ◽  
Use Efficiency

<p class="MDPI17abstract"><span lang="EN-US">The paper presents a modified Denavit-Hartenberg coordinate system resulted from joint application of graph theory and the Denavit-Hartenberg coordinate system, which was developed to describe the kinematics of robot actuators with a linear open kinematic chain. It allows forming mathematical models of actuating mechanisms for the robots with tree-like kinematic structures. The work introduces the concept of primary and auxiliary coordinate systems. It considers an example of making the links’ reachability matrix and reachability graph for the tree-like actuating mechanism of a robotic mannequin. The use efficiency of the proposed modified Denavit-Hartenberg coordinate system is illustrated by the examples giving the mathematical description of the kinematics and dynamics of specific robots’ tree-like actuating mechanisms discussed in the previously published papers. It is shown that the proposed coordinate system can also be successfully applied to describe the actuating mechanisms of robots with a linear open kinematic chain, which is a particular case of the tree-like kinematic structure. The absence of branching joints in it does not require introducing auxiliary coordinate systems and the parameters f(i) and ns(i) are necessary only for the formal notation of equations, which have similar forms for the tree-like and linear chains. In this case, the modified and traditional coordinate systems coincide.</span></p>

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.

Congestion Control Using Soft Computing

2010 ◽  
pp. 271-289
Author(s):  
T. Revathi ◽  
K. Muneeswaran
Keyword(s):  
Queue Length ◽  
Fuzzy Rule ◽  
Vital Role ◽  
Rate Of Change ◽  
Rule Base ◽  
Queue Management ◽  
Internet Routers ◽  
Fuzzy Rule Base ◽  
The Status

In the recent Internet era the queue management in the routers plays a vital role in the provision of Quality of Service (QoS). Virtual queue-based marking schemes have been recently proposed for Active Queue Management (AQM) in Internet routers. In this chapter, the authors propose Fuzzy enabled AQM (F-AQM) scheme where the linguistics variables are used to specify the behavior of the queues in the routers. The status of the queue is continuously monitored and decisions are made adaptively to drop or mark the packets as is done in Random Early Discard (RED) and Random Early Marking (REM) algorthms or schemes. The authors design a fuzzy rule base represented in the form of matrix indexed by queue length and rate of change of queue. The performance of the proposed F-AQM scheme is compared with several well-known AQM schemes such as RED, REM and Adaptive Virtual Queue (AVQ).

SOFTWARE REUSABILITY MODEL FOR PROCEDURE BASED DOMAIN-SPECIFIC SOFTWARE COMPONENTS

2008 ◽  
Vol 18 (08) ◽  
pp. 1063-1081 ◽  
Author(s):  
PARVINDER SINGH SANDHU ◽  
HARDEEP SINGH
Keyword(s):  
Software Metrics ◽  
Semantic Analysis ◽  
Research Work ◽  
Matrix Decomposition ◽  
Probabilistic Latent Semantic Analysis ◽  
Rule Base ◽  
Software Components ◽  
Reusable Components ◽  
Taguchi Analysis

Automatic reusability appraisal is helpful in evaluating the quality of developed or developing reusable software components and in identification of reusable components from existing legacy systems; that can save cost of developing the software from scratch. But the issue of how to identify reusable components from existing systems has remained relatively unexplored. In this paper, we mention a two-tier approach by studying the structural attributes as well as usability or relevancy of the component to a particular domain. We evaluate Probabilistic Latent Semantic Analysis (PLSA) approach, LSA's Singular Value Decomposition (SVD) technique, LSA's Semi-Discrete Matrix Decomposition (SDD) technique and Naïve Bayes approach to determine the Domain Relevancy of software components. It exploits the fact that Feature Vector codes can be seen as documents containing terms — the identifiers present in the components — and so text modeling methods that capture co-occurrence information in low-dimensional spaces can be used. In this research work, structural attributes of software components are explored using software metrics and quality of the software is inferred by Neuro-Fuzzy (NF) Inference engine, taking the metric values as input. The influence of different factors on the reusability is studied and the condition for the optimum reusability index is derived using Taguchi Analysis. The NF system is optimized by selecting initial rule-base through modified ID3 decision tree algorithm in combination with the results of Taguchi Analysis. The calculated reusability value enables to identify a good quality code automatically. It is found that the reusability value determined is close to the manual analysis used to be performed by the programmers or repository managers. So, the system developed can be used to enhance the productivity and quality of software development.

Type Synthesis of 3-DOF Spherical Parallel Manipulators Based on Screw Theory1

2004 ◽  
Vol 126 (1) ◽  
pp. 101-108 ◽  
Author(s):  
Xianwen Kong ◽  
Cle´ment M. Gosselin
Keyword(s):  
Parallel Manipulator ◽  
Screw Theory ◽  
General Procedure ◽  
Kinematic Chain ◽  
Parallel Manipulators ◽  
Type Synthesis ◽  
Validity Condition ◽  
First Time ◽  
Spherical Parallel Manipulator ◽  
Selection Of

A spherical parallel manipulator (SPM) refers to a 3-DOF (degree-of-freedom) parallel manipulator generating 3-DOF spherical motion. A method is proposed for the type synthesis of SPMs based on screw theory. The wrench systems of a spherical parallel kinematic chain (SPKC) and its legs are first analyzed. A general procedure is then proposed for the type synthesis of SPMs. The type synthesis of legs for SPKCs, the type synthesis of SPKCs, as well as the selection of inputs of SPMs are dealt with in sequence. An input validity condition of SPMs is proposed. SPKCs with and without inactive joints are synthesized. The number of overconstraints of each SPKC is also given. The phenomenon of dependent joint groups in an SPKC is revealed for the first time.

Structural Analysis and Mobility Test of Fourteen Links Kinematic Chain Using Graph Theory

2014 ◽  
Vol 592-594 ◽  
pp. 1165-1169
Author(s):  
Preeti Gulia ◽  
V.P. Singh
Keyword(s):  
Graph Theory ◽  
Structural Analysis ◽  
Incidence Matrix ◽  
Reliable Method ◽  
Kinematic Chain ◽  
Polynomial Equation ◽  
Degree Of Freedom ◽  
Mobility Test ◽  
Structural Problems ◽  
Algebraic Test

The present work is focused on the graph theory which is used for structural analysis of kinematic chain and identification of degree of freedom. A method based on graph theory is proposed in this paper to solve structural problems by using a suitable example of fourteen links kinematic chain. Purpose of this paper is to give an easy and reliable method for structural analysis of fourteen links kinematic chain. Here, a simple incidence matrix is used to represent the kinematic chain. The proposed method is applied for determining the characteristic polynomial equation of fourteen links kinematic chain. An algebraic test based on graph theory is also used for identifying degree of freedom of kinematic chain whether it is total, partial or fractionated degree of freedom.

scholarly journals Student discourse networks and instructor facilitation in process oriented guided inquiry physical chemistry classes

2020 ◽  
Author(s):  
Dilhara Liyanage ◽  
Stanley M. Lo ◽  
Sally S. Hunnicutt
Keyword(s):  
Physical Chemistry ◽  
Graph Theory ◽  
Student Engagement ◽  
Inquiry Learning ◽  
Cognitive Engagement ◽  
Guided Inquiry ◽  
Student Interactions ◽  
Process Oriented ◽  
Student Discussion

A novel methodology has been developed to capture student interactions and engagement modes by mapping their discourse in Process Oriented Guided Inquiry Learning (POGIL) physical chemistry courses using graph theory and a modified ICAP (Interactive, Constructive, Active, Passive) framework. This work provides a deeply contextualized description of student teamwork in a POGIL setting with triangulation of data from talk-turn tracking and coding of student engagement. Graphs of student discussions in teams were constructed for 17 students in five teams in two courses taught by different instructors. Combined with the modified ICAP framework, our data illustrate the amount, extent, and quality of discussion along with students’ cognitive engagement. Specific facilitation strategies used by instructors appear to correlate with improved student discussion and interactivity. Such strategies include providing responsive versus prepared lectures and requiring students to publicly share their thinking.

Generation of Epicyclic Gear Trains of One Degree of Freedom

2008 ◽  
Vol 130 (5) ◽  
Author(s):  
Y. V. D. Rao ◽  
A. C. Rao
Keyword(s):  
Graph Theory ◽  
Adjacency Matrix ◽  
Kinematic Chain ◽  
Planetary Gear ◽  
Degree Of Freedom ◽  
Planetary Gear Trains ◽  
Epicyclic Gear ◽  
Gear Trains ◽  
Hamming Matrix

New planetary gear trains (PGTs) are generated using graph theory. A geared kinematic chain is converted to a graph and a graph in turn is algebraically represented by a vertex-vertex adjacency matrix. Checking for isomorphism needs to be an integral part of the enumeration process of PGTs. Hamming matrix is written from the adjacency matrix, using a set of rules, which is adequate to detect isomorphism in PGTs. The present work presents the twin objectives of testing for isomorphism and compactness using the Hamming matrices and moment matrices.

Sign in / Sign up

Export Citation Format

Share Document