Control Algorithm for Equal Current Sharing between Parallel-Connected Boost Converters in a DC Microgrid
Bibliographic record
Abstract
DC microgrids are gaining more attention compared to AC microgrids due to their high efficiency and uncomplicated interconnection of renewable sources. In standalone DC microgrid, parallel-connected converters connect the storage system to the load. To achieve equal current sharing among parallel converters, several methods have been presented, but they vary in their current sharing performance, complexity, cost, and reliability. In DC microgrid, the conventional droop control method is preferred because it is more competitive in terms of cost, suitability, and reliability compared to the master-slave control method. However, the conventional droop method cannot ensure equal current sharing due to the mismatches in parameters of parallel-connected converters. To address this limitation, a control algorithm that supervises a modified droop method to achieve precise current sharing between parallel modules is proposed in this paper. The control algorithm is based on the percentage of current sharing for each module to the total load current. The output current measurement of each converter is compared to the total load current and is used to modify the nominal voltage for each converter. The effectiveness of the proposed algorithm is verified by MATLAB simulation model and experimental results.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".