Physics-Guided Multi-Agent Adversarial Reinforcement Learning for Robust Active Voltage Control With Peer-to-Peer (P2P) Energy Trading
Bibliographic record
Abstract
The utilization of peer-to-peer (P2P) energy trading in the active distribution network can facilitate profit sharing among numerous prosumers while effectively accommodating the integration of distributed renewable energy. However, the market-oriented P2P energy trading involved self-interested prosumers could unavoidably result in voltage violations of buses. To tackle this challenge, this paper proposes a physics-guided multi-agent deep reinforcement learning (MADRL) integrated with adversarial learning for both day-ahead trading and intra-day voltage regulation. In the day-ahead energy trading, an energy cost minimization framework is built and constrained with distributed generators and battery energy storage systems (BESSs) for the repeated rounds of multilateral negotiations among prosumers to reach an optimal trading solution without considering physical network limitations. Then, in the intra-day voltage regulation, the physics-guided multi-agent adversarial twin delayed deep deterministic (PG-MA2TD3) policy gradient algorithm is designed to overcome the voltage fluctuation problem and minimize the line loss via adjusting the active power from BESSs and reactive power from photovoltaic (PV) inverters. Moreover, the Jacobian matrix is exploited to measure the impact of neighbor bus active power variations on local voltage due to neighborhood trading in P2P transaction and a multi-agent adversarial learning (MAAL) approach is implemented to obtain an adaptive descend gradient corresponding to the action of the adjacent agents in Q function for increasing the robustness of trained policy. It is verified that the proposed method provides better robustness and the largest steady-state reward with comparison to various state-of-the-art methods on the IEEE 33- bus system with three-year data in Portuguese power system.
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".