Synthesis of mechanisms integrated with motion and force transformation

2016 ◽  
Vol 17 (12) ◽  
pp. 1643-1649 ◽  
Author(s):  
Bin He ◽  
Yicheng Hua
Author(s):  
N.A. SAPRYKINA ◽  
◽  
A.V. PROSKOKOV ◽  
A.A. SAPRYKIN ◽  
◽  
...  

2004 ◽  
Author(s):  
Earl Teeter ◽  
Greg Smith ◽  
Geoff Hendrick

2003 ◽  
Author(s):  
DEPARTMENT OF THE AIR FORCE WASHINGTON DC

Author(s):  
Hong-Sen Yan ◽  
Chin-Hsing Kuo

A mechanism that encounters a certain changes in its topological structure during operation is called a mechanism with variable topologies (MVT). This paper is developed for the structural and motion state representations and identifications of MVTs. For representing the topological structures of MVTs, a set of methods including graph and matrix representations is proposed. For representing the motion state characteristics of MVTs, the idea of finite-state machines is employed via the state tables and state graphs. And, two new concepts, the topological homomorphism and motion homomorphism, are proposed for the identifications of structural and motion state characteristics of MVTs. The results of this work provide a logical foundation for the topological analysis and synthesis of mechanisms with variable topologies.


Author(s):  
Sio-Hou Lei ◽  
Ying-Chien Tsai

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.


2017 ◽  
Author(s):  
Relly Victoria mname Petrescu ◽  
Raffaella mname Aversa ◽  
Antonio mname Apicella ◽  
MirMilad mname Mirsayar ◽  
Samuel mname Kozaitis ◽  
...  

1993 ◽  
Vol 115 (3) ◽  
pp. 627-630 ◽  
Author(s):  
C. S. Tang ◽  
Tyng Liu

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.


1990 ◽  
Vol 112 (4) ◽  
pp. 488-493 ◽  
Author(s):  
B. Yang ◽  
P. Datseris ◽  
U. Datta ◽  
J. Kowalski

Methodologies have been developed and implemented in LISP and OPS-5 languages which address type synthesis of mechanisms. Graph theory and separation of structure from function concepts have been integrated into an expert system called DOMES (Design Of Mechanism by an Expert System) to effectively implement the following three activities: (1) enumeration of all nonisomorphic labelled graphs; (2) identification of those graphs which satisfy structural constraints; (3) sketching of a mechanism corresponding to a given graph. Developed theories and algorithms are applied to a Robot Gripper design [19] and a Variable Stroke Piston Engine design [16]. The results from these two applications indicate that the automated techniques effectively identify all previously obtained solutions via manual techniques. Additional solutions are also identified and several errors of the manual process are detected. The developed methodologies and software appear to perform a complete and unbiased search of all possible candidate designs and are not prone to the errors of the manual process. Other important features of DOMES are: (1) it can learn and reason, by analogy, about a new design problem based on its experience of the problems previously solved by the system; (2) it has the capability to incrementally expand its knowledge base of rejection criteria by converting into LISP code information obtained through a query-based interactive session with a human designer; (3) it can select the set of rejection criteria relevant to a design problem from its knowledge base of rejection criteria. These procedures could become a powerful tool for design engineers, especially at the conceptual stage of design.


2008 ◽  
pp. 167-174 ◽  
Author(s):  
J.A. Cabrera ◽  
J.J. Castillo ◽  
F. Nadal ◽  
A. Ortiz ◽  
A. Simón

Sign in / Sign up

Export Citation Format

Share Document