Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTransmission System Resilience Enhancement with Extended Steady-state Security Region in Consideration of Uncertain Topology Changes
175
0
0.0
(
0
)
Added by
Chong Wang
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The increasing extreme weather events poses unprecedented challenges on power system operation because of their uncertain and sequential impacts on power systems. This paper proposes the concept of an extended steady-state security region (ESSR), and resilience enhancement for transmission systems based on ESSR in consideration of uncertain varying topology changes caused by the extreme weather events is implemented. ESSR is a ploytope describing a region, in which the operating points are within the operating constraints. In consideration of uncertain varying topology changes with ESSR, the resilience enhancement problem is built as a bilevel programming optimization model, in which the system operators deploy the optimal strategy against the most threatening scenario caused by the extreme weather events. To avoid the curse of dimensionality with regard to system topologies for a large scale system, the Monte Carlo method is used to generate uncertain system topologies, and a recursive McCormick envelope-based approach is proposed to connect generated system topologies to optimization variables. Karush Kuhn Tucker (KKT) conditions are used to transform the suboptimization model in the second level into a group of equivalent constraints in the first level. A simple test system and IEEE 118-bus system are used to validate the proposed.
rate research
Read More
Any industrial system goes along with objectives to be met (e.g. economic performance), disturbances to handle (e.g. market fluctuations, catalyst decay, unexpected variations in uncontrolled flow rates and compositions,...), and uncertainties about its behavior. In response to these, decisions must be taken and instructions be sent to the operators to drive and maintain the plant at satisfactory, yet potentially changing operating conditions. Over the past thirty years many methods have been created and developed to answer these questions. In particular, the field of Real-Time Optimization (RTO) has emerged that, among others, encompasses methods that allow the systematic improvement of the performances of the industrial system, using plant measurements and a potentially inaccurate tool to predict its behaviour, generally in the form of a model. Even though the definition of RTO can differ between authors, inside and outside the process systems engineering community, there is currently no RTO method, which is deemed capable of fully automating the aforementioned decision-making process. This thesis consists of a series of contributions in this direction, which brings RTO closer to being capable of a full plant automation. Keywords: Real-time optimization, Decision-making, Optimization, Reduced-order-model optimization, Autopilot for steady-state processes, Operational research.
We develop a data-driven approach to the computation of a-posteriori feasibility certificates to the solution sets of variational inequalities affected by uncertainty. Specifically, we focus on instances of variational inequalities with a deterministic mapping and an uncertain feasibility set, and represent uncertainty by means of scenarios. Building upon recent advances in the scenario approach literature, we quantify the robustness properties of the entire set of solutions of a variational inequality, with feasibility set constructed using the scenario approach, against a new unseen realization of the uncertainty. Our results extend existing results that typically impose an assumption that the solution set is a singleton and require certain non-degeneracy properties, and thereby offer probabilistic feasibility guarantees to any feasible solution. We show that assessing the violation probability of an entire set of solutions, rather than of a singleton, requires enumeration of the support constraints that shape this set. Additionally, we propose a general procedure to enumerate the support constraints that does not require a closed form description of the solution set, which is unlikely to be available. We show that robust game theory problems can be modelling via uncertain variational inequalities, and illustrate our theoretical results through extensive numerical simulations on a case study involving an electric vehicle charging coordination problem.
In this paper, we investigate a constrained optimal coordination problem for a class of heterogeneous nonlinear multi-agent systems described by high-order dynamics subject to both unknown nonlinearities and external disturbances. Each agent has a private objective function and a constraint about its output. A neural network-based distributed controller is developed for each agent such that all agent outputs can reach the constrained minimal point of the aggregate objective function with bounded residual errors. Two examples are finally given to demonstrate the effectiveness of the algorithm.
We consider the effect of parametric uncertainty on properties of Linear Time Invariant systems. Traditional approaches to this problem determine the worst-case gains of the system over the uncertainty set. Whilst such approaches are computationally tractable, the upper bound obtained is not necessarily informative in terms of assessing the influence of the parameters on the system performance. We present theoretical results that lead to simple, convex algorithms producing parametric bounds on the $mathcal{L}_2$-induced input-to-output and state-to-output gains as a function of the uncertain parameters. These bounds provide quantitative information about how the uncertainty affects the system.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
