Xiaoyu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaoyu Li has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ming Yang
School of Electrical Engineering, Shandong University, Jinan, China
2 shared publications - Xueshan Han
Key Laboratory of Power System Intelligent Dispatch and Control of Ministry of Education, Shandong University, Jinan, China
2 shared publications Chunmei Lu
School of Energy and Power Engineering, Shandong University, Jinan 250061, China
1 shared publication- Guangqian Luo
State Key Laboratory of Coal Combustion, School of Energy and Power Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
1 shared publication - Hong Yao
Northwest Normal University
1 shared publication - Juan Chen
Faculty of Geosciences and Environmental Engineering, Southwest Jiaotong University, Chengdu 610031, P. R. China
1 shared publication
Latest Publications
- Open Access
- 19 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 15211-15228
Risk-Based Reserve Scheduling for Active Distribution Networks Based on an Improved Proximal Policy Optimization Algorithm
Achieving the coordinated optimization of tie-line reserve and energy storage on two timescales is a key issue in reserve scheduling for active distribution networks. To effectively manage the uncertainty related to renewable energy, we propose risk-based reserve scheduling for active distribution networks based on an improved proximal policy optimization algorithm. The reserve scheduling for active distribution networks is constructed as a two-scale multistage stochastic programming model, in which intraday real-time operation is constructed as a multi-stage stochastic programming model. With the help of more accurate and realistic intraday operation scenario simulation, the energy storage can be fully utilized to improve the system’s ability to climb and peak, reduce the reserve pressure of the main network, and achieve the purpose of improving the flexibility of system operation. An improved proximal policy optimization algorithm is proposed to solve optimization problems in a model-free manner while effectively handling conditional value-at-risk constraints. The effectiveness of the proposed risk-based reserve scheduling for active distribution networks based on an improved proximal policy optimization algorithm is verified by a modified IEEE33 case.
- 19 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 15211-15228
Open AccessRisk-Based Reserve Scheduling for Active Distribution Networks Based on an Improved Proximal Policy Optimization Algorithm
Achieving the coordinated optimization of tie-line reserve and energy storage on two timescales is a key issue in reserve scheduling for active distribution networks. To effectively manage the uncertainty related to renewable energy, we propose risk-based reserve scheduling for active distribution networks based on an improved proximal policy optimization algorithm. The reserve scheduling for active distribution networks is constructed as a two-scale multistage stochastic programming model, in which intraday real-time operation is constructed as a multi-stage stochastic programming model. With the help of more accurate and realistic intraday operation scenario simulation, the energy storage can be fully utilized to improve the system’s ability to climb and peak, reduce the reserve pressure of the main network, and achieve the purpose of improving the flexibility of system operation. An improved proximal policy optimization algorithm is proposed to solve optimization problems in a model-free manner while effectively handling conditional value-at-risk constraints. The effectiveness of the proposed risk-based reserve scheduling for active distribution networks based on an improved proximal policy optimization algorithm is verified by a modified IEEE33 case.
- Open Access
- 9 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10 (01628828) , 9357-9370
Day-Ahead Optimal Dispatch Strategy for Active Distribution Network Based on Improved Deep Reinforcement Learning
Object detection is a fundamental computer vision task that simultaneously predicts the category and localization of the targets of interest. Recently one-stage (also termed “dense”) detectors have gained much attention over two-stage ones due to their simple pipeline and friendly application to end devices. Dense object detectors basically formulate object detection as dense classification and localization (i.e., bounding box regression). The classification is usually optimized by Focal Loss and the box location is commonly learned under Dirac delta distribution. A recent trend for dense detectors is to introduce an individual prediction branch to estimate the quality of localization, which facilitates the classification to improve detection performance. This paper delves into the representations of the above three fundamental elements: quality estimation, classification and localization. Three problems are discovered in existing practices, including (1) the inconsistent usage of the quality estimation and classification between training and inference, (2) the inflexible Dirac delta distribution for localization, and (3) the deficient and implicit guidance for accurate quality estimation. To address these problems, we design new representations for these elements. Specifically, we merge the quality estimation into the class prediction vector to form a joint representation, use a vector to represent arbitrary distribution of box locations, and extract discriminant feature descriptors from the distribution vector for more reliable quality estimation. The improved representations eliminate the inconsistency risk and accurately depict the flexible distribution in real data, but contain continuous labels, which is beyond the scope of Focal Loss. We then propose Generalized Focal Loss (GFocal) that generalizes Focal Loss from its discrete form to the continuous version for successful optimization. Extensive experiments demonstrate the effectiveness of our method, without sacrificing the efficiency both in training and inference. Based on GFocal, we construct a considerably fast and lightweight detector termed NanoDet under mobile settings, which is 1.8 AP higher, 2x faster and 6x smaller than scaled YoloV4-Tiny.
- 9 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10 (01628828) , 9357-9370
Open AccessDay-Ahead Optimal Dispatch Strategy for Active Distribution Network Based on Improved Deep Reinforcement Learning
Object detection is a fundamental computer vision task that simultaneously predicts the category and localization of the targets of interest. Recently one-stage (also termed “dense”) detectors have gained much attention over two-stage ones due to their simple pipeline and friendly application to end devices. Dense object detectors basically formulate object detection as dense classification and localization (i.e., bounding box regression). The classification is usually optimized by Focal Loss and the box location is commonly learned under Dirac delta distribution. A recent trend for dense detectors is to introduce an individual prediction branch to estimate the quality of localization, which facilitates the classification to improve detection performance. This paper delves into the representations of the above three fundamental elements: quality estimation, classification and localization. Three problems are discovered in existing practices, including (1) the inconsistent usage of the quality estimation and classification between training and inference, (2) the inflexible Dirac delta distribution for localization, and (3) the deficient and implicit guidance for accurate quality estimation. To address these problems, we design new representations for these elements. Specifically, we merge the quality estimation into the class prediction vector to form a joint representation, use a vector to represent arbitrary distribution of box locations, and extract discriminant feature descriptors from the distribution vector for more reliable quality estimation. The improved representations eliminate the inconsistency risk and accurately depict the flexible distribution in real data, but contain continuous labels, which is beyond the scope of Focal Loss. We then propose Generalized Focal Loss (GFocal) that generalizes Focal Loss from its discrete form to the continuous version for successful optimization. Extensive experiments demonstrate the effectiveness of our method, without sacrificing the efficiency both in training and inference. Based on GFocal, we construct a considerably fast and lightweight detector termed NanoDet under mobile settings, which is 1.8 AP higher, 2x faster and 6x smaller than scaled YoloV4-Tiny.
- 1 June 2021
- Published by Elsevier in Journal of Hazardous Materials
- Vol. 412, 125218
Fate of chromium with the presence of HCl and steam during oxy-coal combustion: Quantum chemistry and experimental study
- 1 June 2021
- Published by Elsevier in Journal of Hazardous Materials
- Vol. 412, 125218
Fate of chromium with the presence of HCl and steam during oxy-coal combustion: Quantum chemistry and experimental study