اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدChance Constrained Economic Dispatch Considering the Capability of Network Flexibility Against Renewable Uncertainties
118
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper introduces network flexibility into the chance constrained economic dispatch (CCED). In the proposed model, both power generations and line susceptances become variables to minimize the expected generation cost and guarantee a low probability of constraint violation in terms of generations and line flows under renewable uncertainties. We figure out the mechanism of network flexibility against uncertainties from the analytical form of CCED. On one hand, renewable uncertainties shrink the usable line capacities in the line flow constraints and aggravate transmission congestion. On the other hand, network flexibility significantly mitigates congestion by regulating the base-case line flows and reducing the line capacity shrinkage caused by uncertainties. Further, we propose an alternate iteration solver for this problem, which is efficient. With duality theory, we propose two convex subproblems with respect to generation-related variables and network-related variables, respectively. A satisfactory solution can be obtained by alternately solving these two subproblems. The case studies on the IEEE 14-bus system and IEEE 118-bus system suggest that network flexibility contributes much to operational economy under renewable uncertainties.
قيم البحث
اقرأ أيضاً
This paper proposes a robust transient stability constrained optimal power flow problem that addresses renewable uncertainties by the coordination of generation re-dispatch and power flow router (PFR) tuning.PFR refers to a general type of network-si
de controller that enlarges the feasible region of the OPF problem. The coordination between network-side and generator-side control in the proposed model is more general than the traditional methods which focus on generation dispatch only. An offline-online solution framework is developed to solve the problem efficiently. Under this framework the original problem is significantly simplified, so that we only need to solve a low-dimensional deterministic problem at the online stage to achieve real-time implementation with a high robustness level. The proposed method is verified on the modified New England 39-bus system. Numerical results demonstrate that the proposed method is efficient and shows good performance on economy and robustness.
With the large-scale integration of renewable power generation, frequency regulation resources (FRRs) are required to have larger capacities and faster ramp rates, which increases the cost of the frequency regulation ancillary service. Therefore, it
is necessary to consider the frequency regulation cost and constraint along with real-time economic dispatch (RTED). In this paper, a data-driven distributionally robust optimization (DRO) method for RTED considering automatic generation control (AGC) is proposed. First, a Copula-based AGC signal model is developed to reflect the correlations among the AGC signal, load power and renewable generation variations. Secondly, samples of the AGC signal are taken from its conditional probability distribution under the forecasted load power and renewable generation variations. Thirdly, a distributionally robust RTED model considering the frequency regulation cost and constraint is built and transformed into a linear programming problem by leveraging the Wasserstein metric-based DRO technique. Simulation results show that the proposed method can reduce the total cost of power generation and frequency regulation.
The correlations of multiple renewable power plants (RPPs) should be fully considered in the power system with very high penetration renewable power integration. This paper models the uncertainties, spatial correlation of multiple RPPs based on Copul
a theory and actual probability historical histograms by one-dimension distributions for economic dispatch (ED) problem. An efficient dynamic renewable power scenario generation method based on Gibbs sampling is proposed to generate renewable power scenarios considering the uncertainties, spatial correlation and variability (temporal correlation) of multiple RPPs, in which the sampling space complexity do not increase with the number of RPPs. Distribution-based and scenario-based methods are proposed and compared to solve the real-time ED problem with multiple RPPs. Results show that the proposed dynamic scenario generation method is much more consist with the actual renewable power. The proposed ED methods show better understanding for the uncertainties, spatial and temporal correlations of renewable power and more economical compared with the traditional ones.
Continued great efforts have been dedicated towards high-quality trajectory generation based on optimization methods, however, most of them do not suitably and effectively consider the situation with moving obstacles; and more particularly, the futur
e position of these moving obstacles in the presence of uncertainty within some possible prescribed prediction horizon. To cater to this rather major shortcoming, this work shows how a variational Bayesian Gaussian mixture model (vBGMM) framework can be employed to predict the future trajectory of moving obstacles; and then with this methodology, a trajectory generation framework is proposed which will efficiently and effectively address trajectory generation in the presence of moving obstacles, and also incorporating presence of uncertainty within a prediction horizon. In this work, the full predictive conditional probability density function (PDF) with mean and covariance is obtained, and thus a future trajectory with uncertainty is formulated as a collision region represented by a confidence ellipsoid. To avoid the collision region, chance constraints are imposed to restrict the collision probability, and subsequently a nonlinear MPC problem is constructed with these chance constraints. It is shown that the proposed approach is able to predict the future position of the moving obstacles effectively; and thus based on the environmental information of the probabilistic prediction, it is also shown that the timing of collision avoidance can be earlier than the method without prediction. The tracking error and distance to obstacles of the trajectory with prediction are smaller compared with the method without prediction.
In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of simple-approximating s
ets of given complexity. A probabilistic scaling procedure then allows to rescale these sets to obtain the desired probabilistic guarantees. The proposed approach is shown to be applicable in several problem in systems and control, such as the design of Stochastic Model Predictive Control schemes or the solution of probabilistic set membership estimation problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
