arXiv subjects

Haiwang Zhong

Publications and source records attributed to Haiwang Zhong.

At least 19 recordsLinked to original sources

arXiv2026

Reference-Free Heterogeneous Multi-Agent Reinforcement Learning for Grid-Friendly Tie-Line Power Shaping in Industrial Microgrids

Tie-line power (TLP) shaping is a key requirement for the grid-friendly operation of industrial microgrids (IMGs). This paper studies the coordination of multi-timescale heterogeneous adjustable resources in a steel IMG to shape a grid-friendly TLP trajectory considering multiple objectives. A sequential heterogeneous-agent coordination (SHAC) framework is proposed, where process loads, hydrogen storage, and battery storage are modeled as functionally heterogeneous agents with cross-role observations, asynchronous decision intervals, role-specific rewards and critics. This design captures the heterogeneous temporal effects of different resources on the TLP trajectory and alleviates ambiguous credit assignment and weak inter-agent coordination. To ensure feasible real-time execution, process-knowledge-based action masking and feasibility projection are embedded into policy execution, and a role-aware multi-timescale actor--critic training scheme is developed for agents with different action structures and decision intervals. Numerical studies using real renewable generation and electricity market data show that SHAC effectively eliminates the dependence on predefined reference trajectories and enables adaptive 1-min online decision-making, achieving zero production failures with an average computational time of only 0.4 ms per step. Compared with the original operation, SHAC reduces the total grid purchase cost, contract-demand exceedance time, and cumulative ramp excess by 91.27\%, 98.64\%, and 96.91\%, respectively. These results demonstrate that the proposed framework improves the economic efficiency and grid friendliness of industrial microgrid operation while satisfying strict process-safety constraints and real-time computational requirements.

eess.SY↗

arXiv2026

Emergency-Aware and Frequency-Constrained HVDC Planning for A Multi-Area Asynchronously Interconnected Grid

High-voltage direct current (HVDC) technology has played a crucial role for long-distance transmission of renewable power generation. However, the integration of large-capacity HVDC lines introduces significant frequency security challenges during HVDC fault emergencies. This paper proposes an emergency-aware and frequency-constrained HVDC planning method to optimize the capacity of inter-area HVDC tie-lines in a multi-area asynchronously interconnected grid. Firstly, a coordinated emergency frequency control scheme is proposed to allocate the emergency control resources during HVDC faults. Then, an enhanced system frequency response model integrating event-driven emergency frequency control is developed and a weighted oblique decision tree approach is employed to extract frequency nadir security constraints. The proposed planning model considers all potential HVDC fault emergencies while treating candidate HVDC capacities as decision variables. Simulation results demonstrate superior performance in balancing economic efficiency with frequency security requirements, providing a practical solution for inter-area HVDC planning.

eess.SY↗

arXiv2025

A Graph Neural Network with Auxiliary Task Learning for Missing PMU Data Reconstruction

In wide-area measurement systems (WAMS), phasor measurement unit (PMU) measurement is prone to data missingness due to hardware failures, communication delays, and cyber-attacks. Existing data-driven methods are limited by inadaptability to concept drift in power systems, poor robustness under high missing rates, and reliance on the unrealistic assumption of full system observability. Thus, this paper proposes an auxiliary task learning (ATL) method for reconstructing missing PMU data. First, a K-hop graph neural network (GNN) is proposed to enable direct learning on the subgraph consisting of PMU nodes, overcoming the limitation of the incompletely observable system. Then, an auxiliary learning framework consisting of two complementary graph networks is designed for accurate reconstruction: a spatial-temporal GNN extracts spatial-temporal dependencies from PMU data to reconstruct missing values, and another auxiliary GNN utilizes the low-rank property of PMU data to achieve unsupervised online learning. In this way, the low-rank properties of the PMU data are dynamically leveraged across the architecture to ensure robustness and self-adaptation. Numerical results demonstrate the superior offline and online performance of the proposed method under high missing rates and incomplete observability.

eess.SY↗

arXiv2025

An Equality Set Projection Approach for TSO-DSO Coordination Dispatch

Coordinated optimization dispatch (COD) of transmission system operator (TSO) and distribution system operator (DSO) can effectively ensure system security and efficiency under high-penetration distributed energy resource (DER) integration. Researches of large-scale COD problem can be categorized into iterative approaches that allow DSO to dispatch independently, and non-iterative methods based on projections of feasible regions (FR). However, the iterative methods suffer from low computational convergence and efficiency, while non-iterative methods struggle to solve equivalent projections with high-dimensional FR. To address these issues, this paper proposes a TSO-DSO coordinated dispatch approach based on an accelerated non-iterative Equality Set Projection (ESP) algorithm. First, ESP algorithm is employed to overcome the bottleneck of high-dimensional FR construction. Second, an regularization-based accelerated method is proposed to reduce computational burden when degeneracy occurs. Accelerated ESP algorithm constructs projection of FR via adjacent facet searching. Therefore, it is less sensitive to the increase of vertices and could efficiently construct the projection of high-dimensional FR. Case studies on a polyhedron dataset, IEEE 33-Bus System and T118D10 TSO-DSO system demonstrate the effectiveness and computational efficiency of the proposed COD approach.

eess.SY↗

arXiv2025

Spatially Dependent Sampling of Component Failures for Power System Preventive Control Against Hurricane

Preventive control is a crucial strategy for power system operation against impending natural hazards, and its effectiveness fundamentally relies on the realism of scenario generation. While most existing studies employ sequential Monte Carlo simulation and assume independent sampling of component failures, this oversimplification neglects the spatial correlations induced by meteorological factors such as hurricanes. In this paper, we identify and address the gap in modeling spatial dependence among component failures under extreme weather. We analyze how the mean, variance, and correlation structure of weather intensity random variables influence the correlation of component failures. To fill this gap, we propose a spatially dependent sampling method that enables joint sampling of multiple component failures by generating correlated meteorological intensity random variables. Comparative studies show that our approach captures long-tailed scenarios and reveals more extreme events than conventional methods. Furthermore, we evaluate the impact of scenario selection on preventive control performance. Our key findings are: (1) Strong spatial correlations in uncertain weather intensity consistently lead to interdependent component failures, regardless of mean value level; (2) The proposed method uncovers more high-severity scenarios that are missed by independent sampling; (3) Preventive control requires balancing load curtailment and over-generation costs under different scenario severities; (4) Ignoring failure correlations results in underestimating risk from high-severity events, undermining the robustness of preventive control strategies.

eess.SY↗

arXiv2025

Performance-Aware Control of Modular Batteries For Fast Frequency Response

Modular batteries can be aggregated to deliver frequency regulation services for power grids. Although utilizing the idle capacity of battery modules is financially attractive, it remains challenging to consider the heterogeneous module-level characteristics such as dynamic operational efficiencies and battery degradation. In addition, real-time decision making within seconds is required to enable fast frequency response. In order to address these issues, this paper proposes a performance-aware scheduling approach for battery modules to deliver fast frequency response (FFR) support. In particular, the conduction loss and switching loss of battery packs as well as converters are captured within a mix-integer quadratic constrained program (MIQCP). The cycle-based aging model identifies the aging cost of battery modules during frequent cycling by introducing the aging subgradient calculation and linearization. Case studies based on real-world battery data show that the proposed scheduling approach can effectively reduce power loss cost by nearly 28%-57% and battery aging cost by 4%-15% compared to conventional methods, which can also enhance the SoC balance.

eess.SY↗

arXiv2025

Learning for Feasible Region on Coal Mine Virtual Power Plants with Imperfect Information

The feasible region assessment (FRA) in industrial virtual power plants (VPPs) is driven by the need to activate large-scale latent industrial loads for demand response, making it essential to aggregate these flexible resources for peak regulation. However, the large number of devices and the need for privacy preservation in coal mines pose challenges to accurately aggregating these resources into a cohesive coal mine VPP. In this paper, we propose an efficient and reliable data-driven approach for FRA in the coal mine VPP that can manage incomplete information. Our data-driven FRA algorithm approximates equipment and FRA parameters based on historical energy dispatch data, effectively addressing the challenges of imperfect information. Simulation results illustrate that our method approximates the accurate feasible operational boundaries under dynamic and imperfect information conditions.

eess.SY↗

arXiv2024

Reinforcement Learning Based Bidding Framework with High-dimensional Bids in Power Markets

Over the past decade, bidding in power markets has attracted widespread attention. Reinforcement Learning (RL) has been widely used for power market bidding as a powerful AI tool to make decisions under real-world uncertainties. However, current RL methods mostly employ low dimensional bids, which significantly diverge from the N price-power pairs commonly used in the current power markets. The N-pair bidding format is denoted as High Dimensional Bids (HDBs), which has not been fully integrated into the existing RL-based bidding methods. The loss of flexibility in current RL bidding methods could greatly limit the bidding profits and make it difficult to tackle the rising uncertainties brought by renewable energy generations. In this paper, we intend to propose a framework to fully utilize HDBs for RL-based bidding methods. First, we employ a special type of neural network called Neural Network Supply Functions (NNSFs) to generate HDBs in the form of N price-power pairs. Second, we embed the NNSF into a Markov Decision Process (MDP) to make it compatible with most existing RL methods. Finally, experiments on Energy Storage Systems (ESSs) in the PJM Real-Time (RT) power market show that the proposed bidding method with HDBs can significantly improve bidding flexibility, thereby improving the profit of the state-of-the-art RL bidding methods.

