Record Details
Automated Synthesis of Planar Mechanisms with Revolute, Prismatic and Pin-In-Slot Joints
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | Automated Synthesis of Planar Mechanisms with Revolute, Prismatic and Pin-In-Slot Joints |
| Names |
Huang, Weifeng
(creator) Campbell, Matthew (advisor) |
| Date Issued | 2015-06-03 (iso8601) |
| Note | Graduation date: 2015 |
| Abstract | The intent of this research is to explore the entire design space of mechanism topologies by using a graph grammar synthesis approach. A new graph representation of planer mechanism has been developed to represent the planar mechanism with revolute (R), prismatic (P), and pin-in-slot (RP) joints. Following Gruebler's equation, the graph grammar rules are designed to increase the complexity of the linkage and avoid changing the default mobility. The "recognize" and "apply" process of graph grammar rules is done through the computer, so that the design space of mechanism topologies can be fully explored automatically. The design space of four to fourteen bar R-joint 1-DOF topologies is obtained through this research. Each of the linkages in this space is valid and does not contain any rigid sub-structure as ensured by the additional graph grammar rules. The higher DOF topologies are also enumerated by degenerating the 1-DOF results. In order to increase the diversity of the topologies design space, P- and RP-joint substitution rules are used to replace the revolute joints in the topologies. With additional functions, the rotatability of the linkage can be preserved after P-joints are introduced. The research results in a total of 159,526 unique mechanism topologies that are each saved as independent computer files. Additionally, a topology design exploration tool is created in this study to provide a convenient approach to generate complex 1-DOF linkage design. |
| Genre | Thesis/Dissertation |
| Access Condition | http://creativecommons.org/licenses/by/3.0/us/ |
| Topic | Linkage synthesis |
| Identifier | http://hdl.handle.net/1957/56377 |
