skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on December 18, 2025

Title: Data-Driven Graph Construction of Power Flow Graphs for Electric Power Transmission Networks
A comprehensive understanding of the topology of the electric power transmission network (EPTN) is essential for reliable and robust control of power systems. While existing research primarily relies on domain-specific methods, it lacks data-driven approaches that have proven effective in modeling the topology of complex systems. To address this gap, this paper explores the potential of data-driven methods for more accurate and adaptive solutions to uncover the true underlying topology of EPTNs. First, this paper examines Gaussian Graphical Models (GGM) to create an EPTN network graph (i.e., undirected simple graph). Second, to further refine and validate this estimated network graph, a physics-based, domain specific refinement algorithm is proposed to prune false edges and construct the corresponding electric power flow network graph (i.e., directed multi-graph). The proposed method is tested using a synchrophasor dataset collected from a two-area, four-machine power system simulated on the real-time digital simulator (RTDS) platform. Experimental results show both the network and flow graphs can be reconstructed using various operating conditions and topologies with limited failure cases.  more » « less
Award ID(s):
2234032 2234031
PAR ID:
10593130
Author(s) / Creator(s):
; ; ; ; ;
Publisher / Repository:
IEEE
Date Published:
ISBN:
979-8-3503-7488-9
Page Range / eLocation ID:
346 to 353
Subject(s) / Keyword(s):
critical infrastructure, data-driven modeling, electric power transmission, Gaussian graphical models, graph construction
Format(s):
Medium: X
Location:
Miami, FL, USA
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    The electric power grid is a critical societal resource connecting multiple infrastructural domains such as agriculture, transportation, and manufacturing. The electrical grid as an infrastructure is shaped by human activity and public policy in terms of demand and supply requirements. Further, the grid is subject to changes and stresses due to diverse factors including solar weather, climate, hydrology, and ecology. The emerging interconnected and complex network dependencies make such interactions increasingly dynamic, posing novel risks, and presenting new challenges to manage the coupled human–natural system. This paper provides a survey of models and methods that seek to explore the significant interconnected impact of the electric power grid and interdependent domains. We also provide relevant critical risk indicators (CRIs) across diverse domains that may be used to assess risks to electric grid reliability, including climate, ecology, hydrology, finance, space weather, and agriculture. We discuss the convergence of indicators from individual domains to explore possible systemic risk, i.e., holistic risk arising from cross-domain interconnections. Further, we propose a compositional approach to risk assessment that incorporates diverse domain expertise and information, data science, and computer science to identify domain-specific CRIs and their union in systemic risk indicators. Our study provides an important first step towards data-driven analysis and predictive modeling of risks in interconnected human–natural systems. 
    more » « less
  2. Voltage control in modern electric power distribution systems has become challenging due to the increasing penetration of distributed energy resources (DER). The current state-of-the-art voltage control is based on static/pre-determined DER volt-var curves. Static volt-var curves do not provide sufficient flexibility to address the temporal and spatial aspects of the voltage control problem in a power system with a large number of DER. This paper presents a simple, scalable, and robust distributed optimization framework (DOF) for optimizing voltage control. The proposed framework allows for data-driven distributed voltage optimization in a power distribution system. This method enhances voltage control by optimizing volt-var curve parameters of inverters in a distributed manner based on a cellular computational network (CCN) representation of the power distribution system. The cellular optimization approach enables the system-wide optimization. The cells to be optimized may be prioritized and two methods namely, graph and impact-based methods, are studied. The impact-based method requires extra initial computational efforts but thereafter provides better computational throughput than the graph-based method. The DOF is illustrated on a modified standard distribution test case with several DERs. The results from the test case demonstrate that the DOF based volt-var optimization results in consistently better performance than the state-of-the-art volt-var control. 
    more » « less
  3. This paper presents an algorithm to optimize the parameters of power systems equivalents to enhance the accuracy of the DC power flow approximation in reduced networks. Based on a zonal division of the network, the algorithm produces a reduced power system equivalent that captures inter-zonal flows with aggregated buses and equivalent transmission lines. The algorithm refines coefficient and bias parameters for the DC power flow model of the reduced network, aiming to minimize discrepancies between inter-zonal flows in DC and AC power flow results. Using optimization methods like Broyden-Fletcher-Goldfarb-Shanno (BFGS), Limited-memory BFGS (L-BFGS), and Truncated Newton Conjugate-Gradient (TNC) in an offline training phase, these parameters boost the accuracy of online DC power flow computations. In contrast to existing network equivalencing methods, the proposed algorithm optimizes accuracy over a specified range of operation as opposed to only considering a single nominal point. Numerical tests demonstrate substantial accuracy improvements over traditional equivalencing and approximation methods. 
    more » « less
  4. Uncertainties from deepening penetration of renewable energy resources have posed critical challenges to the secure and reliable operations of future electric grids. Among various approaches for decision making in uncertain environments, this paper focuses on chance-constrained optimization, which provides explicit probabilistic guarantees on the feasibility of optimal solutions. Although quite a few methods have been proposed to solve chance-constrained optimization problems, there is a lack of comprehensive review and comparative analysis of the proposed methods. We first review three categories of existing methods to chance-constrained optimization: (1) scenario approach; (2) sample average approximation; and (3) robust optimization based methods. Data-driven methods, which are not constrained by any particular distributions of the underlying uncertainties, are of particular interest. Key results of the analytical reformulation approach for specific distributions are briefly discussed. We then provide a comprehensive review on the applications of chance-constrained optimization in power systems. Finally, this paper provides a critical comparison of existing methods based on numerical simulations, which are conducted on standard power system test cases. 
    more » « less
  5. Graph signal processing (GSP) has emerged as a powerful tool for practical network applications, including power system monitoring. Recent research has focused on developing GSP-based methods for state estimation, attack detection, and topology identification using the representation of the power system voltages as smooth graph signals. Within this framework, efficient methods have been developed for detecting false data injection (FDI) attacks, which until now were perceived as nonsmooth with respect to the graph Laplacian matrix. Consequently, these methods may not be effective against smooth FDI attacks. In this paper, we propose a graph FDI (GFDI) attack that minimizes the Laplacian-based graph total variation (TV) under practical constraints. We present the GFDI attack as the solution for a non-convex constrained optimization problem. The solution to the GFDI attack problem is obtained through approximating it using ℓ1 relaxation. A series of quadratic programming problems that are classified as convex optimization problems are solved to obtain the final solution. We then propose a protection scheme that identifies the minimal set of measurements necessary to constrain the GFDI output to a high graph TV, thereby enabling its detection by existing GSP-based detectors. Our numerical simulations on the IEEE-57 and IEEE-118 bus test cases reveal the potential threat posed by well-designed GSP-based FDI attacks. Moreover, we demonstrate that integrating the proposed protection design with GSP-based detection can lead to significant hardware cost savings compared to previous designs of protection methods against FDI attacks. 
    more » « less