Machine Learning-Based State Monitoring and Regulation Characterization of Distribution Grid with High Percentage Distributed Resource Access
Bibliographic record
Abstract
The large number of accesses of distributed power supplies changes the distribution network from a passive network to an active network with small and medium-sized power supplies all over the network, which brings important impacts on all aspects of the distribution network, such as planning, operation, and power quality.The study analyzes the types of distributed power nodes and the traditional trend model of distribution network, studies the changes of voltage and network loss after the integration of distributed power sources into the distribution network, and analyzes the impact of different numbers, capacities and access locations of distributed power sources on the reactive power optimization of the distribution network by means of IEEE33 nodes.Analyze the impact of distributed power supply on distribution network.Firstly, the characteristics of distributed power supply are analyzed, distributed photovoltaic and distributed wind power operation models are established, and the influencing factors of the two power supply outputs are analyzed to generalize the distributed power supply output model.The basic principle of weighted least squares state estimation and its algorithmic process are introduced, and on its basis, an equation-containing constrained state estimation model for dealing with zero-injection nodes in the distribution network is introduced, and finally, the feasibility and validity of the proposed constrained state estimation model's state estimation method for the distribution network are verified through the analysis of an example of the IEEE 33-node system.Combining the sequence quadratic programming method and the idea of trust domain, the trust domain sequence quadratic programming method is proposed, and the use of the effective set method to quickly solve the subquadratic programming problem after downsizing is the key that the algorithm in this paper can solve the optimization problem relatively quickly.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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".