Effective Charging Planning Based on Deep Reinforcement Learning for Electric Vehicles
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Electric vehicles (EVs) are viewed as an attractive option to reduce carbon emission and fuel consumption, but the popularization of EVs has been hindered by the cruising range limitation and the inconvenient charging process. In public charging stations, EVs usually spend a lot of time on queuing especially during peak hours of charging. Therefore, building an effective charging planning system has become a crucial task to reduce the total charging time for EVs. In this paper, we first introduce EVs charging scheduling problem and prove the NP-hardness of the problem. Then, we formalize the scheduling problem of EV charging as a Markov Decision Process and propose deep reinforcement learning algorithms to address it. The objective of the proposed algorithms is to minimize the total charging time of EVs and maximal reduction in the origin-destination distance. Finally, we experiment on real-world data and compare with two baseline algorithms to demonstrate the effectiveness of our approach. It shows that the proposed algorithms can significantly reduce the charging time of EVs compared to EST and NNCR algorithms.
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
Large-Scale Machine Learning with Stochastic Gradient Descent
Bottou, L. (2010) · Proceedings of COMPSTAT'2010 · doi:10.1007/978-3-7908-2604-3_16 · Cited by 5,795 · cited 1×
“Differentiating the loss function with respect to the neural network’s parameters at iteration i , θ i gives the following gradient : Our EVs scheduling model uses stochastic gradient descent [38] method to optimize the loss function.”
MethodBetween MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
Sutton, R. S., Precup, D., & Singh, S. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00052-1 · Cited by 3,119
Model-Free Real-Time EV Charging Scheduling Based on Deep Reinforcement Learning
Wan, Z., Li, H., He, H., & Prokhorov, D. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2018.2879572 · Cited by 548 · cited 1×
“Because the existence of randomness in traffic conditions, users’ commuting behaviors, and the pricing process of the utility, the literatures [19] proposes a model-free approach to determine an optimal charging strategy for EVs charging.”
BackgroundAssessment of electric vehicle charging scenarios based on demographical data
Steen, D., Tuan, L. A., Carlson, O., & Bertling, L. (2012) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2195687 · Cited by 145 · cited 1×
“The literature [5] proposes that if public charging stations are not well deployed, the total time spent on charging would be dramatic.”
Background
Cited by
Reinforcement learning for electric vehicle applications in power systems:A critical review
Qiu, D., Wang, Y., Hua, W., & Strbac, G. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.113052 · Cited by 176
Metadata
- Authors
- Zhang, C., Liu, Y., Wu, F., Tang, B., & Fan, W.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2021-01
- Volume
- 22
- Issue
- 1
- Pages
- 542-554
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W3037451795
- Cited by
- 167
- References
- 4
- FWCI
- 5.91
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Effective Charging Planning Based on Deep Reinforcement Learning for Electric Vehicles. https://app.cochat.ai/papers/10.1109/tits.2020.3002271
- The paper
- Zhang, C., Liu, Y., Wu, F., Tang, B., & Fan, W. (2021). Effective Charging Planning Based on Deep Reinforcement Learning for Electric Vehicles. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2020.3002271
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.