Distributed state estimation: a novel stopping criterion
Power System State Estimation (PSSE) has been a research area of interest for power engineers for a long period of time. Due to the intermittent nature of renewable energy sources, which are applied in the power network more than before, the importance of state estimation has been increased as well. Centralized state estimation due to the complexity of new networks and growing size of power network will face problems such as communication bottleneck in real-time analyzing of the system or reliability issues. Distributed state estimation is a solution for the mentioned issues. There are different implementation methods introduced for it. The results of the paper are twofold. First, we examined different approaches to distributed PSSE (DPSSE) problem, according to most important factors like iteration number, convergence rate, data needed to be transferred to/from each area and so on. Next, we proposed and discussed a new distributed stopping criterion for the methods and above-mentioned factors are obtained as well. Finally, a comparison between the total efficiency of all applied methods is done.
Code (0)
등록된 구현이 없습니다.
Tasks
State EstimationSimilar Papers 제목 키워드 기반
An $(ε,δ)$-accurate level set estimation with a stopping criterion
The level set estimation problem seeks to identify regions within a set of candidate points where an unknown and costly to evaluate function's value exceeds a specified threshold, providing an efficient alternative to ex…
A new stopping criterion for the mean shift iterative algorithm
The mean shift iterative algorithm was proposed in 2006, for using the entropy as a stopping criterion. From then on, a theoretical base has been developed and a group of applications has been carried out using this algo…
SegmentationComments on A New Parity Check Stopping Criterion for Turbo Decoding
A parity-check stopping (PCS) criterion for turbo decoding is proposed in [1], which shows its priority compared with the stopping criteria of Sign Change Ratio (SCR), Sign Difference Ratio (SDR), Cross Entropy (CE) and …
Distributed finite-time termination for consensus algorithm in switching topologies
In this article, we present a finite time stopping criterion for consensus algorithms in networks with dynamic communication topology. Recent results provide asymptotic convergence to the consensus algorithm. However, th…
Stopping Bayesian Optimization with Probabilistic Regret Bounds
Bayesian optimization is a popular framework for efficiently tackling black-box search problems. As a rule, these algorithms operate by iteratively choosing what to evaluate next until some predefined budget has been exh…
Bayesian Optimization