Lei Yang
Lei Yang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Xiaohong Guan
Xi'an Jiaotong University, Xi'an, China
2 shared publications Baochang Liu
China Mobile Group, China Mobile Design Institute, Beijing, China
1 shared publication- Jiang Wu
MOE KLINNS Lab, Xian Jiaotong University, Xian, China
1 shared publication - Jinhui Liu
Faculty of Electronic and Information Engineering, Xian Jiaotong University, Xian, China
1 shared publication - Lang Tong
School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, USA
1 shared publication - Wangyi Guo
MOE KLINNS Lab, Xian Jiaotong University, Xian, China
1 shared publication
Latest Publications
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 7379-7395
Computational Resource Management of Edge Clouds for Vehicle-to-Network Services With Resource Limit
This paper studies the online management of the computational resources between multiple edge clouds to minimize the operational cost for a vehicle-to-network (V2N) service provider, subject to stochastic trajectories of vehicles, the quality-of-service (QoS) and the resource limit. Due to the random mobility of vehicles, it poses challenges in real-time migration management when the computational capacity of each edge cloud and the stringent delay requirement of V2N services are both constrained, resulting in strong temporal-spatial coupling of the migration decisions. The problem could even be intractable to solve as the number of vehicles grows. To tackle these issues, we first propose a multi-layered cloud framework to gather and coordinate migration information between vehicles. Then, a multiagent rollout with feasibility construction approach is developed, where the migration decision can be optimized sequentially for each vehicle based on the coordinated migration information from the central cloud. To handle the potentially infeasible solutions caused by the computational resource constraint, we propose a heuristic method to determine the migration priority at each overloading edge cloud, and an integer program is constructed that can be easily solved to produce feasible solutions. The numerical results show the efficiency of the proposed approach in both economical performance and computational complexity compared to the benchmarks.
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 7379-7395
Computational Resource Management of Edge Clouds for Vehicle-to-Network Services With Resource Limit
This paper studies the online management of the computational resources between multiple edge clouds to minimize the operational cost for a vehicle-to-network (V2N) service provider, subject to stochastic trajectories of vehicles, the quality-of-service (QoS) and the resource limit. Due to the random mobility of vehicles, it poses challenges in real-time migration management when the computational capacity of each edge cloud and the stringent delay requirement of V2N services are both constrained, resulting in strong temporal-spatial coupling of the migration decisions. The problem could even be intractable to solve as the number of vehicles grows. To tackle these issues, we first propose a multi-layered cloud framework to gather and coordinate migration information between vehicles. Then, a multiagent rollout with feasibility construction approach is developed, where the migration decision can be optimized sequentially for each vehicle based on the coordinated migration information from the central cloud. To handle the potentially infeasible solutions caused by the computational resource constraint, we propose a heuristic method to determine the migration priority at each overloading edge cloud, and an integer program is constructed that can be easily solved to produce feasible solutions. The numerical results show the efficiency of the proposed approach in both economical performance and computational complexity compared to the benchmarks.
- 31 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (2) , 2125-2138
EV Charging Scheduling Under Demand Charge: A Block Model Predictive Control Approach
This paper studies the online scheduling of electric vehicle charging by a service provider subject to a demand charge in a distribution system. Demand charge imposes a penalty on the peak power consumption over each billing period, representing a substantial cost for the service provider with a large number of clients. Because the demand charge is calculated at the end of the billing period, it poses challenges in real-time scheduling when energy demand forecasts are inaccurate, resulting in either overly conservative power consumption or substantial demand charge. We propose a block model predictive control approach that decomposes the demand charge into a sequence of stage costs. Optimality conditions on demand patterns are also presented and analyzed. Numerical simulations demonstrate the efficacy of the proposed approach. Note to Practitioners —This paper addresses a significant practical problem of minimizing the demand charge on the real-time scheduling of deferrable demands. In particular, we consider a setting where a commercial electric vehicle (EV) charging service provider has to manage the online scheduling of a large number of arriving EVs at a charging facility subject to a maximum charging power constraint and a tariff with the demand charge. A major practical challenge is to balance the tradeoff between maximizing profit in scheduling as much EV charging as possible and the need to minimize penalty on the peak charging power. We propose a model predictive control strategy that decomposes the overall demand charge into a sequence of terminal costs. Also addressed is the practical constraint arising from the mismatched EV charging decision period and the power measurement period used to compute the demand charge. Using real data collected at the Adaptive Charging Network (ACN) testbed in simulations, the proposed approach yields 8-12% improvement in operational profit over existing benchmarks, while it has yet been tested in actual charging systems. In the future research, we will address the charging scheduling under demand charge over multiple charging stations.
- 31 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (2) , 2125-2138
EV Charging Scheduling Under Demand Charge: A Block Model Predictive Control Approach
This paper studies the online scheduling of electric vehicle charging by a service provider subject to a demand charge in a distribution system. Demand charge imposes a penalty on the peak power consumption over each billing period, representing a substantial cost for the service provider with a large number of clients. Because the demand charge is calculated at the end of the billing period, it poses challenges in real-time scheduling when energy demand forecasts are inaccurate, resulting in either overly conservative power consumption or substantial demand charge. We propose a block model predictive control approach that decomposes the demand charge into a sequence of stage costs. Optimality conditions on demand patterns are also presented and analyzed. Numerical simulations demonstrate the efficacy of the proposed approach. Note to Practitioners —This paper addresses a significant practical problem of minimizing the demand charge on the real-time scheduling of deferrable demands. In particular, we consider a setting where a commercial electric vehicle (EV) charging service provider has to manage the online scheduling of a large number of arriving EVs at a charging facility subject to a maximum charging power constraint and a tariff with the demand charge. A major practical challenge is to balance the tradeoff between maximizing profit in scheduling as much EV charging as possible and the need to minimize penalty on the peak charging power. We propose a model predictive control strategy that decomposes the overall demand charge into a sequence of terminal costs. Also addressed is the practical constraint arising from the mismatched EV charging decision period and the power measurement period used to compute the demand charge. Using real data collected at the Adaptive Charging Network (ACN) testbed in simulations, the proposed approach yields 8-12% improvement in operational profit over existing benchmarks, while it has yet been tested in actual charging systems. In the future research, we will address the charging scheduling under demand charge over multiple charging stations.