Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampled backward induction”

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.

Optimizing Distributed Photovoltaic System Set Points Under Uncertainty

We explore the potential for using dynamic programming (DP) and approximate dynamic programming (ADP) techniques to optimize the set points of distributed photovoltaic (DGPV) inverters under uncertainty about future DGPV deployment. We consider a case where a large (=1MW) system is installed first, and growth in deployment of small rooftop systems is anticipated, but uncertain. We find that for a real feeder (EPRI's J1 feeder), a significant reduction in the number and severity of voltage violations can be expected when DP or ADP is used compared to selecting set points based on the current conditions (the traditional myopic approach). Additionally, we find that using a simple ADP algorithm, sampled backward induction, is more than twice as fast as DP with similar outcomes.

14 SOLAR ENERGY↗

Stochastic Generation Capacity Expansion Planning with Approximate Dynamic Programming

Failing to consider the many long-term uncertainties that affect the performance of a power generation portfolio can result in suboptimal generation expansion plans. Further, traditional deterministic approaches can omit flexible plans that are able to adapt to future events. In this paper, we explore the use of approximate dynamic programming (ADP) to create forward-looking generation expansion plans. A case study is included with three sequential decision periods; three generation technologies; and four uncertainties: demand growth, natural gas prices, renewable portfolio standards, and the adoption of customer-driven solar generation. The flexible plans found through ADP show a 3 % reduction in total expected cost when compared to myopic planning heuristics while circumventing the computational burdens that accompany high-dimensional dynamic programs.

24 POWER TRANSMISSION AND DISTRIBUTION↗