XZXiaolong Zuo

Xiaolong Zuo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xiaolong Zuo has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Sequence Aware Feasibility Constrained Hierarchical Reinforcement Learning Framework for Electric Vehicle Charging Navigation under Dynamic Uncertainty

    by Xiaolong Zuo, Jun Bi, Yongxing Wang, Zixian Zhang

    Range anxiety remains a critical barrier to electric vehicle (EV) adoption, calling for charging navigation methods that can provide real time guidance under dynamic network conditions. The task couples two decisions, charging station selection and route planning, each affected by time varying queueing delays, charging prices, travel times, and energy consumption. Existing methods either reduce these uncertainties to deterministic surrogates or merge the two decisions into a single value function, which leaves the station route coupling insufficiently represented. This paper develops a feasibility constrained hierarchical reinforcement learning framework for EV charging navigation. The framework combines a high level Double Deep Q Network (DDQN) for station selection with a low level Long Short Term Memory (LSTM) augmented Advantage Actor Critic (A2C) for sequential routing. The station selector handles stochastic queueing delays and charging prices, while the route planner treats routing as a trajectory dependent policy learning problem. To support feasible policy learning, action masks are applied at both decision levels. The high level mask removes unreachable charging stations. The low level mask removes routing actions that violate road connectivity, residual battery, or route acyclicity constraints. Experiments on a representative urban network show that the proposed framework reduces the total weighted navigation cost by 32.6%, 30.3%, 29.3%, and 7.9% compared with Dijkstra, a genetic algorithm, single layer A2C, and a value based hierarchical variant, respectively. It also achieves successful completion in all evaluated trips. These findings demonstrate the potential of sequence aware hierarchical reinforcement learning as a soft computing approach for constrained, dynamic, and coupled transportation energy decision problems.

  • Open Access

    Hierarchical Reinforcement Learning for Electric vehicle Charging Navigation in Dynamic Transportation Networks

    by Xiaolong Zuo, Jun Bi, Yongxing Wang, Zixian Zhang

    Range anxiety remains a significant barrier to sustainable electric vehicle (EV) adoption. Existing navigation methods often decouple station selection from route planning, struggling to adapt to real-world uncertainties. To address this, we propose a real-time, bi-level stochastic optimization framework capturing the spatiotemporal dynamics of coupled transportation and charging networks. We develop a novel Hierarchical Reinforcement Learning approach (HE-DDQN-A2C) to solve this system. The upper-level Double Deep Q-Network optimizes station selection to minimize queuing and charging costs, while the lower-level Advantage Actor-Critic algorithm executes sequential route planning to minimize energy consumption and travel time. Validated on an urban network, HE-DDQN-A2C significantly outperforms traditional routing (Dijkstra, Genetic Algorithms) and single-layer reinforcement learning baselines. By achieving a 100% success rate and substantially reducing total navigation costs, our framework offers a robust solution for alleviating range anxiety and enhancing sustainable EV mobility.

  • Open Access

    Hierarchical Reinforcement Learning for Electric vehicle Charging Navigation in Dynamic Transportation Networks

    by Xiaolong Zuo, Jun Bi, Yongxing Wang, Zixian Zhang

    Range anxiety remains a significant barrier to sustainable electric vehicle (EV) adoption. Existing navigation methods often decouple station selection from route planning, struggling to adapt to real-world uncertainties. To address this, we propose a real-time, bi-level stochastic optimization framework capturing the spatiotemporal dynamics of coupled transportation and charging networks. We develop a novel Hierarchical Reinforcement Learning approach (HE-DDQN-A2C) to solve this system. The upper-level Double Deep Q-Network optimizes station selection to minimize queuing and charging costs, while the lower-level Advantage Actor-Critic algorithm executes sequential route planning to minimize energy consumption and travel time. Validated on an urban network, HE-DDQN-A2C significantly outperforms traditional routing (Dijkstra, Genetic Algorithms) and single-layer reinforcement learning baselines. By achieving a 100% success rate and substantially reducing total navigation costs, our framework offers a robust solution for alleviating range anxiety and enhancing sustainable EV mobility.

  • Open Access

    Optimal Route Choice and Charging Strategy for Connected and Autonomous Electric Vehicles Under Mixed Traffic Flow Considering Multiple Objectives

    by Xiaolong Zuo, Jun Bi, Yongxing Wang

    The effective management of connected and autonomous electric vehicle (CAEV) fleets is critical for realising their potential to create safer and more efficient urban transportation systems. As CAEVs increasingly share the road with conventional vehicles, a primary challenge is to optimise their operations within this mixed‐traffic reality. This study tackles the joint problem of route selection and charging scheduling for multiple CAEVs by developing a multi‐objective optimisation model. The framework is designed to minimise a holistic cost function comprising energy consumption, travel time, charging service fees and penalties for violating user‐specified time windows. Critically, the model incorporates real‐world complexities, including time‐of‐use electricity pricing, partial charging strategy and the stochastic queuing delays introduced by non‐connected vehicles at charging stations. We adapt the non‐dominated sorting genetic algorithm III (NSGA‐III) to efficiently solve this complex optimisation problem. The proposed model is demonstrated through a case study using an actual road network from Beijing, China. The results indicate that the proposed model can reduce charging service fees by up to 96% and travel time by 33% when compared to conventional scheduling methods. These findings can offer significant insights for policymakers and platform operators aiming to formulate effective CAEV travel and charging policies in heterogeneous traffic environments.


  • A Novel Controller Based on Fuzzy Sliding Mode Control for Train Speed Tracking

    by Zhuang Kang, Li-Min Jia, Xiao-Long Zuo, Peng-Ju Shen, Yong Qin, Yuan-Yuan Chai

    The train operation process is characterized by strong coupling and nonlinearity, often accompanied by significant and unobservable external disturbances, which makes train operation control a challenging task. To address these problems, a new design method of the fuzzy sliding mode controller is proposed for the train operation speed tracking control. Firstly, the global fast terminal sliding mode control is introduced to enable the system to reach a steady state in finite time. Then, an adaptive disturbance estimation term is created, which is compensated by the absolute value of the derivative of the Lyapunov function. And a double-layer hierarchical and exponential reaching law global fast terminal fuzzy sliding mode controller is proposed, where the exponential reaching law is introduced to regulate the dynamic quality of the sliding mode surface, this controller can quickly converge to the stable state and effectively eliminate the chattering of the controller. Finally, the proposed method is verified through simulation experiments, demonstrating its effectiveness in improving the train operation control performance.


  • Open Access

    A Charging Guidance Optimization Model for Electric Vehicle Travel by Considering Multi-Dimensional Preferences of Users

    by Xiaolong Zuo, Jun Bi, Yongxing Wang, Yujia Du

    The dual-carbon strategy advocates a green, environmentally friendly, and low-carbon lifestyle. In the field of transportation, electric vehicles (EVs) have been regarded as an effective solution to reduce carbon emissions and to conserve energy. Developing a reasonable charging guidance scheme for users is a feasible way to solve problems, such as the range anxiety of EV users, and has a great application value for the promotion of EVs in the future. In practical situations, how to develop charging induction schemes for users that better meet their needs according to the type of user and their multi-dimensional preferences is the focus of this paper. To this end, this study utilized charging behavioral data to investigate the multi-dimensional charging preference of users based on the collaborative filtering algorithm. Then, a multi-objective optimization model was established based on the preference degree of each charging station and the integrated travel cost. An NSGA-III framework was used to design the algorithm to solve the proposed model. The algorithm was tested using simulation experiments that were designed based on the road network and charging stations in Beijing. The final result is an experimental analysis of the weight matrices for the three different preferences of minimum energy consumption cost, minimum time cost, and minimum fee cost, which yields a difference of about 4.4% between the optimal energy consumption cost and the maximum energy cost, about 2.9% between the optimal time cost and the maximum time cost, and about 10% between the optimal fee cost and the maximum fee cost under these three different preferences, respectively. The proposed multi-objective optimization model is able to provide users with reliable charging station selection by incorporating their personalized charging preference characteristics and charge guidance schemes.