Anna Scaglione

Anna Scaglione

Auto-generated profile, based on publicly available information

Anna Scaglione

Cornell University

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
25 October 2017 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
MJMahdi Jamei
Mahdi Jamei
ASAnna Scaglione
Anna Scaglione
CRCiaran Roberts
Ciaran Roberts
ESEmma Stewart
Emma Stewart
SPSean Peisert
Sean Peisert
AMAlex McEachern
Alex McEachern
As the distribution grid moves toward a tightly-monitored network, it is important to automate the analysis of the enormous amount of data produced by the sensors to increase the operators situational awareness about the system. In this paper, focusing on Micro-Phasor Measurement Unit (μPMU) data, we propose a hierarchical architecture for monitoring the grid and establish a set of analytics and sensor fusion primitives for the detection of abnormal behavior in the control perimeter. Due to the key role of the μPMU devices in our architecture, a source-constrained optimal μPMU placement is also described that finds the best location of the devices with respect to our rules. The effectiveness of the proposed methods are tested through the synthetic and real μPMU data.

23 April 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
RRRaksha Ramakrishna
Raksha Ramakrishna
ASAnna Scaglione
Anna Scaglione
The underlying theme of this paper is to explore the various facets of power systems data through the lens of graph signal processing (GSP), laying down the foundations of the Grid-GSP framework. Grid-GSP provides an interpretation for the spatio-temporal properties of voltage phasor measurements, by showing how the well-known power systems modeling supports a generative low-pass graph filter model for the state variables, namely the voltage phasors. Using the model we formalize the empirical observation that voltage phasor measurement data lie in a low-dimensional subspace and tie their spatio-temporal structure to generator voltage dynamics. The Grid-GSP generative model is then successfully employed to investigate the problems, pertaining to the grid, of data sampling and interpolation, network inference, detection of anomalies and data compression. Numerical results on a large synthetic grid that mimics the real-grid of the state of Texas, ACTIVSg2000, and on real-world measurements from ISO-New England verify the efficacy of applying Grid-GSP methods to electric grid data.

29 October 2020 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
RRRaksha Ramakrishna
Raksha Ramakrishna
HWHoi-To Wai
Hoi-To Wai
ASAnna Scaglione
Anna Scaglione
The notion of graph filters can be used to define generative models for graph data. In fact, the data obtained from many examples of network dynamics may be viewed as the output of a graph filter. With this interpretation, classical signal processing tools, such as frequency analysis, have been successfully applied with analogous interpretation to graph data, generating new insights for data science. What follows is a user guide on a specific class of graph data, where the generating graph filters are low pass; i.e., the filter attenuates contents in the higher graph frequencies while retaining contents in the lower frequencies. Our choice is motivated by the prevalence of low-pass models in application domains such as social networks, financial markets, and power systems. We illustrate how to leverage properties of low-pass graph filters to learn the graph topology and identify its community structure; efficiently represent graph data through sampling; recover missing measurements; and denoise graph data. The low-pass property is also used as the baseline to detect anomalies.

10 July 2025 in Proceedings of the IEEE
Verified
Journal Article
Closed access
TSTong Su
Tong Su
TWTong Wu
Tong Wu
JZJunbo Zhao
Junbo Zhao
ASAnna Scaglione
Anna Scaglione
LXLe Xie
Le Xie
Given the availability of more comprehensive measurement data in modern power systems, reinforcement learning (RL) has gained significant interest in operation and control. Conventional RL relies on trial-and-error interactions with the environment and reward feedback, which often leads to exploring unsafe operating regions and executing unsafe actions, especially when deployed in real-world power systems. To address these challenges, safe RL has been proposed to optimize operational objectives while ensuring safety constraints are met, keeping actions and states within safe regions throughout both training and deployment. Rather than relying solely on manually designed penalty terms for unsafe actions, as is common in conventional RL, safe RL methods reviewed here primarily leverage advanced and proactive mechanisms. These include techniques such as Lagrangian relaxation, safety layers, and theoretical guarantees like Lyapunov functions to rigorously enforce safety boundaries. This article provides a comprehensive review of safe RL methods and their applications across various power system operations and control domains, including security control, real-time operation, operational planning, and emerging areas. It summarizes existing safe RL techniques, evaluates their performance, analyzes suitable deployment scenarios, and examines algorithm benchmarks and application environments. This article also highlights real-world implementation cases and identifies critical challenges such as scalability in large-scale systems and robustness under uncertainty, providing potential solutions and outlining future directions to advance the reliable integration and deployment of safe RL in modern power systems.

19 August 2017 in Energies
Verified
Journal Article
Open access
PDF file
ABAdam Birchfield
Adam Birchfield
ESEran Schweitzer
Eran Schweitzer
MAMir Hadi Athari
Mir Hadi Athari
TXTi Xu
Ti Xu
TOThomas J. Overbye
Thomas J. Overbye
ZWZhifang Wang
Zhifang Wang
Public power system test cases that are of high quality benefit the power systems research community with expanded resources for testing, demonstrating, and cross-validating new innovations. Building synthetic grid models for this purpose is a relatively new problem, for which a challenge is to show that created cases are sufficiently realistic. This paper puts forth a validation process based on a set of metrics observed from actual power system cases. These metrics follow the structure, proportions, and parameters of key power system elements, which can be used in assessing and validating the quality of synthetic power grids. Though wide diversity exists in the characteristics of power systems, the paper focuses on an initial set of common quantitative metrics to capture the distribution of typical values from real power systems. The process is applied to two new public test cases, which are shown to meet the criteria specified in the metrics of this paper.

20 December 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
HWHoi-To Wai
Hoi-To Wai
SSSantiago Segarra
Santiago Segarra
AOAsuman E. Ozdaglar
Asuman E. Ozdaglar
ASAnna Scaglione
Anna Scaglione
AJAli Jadbabaie
Ali Jadbabaie
This paper considers a new framework to detect communities in a graph from the observation of signals at its nodes. We model the observed signals as noisy outputs of an unknown network process, represented as a graph filter that is excited by a set of unknown low-rank inputs/excitations. Application scenarios of this model include diffusion dynamics, pricing experiments, and opinion dynamics. Rather than learning the precise parameters of the graph itself, we aim at retrieving the community structure directly. The paper shows that communities can be detected by applying a spectral method to the covariance matrix of graph signals. Our analysis indicates that the community detection performance depends on an intrinsic ‘low-pass’ property of the graph filter. We also show that the performance can be improved via a low-rank matrix plus sparse decomposition method when the latent parameter vectors are known. Numerical results demonstrate that our approach is effective.