اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMost probable failure scenario in a model power grid with random power demand
64
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a simple system with a local synchronous generator and a load whose power consumption is a random process. The most probable scenario of system failure (synchronization loss) is considered, and it is argued that its knowledge is virtually enough to estimate the probability of failure per unit time. We discuss two numerical methods to obtain the optimal evolution leading to failure.
قيم البحث
اقرأ أيضاً
Transmission line failures in power systems propagate and cascade non-locally. This well-known yet counter-intuitive feature makes it even more challenging to optimally and reliably operate these complex networks. In this work we present a comprehens
ive framework based on spectral graph theory that fully and rigorously captures how multiple simultaneous line failures propagate, distinguishing between non-cut and cut set outages. Using this spectral representation of power systems, we identify the crucial graph sub-structure that ensures line failure localization -- the network bridge-block decomposition. Leveraging this theory, we propose an adaptive network topology reconfiguration paradigm that uses a two-stage algorithm where the first stage aims to identify optimal clusters using the notion of network modularity and the second stage refines the clusters by means of optimal line switching actions. Our proposed methodology is illustrated using extensive numerical examples on standard IEEE networks and we discussed several extensions and variants of the proposed algorithm.
We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed into the grid to relieve congestion created by load growth or fluctuations of intermittent
renewable generation. We limit our selection of FACTS devices to those that can be represented by modification of the inductance of the transmission lines. Our master optimization problem minimizes the $l_1$ norm of the FACTS-associated inductance correction subject to constraints enforcing that no line of the system exceeds its thermal limit. We develop off-line heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) where at each step the constraints are linearized analytically around the current operating point. The algorithm is accelerated further with a version of the cutting plane method greatly reducing the number of active constraints during the optimization, while checking feasibility of the non-active constraints post-factum. This hybrid algorithm solves a typical single-contingency problem over the MathPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop---a speed up that allows the sizing and placement of a family of FACTS devices to correct a large set of anticipated contingencies. From testing of multiple examples, we observe that our algorithm finds feasible solutions that are always sparse, i.e., FACTS devices are placed on only a few lines. The optimal FACTS are not always placed on the originally congested lines, however typically the correction(s) is made at line(s) positioned in a relative proximity of the overload line(s).
Given the rise of electric vehicle (EV) adoption, supported by government policies and dropping technology prices, new challenges arise in the modeling and operation of electric transportation. In this paper, we present a model for solving the EV rou
ting problem while accounting for real-life stochastic demand behavior. We present a mathematical formulation that minimizes travel time and energy costs of an EV fleet. The EV is represented by a battery energy consumption model. To adapt our formulation to real-life scenarios, customer pick-ups and drop-offs were modeled as stochastic parameters. A chance-constrained optimization model is proposed for addressing pick-ups and drop-offs uncertainties. Computational validation of the model is provided based on representative transportation scenarios. Results obtained showed a quick convergence of our model with verifiable solutions. Finally, the impact of electric vehicles charging is validated in Downtown Manhattan, New York by assessing the effect on the distribution grid.
In this letter we propose a generalized branch model to be used in DC optimal power flow (DCOPF) applications. Besides AC lines and transformers, the formulation allows for representing variable susceptance branches, phase shifting transformers, HVDC
lines, zero impedance lines and open branches. The possibility to model branches with concurrently variable susceptance and controllable phase shift angles is also provided. The model is suited for use in DCOPF formulations aimed at the optimization of remedial actions so as to exploit power system flexibility; applications to small-, medium- and large-scale systems are presented to this purpose.
This paper proposes a cascading failure mitigation strategy based on Reinforcement Learning (RL). The motivation of the Multi-Stage Cascading Failure (MSCF) problem and its connection with the challenge of climate change are introduced. The bottom-le
vel corrective control of the MCSF problem is formulated based on DCOPF (Direct Current Optimal Power Flow). Then, to mitigate the MSCF issue by a high-level RL-based strategy, physics-informed reward, action, and state are devised. Besides, both shallow and deep neural network architectures are tested. Experiments on the IEEE 118-bus system by the proposed mitigation strategy demonstrate a promising performance in reducing system collapses.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