cs.LG↗

arXiv2024

Misaka: Interactive Swarm Testbed for Smart Grid Distributed Algorithm Test and Evaluation

In this paper, we present Misaka, a visualized swarm testbed for smart grid algorithm evaluation, also an extendable open-source open-hardware platform for developing tabletop tangible swarm interfaces. The platform consists of a collection of custom-designed 3 omni-directional wheels robots each 10 cm in diameter, high accuracy localization through a microdot pattern overlaid on top of the activity sheets, and a software framework for application development and control, while remaining affordable (per unit cost about 30 USD at the prototype stage). We illustrate the potential of tabletop swarm user interfaces through a set of smart grid algorithm application scenarios developed with Misaka.

cs.RO↗

arXiv2024

Network-Constrained Unit Commitment with Flexible Temporal Resolution

Modern network-constrained unit commitment (NCUC) bears a heavy computational burden due to the ever-growing model scale. This situation becomes more challenging when detailed operational characteristics, complicated constraints, and multiple objectives are considered. We propose a novel simplification method to determine the flexible temporal resolution for acceleration and near-optimal solutions. The flexible temporal resolution is determined by analyzing the impact on generators in each adaptive time period with awareness of congestion effects. Additionally, multiple improvements are employed on the existing NCUC model compatible with flexible temporal resolution to reduce the number of integer variables while preserving the original features. A case study using the IEEE 118-bus and the Polish 2736-bus systems verifies that the proposed method achieves substantial acceleration with low cost variation and high accuracy.

eess.SY↗

arXiv2023

A Projection-Based Approach for Distributed Energy Resources Aggregation

Aggregating distributed energy resources (DERs) is of great significance to improve the overall operational efficiency of smart grid. The aggregation model needs to consider various factors such as network constraints, operational constraints, and economic characteristics of the DERs. This paper constructs a multi-slot DER aggregation model that considers the above factors using feasible region projection approach, which achieved the protection of DERs data information and the elimination of internal variables. A system economic dispatch (ED) model is established for the operators to make full use of the DER clusters. We calculate the feasible regions with temporal coupling by extending the Progressive Vertex Enumeration (PVE) algorithm to high dimension by the Quickhull algorithm. Finally, an IEEE 39-bus distribution network is simulated with DERs to verify the effectiveness of the proposed model. Results show that the two-step ED derives the same results as the centralized ED.

eess.SY↗

arXiv2023

Life cycle economic viability analysis of battery storage in electricity market

Battery storage is essential to enhance the flexibility and reliability of electric power systems by providing auxiliary services and load shifting. Storage owners typically gains incentives from quick responses to auxiliary service prices, but frequent charging and discharging also reduce its lifetime. Therefore, this paper embeds the battery degradation cost into the operation simulation to avoid overestimated profits caused by an aggressive bidding strategy. Based on an operation simulation model, this paper conducts the economic viability analysis of whole life cycle using the internal rate of return(IRR). A clustering method and a typical day method are developed to reduce the huge computational burdens in the life-cycle simulation of battery storage. Our models and algorithms are validated by the case study of two mainstream technology routes currently: lithium nickel cobalt manganese oxide (NCM) batteries and lithium iron phosphate (LFP) batteries. Then a sensitivity analysis is presented to identify the critical factors that boost battery storage in the future. We evaluate the IRR results of different types of battery storage to provide guidance for investment portfolio.

eess.SY↗

arXiv2023

Real-time scheduling of renewable power systems through planning-based reinforcement learning

The growing renewable energy sources have posed significant challenges to traditional power scheduling. It is difficult for operators to obtain accurate day-ahead forecasts of renewable generation, thereby requiring the future scheduling system to make real-time scheduling decisions aligning with ultra-short-term forecasts. Restricted by the computation speed, traditional optimization-based methods can not solve this problem. Recent developments in reinforcement learning (RL) have demonstrated the potential to solve this challenge. However, the existing RL methods are inadequate in terms of constraint complexity, algorithm performance, and environment fidelity. We are the first to propose a systematic solution based on the state-of-the-art reinforcement learning algorithm and the real power grid environment. The proposed approach enables planning and finer time resolution adjustments of power generators, including unit commitment and economic dispatch, thus increasing the grid's ability to admit more renewable energy. The well-trained scheduling agent significantly reduces renewable curtailment and load shedding, which are issues arising from traditional scheduling's reliance on inaccurate day-ahead forecasts. High-frequency control decisions exploit the existing units' flexibility, reducing the power grid's dependence on hardware transformations and saving investment and operating costs, as demonstrated in experimental results. This research exhibits the potential of reinforcement learning in promoting low-carbon and intelligent power systems and represents a solid step toward sustainable electricity generation.

cs.AI↗

arXiv2023

