State Estimation of Power Flows for Smart Grids via Belief Propagation
- URL: http://arxiv.org/abs/2012.10473v1
- Date: Fri, 18 Dec 2020 19:22:03 GMT
- Title: State Estimation of Power Flows for Smart Grids via Belief Propagation
- Authors: Tim Ritmeester and Hildegard Meyer-Ortmanns
- Abstract summary: Belief propagation is an algorithm that is known from statistical physics and computer science.
We show that belief propagation scales linearly with the grid size for the state estimation itself.
It also facilitates and accelerates the retrieval of missing data and allows an optimized positioning of measurement units.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Belief propagation is an algorithm that is known from statistical physics and
computer science. It provides an efficient way of calculating marginals that
involve large sums of products which are efficiently rearranged into nested
products of sums to approximate the marginals. It allows a reliable estimation
of the state and its variance of power grids that is needed for the control and
forecast of power grid management. At prototypical examples of IEEE-grids we
show that belief propagation not only scales linearly with the grid size for
the state estimation itself, but also facilitates and accelerates the retrieval
of missing data and allows an optimized positioning of measurement units. Based
on belief propagation, we give a criterion for how to assess whether other
algorithms, using only local information, are adequate for state estimation for
a given grid. We also demonstrate how belief propagation can be utilized for
coarse-graining power grids towards representations that reduce the
computational effort when the coarse-grained version is integrated into a
larger grid. It provides a criterion for partitioning power grids into areas in
order to minimize the error of flow estimates between different areas.
Related papers
- Distributed Markov Chain Monte Carlo Sampling based on the Alternating
Direction Method of Multipliers [143.6249073384419]
In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers.
We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art.
In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
arXiv Detail & Related papers (2024-01-29T02:08:40Z) - Adversarial Likelihood Estimation With One-Way Flows [44.684952377918904]
Generative Adversarial Networks (GANs) can produce high-quality samples, but do not provide an estimate of the probability density around the samples.
We show that our method converges faster, produces comparable sample quality to GANs with similar architecture, successfully avoids over-fitting to commonly used datasets and produces smooth low-dimensional latent representations of the training data.
arXiv Detail & Related papers (2023-07-19T10:26:29Z) - Deep Learning-enabled MCMC for Probabilistic State Estimation in
District Heating Grids [0.0]
District heating grids are an important part of future, low-carbon energy systems.
We use Markov Chain Monte Carlo sampling in the space of network heat exchanges to estimate the posterior.
A deep neural network is trained to approximate the solution of the exact but slow non-linear solver.
arXiv Detail & Related papers (2023-05-24T08:47:01Z) - Robust Estimation for Nonparametric Families via Generative Adversarial
Networks [92.64483100338724]
We provide a framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems.
Our work extend these to robust mean estimation, second moment estimation, and robust linear regression.
In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance.
arXiv Detail & Related papers (2022-02-02T20:11:33Z) - Physics-Informed Graph Learning for Robust Fault Location in
Distribution Systems [2.984934409689467]
Rapid growth of distributed energy resources potentially increases power grid instability.
One promising strategy is to employ data in power grids to efficiently respond to abnormal events (e.g., faults) by detection and location.
We propose a physics-informed graph learning framework of two stages to handle these challenges when locating faults.
arXiv Detail & Related papers (2021-07-05T21:18:37Z) - Direct Measure Matching for Crowd Counting [59.66286603624411]
We propose a new measure-based counting approach to regress the predicted density maps to the scattered point-annotated ground truth directly.
In this paper, we derive a semi-balanced form of Sinkhorn divergence, based on which a Sinkhorn counting loss is designed for measure matching.
arXiv Detail & Related papers (2021-07-04T06:37:33Z) - Probabilistic Neural Network to Quantify Uncertainty of Wind Power
Estimation [3.4376560669160385]
A probabilistic neural network with Monte Carlo dropout is considered to quantify the model uncertainty of the power curve estimation.
The developed network captures both model and noise uncertainty which is found to be useful tools in assessing performance.
arXiv Detail & Related papers (2021-06-04T19:15:53Z) - FedPower: Privacy-Preserving Distributed Eigenspace Estimation [38.17106202734679]
We propose a class of algorithms called textsfFedPower within the federated learning (FL) framework.
textsfFedPower leverages the well-known power method by alternating multiple local power iterations and a global aggregation step.
We provide convergence bounds for textsfFedPower that are composed of different interpretable terms corresponding to the effects of Gaussian noise, parallelization, and random sampling of local machines.
arXiv Detail & Related papers (2021-03-01T02:33:20Z) - Physics-Informed Gaussian Process Regression for Probabilistic States
Estimation and Forecasting in Power Grids [67.72249211312723]
Real-time state estimation and forecasting is critical for efficient operation of power grids.
PhI-GPR is presented and used for forecasting and estimating the phase angle, angular speed, and wind mechanical power of a three-generator power grid system.
We demonstrate that the proposed PhI-GPR method can accurately forecast and estimate both observed and unobserved states.
arXiv Detail & Related papers (2020-10-09T14:18:31Z) - FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity
to Non-IID Data [59.50904660420082]
Federated Learning (FL) has become a popular paradigm for learning from distributed data.
To effectively utilize data at different devices without moving them to the cloud, algorithms such as the Federated Averaging (FedAvg) have adopted a "computation then aggregation" (CTA) model.
arXiv Detail & Related papers (2020-05-22T23:07:42Z) - Tractable learning in under-excited power grids [4.568911586155097]
We propose a novel learning algorithm for learning underexcited general (non-radial) networks based on physics-informed conservation laws.
We prove the correctness of our algorithm for grids with non-adjacent under-excited internal nodes.
Our approach is validated through simulations with non-linear voltage samples generated on test grids with real injection data.
arXiv Detail & Related papers (2020-05-04T19:54:48Z) - Block-Approximated Exponential Random Graphs [77.4792558024487]
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs.
We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions.
Our methods are scalable to sparse graphs consisting of millions of nodes.
arXiv Detail & Related papers (2020-02-14T11:42:16Z)
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.