Reduced‐order modelling of solar‐PV generators for small‐signal stability assessment of power systems and estimation of maximum penetration levels
Bibliographic record
Abstract
There is an urgent need for constructing adequately accurate standard reduced‐order models of various renewable sources for fast assessment of the stability and security of power grids. This study focuses on this theme considering solar‐photovoltaic generators (SPVGs). The main objectives of this study include the construction of a valid reduced‐order dynamic model for SPVGs, analysis of the impact of the SPVG model on the stability of the host power system in a mixed mode generation under various integration scenarios, and evaluation of the consistency of SPVGs with fault‐ride through requirements based on relevant grid codes. Various modes of operations of SPVGs are analysed and considered using an enhanced search algorithm for maximum power point tracking. In addition, this study proposes an algorithm for the estimation of the maximum penetration level of SPVGs constrained by the small‐signal stability of power systems. The results presented in this study are based on dynamic simulation and validation using the MATLAB, PSAT, and ETAP‐software environments for stability assessment of power systems. The results show that the developed reduced‐order model indicates an acceptable accuracy accompanied with simplicity in simulating complex dynamic performances of host power systems with SPVGs integration.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".