Look-Ahead AC Optimal Power Flow: A Model-Informed Reinforcement Learning Approach

With the increasing proportion of renewable energy in the generation side, it becomes more difficult to accurately predict the power generation and adapt to the large deviations between the optimal dispatch scheme and the day-ahead scheduling in the process of real-time dispatch. Therefore, it is necessary to conduct look-ahead dispatches to revise the operation plan according to the real-time status of the power grid and reliable ultra-short-term prediction. Application of traditional model-driven methods is often limited by the scale of the power system and cannot meet the computational time requirements of real-time dispatch. Data-driven methods can provide strong online decision-making support abilities when facing large-scale systems, while it is limited by the quantity and quality of the training dataset. This paper proposes a model-informed reinforcement learning approach for look-ahead AC optimal power flow. The reinforcement learning model is first formulated based on the domain knowledge of economic dispatch, and then the physics-informed neural network is constructed to enhance the reliability and efficiency. At last, the case study based on the SG 126-bus system validates the accuracy and efficiency of the proposed approach.

eess.SY↗

arXiv2023

Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection-Part II: Method and Applications

This two-part paper develops a non-iterative coordinated optimal dispatch framework, i.e., free of iterative information exchange, via the innovation of the equivalent projection (EP) theory. The EP eliminates internal variables from technical and economic operation constraints of the subsystem and obtains an equivalent model with reduced scale, which is the key to the non-iterative coordinated optimization. In Part II of this paper, a novel projection algorithm with the explicit error guarantee measured by the Hausdorff distance is proposed, which characterizes the EP model by the convex hull of its vertices. This algorithm is proven to yield a conservative approximation within the prespecified error tolerance and can obtain the exact EP model if the error tolerance is set to zero, which provides flexibility to balance the computation accuracy and effort. Applications of the EP-based coordinated dispatch are demonstrated based on the multi-area coordination and transmission-distribution coordination. Case studies with a wide range of system scales verify the superiority of the proposed projection algorithm in terms of computational efficiency and scalability, and validate the effectiveness of the EP-based coordinated dispatch in comparison with the joint optimization.

math.OC↗

arXiv2023

Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection-Part I: Theory

Coordinated optimal dispatch is of utmost importance for the efficient and secure operation of hierarchically structured power systems. Conventional coordinated optimization methods, such as the Lagrangian relaxation and Benders decomposition, require iterative information exchange among subsystems. Iterative coordination methods have drawbacks including slow convergence, risk of oscillation and divergence, and incapability of multi-level optimization problems. To this end, this paper aims at the non-iterative coordinated optimization method for hierarchical power systems. The theory of the equivalent projection (EP) is proposed, which makes external equivalence of the optimal dispatch model of the subsystem. Based on the EP theory, a coordinated optimization framework is developed, where each subsystem submits the EP model as a substitute for its original model to participate in the cross-system coordination. The proposed coordination framework is proven to guarantee the same optimality as the joint optimization, with additional benefits of avoiding iterative information exchange, protecting privacy, compatibility with practical dispatch scheme, and capability of multi-level problems.

math.OC↗

arXiv2023

Low-Carbon Economic Dispatch of Bulk Power Systems Using Nash Bargaining Game

Decarbonization of power systems plays a crucial role in achieving carbon neutral goals across the globe, but there exists a sharp contradiction between the emission reduction and levelized generation cost. Therefore, it is of great importance for power system operators to take economic as well as low-carbon factors into account. This paper establishes a low-carbon economic dispatch model of bulk power systems based on Nash bargaining game, which derives a Nash bargaining solution making a reasonable trade-off between economic and low-carbon objectives. Because the Nash bargaining solution satisfies Pareto effectiveness, we analyze the computational complexity of Pareto frontiers with parametric linear programming and interpret the inefficiency of the method. Instead, we assign a group of dynamic weights in the objective function of the proposed low-carbon economic dispatch model so as to improve the computational efficiency by decoupling time periods and avoiding the complete computation of Pareto frontiers. In the end, we validate the proposed model and the algorithm by a realistic nationwide simulation in mainland China.

eess.SY↗

arXiv2022

Transmission Congestion Management with Generalized Generation Shift Distribution Factors

A major concern in modern power systems is that the popularity and fluctuating characteristics of renewable energy may cause more and more transmission congestion events. Traditional congestion management modeling involves AC or DC power flow equations, while the former equation always accompanies great amount of computation, and the latter cannot consider voltage amplitude and reactive power. Therefore, this paper proposes a congestion management approach incorporating a specially-designed generalized generator shift distribution factor (GSDF) to derive a computationally-efficient and accurate management strategies. This congestion management strategy involves multiple balancing generators for generation shift operation. The proposed model is superior in a low computational complexity (linear equation) and versatile modeling representation with full consideration of voltage amplitude and reactive power.

eess.SY↗