On the Solution of Eight-Precision-Point Path Synthesis of Planar Four-Bar Mechanisms Based on the Solution Region Methodology

2019 ◽  
Vol 11 (6) ◽  
Author(s):  
Jianyou Han ◽  
Wupeng Liu

Abstract In this paper, the solution region synthesis methodology (abbreviated as SRSM below) for the eight-precision-point path synthesis of planar four-bar mechanisms is presented. The so-called solution region synthesis methodology represents an infinite number of mechanism solutions in a plane, and the solution region is the area where the mechanism solutions are distributed in the plane. The x-coordinate and the y-coordinate of the plane are both taken as the concerned parameters of mechanisms. Furthermore, characteristic curves of mechanisms can be expressed in the plane. In addition, a defect judgment method is proposed, which can be realized in the computer program. The defective solutions can be eliminated efficiently, and the solutions without defects are obtained using the proposed method. After considering and imposing additional design requirements, the linkages of different types and different curve shapes are classified in the solution region. Finally, taking the path generation for eight points as the example, the methodology of establishing the solution region and the feasible solution region are presented, and the synthesis results are illustrated.

Author(s):  
Jianyou Han ◽  
Wupeng Liu

In this paper, the solution region synthesis method for multi-precision-point path synthesis of planar four-bar mechanisms is presented. The solution region method is to represent an infinite number of mechanism solutions in a plane, in which the x-coordinate and the y-coordinate of the plane are both taken as the concerned parameters of the mechanisms. Then the feature curves of the mechanisms can be expressed in the plane. Firstly, the synthesis equations for the multi-precision-point path synthesis of planar four-bar mechanisms are established. Then according to the proposed defect judgment method, the defective solutions are eliminated, and an infinite number of solutions without defects are obtained. After considering and imposing design requirements, the linkages of different types and different curve types are represented in the solution region. Finally, Taking the path generation of eight points as the example, the methodology of establishing the solution region and the feasible solution region are presented, and the synthesis results are illustrated.


Author(s):  
Guangzhen Cui ◽  
Jianyou Han ◽  
Yanqiu Xiao ◽  
Caidong Wang

The solution region methodology for solving the problem of four-bar linkage synthesis with four specified positions was extended to solve the problem of eight-bar linkage synthesis. The processes to build solution regions for synthesizing different types of eight-bar linkages are described, and the methods of building solution regions are divided into five types. First, the synthesis equation is derived, and the curve expressed by the synthesis equation is called the solution curve. Second, the process to build the spatial solution regions from the solution curves is detailed, and a new defect identification method is developed for building the spatial feasible solution region, which is a set of linkage solutions meeting four positions and excluding defects. Finally, linkage solutions that do not meet practical engineering requirements are eliminated from the spatial feasible solution region to obtain the useful spatial solution region. The examples demonstrate the feasibility of the proposed method. The proposed synthesis methodology is simple and easy to program, and provides reference for four specified position synthesis of other multi-bar linkages.


2017 ◽  
Vol 9 (4) ◽  
Author(s):  
Jianyou Han ◽  
Guangzhen Cui

This paper presents a solution region synthesis methodology to perform the dimensional synthesis of spatial 5-spherical–spherical (SS) linkages for six specified positions of the end-effector. Dimensional synthesis equations for an SS link are formulated. After solving the synthesis equations, the curves of moving and fixed joints can be obtained, and they are called moving and fixed solution curves, respectively. Each point on the curves represents an SS link. Considering the limited range of joints at the first position, we can obtain the feasible solution curves. The link length curves can be obtained based on the feasible solution curves. We determine three SS links by selecting three points meeting the requirements on link length curves. Then, the solution region is built by sorting and adding feasible solution curves and projecting the feasible solution curves on the line. The feasible solution region can be obtained by eliminating defective linkages and linkages that fail to meet the other requirements from the solution region. The validity of the formulas and applicability of the proposed approach is illustrated by example.


2018 ◽  
Vol 9 (2) ◽  
pp. 297-305 ◽  
Author(s):  
Jianyou Han ◽  
Yang Cao

