Search NASA⌕ Search

SEARCH · Search NASA

Results for “DISPATCH”

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.

At least 271 records · Page 15

Dispatch analysis of flexible power operation with multi-unit small modular reactors

The relevance of nuclear power plant flexible power operation (FPO) is rising due to increased penetration of variable renewables. Small Modular Reactors (SMRs) such as NuScale are envisaged to have multiple units on one site. This provides opportunities for coordinating FPO between units, but also introduces challenges as common services (e.g., refueling equipment) must be shared between units and fuel loadings may be standardized. It is therefore important to quantify whether FPO with SMRs is economically beneficial. Here, this paper quantifies the economics of FPO on different timescales to analyze refueling outages of such multi-unit SMRs. A 24-h price-taker profit maximization of SMR operation is first solved considering revenues from wholesale power and ancillary service (AS) markets. The results are then used to find the most profitable operation strategy over several years for multiple units at the site accounting for the physics and materials limits on NPP operation, including refueling outages. Results show a small but appreciable participation of nuclear into AS, contributing 4% of revenues. Due to the longer fuel cycle, over a decade of operation the units’ refueling outages drifted by 3 months, ultimately leading to refueling during summer.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Convex Q-Learning in Continuous Time with Application to Dispatch of Distributed Energy Resources

Convex Q-learning is a recent approach to reinforcement learning, motivated by the possibility of a firmer theory for convergence, and the possibility of making use of greater a priori knowledge regarding policy or value function structure. This paper explores algorithm design in the continuous time domain, with a finite-horizon optimal control objective. The main contributions are (i) The new Q-ODE: a model-free characterization of the Hamilton-Jacobi-Bellman equation. (ii) A formulation of Convex Q-learning that avoids approximations appearing in prior work. The Bellman error used in the algorithm is defined by filtered measurements, which is necessary in the presence of measurement noise. (iii) Convex Q-learning with linear function approximation is a convex program. It is shown that the constraint region is bounded, subject to an exploration condition on the training input. (iv) The theory is illustrated in application to resource allocation for distributed energy resources, for which the theory is ideally suited.

Lu, Fan↗