An Improved Perturb and Observed Maximum Power Point Tracking Algorithm for Photovoltaic Power Systems
Bibliographic record
Abstract
This paper aims to improve the performance of the conventional perturb and observe (P&O) maximum power point tracking (MPPT) algorithm. As the oscillation around the maximum power point (MPP) is the main disadvantage of this technique, we introduce a modified P&O algorithm to conquer this handicap. The new algorithm recognizes approaching the peak of the photovoltaic (PV) array power curve and prevents the oscillation around the MPP. The key to achieve this goal is testing the change of output power in each cycle and comparing it with the change in array terminal power of the previous cycle. If a decrease in array terminal power is observed after an increase in the previous cycle or in the opposite direction, an increase in array terminal power is observed after a decrease in the previous cycle; it means we are at the peak of the power curve, so the duty cycle of the boost converter should remain the same as the previous cycle. Besides, an optimized duty cycle is introduced, which is adjusted based on the operating point of PV array. Furthermore, a DC-DC boost converter powered by a PV array simulator is used to test the proposed concept. When the irradiance changes, the proposed algorithm produces an average ηMPPTof nearly 3.1% greater than that of the conventional P&O algorithm and the incremental conductance (InC) algorithm. In addition, under strong partial shading conditions and drift avoidance tests, the proposed algorithm produces an average ηMPPTof nearly 9% and 8% greater than that of the conventional algorithms, respectively.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".