Gaoxi Xiao

Guoqi Li, Xumin Chen, Pei Tang et al.

Target control of directed networks, which aims to control only a target subset instead of the entire set of nodes in large natural and technological networks, is an outstanding challenge faced in various real world applications. We address one fundamental issue regarding this challenge, i.e., for a given target subset, how to allocate a minimum number of control sources which provide input signals to the network nodes. This issue remains open in general networks with loops. We show that the issue is essentially a path cover problem and can be further converted into a maximum network flow problem. A method termed `Maximum Flow based Target Path-cover' (MFTP) with complexity $O(|V|^{1/2}|E|)$ in which $|V|$ and $|E|$ denote the number of network nodes and edges is proposed. It is also rigorously proven to provide the minimum number of control sources on arbitrary directed networks, whether loops exist or not. We anticipate that this work would serve wide applications in target control of real-life networks, as well as counter control of various complex systems which may contribute to enhancing system robustness and resilience.

Chao Zhai, Hehong Zhang, Gaoxi Xiao et al.

Cascading failures in power systems normally occur as a result of initial disturbance or faults on electrical elements, closely followed by errors of human operators. It remains a great challenge to systematically trace the source of cascading failures in power systems. In this paper, we develop a mathematical model to describe the cascading dynamics of transmission lines in power networks. In particular, the direct current (DC) power flow equation is employed to calculate the transmission power on the branches. By regarding the disturbances on the elements as the control inputs, we formulate the problem of determining the initial disturbances causing the cascading blackout of power grids in the framework of optimal control theory, and the magnitude of disturbances or faults on the selected branch can be obtained by solving the system of algebraic equations. Moreover, an iterative search algorithm is proposed to look for the optimal solution leading to the worst case of cascading failures. Theoretical analysis guarantees the asymptotic convergence of the iterative search algorithm. Finally, numerical simulations are carried out in IEEE 9 Bus System and IEEE 14 Bus System to validate the proposed approach.

Chao Zhai, Gaoxi Xiao, Hehong Zhang et al.

This paper aims to investigate the risk identification problem of power transmission system that is integrated with renewable energy sources. In practice, the fluctuation of power generation from renewable energy sources can lead to severe consequences to power transmission network. By treating the fluctuation of power generation as the control input, the risk identification problem is formulated with the aid of optimal control theory. Thus, a control approach is developed to identify the fluctuation of power generation that results in the worst-case cascading failures of power systems. Theoretical analysis is also conducted to obtain the necessary condition for the worst fluctuations of power generation. Finally, numerical simulations are implemented on IEEE 9 Bus System to demonstrate the effectiveness of the proposed approach.

Chao Zhai, Gaoxi Xiao, Hehong Zhang et al.

This paper addresses the cooperative control problem of Thyristor-Controlled Series Compensation (TCSC) to eliminate the stress of cyber-physical power system. The cyber-physical power system is composed of power network, protection and control center and communication network. A cooperative control algorithm of TCSC is developed to adjust the branch impedance and regulate the power flow. To reduce computation burdens, an approximate method is adopted to estimate the Jacobian matrix for the generation of control signals. In addition, a performance index is introduced to quantify the stress level of power system. Theoretical analysis is conducted to guarantee the convergence of performance index when the proposed cooperative control algorithm is implemented. Finally, numerical simulations are carried out to validate the cooperative control approach on IEEE 24 Bus Systems in uncertain environments.

Junhao Ren, Honglin Gao, Sijie Wang et al.

The challenges of the uncertainties in renewable energy generation and the instability of the real-time market limit the effective utilization of clean energy in microgrid communities. Existing peer-to-peer (P2P) and microgrid coordination approaches typically rely on certain centralized optimization or restrictive coordination rules which are difficult to be implemented in real-life applications. To address the challenge, we propose an intraday P2P trading framework that allows self-interested microgrids to pursue their economic benefits, while allowing the market operator to maximize the social welfare, namely the low carbon emission objective, of the entire community. Specifically, the decision-making processes of the microgrids are formulated as a Decentralized Partially Observable Markov Decision Process (DEC-POMDP) and solved using a Multi-Agent Reinforcement Learning (MARL) framework. Such an approach grants each microgrid a high degree of decision-making autonomy, while a novel market clearing mechanism is introduced to provide macro-regulation, incentivizing microgrids to prioritize local renewable energy consumption and hence reduce carbon emissions. Simulation results demonstrate that the combination of the self-interested bidding strategy and the P2P market design helps significantly improve renewable energy utilization and reduce reliance on external electricity with high carbon-emissions. The framework achieves a balanced integration of local autonomy, self-interest pursuit, and improved community-level economic and environmental benefits.

Junhao Ren, Honglin Gao, Lan Zhao et al.

Uncertainties in renewable generation and demand dynamics challenge day-ahead scheduling. To enhance renewable penetration and maintain intra-day balance, we develop a multi-agent reinforcement learning framework for self-interested microgrids participating in peer-to-peer (P2P) electricity trading. Each microgrid independently bids both price and quantity while optimizing its own profit via storage arbitrage under time-varying main-grid prices. A market-clearing mechanism coordinating trades and promoting incentive compatibility is proposed. Simulation results show that the learned bidding policy improves renewable utilization and reduces reliance on high-carbon electricity, while increasing community-level economic welfare, delivering a win-win situation in emission reduction and local prosperity.

Honglin Gao, Lan Zhao, Junhao Ren et al.

Heterogeneous graph neural networks (HGNNs) have achieved strong performance in many real-world applications, yet targeted backdoor poisoning on heterogeneous graphs remains less studied. We consider backdoor attacks for heterogeneous node classification, where an adversary injects a small set of trigger nodes and connections during training to force specific victim nodes to be misclassified into an attacker-chosen label at test time while preserving clean performance. We propose HeteroHBA, a generative backdoor framework that selects influential auxiliary neighbors for trigger attachment via saliency-based screening and synthesizes diverse trigger features and connection patterns to better match the local heterogeneous context. To improve stealthiness, we combine Adaptive Instance Normalization (AdaIN) with a Maximum Mean Discrepancy (MMD) loss to align the trigger feature distribution with benign statistics, thereby reducing detectability, and we optimize the attack with a bilevel objective that jointly promotes attack success and maintains clean accuracy. Experiments on multiple real-world heterogeneous graphs with representative HGNN architectures show that HeteroHBA consistently achieves higher attack success than prior backdoor baselines with comparable or smaller impact on clean accuracy; moreover, the attack remains effective under our heterogeneity-aware structural defense, CSD. These results highlight practical backdoor risks in heterogeneous graph learning and motivate the development of stronger defenses.

Liping Huang, Gaoxi Xiao, Stefan Ma et al.

Dengue, a mosquito-borne disease, continues to pose a persistent public health challenge in urban areas, particularly in tropical regions such as Singapore. Effective and affordable control requires anticipating where transmission risks are likely to emerge so that interventions can be deployed proactively rather than reactively. This study introduces a novel framework that uncovers and exploits latent transmission links between urban regions, mined directly from publicly available dengue case data. Instead of treating cases as isolated reports, we model how hotspot formation in one area is influenced by epidemic dynamics in neighboring regions. While mosquito movement is highly localized, long-distance transmission is often driven by human mobility, and in our case study, the learned network aligns closely with commuting flows, providing an interpretable explanation for citywide spread. These hidden links are optimized through gradient descent and used not only to forecast hotspot status but also to verify the consistency of spreading patterns, by examining the stability of the inferred network across consecutive weeks. Case studies on Singapore during 2013-2018 and 2020 show that four weeks of hotspot history are sufficient to achieve an average F-score of 0.79. Importantly, the learned transmission links align with commuting flows, highlighting the interpretable interplay between hidden epidemic spread and human mobility. By shifting from simply reporting dengue cases to mining and validating hidden spreading dynamics, this work transforms open web-based case data into a predictive and explanatory resource. The proposed framework advances epidemic modeling while providing a scalable, low-cost tool for public health planning, early intervention, and urban resilience.

Honglin Gao, Xiang Li, Lan Zhao et al.

Heterogeneous graph neural networks (HGNNs) have recently drawn increasing attention for modeling complex multi-relational data in domains such as recommendation, finance, and social networks. While existing research has been largely focused on enhancing HGNNs' predictive performance, their robustness and security, especially under backdoor attacks, remain underexplored. In this paper, we propose a novel Heterogeneous Backdoor Attack (HeteroBA) framework for node classification tasks on heterogeneous graphs. HeteroBA inserts carefully crafted trigger nodes with realistic features and targeted structural connections, leveraging attention-based and clustering-based strategies to select influential auxiliary nodes for effective trigger propagation, thereby causing the model to misclassify specific nodes into a target label while maintaining accuracy on clean data. Experimental results on three datasets and various HGNN architectures demonstrate that HeteroBA achieves high attack success rates with minimal impact on the clean accuracy. Our method sheds light on potential vulnerabilities in HGNNs and calls for more robust defenses against backdoor threats in multi-relational graph scenarios.

Chao Zhai, Gaoxi Xiao, Hehong Zhang et al.

Due to the evolving nature of power systems and the complicated coupling relationship of power devices, it has been a great challenge to identify the contingencies that could trigger cascading blackouts of power systems. This paper aims to develop a universal approach for identifying the initial disruptive contingencies that can result in the worst-case cascading failures of power grids. The problem of contingency identification is formulated in a unified mathematical framework, and it can be solved by the Jacobian-Free Newton-Krylov (JFNK) method in order to circumvent the Jacobian matrix and relieve the computational burden. Finally, numerical simulations are carried out to validate the proposed identification approach on the IEEE $118$ Bus System.

Chao Zhai, Gaoxi Xiao, Hehong Zhang

This paper aims to identify and analyze the initial contingencies or disturbances that could lead to the worst-case cascading failures of power grids. An optimal control approach is proposed to determine the most disruptive disturbances on the branch of power transmission system by regarding the disturbances as the control inputs. Moreover, protective actions such as load shedding and generation dispatch are taken into account in a convex optimization framework to prevent the cascading outages of power grids. In theory, the necessary conditions for identifying the most disruptive disturbances are obtained by solving an integrated system of algebraic equations. Finally, numerical simulations are carried out to validate the proposed approach on the IEEE RTS 24 Bus System.

Hehong Zhang, Chao Zhai, Gaoxi Xiao et al.

Potential critical risks of cascading failures in power systems can be identified by exposing those critical electrical elements on which certain initial disturbances may cause maximum disruption to power transmission networks. In this work, we investigate cascading failures in power systems described by the direct current (DC) power flow equations, while initial disturbances take the form of altering admittance of elements. The disruption is quantified with the remaining transmission power at the end of cascading process. In particular, identifying the critical elements and the corresponding initial disturbances causing the worst-case cascading blackout is formulated as a dynamic optimization problem (DOP) in the framework of optimal control theory, where the entire propagation process of cascading failures is put under consideration. An Identifying Critical Risk Algorithm (ICRA) based on the maximum principle is proposed to solve the DOP. Simulation results on the IEEE 9-Bus and the IEEE 14-Bus test systems are presented to demonstrate the effectiveness of the algorithm.