Qinglai Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Qinglai Guo has a total of 417 co-authors. Here are the top co-authors by number of shared publications:
- Hongbin Sun
Tsinghua University
78 shared publications Hongbin Sun
22 shared publications- Bin Wang
Department of Electrical Engineering, Tsinghua University, Beijing, China
17 shared publications - Haotian Zhao
Tsinghua University
11 shared publications Boming Zhang
Department of Electrical Engineering, State Key Laboratory of Power Systems Tsinghua University Beijing People's Republic of China
10 shared publications- Yanzhen Zhou
Tsinghua University
10 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (22) , 52144-52157
Coordinated Defense Framework for Mitigating Transmission Line Overloads Induced by VPP-Based Manipulation of Demand Attacks
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (22) , 52144-52157
Coordinated Defense Framework for Mitigating Transmission Line Overloads Induced by VPP-Based Manipulation of Demand Attacks
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4806-4817
Enhancing Power Grid Model Generation With Large Language Models via Progressive Fine-Tuning
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4806-4817
Enhancing Power Grid Model Generation With Large Language Models via Progressive Fine-Tuning
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 6597-6608
Vulnerability of Time-Series AI Detectors to Physics-Informed Poisoning Attacks
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 6597-6608
Vulnerability of Time-Series AI Detectors to Physics-Informed Poisoning Attacks
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (5) , 3847-3859
Why Shorter Time Steps Induce the Failure Probability Curse in Power Outage Risk Analysis: An Explanation and Solution
Recent climate change has led to more frequent and widespread extreme weather events, causing damage to power system components and resulting in significant outages and losses. Component fragility curves and sequential Monte Carlo simulations have been widely used for power system outage risk assessment. Fragility curves serve as the bridge linking weather events to component failures, while sequential Monte Carlo methods capture the temporal dynamics of weather and balance probabilities with consequences. However, a direct and improper combination of these two tools can introduce significant bias, especially under high time resolution. This phenomenon is referred to as the “failure probability curse.” This paper analyzes the fundamental cause of this issue and proposes a conditional-probability correction method for the sequential Monte Carlo simulation. The method can eliminate the inherent bias from high-time-resolution sampling in power outage risk analysis and reconcile sequential Monte Carlo with different physical failure mechanisms. Furthermore, the conditional-probability perspective provided in this paper offers support and explanation for related existing methods at the level of mathematical principles, enhancing the insights of the “failure probability curse” from both an explanation and solution perspective. Numerical experiments based on an illustrative system and the Tennessee power network confirm the validity of the proposed approach.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (5) , 3847-3859
Why Shorter Time Steps Induce the Failure Probability Curse in Power Outage Risk Analysis: An Explanation and Solution
Recent climate change has led to more frequent and widespread extreme weather events, causing damage to power system components and resulting in significant outages and losses. Component fragility curves and sequential Monte Carlo simulations have been widely used for power system outage risk assessment. Fragility curves serve as the bridge linking weather events to component failures, while sequential Monte Carlo methods capture the temporal dynamics of weather and balance probabilities with consequences. However, a direct and improper combination of these two tools can introduce significant bias, especially under high time resolution. This phenomenon is referred to as the “failure probability curse.” This paper analyzes the fundamental cause of this issue and proposes a conditional-probability correction method for the sequential Monte Carlo simulation. The method can eliminate the inherent bias from high-time-resolution sampling in power outage risk analysis and reconcile sequential Monte Carlo with different physical failure mechanisms. Furthermore, the conditional-probability perspective provided in this paper offers support and explanation for related existing methods at the level of mathematical principles, enhancing the insights of the “failure probability curse” from both an explanation and solution perspective. Numerical experiments based on an illustrative system and the Tennessee power network confirm the validity of the proposed approach.
- Open Access
- 7 July 2026
- Published by Institution of Engineering and Technology (IET) in Energy Internet
- Vol. 3 (2) , 81-85
Why Computing–Electricity Coordination Has Not Scaled in Practice
The rapid growth of LLM‐driven artificial intelligence (AI) and data center deployment is imposing a new paradigm of massive and highly dynamic power demand on the grid. Volatility in both computing and renewable energy resources introduces severe challenges to power system operation. Although typical computing workloads are technically flexible, their responsive capacity remains largely untapped in real‐world scenarios. This paper argues that the main barriers to scalable computing–electricity coordination are not solely technical, but arise from weak electricity cost pass‐through, limited cost visibility, and misaligned compute‐side incentives. In leasing and cloud‐service modes, electricity costs of data centres are often bundled into broader service charges, reducing their influence on workload scheduling. Meanwhile, compute‐side actors prioritise GPU utilisation, return on investment, latency, throughput, and service quality over flexible load profiles supporting power‐system operation. Therefore, green operational constraints and new pricing mechanisms that expose carbon or electricity signals to compute‐side decision‐makers are critical to making computing–electricity coordination scalable in practice. Flexible computing loads can support power systems only when technical flexibility is matched with actionable economic, contractual, and operational incentives.
- 7 July 2026
- Published by Institution of Engineering and Technology (IET) in Energy Internet
- Vol. 3 (2) , 81-85
Open AccessWhy Computing–Electricity Coordination Has Not Scaled in Practice
The rapid growth of LLM‐driven artificial intelligence (AI) and data center deployment is imposing a new paradigm of massive and highly dynamic power demand on the grid. Volatility in both computing and renewable energy resources introduces severe challenges to power system operation. Although typical computing workloads are technically flexible, their responsive capacity remains largely untapped in real‐world scenarios. This paper argues that the main barriers to scalable computing–electricity coordination are not solely technical, but arise from weak electricity cost pass‐through, limited cost visibility, and misaligned compute‐side incentives. In leasing and cloud‐service modes, electricity costs of data centres are often bundled into broader service charges, reducing their influence on workload scheduling. Meanwhile, compute‐side actors prioritise GPU utilisation, return on investment, latency, throughput, and service quality over flexible load profiles supporting power‐system operation. Therefore, green operational constraints and new pricing mechanisms that expose carbon or electricity signals to compute‐side decision‐makers are critical to making computing–electricity coordination scalable in practice. Flexible computing loads can support power systems only when technical flexibility is matched with actionable economic, contractual, and operational incentives.
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 17 (3) , 2267-2278
Learning-Accelerated Solution for the Bilinear Optimal Dispatch of Integrated Electricity and Heating Systems
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 17 (3) , 2267-2278
Learning-Accelerated Solution for the Bilinear Optimal Dispatch of Integrated Electricity and Heating Systems
- 3 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 442-454
Detecting Cyber Attacks in Power System AGC Using a Drifted Ornstein-Uhlenbeck Process
The Automatic Generation Control (AGC) system, reliant on real-time measurements over communication networks, is susceptible to stealthy false data injection attacks (FDIAs), risking equipment damage and economic losses. We propose a robust FDIA detection method using maximum likelihood estimation (MLE) of a drifted multivariate Ornstein-Uhlenbeck (OU) process. Independent of load observability, in various cyber-attack scenarios, the proposed FDIA detection method delivers accurate and rapid detection of sophisticated FDIAs, outperform-ing traditional Unknown Input Observer (UIO) methods, which miss detections, and Long Short-Term Memory Autoencoder (LSTM-AE) approaches, which suffer from prolonged detection times.
- 3 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 442-454
Detecting Cyber Attacks in Power System AGC Using a Drifted Ornstein-Uhlenbeck Process
The Automatic Generation Control (AGC) system, reliant on real-time measurements over communication networks, is susceptible to stealthy false data injection attacks (FDIAs), risking equipment damage and economic losses. We propose a robust FDIA detection method using maximum likelihood estimation (MLE) of a drifted multivariate Ornstein-Uhlenbeck (OU) process. Independent of load observability, in various cyber-attack scenarios, the proposed FDIA detection method delivers accurate and rapid detection of sophisticated FDIAs, outperform-ing traditional Unknown Input Observer (UIO) methods, which miss detections, and Long Short-Term Memory Autoencoder (LSTM-AE) approaches, which suffer from prolonged detection times.
- Open Access
- 1 May 2026
- Published by KEAI Publishing in Cyber-Physical Energy Systems
- Vol. 2 (2) , 50-60
Privacy-preserving combined heat and power dispatch: A heterogeneous decomposition method using Paillier cryptosystem
- 1 May 2026
- Published by KEAI Publishing in Cyber-Physical Energy Systems
- Vol. 2 (2) , 50-60
Open AccessPrivacy-preserving combined heat and power dispatch: A heterogeneous decomposition method using Paillier cryptosystem
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (6) , 4968-4979
Hamiltonian Optimal Control-Based Adversarial Training in Deep Reinforcement Learning for Robust Load Frequency Control
Although deep reinforcement learning has demonstrated significant potential in load frequency control, existing methods often exhibit insufficient robustness when facing extreme or worst-case disturbances that lie outside the standard training data. To address this issue, this article proposes an adversarial training framework based on Hamiltonian optimal control. Unlike traditional data augmentation strategies that rely on random noise, this method mathematically derives adversarial load profiles—including sustained frequency drops and oscillatory disturbances designed to induce system resonance—by designing specific Lagrangians for the objective functionals and solving the resulting Hamiltonian canonical equations. We integrate these targeted adversarial samples into the training loops of deep deterministic policy gradient (DDPG), twin delayed DDPG, and proximal policy optimization algorithms to enhance the agents’ adaptability to extreme operating conditions. Simulation results on two-area and extended three-area power system models demonstrate that the proposed method accurately identifies the system’s critical resonant frequencies. Compared to baseline controllers trained solely on random noise, the agents trained with Hamiltonian adversarial loads exhibit significantly superior frequency stability and damping characteristics when subjected to structured, time-varying extreme disturbances, effectively preventing catastrophic system instability.
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (6) , 4968-4979
Hamiltonian Optimal Control-Based Adversarial Training in Deep Reinforcement Learning for Robust Load Frequency Control
Although deep reinforcement learning has demonstrated significant potential in load frequency control, existing methods often exhibit insufficient robustness when facing extreme or worst-case disturbances that lie outside the standard training data. To address this issue, this article proposes an adversarial training framework based on Hamiltonian optimal control. Unlike traditional data augmentation strategies that rely on random noise, this method mathematically derives adversarial load profiles—including sustained frequency drops and oscillatory disturbances designed to induce system resonance—by designing specific Lagrangians for the objective functionals and solving the resulting Hamiltonian canonical equations. We integrate these targeted adversarial samples into the training loops of deep deterministic policy gradient (DDPG), twin delayed DDPG, and proximal policy optimization algorithms to enhance the agents’ adaptability to extreme operating conditions. Simulation results on two-area and extended three-area power system models demonstrate that the proposed method accurately identifies the system’s critical resonant frequencies. Compared to baseline controllers trained solely on random noise, the agents trained with Hamiltonian adversarial loads exhibit significantly superior frequency stability and damping characteristics when subjected to structured, time-varying extreme disturbances, effectively preventing catastrophic system instability.