annie2001_3

annie2001_3 - Evolutionary Synthesis of MEMS Design...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Evolutionary Synthesis of MEMS Design Ningning Zhou, Alice Agogino, Bo Zhu, Kris Pister*, Raffi Kamalian Department of Mechanical Engineering, *Department of Electrical Engineering and Computer Science University of California at Berkeley Outline Introduction MEMS GA representation Genetic operations Synthesis example 1 Synthesis example 2 Conclusion and Future work Introduction to MEMS Synthesis MEMS are extremely small (~um) mechanical elements often integrated together with electronic circuitry, manufactured in a similar way to computer microchips. MEMS synthesis: automatically generate functional and optimum solutions for MEMS design. Device design synthesis Fabrication process synthesis Evolutionary Approach Genetic algorithms are global stochastic optimization techniques based on the adaptive mechanics of natural genetics. Robust and non-problem specific. GAs code the parameter set of the optimization problem as finite-length string. GAs start the searching from a population of random points, improve the quality of the population over time by genetic operations: selection, crossover, mutation; The best fitted solution will be evolved toward objective function. Multi-objective Genetic Algorithms (MOGAs) Deal with multiple, often competing, objectives. Present a set of pareto-optimal solutions: A(1) B(1) D(1) G(2) H(2) I(3) f1 f2 A solution x is pareto- optimal if there doesnt exist any other solutions that dominate x. equally good; non- dominated; Evolutionary MEMS Synthesis Approach Done Pareto ranking Rank-based fitness assignment Design specifications MEMS simulation (SUGAR or other tools ) Create initial designs Yes No New generation of designs Random immigrants P e % Elitism P i % 1 - P e % - P i % Performance values Meet specifications Genetic operations: selection,crossover mutation MEMS GA Representation A MEMS device is decomposed into parameterized MEMS GA building blocks....
View Full Document

This note was uploaded on 01/05/2012 for the course ECEN 212 taught by Professor Hamilton during the Fall '11 term at BYU.

Page1 / 29

annie2001_3 - Evolutionary Synthesis of MEMS Design...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online