Wenqi Huang

Wenqi Huang

Auto-generated profile, based on publicly available information

Wenqi Huang

Beijing Huairou Laboratory, Beijing, China and China Southern Power Grid Novel Electric Power System (BEIJING) Research Institute, Beijing, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 March 2024 in IEEE Transactions on Sustainable Energy
Verified
Journal Article
Closed access
QLQiong Liu
Qiong Liu
YGYe Guo
Ye Guo
LDLirong Deng
Lirong Deng
HLHaotian Liu
Haotian Liu
DLDongyu Li
Dongyu Li
WHWenqi Huang
Wenqi Huang
Inverter-based Volt-VAR control (IB-VVC) can be simplified as a single-period optimization problem. However, recently DRL methods formulate IB-VVC as a Markov decision process (MDP) and solve it as a multi-period optimization problem. It complicates the IB-VVC problem and degrades the performance of deep reinforcement learning (DRL) algorithms. To avoid this, this paper formulates the inverter-based VVC as a one-step MDP and designs a single-period DRL algorithm to solve the problem. It simplifies the DRL approach considerably and accelerates the convergence rate as well as the control performance. Since VVC has two aims: eliminating voltage violations and minimizing power loss, those two objectives have different profiles. Existing DRL methods use one critic neural network to approximate the two objectives together without considering their special property. It increases the approximate difficulty of the critic neural networks in the training process. To alleviate it, we design a two-critic approach. It approximates the two objective functions by two critic neural networks separately. It has a better approximation capability, thus accelerating the convergence rate and improving the control performance of the DRL method further. Based on the single-period two-critic DRL (TC) approach, we design two DRL algorithms: 1) TC-DDPG with deterministic policy and 2) TC-SAC with stochastic policy. Further, we extend the TC-DRL to multi-agent TC to show it scales well for multi-agent DRL algorithms. Simulations conducted on 33-bus and 69-bus test distribution networks demonstrate the superiority of the proposed approach in both single-agent DRL algorithms and multi-agent DRL algorithms. A two-critic deep reinforcement learning (TC-DRL) approach for inverter-based volt-var control (IB-VVC) in active distribution networks is proposed in this paper. Considering two objectives of VVC, minimizing power loss and eliminating voltage violations, have different mathematical properties, we utilize two critics to approximate two objectives separately, which reduces the learning difficulties of each critic. The TC-DRL approach cooperates well with many actor-critic DRL algorithms for the centralized IB-VVC problems, and two centralized DRL algorithms were designed as examples. For decentralized IB-VVC, we extend the approach to a multi-agent TC-DRL approach and further simplify the multi-agent DRL approach with all agents sharing the same centralized two-critic. Extensive simulation experiments show that the proposed two centralized TC-DRL algorithms require fewer iteration times and return better results than the recent DRL algorithms, and the multi-agent TC-DRL algorithms work well for decentralized IB-VVC problems with different limited real-time measurement conditions.

25 February 2025 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
YZYuhong Zhu
Yuhong Zhu
YZYongzhi Zhou
Yongzhi Zhou
WWWei Wei
Wei Wei
PLPeng Li
Peng Li
WHWenqi Huang
Wenqi Huang
Efficient and informative representation of system topologies is critical in AI-driven power system analysis (PSA). Despite a major breakthrough, recent approaches employing Graph Neural Networks (GNNs) face significant challenges in large-scale PSA, including high computational demands for sufficient labeled data and poor generalization to unseen disturbed topologies. To tackle these issues, we propose a self-supervised strategy for pre-training GNNs that enhances their expressiveness at both the individual node feature level and the whole graph structure. Integrating physics-informed techniques, our strategy allows GNNs to internalize fundamental principles applicable to multiple downstream tasks. We demonstrate that our method enables the efficient training of GNNs on extensive topology datasets without supervision, effectively addressing the noted challenges. By pre-training GNNs with 145 million parameters on 20 million unlabeled topologies and subsequently fine-tuning them, we observe a significant performance improvement, averaging over 13%, compared to existing state-of-the-art (SOTA) methods across four challenging tasks.

25 March 2022
Verified
Conference Paper
Closed access
PLPeng Li
Peng Li
WHWenqi Huang
Wenqi Huang
ZDZhen Dai
Zhen Dai
JHJiaxuan Hou
Jiaxuan Hou
SCShang Cao
Shang Cao
JCJunbin Chen
Junbin Chen
Due to the fast development of new-type power systems, the power grid is facing increasing uncertainties brought by high penetration of distributed generations. How to improve the decision quality of economic dispatch under such conditions becomes a very crucial task. Therefore, a novel graph reinforcement learning (GRL) approach for dynamic economic dispatch under high penetration of renewable energy is proposed. Compared with other reinforcement learning method, a novel graph-based representation of system state is adopted. Thus, the implicit correlations of uncertainties considering system topology can be more effectively captured. As a fully model-free method, the proposed methodology does not rely on the explicit models of physical system and uncertainty distributions. The asymptotic optimal policy can be obtained by continuous interaction with the environment. Case simulations illustrate that the proposed method achieves a better performance in terms of optimality and efficiency compared with existing learning methods.

1 January 2026 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
CSChao Shen
Chao Shen
ZGZihan Guo
Zihan Guo
KZKe Zuo
Ke Zuo
WHWenqi Huang
Wenqi Huang
MSMingyang Sun
Mingyang Sun

6 November 2026
Verified
Conference Paper
Open access
ZZZhen Zhao
Zhen Zhao
WHWenqi Huang
Wenqi Huang
ZWZicheng Wang
Zicheng Wang
JHJiaxuan Hou
Jiaxuan Hou
PLPeng Li
Peng Li
LBLei Bai
Lei Bai
Power flow estimation plays a vital role in ensuring the stability and reliability of electrical power systems, particularly in the context of growing network complexities and renewable energy integration. However, existing studies often fail to adequately address the unique characteristics of power systems, such as the sparsity of network connections and the critical importance of the unique Slack node, which poses significant challenges in achieving high-accuracy estimations. In this paper, we present SenseFlow, a novel physics-informed and self-ensembling iterative framework that integrates two main designs, the Physics-informed Power Flow Network (PPFNet) and Self-ensembling Iterative Estimation (SeIter), to carefully address the unique properties of the power system and thereby enhance the power flow estimation. In specific, SenseFlow enforces the PPFNet to gradually predict high-precision voltage magnitudes and phase angles through the iterative SeIter process. On the one hand, PPFNet employs the Virtual Node Attention and Slack-Gated Feed-Forward modules to facilitate efficient global-local communication in the face of network sparsity and amplify the influence of the Slack node on angle predictions, respectively. On the other hand, SeIter maintains an exponential moving average of PPFNet's parameters to create an ensemble model that refines power state predictions throughout the iterative fitting process. Experimental results demonstrate that SenseFlow outperforms existing methods, providing a promising solution for high-accuracy power flow estimation across diverse grid configurations. The code is available at https://github.com/ZhenZHAO/SenseFlow.