Research on clustering and co-regulation of virtual power plant resources based on machine learning
Bibliographic record
Abstract
In order to realize the strategic goal of environmental protection and low carbon, designing a set of resource clustering and regulation strategies that take into account energy saving and operating costs has become a research challenge for virtual power plants. In this study, the ICEEMDAN-CNN-SSDAE hybrid model is used to realize high-precision prediction of electricity price and load data in virtual power plants. The objective function and constraints of resource clustering and cooperative regulation of virtual power plants are established under the condition of demand response, and solved by Markov process. Finally, the virtual power plant resource clustering and co-regulation model is constructed on the basis of the deep reinforcement learning model framework by combining the prediction model and objective function. The results show that the ICEEMDAN-CNN-SSDAE model proposed in this paper can guarantee high prediction speed (0.062s and 0.059s) while having high prediction accuracy. It is also found that the average capacity of the output power of each component in the virtual power plant system after the model clusters and optimizes the regulation of a virtual power plant resources increases by 0.535-0.686 MW/h compared with the pre-optimization period, and the economic efficiency and energy utilization are also improved to different degrees. The research in this paper verifies the rationality and effectiveness of the proposed model, and provides certain theoretical basis and guidance method for virtual power plant resource clustering and cooperative scheduling.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".