Robust $\mathrm{L}_{1}$ Control of Uncertain IBRs in Dynamic Virtual Power Plants
Bibliographic record
Abstract
The increasing integration of inverterbased resources (IBRs) in modern power systems leads to a reduction in overall system inertia and stability margins. They produce power less than conventional fossil-fuel-based plants, positioning them as price followers in energy markets. Moreover, accurate modeling of IBRs is a hard task, requiring robust approaches to be developed. To address these challenges, this paper proposes a novel hierarchical$L_{1}$performance controller to shape a dynamic virtual power plant (DVPP). The proposed approach uses a two-layer control design. The first layer involves a global controller that uses the adaptive divide-and-conquer approach to design desired models for the IBRs. The second layer comprises local controllers that enable the DVPP to control the IBRs. The local controller uses the desired model to compute the operating point for the IBR and a robust state-feedback law to stabilize the tracking error dynamics of IBRs. Since the IIBR models are uncertain, the computed operating point is not accurate and introduces a persistent bounded disturbance in the tracking error dynamics. A robust$L_{1}$controller design is proposed to deal with the system uncertainties and minimize the effect of the persistent bounded disturbance on the IBR power. The controller gains are derived by solving a set of linear matrix inequalities (LMIs). Unlike many existing methods, the proposed framework avoids directly coupling the dynamic reference and source models, thereby reducing design complexity and enhancing the scalability of the DVPP. Furthermore, this work explicitly incorporates parameter uncertainties in IBR models, which is not the case in state-of-the-art methods. The effectiveness of the proposed method is demonstrated through simulations, highlighting its capability to maintain reliable power generation in the presence of faults.
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.002 |
| 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.001 |
| 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.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".