Design and Optimization of Piezoelectric MEMS Vibration Energy Harvesters Based on Genetic Algorithm
Bibliographic record
Abstract
Low-power electronic applications are normally powered by batteries, which have to deal with stringent lifetime and size constraints. To enhance operational autonomy, energy harvesting from ambient vibration by microelectromechanical systems (MEMS) has been identified as a vivid solution to this universal problem. This paper proposes an automated design and optimization methodology with minimum human efforts for MEMS-based piezoelectric energy harvesters. The analytic equations for estimating the harvested voltage by the unimorph piezoelectric energy harvesters are presented with their accuracy validated by using the finite element method (FEM) simulation and prototype measurement. Thanks to their high accuracy, we use these analytic equations as fitness functions of genetic algorithm (GA), an evolutionary computation method for optimization problems by mimicking biological evolution. Our experimental results show that the GA is capable of optimizing multiple physical parameters of piezoelectric energy harvesters to considerably enhance the output voltage. This harvesting efficiency improvement is also desirably coupled with physical size reduction as preferred for the MEMS design process. To demonstrate capability of the proposed optimization method, we have also included a commercial optimization product (i.e., COMSOL optimization module) in our comparison study. The experiments show that our proposed GA-based optimization methodology offers higher effectiveness in the magnitude improvement of harvested voltage along with less runtime compared with the other optimization approaches. Furthermore, the effects of geometry optimization on mechanical and electrical properties (e.g., resonant frequency, stiffness, and internal impedance) are also studied and an effective solution to producing maximum power from unimorph piezoelectric harvesters is proposed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".