Search

The integration of variable renewable energy (VRE) generation, i.e., wind power and solar photovoltaic, brings significant uncertainty for the power system operation. Different with VRE techniques, concentrating solar power (CSP) is an appealing renewable generation technology due to its dispatch ability through the use of thermal energy storage and is thus expected to play a significant role in high renewable energy penetrated power systems. In this paper, we propose a look-ahead stochastic unit commitment model to operate power systems with CSP under high renewable energy penetration. It has a three-stage structure. The first stage optimizes the operational decisions in a day-ahead framework based on forecasts; the second stage minimizes the expected generation cost for possible realizations in the real time; and the third stage accounts for look-ahead operation in future operating days. This paper has a dual purpose: first, exploring how CSP plants operate in high renewable penetrated power systems; and second, analyzing the benefits of CSP in accommodating VRE generation. A case study on a modified IEEE RTS-79 system with actual solar and wind power data is provided to validate the proposed method. [ABSTRACT FROM AUTHOR]

The integration of high penetration of renewable energy brings greater uncertainties for the operation of future power systems due to its intermittency and lack of predictability. The uncertainties brought by wide scale renewables might have dependencies with each other because their outputs are mainly influenced by weather. However, an analysis of such uncertainties with complex dependencies faces the “curse of dimensionality”. This challenges the power system uncertainty analysis in probabilistic forecasting, power system operation optimization, and power system planning. This paper proposes an efficient approach that is able to handle high-dimensional dependencies. The approach uses the high-dimensional Copula theory and discrete convolution method to conduct a high-dimensional dependent discrete convolution (DDC) calculation. A recursive algorithm is proposed to decompose the computation of DDC into multiple convolutions between each pair of stochastic variables so that the “curse of dimensionality” is solved. The computational complexity of the proposed method is linear with respect to the number of dimensions and guarantees computational efficiency. Finally, illustrative examples of power system reserve requirement evaluation and wind power capacity credit assessment analysis are used to verify the effectiveness and superiority of the proposed approach. [ABSTRACT FROM PUBLISHER]