Charging Scheduling with Computation Energy Consumption and Carbon Tax in Vehicle Networks

For electric vehicles (EVs) that are running out of power during the journey, how to select the charging station (CS) and charge at the minimum cost is an important problem. Taking the computation energy consumption and the carbon tax into consideration, in this paper, the CS and charging power selection problem is formulated into an optimization problem, where the charging expenditure and waiting time are minimized. Since the proposed problem changes dynamically with EV user behaviors, the proposed problem cannot be solved by traditional optimization methods. Then the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm is used to find the near-optimal solution. Simulation results show that our proposed strategy helps reduce not only the charging costs but also the CO<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> emissions. In addition, our strategy balances the load of each CS and reduces the peak-to-valley difference in electricity consumption.

Authors

Institutions

Publication Details

Published
2024-10-07
DOI
https://doi.org/10.1109/vtc2024-fall63153.2024.10757629
Citations
1
Primary Topic
Electric Vehicles and Infrastructure
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Charging Scheduling with Computation Energy Consumption and Carbon Tax in Vehicle Networks

Biling Zhang, Jung-Lang Yu, Lü Peng
1 citations
Electric Vehicles and Infrastructure
0.21
article

Charging Scheduling with Computation Energy Consumption and Carbon Tax in Vehicle Networks

Biling Zhang, Jung-Lang Yu, Lü Peng
article en
1 citations

Abstract

For electric vehicles (EVs) that are running out of power during the journey, how to select the charging station (CS) and charge at the minimum cost is an important problem. Taking the computation energy consumption and the carbon tax into consideration, in this paper, the CS and charging power selection problem is formulated into an optimization problem, where the charging expenditure and waiting time are minimized. Since the proposed problem changes dynamically with EV user behaviors, the proposed problem cannot be solved by traditional optimization methods. Then the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm is used to find the near-optimal solution. Simulation results show that our proposed strategy helps reduce not only the charging costs but also the CO<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> emissions. In addition, our strategy balances the load of each CS and reduces the peak-to-valley difference in electricity consumption.

Fu Jen Catholic University (TW), Beijing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China
Affordable and clean energy
Openalex Percentile: Top 44%
Electric Vehicles and Infrastructure
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Charging Scheduling with Computation Energy Consumption and Carbon Tax in Vehicle Networks — Biling Zhang, Jung-Lang Yu, et al. · (2024) | TGRS Research Map | TGRS