Distributed Secondary Control for DC Microgrids With Near-Infinite Constant Power Load Accommodation
Bibliographic record
Abstract
In DC microgrids, constant power loads (CPLs) inherently exhibit negative impedance characteristics, which are widely believed to degrade system stability as their penetration level increases. Consequently, extensive research has aimed to establish safe upper bounds for CPL penetration. However, these upper bounds are typically derived as sufficient conditions, making them overly conservative. Moreover, when multiple DC sources are connected in parallel to a common DC bus, the simultaneous need for current sharing and DC bus voltage regulation further complicates system control. To address these challenges, this paper proposes a novel distributed secondary control method based on the dynamic averaging of virtual voltage drops (VVDs). The proposed method offers two key advantages: 1) It ensures both precise current sharing and voltage regulation in single-bus DC microgrids, even in the presence of mixed ZIP loads, i.e., constant resistive loads (Z), constant current loads (I), and constant power loads (P). 2) Unlike existing approaches that impose conservative limits on CPL penetration, the proposed method theoretically demonstrates that the safe upper bound for CPLs can be arbitrarily large, enabling the DC microgrid to accommodate an almost infinite number of CPLs without compromising stability. Both Simulation and experiment studies are conducted to validate the effectiveness of the proposed method.
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.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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".