Multi-peak MPPT Control Based on Variable Step Disturbance Observation Method and Butterfly Optimization Algorithm
Bibliographic record
Abstract
Photovoltaic power generation has attracted more and more attention in the field of new energy applications, and the maximum power point tracking technology is the critical link of the photovoltaic power generation system. In the case of partial shading, the output power curve of the photovoltaic array presents a multi-peak phenomenon, and the traditional MPPT algorithm is easy to fall into the optimal local solution when tracking the maximum power, while the traditional butterfly algorithm has slow convergence and low optimization accuracy in the tracking process. In order to reduce the loss of output power of photovoltaic system, an MPPT control method combining butterfly algorithm with adaptive inertia weight and variable step size disturbance observation method is proposed. In the butterfly algorithm, the population randomly generates the initial solution, and the crossover mutation operation is carried out on the population. The inertia weight is constantly updated with the increase of iteration times, which can reduce the oscillation amplitude in the tracking process, increase the robustness of the algorithm search, and achieve the purpose of global search. Then, the perturbation observation method with variable step size is used to accelerate the convergence speed and accuracy. The simulation results show that compared with the traditional perturbation observation method and butterfly optimization algorithm, the proposed algorithm can find the maximum power point stably, quickly, and accurately in the case of sudden illumination change, which significantly improves the performance of MPPT.
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.000 | 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.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".