Search arXivSearch

arXiv · 2406.02964

Real-Time Small-Signal Security Assessment Using Graph Neural Networks

Abstract

Security assessment is one of the most crucial functions of a power system operator. However, growing complexity and unpredictability make this an increasingly complex and computationally difficult task. In recent times, machine learning methods have gained attention for their ability to handle complex modeling applications. Some methods proposed include deep learning using convolutional neural networks, decision trees, etc. While these methods generate promising results, most methods still require long training times and computational resources. This paper proposes a graph neural network (GNN) approach to the small-signal security assessment problem using data from Phasor Measurement Units (PMUs). Leveraging the inherently graphical structure of the power grid using GNNs, training times can be reduced and efficiency improved for real-time application. Also, using graph properties, optimal PMU placement is determined and the proposed method is shown to perform efficiently under partial observability with limited PMU data. Case studies with simulated data from the IEEE 68-bus system and the NPCC 140-bus system are used to verify the effectiveness of the proposed method.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Glory Justin, Santiago Paternain. 2024-06-05. Real-Time Small-Signal Security Assessment Using Graph Neural Networks. https://arxiv.org/abs/2406.02964

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY