GL Garrad Hassan Short term power forecasts for large offshore wind turbine arrays

Transcription

1 GL Garrad Hassan Short term power forecasts for large offshore wind turbine arrays Require accurate wind (and hence power) forecasts for 4, 24 and 48 hours in the future for trading purposes. Receive 4 forecasts from different NWP models. One problem is resolution: UK NWP models have a grid size of 4 square km, whereas a typical wind farm may be a few hundred square km. No knowledge of the NWP models but have (some) on-site measurements to combine with model outputs to improve the forecast.

2

3

4

5 NWP versus On-site measurements

6 Approaches split into two camps: Statistical analysis Linear regression analysis Probabilistic forecasting Modelling Auto regressive model 4D-Var data assimilation Artificial Neural Networks

7 Linear regression analysis Bias correction Optimal NWP as a linear combination of NWPs: NWP optimal w NWP 1 1 w2nwp2 w3nwp3 w4nwp4 w i Obtain using a least squares fit to the measurements from the first half of Forecast for the second half.

8

9 Linear regression analysis errors for second half of hour forecast NWP 1 NWP 2 NWP 3 NWP 4 NWP optimal RMS error hour forecast NWP 1 NWP 2 NWP 3 NWP 4 NWP optimal RMS error hour forecast NWP 1 NWP 2 NWP 3 NWP 4 NWP optimal RMS error

10 Auto regressive model

11 ANN for SCADA data SCADA is useful on a very short scale (<8 hours) Uses smoothed measured wind speed data, hourly average values of 10 min averages The simulation uses the average wind speed from the last K hours (K=1..96), the network is trained on N number of vectors of length K (N= ), estimates the wind speed with an H hour horizon (H=1..8)

12 ANN simulation results RMSE of the ANN is smaller than that of the average of the estimations of the four NWP models: RMSE of NWP average: RMSE of estimation: (about ~12% improvement) RMSE of persistence: Standard deviation: 2.271

13 Data Assimilation Observations

14 u b Background Estimate

15

16 u b u a Analysis Vector (Optimal Solution)

17

18

19 Re-run periodically

20 Resulting Equation 4D-Var Data Assimilation cost function J u 0 = (ub u 0 ) T B 1 u b u 0 L + [y l H l u l ] T R l 1 [ l=0 Optimal Solution u a = min u 0 J(u 0 ) y l H l (u l )]

21 Data for this Problem Aim: Estimate optimal initial condition for the ARMA model, x 0. m x n = i=1 a i x n i + ξ n+i To find the optimal solution from the model, we need optimal parameters to estimate x 0 (a i and ξ n+i fixed by training data). These are x 1,, x m. x l 1 x 1 x l 2 x 2 So let, u l = which implies u 0 =. x l m x m Use NWP data to find as u b for the a priori information to constrain the solution.

22 Making Probabilistic Forecasts for wind activity. Given point forecasts from 4 models and observations how can we make probabilistic forecasts of wind speed? First step If we don't have any specific knowledge of the future we can naively look at past observations. We call this the 'climatology'. We expect any useful model to do better than climatology.

23 Our simple approach (due to time constraints) is to create a climatological distribution modelled as a Gaussian distribution from a whole year's data.

24 We could also use climatology that is month or even date specific (data permitting).

25 Moving Variance of wind speed over a year

26 Ignorance Skill Score To compare our models we use the 'ignorance score' (Good, 1952) given by ign=-log 2 (p) where p is the amount of probability assigned to the true outcome. All ignorance scores are given relative to climatology (where a negative score means we are doing better).

27 Blending with climatology It is common to create new models that are a linear combination of a particular model and the climatology. We then have a distribution in the form P(y)= αp mod (y)+(1-α)p clim (y) where α is optimised in some way (Commonly to minimise the ignorance score).

28 A simple model To create a simple model from the data we take a Gaussian distribution with moving mean, averaged from the last 5 observations and a moving variance taken from the last 30 observations. The relative ignorance for this model is This means that our model does worse than climatology. However, when we blend with climatology, we get a relative ignorance score of (α=0.3)

29 Kernel Dressing Models We can turn point forecasts into probabilistic forecasts using kernel dressing. We replace each point forecast with a Gaussian distribution (also known as a kernel). The mean of the Gaussian distribution is just the point forecast with a bias correction from past experience. The standard deviation for each model is the mean error found from past experience.

30 Kernel Dressing Models This is done for all 4 NWP models We can compare the models using the relative ignorance score. Each one has been blended with climatology. NWP1 NWP2 NWP3 NWP

31 Kernel Dressing Models We can create a new model that is a weighted average of the other 4 models and blended with climatology. i.e. P(Y)=α(w 1 *P 1 (y)+w 2 P 2 (y)+w 3 P 3 (y)+w 4 P 4 (y))+(1 -α)*p clim (y) W 1 W 2 W 3 W 4 α Rel. ign

32 Kernel Dressing methods We chose our Kernel widths with a forecast using an individual model in mind, but given that the 4 models are likely to cover more possible outcomes, we might want to reduce the kernel widths. The results of halving them are shown below. W1 W2 W3 W4 alpha Rel. ign

33 Summary of Results First Gaussian Model 0.38 First Gaussian Model blended with climatology Individual models blended with climatology Weighted model using kernel widths from individual models and blended with climatology -0.93(NWP1) Weighted model using smaller kernel widths and blended with climatology

34 Possible future work Extend the work to more realistic distributions rather than Gaussian. Find probabilistic forecasts from ensembles. Find a way of optimising the weightings and kernel widths by minimising the ignorance score. Extend the work to probabilistic forecasts of power.

35 Artificial Neural Networks (ANN) with Gaussian Radial Basis Functions* * newgrnn is used in MATLAB

36 ANN for SCADA evaluation Evaluation is based on percentage reduction of the RMSE (Root Mean Square Error) compared to persistence (assuming the same wind speed H hours later as what is now)

37 ANN s for NWP values Training of the ANN Input: 30 hours ahead wind speeds calculated by four Numerical Weather Predictions (NWP1-4) Target: Measured wind speeds at the site 30 hours later Evaluation: results are compared to the estimation provided by the average of the four NWP s and persistence

38 Training & Results Limited number of data for training the network: 365 days 9am prediction for 3pm wind speed the next day and measured wind speeds at that time from SCADA data The RMS error decreases with the number of training data:

39 Conclusions Neural Networks (with Gaussian Radial Basis Functions) used for short term prediction of wind speed based on SCADA data exclusively do not provide significant improvement compared to persistence (naive estimator) maximum 5% improvement Longer term (30 hours) predictions using ANN s based on the four NWP inputs provide good results and significant improvement compared to averaging the NWP s at least 12% improvement (probably more if the network is trained on high amount of data, 300 was the maximum in this study) Combining the SCADA data and the NWP s data to form an input for the ANN would probably be able to provide better results for both long and short term; further investigation required