Concurrent type and dimensional synthesis of planar mechanisms using graph-theoretic enumeration, automatic loop closure equation generation, and descent-based optimization

Carl A. Nelson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

An approach to concurrent type and dimensional synthesis of planar mechanisms is presented. Using graph-theoretic enumeration of mechanisms and determination of loops, automatic loop closure equations are generated. Using constrained optimization routines based on descent methods, and given an appropriate goal function, optimal mechanism designs can be determined. These are not limited to traditional problems such as rigid-body guidance and path generation, but can be more flexibly expressed according to designer needs. This method can be effective at finding mechanism solutions when topology has not been determined a priori and may also be extensible to synthesis of spatial mechanisms. This paper presents the data flow and algorithm outline, simulation results, and examples of nonstandard synthesis problems solvable with this method.

Original languageEnglish (US)
Title of host publicationDynamic Systems and Control; Mechatronics and Intelligent Machines
PublisherAmerican Society of Mechanical Engineers (ASME)
Pages215-222
Number of pages8
EditionPARTS A AND B
ISBN (Print)9780791854938
DOIs
StatePublished - 2011
EventASME 2011 International Mechanical Engineering Congress and Exposition, IMECE 2011 - Denver, CO, United States
Duration: Nov 11 2011Nov 17 2011

Publication series

NameASME 2011 International Mechanical Engineering Congress and Exposition, IMECE 2011
NumberPARTS A AND B
Volume7

Conference

ConferenceASME 2011 International Mechanical Engineering Congress and Exposition, IMECE 2011
Country/TerritoryUnited States
CityDenver, CO
Period11/11/1111/17/11

ASJC Scopus subject areas

  • Mechanical Engineering

Fingerprint

Dive into the research topics of 'Concurrent type and dimensional synthesis of planar mechanisms using graph-theoretic enumeration, automatic loop closure equation generation, and descent-based optimization'. Together they form a unique fingerprint.

Cite this