Multi-Agent DDPG-Based Multi-Device Charging Scheduling for IIoT Smart Grids
Bibliographic record
Abstract
As electric vehicles (EVs) gain widespread adoption in industrial environments supported by Industrial Internet of Things (IIoT) smart grids technology, coordinated charging of multiple EVs has become vital for maintaining grid stability. In response to the scalability challenges faced by traditional algorithms in multi-device environments and the limitations of discrete action spaces in continuous control scenarios, this paper proposes a dynamic charging scheduling algorithm for EVs based on Multi-Agent Deep Deterministic Policy Gradient (MADDPG). The algorithm combines real-time electricity prices, battery status monitoring, and distributed sensor data to dynamically optimize charging and discharging strategies of multiple EVs in continuous action spaces. The goal is to reduce charging costs and balance grid load through coordinated multi-agent learning. Experimental results show that, compared with baseline methods, the proposed MADDPG algorithm achieves a 41.12% cost reduction over a 30-day evaluation period. Additionally, it effectively adapts to price fluctuations and user demand changes through Vehicle-to-Grid technology, optimizing charging time allocation and enhancing grid stability.
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.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.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".