Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning

Electric heavy-truck battery swapping stations (BSSs) face coupled challenges in practical operation, including uncertain swapping demand, time-of-use (TOU) electricity-price fluctuations, and difficult on-site battery dispatch. This paper proposes a robust optimal scheduling method based on the Distributionally Robust Soft Actor–Critic (DR-SAC) algorithm. First, a battery-cluster model based on state-of-charge (SOC) classification compresses the decision space into level-wise charging-count scheduling, reducing dimensionality. Second, the scheduling problem is formulated as a Robust Markov Decision Process (RMDP), optimizing the worst-case entropy-regularized cumulative reward within a Kullback–Leibler (KL) divergence-constrained ambiguity set. To cope with the unknown transition kernel in offline learning, a Variational Auto-Encoder (VAE) estimates the transition distribution from historical data, while a strong-duality transformation and functional approximation efficiently solve the robust Bellman operator. Results show that under joint upward perturbations of demand and price, the relative variation in the daily profit of DR-SAC is 3.7%, and the peak-shaving rate reaches 78.9% at a KL radius δ of 0.067 calibrated from historical forecasting errors. Across varying demand intensities, DR-SAC ranks first in daily profit with the smallest run-to-run variation among the compared algorithms on the studied station. DR-SAC provides a practical scheduling solution for electric heavy-truck BSSs under multiple uncertainties.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-11-16
DOI
https://doi.org/10.3390/app162211346
Primary Topic
Electric Vehicles and Infrastructure
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning

Liwei Zhu, Yucheng Du
5 links
Applied Sciences
Electric Vehicles and Infrastructure
article

Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning

Liwei Zhu, Yucheng Du
article en

Abstract

Electric heavy-truck battery swapping stations (BSSs) face coupled challenges in practical operation, including uncertain swapping demand, time-of-use (TOU) electricity-price fluctuations, and difficult on-site battery dispatch. This paper proposes a robust optimal scheduling method based on the Distributionally Robust Soft Actor–Critic (DR-SAC) algorithm. First, a battery-cluster model based on state-of-charge (SOC) classification compresses the decision space into level-wise charging-count scheduling, reducing dimensionality. Second, the scheduling problem is formulated as a Robust Markov Decision Process (RMDP), optimizing the worst-case entropy-regularized cumulative reward within a Kullback–Leibler (KL) divergence-constrained ambiguity set. To cope with the unknown transition kernel in offline learning, a Variational Auto-Encoder (VAE) estimates the transition distribution from historical data, while a strong-duality transformation and functional approximation efficiently solve the robust Bellman operator. Results show that under joint upward perturbations of demand and price, the relative variation in the daily profit of DR-SAC is 3.7%, and the peak-shaving rate reaches 78.9% at a KL radius δ of 0.067 calibrated from historical forecasting errors. Across varying demand intensities, DR-SAC ranks first in daily profit with the smallest run-to-run variation among the compared algorithms on the studied station. DR-SAC provides a practical scheduling solution for electric heavy-truck BSSs under multiple uncertainties.

Applied SciencesVol. 16(22)
Ministry of Transport (CN), Research Institute of Highway (CN)
Industry, innovation and infrastructure, Affordable and clean energy
Electric Vehicles and Infrastructure
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.

Laika access coming soon