ترغب بنشر مسار تعليمي؟ اضغط هنا

Voltage Analytics for Power Distribution Network Topology Verification

394   0   0.0 ( 0 )
 نشر من قبل Guido Cavraro
 تاريخ النشر 2017
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Distribution grids constitute complex networks of lines often times reconfigured to minimize losses, balance loads, alleviate faults, or for maintenance purposes. Topology monitoring becomes a critical task for optimal grid scheduling. While synchrophasor installations are limited in low-voltage grids, utilities have an abundance of smart meter data at their disposal. In this context, a statistical learning framework is put forth for verifying single-phase grid structures using non-synchronized voltage data. The related maximum likelihood task boils down to minimizing a non-convex function over a non-convex set. The function involves the sample voltage covariance matrix and the feasible set is relaxed to its convex hull. Asymptotically in the number of data, the actual topology yields the global minimizer of the original and the relaxed problems. Under a simplified data model, the function turns out to be convex, thus offering optimality guarantees. Prior information on line statuses is also incorporated via a maximum a-posteriori approach. The formulated tasks are tackled using solvers having complementary strengths. Numerical tests using real data on benchmark feeders demonstrate that reliable topology estimates can be acquired even with a few smart meter data, while the non-convex schemes exhibit superior line verification performance at the expense of additional computational time.

قيم البحث

اقرأ أيضاً

The dynamic response of power grids to small disturbances influences their overall stability. This paper examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes ${ca l H}_2$-norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. The efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network.
As a representative mathematical expression of power flow (PF) constraints in electrical distribution system (EDS), the piecewise linearization (PWL) based PF constraints have been widely used in different EDS optimization scenarios. However, the lin earized approximation errors originating from the currently-used PWL approximation function can be very large and thus affect the applicability of the PWL based PF constraints. This letter analyzes the approximation error self-optimal (ESO) condition of the PWL approximation function, refines the PWL function formulas, and proposes the self-optimal (SO)-PWL based PF constraints in EDS optimization which can ensure the minimum approximation errors. Numerical results demonstrate the effectiveness of the proposed method.
This paper considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effecti ve technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes infeasible for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, thus leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.
We propose a framework for integrating optimal power flow (OPF) with state estimation (SE) in the loop for distribution networks. Our approach combines a primal-dual gradient-based OPF solver with a SE feedback loop based on a limited set of sensors for system monitoring, instead of assuming exact knowledge of all states. The estimation algorithm reduces uncertainty on unmeasured grid states based on a few appropriate online state measurements and noisy pseudo-measurements. We analyze the convergence of the proposed algorithm and quantify the statistical estimation errors based on a weighted least squares (WLS) estimator. The numerical results on a 4521-node network demonstrate that this approach can scale to extremely large networks and provide robustness to both large pseudo measurement variability and inherent sensor measurement noise.
We study social networks and focus on covert (also known as hidden) networks, such as terrorist or criminal networks. Their structures, memberships and activities are illegal. Thus, data about covert networks is often incomplete and partially incorre ct, making interpreting structures and activities of such networks challenging. For legal reasons, real data about active covert networks is inaccessible to researchers. To address these challenges, we introduce here a network generator for synthetic networks that are statistically similar to a real network but void of personal information about its members. The generator uses statistical data about a real or imagined covert organization network. It generates randomized instances of the Stochastic Block model of the network groups but preserves this network organizational structure. The direct use of such anonymized networks is for training on them the research and analytical tools for finding structure and dynamics of covert networks. Since these synthetic networks differ in their sets of edges and communities, they can be used as a new source for network analytics. First, they provide alternative interpretations of the data about the original network. The distribution of probabilities for these alternative interpretations enables new network analytics. The analysts can find community structures which are frequent, therefore stable under perturbations. They may also analyze how the stability changes with the strength of perturbation. For covert networks, the analysts can quantify statistically expected outcomes of interdiction. This kind of analytics applies to all complex network in which the data are incomplete or partially incorrect.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا