Harmonic Compensation Optimization for Multiple Parallel Distributed Generators
Bibliographic record
Abstract
The interest in distributed generators (DGs), especially those associated with renewable energies, has increased in recent years. The number of functionalities that their commonly associated voltage source inverters (VSIs) can deal with is rising, harmonic currents compensation being one of them. VSI control is in charge of accomplishing the different capabilities, and it must be done without exceeding the limited and variable dc voltage margin, if undesirable effects want to be avoided. If limitations are reached, capabilities will be reduced in order to remain within the limitations. At the same time, as the number of DGs is also increasing, when capabilities are not able to be coped with exclusively one VSI, the cooperation among VSIs appears as a solution. A key point is to establish a strategy in this kind of topology when one of the VSI is brought to its limits. In this paper, a new strategy is proposed, where even under limited situation VSIs always try to inject the maximum power extracted from the DG and achieve the harmonic compensation (multifrequency) by cooperation among the different parallel VSIs. Newest multifrequency saturation strategies are studied, modified, and applied to cooperative applications. Simulations, hardware in the loop (HiL), and experimental results are included and compared.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".