Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “day-ahead forecasting”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

78 records · Page 5

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗

Spatiotemporal Downscaling Model for Solar Irradiance Forecast Using Nearest-Neighbor Random Forest and Gaussian Process

Accurate solar photovoltaic (PV) capacity estimation requires high-resolution, site-specific solar irradiance data to account for localized variability. However, global datasets, such as the National Solar Radiation Database (NSRDB), provide regional averages that fail to capture the fine-scale fluctuations critical for large-scale grid integration. This limitation is particularly relevant in the context of increasing distributed energy resources (DERs) penetration, such as rooftop PV. Additionally, it is critical to the implementation of the U.S. Federal Energy Regulatory Commission (FERC) Order 2222, which facilitates DER participation in U.S. bulk power markets. To address this challenge, this study evaluates Nearest-Neighbor Random Forest (NNRF) and Nearest-Neighbor Gaussian Process (NNGP) models for spatiotemporal downscaling of global solar irradiance data. By leveraging historical irradiance and meteorological data, these models incorporate spatial, temporal, and feature-based correlations to enhance local irradiance predictions. The NNRF model, a machine-learning approach, prioritizes computational efficiency and predictive accuracy, while the NNGP model offers a level of interpretability and prediction uncertainty by numerically quantifying correlations and dependencies in the data. Model validation was conducted using day-ahead predictions. The results showed that the average Goodness of Fit (GoF) of the NNRF model of 90.61% across all eight sites outperformed the GoF of the NNGP of 85.88%. Additionally, the computational speed of NNRF was 2.5 times faster than the NNGP. Finally, the NNGP displayed polynomial scaling while the NNRF scaled linearly with increasing number of nearest neighbors. Additional validation of the model on five sites in Puerto Rico further confirmed the superiority of the NNRF model over the NNGP model. These findings highlight the robustness and computational efficiency of NNRF for large-scale solar irradiance downscaling, making it a strong candidate for improving PV capacity estimation and real-time electricity market integration for DERs.

Asiedu, Shadrack (ORCID:0009000646004826)↗

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast: Preprint

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗

Development of Multiresolution Capabilities for the Holistic Energy Resource Optimization Network (HERON) tool A progress update

INL researchers work on technoeconomic analyses for integrated energy systems (IES) using the Framework for Optimization of ResourCes and Economics (FORCE). Within FORCE, researchers use the Holistic Energy Resource Optimization Network (HERON) tool to conduct optimization of grid portfolios under uncertain market conditions. These optimizations determine optimal capacities for all IES components and strategies for resource dispatch which maximize some economic metric (e.g., net present value). Resource dispatch occurs on finer timescales (typically hours) and thus are asked to respond to a given time series (e.g. hourly load demand profiles for a grid, or pre-determined electricity prices). Volatile and complex bidding dynamics as well as poorly forecasted weather events within deregulated markets add uncertainty to the time series; FORCE can address this uncertainty by training a reduced order model on historical time series and generate unique synthetic time series which represent individual scenarios or realizations of the market. The IES configuration can be simulated under these different sampled realizations and a stochastic optimization is conducted which optimizes the expected value of the desired economic metric. The training of a synthetic time series generator is limited by the chosen time resolution; dynamics can occur on different time scales. Seasonal demand trends can dominate faster dynamical events (such as power outages from certain sectors or severe weather events) which might not get captured correctly by the trained model. In this report, we investigate different ways of addressing the training and generation of time series on multiple time scales using three main algorithms: wavelet decomposition, dynamic mode decomposition, and generative adversarial networks for time series. We demonstrate a time series analysis that yields information on not just the frequency space but also temporal space: where a fast Fourier transform can provide what frequencies dominate, the new algorithms can provide when the frequencies dominate as well. These analyses can help improve IES optimization by allowing researchers to couple simulations at different timescales when it is most needed - seasonal, day-ahead, and real time optimization - with greater computational efficiency. Future work will include implementation of a subset of the proposed algorithms into the FORCE toolset and application of these analyses into multiple timescale optimization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Combined Day-ahead and Real-time approach for Scheduling Real and Reactive power dispatch of Battery Energy Storage System

A combined day-ahead (look-ahead) and real-time optimization approach is proposed to schedule BESS real and reactive power dispatch. The look ahead scheduling agent maximizes profit and essentially performs the function of energy arbitrage by looking at forecasted prices, network constraints and BESS operating conditions to generate real power dispatch schedule. While this schedule is followed, the real time optimization agent computes an optimum reactive power set-point (for a particular objective function) using optimal power flow framework. The concepts are implemented by co-simulating legacy tools and demonstrated on a large real world distribution system. In addition to the profits from energy arbitrage, optimum reactive power set point computation results in achieving desirable network attributes like flat voltage profiles and minimizing voltage deviations from desired value.

Bhatti, Bilal A.↗