Abstract. This paper presents a synthesis methodology of RCCC linkages based on the solution region methodology, R denoting a revolute joint and C denoting a cylindrical joint. The RCCC linkage is usually synthesized via its two defining dyads, RC and CC. For the four poses problem, there are double infinite solutions of the CC dyad, but there is no solution for the RC dyad. However, if a condition is imposed that leads to a coupling of the two dyads, a maximum of four poses can be visited with the RCCC linkage. Unfortunately, until now, there is no methodology to synthesize the RCCC linkage for four given poses besides optimization method. According to the coupling condition above, infinite exact solutions of RCCC linkages can be obtained. For displaying these RCCC linkages, we first build a spherical 4R linkage solution region. Then solutions with circuit and branch defects can be eliminated on this solution region, so that the feasible solution region is obtained. An RCCC linkage can be obtained by using the prescribed spatial positions and selected a value on the feasible solution region. We take values on the feasible solution region by a certain step length and many exact solutions for RCCC linkages can be obtained. Finally we display these solutions on a map, this map is the solution region for RCCC linkages.


Author(s):  
James K. Chan ◽  
John W. Ramsey

This paper describes the current pressure protection program at Savannah River Site (SRS), a Department of Energy chemical processing and nuclear material handling facility in Aiken, South Carolina. It gives a brief description of the design requirements based on ASME, API, CGA, and ASHRAE Codes. Equipment and systems requiring pressure protection at SRS are primarily pressure vessels, steam stations, process chemical systems, refrigerant and cryogenic systems and other air or gas systems. It is understood that any pressure protection program is built on five fundamental areas of responsibility: procurement, verification, registration, inspection, and repair. This paper focuses on the existing process of facility pressure protection evaluation for code compliance followed by identification of failure scenarios and system design requirements, valve selection and sizing, and verification record generation. Improvements to this process are recognized and discussed. They include the development of a computer program to perform pressure protection evaluation and generate verification records. The software would process all applicable pressure protection calculations using improved methodologies. All relevant data required would be accessible within the program. Pressure safety relief device attributes and system parameters would be displayed. The computer program would enhance design consistency, improve quality and plant safety, and make the pressure protection verification process more efficient and cost effective.


1998 ◽  
Vol 72 (2) ◽  
pp. 111-121 ◽  
Author(s):  
M. S. RIDOUT ◽  
S. TONG ◽  
C. J. VOWDEN ◽  
K. R. TOBUTT

Ritter & Salamini (1996) presented a systematic account of two-point linkage analysis in allogamous diploid plant species. Vowden et al. (1995) described an alternative approach that is implemented in a computer program LINKEM. This paper describes how the latter approach has been extended to three-point linkage analysis, and implemented in a new program LINK3EM that is available from the authors. The essence of the approach is for the computer program to derive the appropriate form of analysis for a specific cross from its ‘knowledge’ of the most general type of cross that can arise. This avoids the need for programming specific codes for the many different types of cross that can arise. The program allows different locus orderings and parental phases to be compared. The Haldane or Kosambi map functions can be specified, although it is also possible to estimate all three pairwise recombination fractions without any assumed map function.


2009 ◽  
Vol 65 (6) ◽  
pp. 707-714
Author(s):  
Anna Collins ◽  
Chick C. Wilson ◽  
Christopher J. Gilmore

The dSNAP computer program has been used to classify searches of the Cambridge Structural Database for two ligands: —O—CH2—CH2—O— and N(CH2CH2O—)3 commonly found in metal-organic systems. The clustering method used is based on total geometries (i.e. all the lengths and angles involving all the atoms in the search fragment, whether bonded or not) and proved capable of distinguishing in a wholly automatic, objective way between different types of metal complex purely on the basis of the geometry of the ligand and the relative positions of the O atoms to the metals.


2006 ◽  
Vol 02 (02) ◽  
pp. 183-194 ◽  
Author(s):  
JUN NAGASHIMA ◽  
TSUYOSHI HASHIMOTO ◽  
HIROYUKI IIDA

This paper proposes a method to tune an opening book based on self-playing games. In this method, many self-playing games are performed from various positions that are contained in the book. The book is well tuned for the target computer program that it may lure the opponent to play into its own hands. We produced some different types of books through the self-playing based tuning to perform a tournament. The tournament results indicate a remarkable playing strength improvement compared to the program with the original book. The proposed idea was implemented in our computer shogi program TACOS, which won the latest Computer Olympiad.


Sign in / Sign up

Export Citation Format

Share Document