The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Deep Reinforcement Learning Method for Demand Response Management of Interruptible Load
Abstract
As an important part of incentive demand response (DR), interruptible load (IL) can achieve a rapid response and improve demand side resilience. Yet, model-based optimization algorithms concerning with IL require the explicit physical or mathematical model of the system, which makes it difficult to adapt to realistic operation conditions. In this paper, a model-free deep reinforcement learning (DRL) method with dueling deep Q network (DDQN) structure is designed to optimize the DR management of IL under the time of use (TOU) tariff and variable electricity consumption patterns. The DDQN-based automatic demand response (ADR) architecture is firstly constructed, which provides a possibility for real-time application of DR. To obtain the maximum long-term profit, the DR management problem of IL is formulated as a Markov decision process (MDP), in which the state, action, and reward function are defined, respectively. The DDQN-based DRL algorithm is applied to solve this MDP for the DR strategy with maximum cumulative reward. The simulation results validate that the proposed algorithm with DDQN overcomes the noise and instability in traditional DQN, and realizes the goal of reducing both the peak load demand and the operation costs on the premise of regulating voltage to the safe limit.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Deep Reinforcement Learning with Double Q-Learning
Van Hasselt, H., Guez, A., & Silver, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10295 · Cited by 3,318
Demand side management in smart grid using heuristic optimization
Logenthiran, T., Srinivasan, D., & Shun, T. Z. (2012) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2195686 · Cited by 1,229
Cited by
Tushar, W., Yuen, C., Saha, T. K., Morstyn, T., Chapman, A. C., Alam, M. J. E., Hanif, S., & Poor, H. V. (2021) · Applied Energy · doi:10.1016/j.apenergy.2020.116131 · Cited by 523
Applications of artificial intelligence for disaster management
Sun, W., Bocchini, P., & Davison, B. D. (2020) · Natural Hazards · doi:10.1007/s11069-020-04124-3 · Cited by 491
Kumari, A., Gupta, R., Tanwar, S., & Kumar, N. (2020) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2020.05.004 · Cited by 172
Zhu, H., Goh, H. H., Zhang, D., Ahmad, T., Liu, H., Wang, S., Li, S., Liu, T., Dai, H., & Wu, T. (2022) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2021.129809 · Cited by 131
Self-citation
Metadata
- Authors
- Wang, B., Li, Y., Ming, W., & Wang, S.
- Venue
- IEEE Transactions on Smart Grid
- Published
- 2020-07
- Volume
- 11
- Issue
- 4
- Pages
- 3146-3155
- ISSN
- 1949-3053 (ISSN-L)
- 1949-3061
- OpenAlex
- W3003290394
- Cited by
- 214
- References
- 4
- FWCI
- 9.96
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.