Identification of AC Networks via Online Learning
- URL: http://arxiv.org/abs/2003.06210v3
- Date: Sun, 19 Sep 2021 18:58:04 GMT
- Title: Identification of AC Networks via Online Learning
- Authors: Emanuele Fabbiani, Pulkit Nahata, Giuseppe De Nicolao, Giancarlo
Ferrari-Trecate
- Abstract summary: This paper proposes an online learning procedure to estimate the network admittance matrix capturing topological information and line parameters.
Our approach improves on existing techniques, and its effectiveness is substantiated by numerical studies on realistic testbeds.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The increasing penetration of intermittent distributed energy resources in
power networks calls for novel planning and control methodologies which hinge
on detailed knowledge of the grid. However, reliable information concerning the
system topology and parameters may be missing or outdated for temporally
varying electric distribution networks. This paper proposes an online learning
procedure to estimate the network admittance matrix capturing topological
information and line parameters. We start off by providing a recursive
identification algorithm exploiting phasor measurements of voltages and
currents. With the goal of accelerating convergence, we subsequently complement
our base algorithm with a design-of-experiment procedure which maximizes the
information content of data at each step by computing optimal voltage
excitations. Our approach improves on existing techniques, and its
effectiveness is substantiated by numerical studies on realistic testbeds.
Related papers
- Learning State-Augmented Policies for Information Routing in
Communication Networks [92.59624401684083]
We develop a novel State Augmentation (SA) strategy to maximize the aggregate information at source nodes using graph neural network (GNN) architectures.
We leverage an unsupervised learning procedure to convert the output of the GNN architecture to optimal information routing strategies.
In the experiments, we perform the evaluation on real-time network topologies to validate our algorithms.
arXiv Detail & Related papers (2023-09-30T04:34:25Z) - Online Network Source Optimization with Graph-Kernel MAB [62.6067511147939]
We propose Grab-UCB, a graph- kernel multi-arms bandit algorithm to learn online the optimal source placement in large scale networks.
We describe the network processes with an adaptive graph dictionary model, which typically leads to sparse spectral representations.
We derive the performance guarantees that depend on network parameters, which further influence the learning curve of the sequential decision strategy.
arXiv Detail & Related papers (2023-07-07T15:03:42Z) - Learning Distribution Grid Topologies: A Tutorial [0.2578242050187029]
This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes.
The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids.
This tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning.
arXiv Detail & Related papers (2022-06-22T04:32:13Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - Solving AC Power Flow with Graph Neural Networks under Realistic
Constraints [3.114162328765758]
We propose a graph neural network architecture to solve the AC power flow problem under realistic constraints.
In our approach, we demonstrate the development of a framework that uses graph neural networks to learn the physical constraints of the power flow.
arXiv Detail & Related papers (2022-04-14T14:49:34Z) - Convolutional generative adversarial imputation networks for
spatio-temporal missing data in storm surge simulations [86.5302150777089]
Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods.
We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
arXiv Detail & Related papers (2021-11-03T03:50:48Z) - Bayesian Error-in-Variables Models for the Identification of Power
Networks [0.0]
A reliable estimate of the admittance matrix may either be missing or quicklybecome obsolete for temporally varying grids.
We propose a data-driven identificationmethod utilising voltage and current measurements collected from micro-PMUs.
arXiv Detail & Related papers (2021-07-09T15:10:47Z) - Estimate Three-Phase Distribution Line Parameters With Physics-Informed
Graphical Learning Method [5.410616652484168]
We develop a physics-informed graphical learning algorithm to estimate network parameters of three-phase power distribution systems.
Our proposed algorithm uses only readily available smart meter data to estimate the three-phase series resistance and reactance of the primary distribution line segments.
arXiv Detail & Related papers (2021-02-17T20:52:55Z) - Resilient Identification of Distribution Network Topology [0.0]
This paper develops a network TI function that relies only on the measurements available to DERMS.
The propounded method is able to identify the network switching configuration, as well as the status of protective devices.
Having a low computational burden, this approach is fast-track and can be applied in real-time applications.
arXiv Detail & Related papers (2020-11-16T14:23:56Z) - Solving Sparse Linear Inverse Problems in Communication Systems: A Deep
Learning Approach With Adaptive Depth [51.40441097625201]
We propose an end-to-end trainable deep learning architecture for sparse signal recovery problems.
The proposed method learns how many layers to execute to emit an output, and the network depth is dynamically adjusted for each task in the inference phase.
arXiv Detail & Related papers (2020-10-29T06:32:53Z) - Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
We propose a topological perspective to represent a network into a complete graph for analysis.
By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner.
This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
arXiv Detail & Related papers (2020-08-19T04:53:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.