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

Efficient Topology Design Algorithms for Power Grid Stability

184   0   0.0 ( 0 )
 نشر من قبل Siddharth Bhela
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




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

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 ${cal 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.



قيم البحث

اقرأ أيضاً

In recent years, the power systems research community has seen an explosion of novel methods for formulating the AC power flow equations. Consequently, benchmarking studies using the seminal AC Optimal Power Flow (AC-OPF) problem have emerged as the primary method for evaluating these emerging methods. However, it is often difficult to directly compare these studies due to subtle differences in the AC-OPF problem formulation as well as the network, generation, and loading data that are used for evaluation. To help address these challenges, this IEEE PES Task Force report proposes a standardized AC-OPF mathematical formulation and the PGLib-OPF networks for benchmarking AC-OPF algorithms. A motivating study demonstrates some limitations of the established network datasets in the context of benchmarking AC-OPF algorithms and a validation study demonstrates the efficacy of using the PGLib-OPF networks for this purpose. In the interest of scientific discourse and future additions, the PGLib-OPF benchmark library is open-access and all the of network data is provided under a creative commons license.
96 - Xinjia Chen , Kemin Zhou 2008
This paper considers the robust ${cal D}$-stability margin problem under polynomic structured real parametric uncertainty. Based on the work of De Gaston and Safonov (1988), we have developed techniques such as, a parallel frequency sweeping strategy , different domain splitting schemes, which significantly reduce the computational complexity and guarantee the convergence.
In the design flow of integrated circuits, chip-level verification is an important step that sanity checks the performance is as expected. Power grid verification is one of the most expensive and time-consuming steps of chip-level verification, due t o its extremely large size. Efficient power grid analysis technology is highly demanded as it saves computing resources and enables faster iteration. In this paper, a topology-base power grid transient analysis algorithm is proposed. Nodal analysis is adopted to analyze the topology which is mathematically equivalent to iteratively solving a positive semi-definite linear equation. The convergence of the method is proved.
113 - Xinjia Chen , Kemin Zhou , 2008
In this paper, we develop efficient randomized algorithms for estimating probabilistic robustness margin and constructing robustness degradation curve for uncertain dynamic systems. One remarkable feature of these algorithms is their universal applic ability to robustness analysis problems with arbitrary robustness requirements and uncertainty bounding set. In contrast to existing probabilistic methods, our approach does not depend on the feasibility of computing deterministic robustness margin. We have developed efficient methods such as probabilistic comparison, probabilistic bisection and backward iteration to facilitate the computation. In particular, confidence interval for binomial random variables has been frequently used in the estimation of probabilistic robustness margin and in the accuracy evaluation of estimating robustness degradation function. Motivated by the importance of fast computing of binomial confidence interval in the context of probabilistic robustness analysis, we have derived an explicit formula for constructing the confidence interval of binomial parameter with guaranteed coverage probability. The formula overcomes the limitation of normal approximation which is asymptotic in nature and thus inevitably introduce unknown errors in applications. Moreover, the formula is extremely simple and very tight in comparison with classic Clopper-Pearsons approach.
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 synchrop hasor 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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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