Decentralised coordinated secondary voltage control of multi‐area power grids using model predictive control
Bibliographic record
Abstract
This manuscript presents a decentralised control scheme for coordinated SVC (CSVC) of large‐scale power networks. In this way, for each area of the power grid, a model predictive controller (MPC) which modifies the set points of reactive power compensators participating in CSVC algorithm is designed. The proposed controller takes into account reactive power limits of these compensation devices. The novelty of the method lies in the consideration of measured reactive power deviation on tie‐lines between neighbouring areas as measured disturbance and compensation of the disturbance by regional MPC controllers. As another contribution of this work, the validation of the proposed algorithm is done in real‐time simulation environment in which the decentralised MPC controllers are run in parallel on separate computational cores. The stability and robustness of the presented algorithm is validated for a large‐scale realistic transmission network with 5000 buses considering standard communication protocols to send and receive the data. Simulation results show that the proposed method can regulate the voltages on the pilot buses at the desired values in the presence of load variations and communication delays. Finally, the computational burden of the proposed method is evaluated in real time.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".