Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Topology optimization of planar linkage mechanisms for path generation without prescribed timing
by
Kim, Yoon Young
, Han, Sang Min
, In Kim, Suh
in
Case studies
/ Computational Mathematics and Numerical Analysis
/ Engineering
/ Engineering Design
/ Fourier analysis
/ Linkage mechanisms
/ Optimization
/ Research Paper
/ Sensitivity analysis
/ Synthesis
/ Theoretical and Applied Mechanics
/ Time measurement
/ Topology optimization
2017
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Topology optimization of planar linkage mechanisms for path generation without prescribed timing
by
Kim, Yoon Young
, Han, Sang Min
, In Kim, Suh
in
Case studies
/ Computational Mathematics and Numerical Analysis
/ Engineering
/ Engineering Design
/ Fourier analysis
/ Linkage mechanisms
/ Optimization
/ Research Paper
/ Sensitivity analysis
/ Synthesis
/ Theoretical and Applied Mechanics
/ Time measurement
/ Topology optimization
2017
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Topology optimization of planar linkage mechanisms for path generation without prescribed timing
by
Kim, Yoon Young
, Han, Sang Min
, In Kim, Suh
in
Case studies
/ Computational Mathematics and Numerical Analysis
/ Engineering
/ Engineering Design
/ Fourier analysis
/ Linkage mechanisms
/ Optimization
/ Research Paper
/ Sensitivity analysis
/ Synthesis
/ Theoretical and Applied Mechanics
/ Time measurement
/ Topology optimization
2017
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Topology optimization of planar linkage mechanisms for path generation without prescribed timing
Journal Article
Topology optimization of planar linkage mechanisms for path generation without prescribed timing
2017
Request Book From Autostore
and Choose the Collection Method
Overview
The synthesis of planar linkage mechanisms by a topology optimization method has recently received much attention because both their numbers and dimensions can be simultaneously determined without baseline layouts. To synthesize a mechanism to produce a desired path at its end-effector, a desired path can be defined with or without prescribed timing. While earlier topology optimizations of mechanisms were all concerned with paths with prescribed timing, no study to deal with the topology optimization of mechanisms for path generation without prescribed timing is carried out in spite of its importance. The aim of this study is to propose and set up a gradient-based topology optimization formulation to synthesize planar linkage mechanisms that generate desired paths without prescribed timing. To this end, the desired path of the end-effector is expressed by the centroid distance function which is then represented by its Fourier descriptors. Then a topology optimization formulation using the Fourier descriptors is developed and the sensitivity analysis based on the Fourier descriptors is derived. Several numerical case studies are considered to verify the effectiveness of the proposed formulation. Some numerical issues appearing with the use of the Fourier descriptors are also investigated.
Publisher
Springer Berlin Heidelberg,Springer Nature B.V
This website uses cookies to ensure you get the best experience on our website.