ﻻ يوجد ملخص باللغة العربية
Chance-constrained optimization (CCO) has been widely used for uncertainty management in power system operation. With the prevalence of wind energy, it becomes possible to consider the wind curtailment as a dispatch variable in CCO. However, the wind curtailment will cause impulse for the uncertainty distribution, yielding challenges for the chance constraints modeling. To deal with that, a data-driven framework is developed. By modeling the wind curtailment as a cap enforced on the wind power output, the proposed framework constructs a Gaussian process (GP) surrogate to describe the relationship between wind curtailment and the chance constraints. This allows us to reformulate the CCO with wind curtailment as a mixed-integer second-order cone programming (MI-SOCP) problem. An error correction strategy is developed by solving a convex linear programming (LP) to improve the modeling accuracy. Case studies performed on the PJM 5-bus and IEEE 118-bus systems demonstrate that the proposed method is capable of accurately accounting the influence of wind curtailment dispatch in CCO.
Recently, chance-constrained stochastic electricity market designs have been proposed to address the shortcomings of scenario-based stochastic market designs. In particular, the use of chance-constrained market-clearing avoids trading off in-expectat
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
High penetration of renewable generation poses great challenge to power system operation due to its uncertain nature. In droop-controlled microgrids, the voltage volatility induced by renewable uncertainties is aggravated by the high droop gains. Thi
Iterative trajectory optimization techniques for non-linear dynamical systems are among the most powerful and sample-efficient methods of model-based reinforcement learning and approximate optimal control. By leveraging time-variant local linear-quad
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