z-logo
Premium
A methodology to learn designing optimal mechanisms for path generation
Author(s) -
GalanMarin Gloria,
AlonsoSanchez F. Javier,
Del CastilloGranados Jose M.
Publication year - 2010
Publication title -
computer applications in engineering education
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.478
H-Index - 29
eISSN - 1099-0542
pISSN - 1061-3773
DOI - 10.1002/cae.20181
Subject(s) - computer science , matlab , convergence (economics) , path (computing) , trace (psycholinguistics) , mechanism (biology) , function (biology) , four bar linkage , simplicity , mathematical optimization , artificial intelligence , mathematics , motion (physics) , linguistics , philosophy , epistemology , evolutionary biology , economics , biology , programming language , economic growth , operating system
The study of four‐bar linkages to trace a desired path is an important part of teaching in mechanical design. When the number of precision points exceeds a certain number, most recent approaches utilize intelligent optimization methods based on too complex computer science theories to be implemented by an engineering student. In this article we develop and implement new mechanism design results, reducing simultaneously the design space to facilitate finding the optimal mechanism. Finally, we apply global optimization methods that do not require analytical expression of the objective function and are freely available for educational use with Matlab. The proposed computerized methodology focuses student motivation on the mechanical aspects of the problem. Design examples presented illustrate the effectiveness of the approach that provides a solution quality comparable to that of the recently proposed intelligent optimization methods with simplicity of implementation and fast convergence. © 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 18: 87–92, 2010; Published online in Wiley InterScience ( www.interscience.wiley.com ); DOI 10.1002/cae.20181

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here