Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic programming”

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 127 records · Page 7

Occupancy-Driven Stochastic Decision Framework for Ranking Commercial Building Loads

For effective integration of building operations into the evolving demand response programs of the power grid, real-time decisions concerning the use of building appliances for grid services must excel on multiple criteria, ranging from the added value to occupants' comfort to the quality of the grid services. In this paper, we present a data-driven stochastic decision-support framework to dynamically rank load control alternatives in a commercial building, addressing the needs of multiple decision criteria (e.g. occupant comfort, grid service quality) under uncertainties in occupancy patterns. We adopt a stochastic multi-criteria decision algorithm recently applied to prioritize residential on/off loads, and extend it to i) consider complex load control decisions (e.g. dimming of lights, changing zone temperature set-points) in a commercial building; and ii) systematically integrate zonal occupancy patterns to better identify short-term (and time-varying) opportunities for grid service participation. We evaluate the performance of the proposed framework for curtailment of air-conditioning, lighting, and plug-loads in a multi-zone commercial office building for a range of design choices. With the help of a prototype system that integrates an interactive \textit{Data Analytics and Visualization} frontend we demonstrate a way for the building operators to monitor and change in real-time the available flexibility in energy consumption and to develop trust in the decision recommendations by interpreting the rationale behind the ranking.

Jain, Milan↗

Statistical patterns of theory uncertainties

A comprehensive uncertainty estimation is vital for the precision program of the LHC. While experimental uncertainties are often described by stochastic processes and well-defined nuisance parameters, theoretical uncertainties lack such a description. We study uncertainty estimates for cross-section predictions based on scale variations across a large set of processes. We find patterns similar to a stochastic origin, with accurate uncertainties for processes mediated by the strong force, but a systematic underestimate for electroweak processes. We propose an improved scheme, based on the scale variation of reference processes, which reduces outliers in the mapping from leading order to next-to-leading-order in perturbation theory.

Ghosh, Aishik↗

Optimal mitigation and control over power system dynamics for stochastic grid resilience

Optimal mitigation planning for highly disruptive contingencies to a transmission-level power system requires optimization with dynamic power system constraints, due to the key role of dynamics in system stability to major perturbations. We formulate a generalized disjunctive program to determine optimal grid component hardening choices for protecting against major failures, with differential algebraic constraints representing system dynamics (specifically, differential equations representing generator and load behavior and algebraic equations representing instantaneous power balance over the transmission system). We optionally allow stochastic optimal pre-positioning across all considered failure scenarios, and optimal emergency control within each scenario. This novel formulation allows, for the first time, analyzing the resilience interdependencies of mitigation planning, preventive control, and emergency control. Using all three strategies in concert is particularly effective at maintaining robust power system operation under severe contingencies, as we demonstrate on the western system coordinating council 9-bus test system using synthetic multi-device outage scenarios.

30 DIRECT ENERGY CONVERSION↗

First Results of the IOTA Ring Research at Fermilab

The IOTA ring at Fermilab is a unique machine exclusively dedicated to accelerator beam physics R&D. The research conducted at IOTA includes topics such as nonlinear integrable optics, suppression of coherent beam instabilities, optical stochastic cooling and quantum science experiments. In this talk we report on the first results of experiments with implementations of nonlinear integrable beam optics. The first of its kind practical realization of a two-dimensional integrable system in a strongly-focusing storage ring was demonstrated allowing among other things for stable beam circulation near or at the integer resonance. Also presented will be the highlights of the world’s first demonstration of optical stochastic beam cooling and other selected results of IOTA’s broad experimental program.

43 PARTICLE ACCELERATORS↗

Risk-averse optimization for resilience enhancement of complex engineering systems under uncertainties

With the growth of complexity and extent, large scale interconnected network systems, e.g., transportation networks or infrastructure networks, become more vulnerable to external disturbances. Hence, managing potential disruptive events during the design, operating, and recovery phase of an engineered system and therefore improving the system’s resilience is an important yet challenging task. Here, to ensure system resilience after the occurrence of failure events, this study proposes a mixed-integer linear programming (MILP) based restoration framework using heterogeneous dispatchable agents. The scenario-based stochastic optimization (SO) technique is adopted to deal with the inherent uncertainties imposed on the recovery process from nature. Moreover, different from conventional SO using deterministic equivalent formulations, the CVaR risk measure is implemented for this study because of the temporal sparsity of the decision making in applications such as the recovery from extreme events. The resulting restoration framework involves a large-scale MILP problem and thus an adequate decomposition technique i.e. modified Lagrangian dual decomposition, is also employed to achieve tractable computational complexity. Case study results based on the IEEE 37-bus test feeder demonstrate the benefits of using the proposed framework for resilience improvement as well as the advantages of adopting SO formulations.

42 ENGINEERING↗

Uncertainty-Informed Operation Coordination in a Water-Energy Nexus

The widespread deployment of smart heterogeneous technologies and the growing complexity in our modern society calls for effective coordination of the interdependent lifeline networks. In particular, operation coordination of electric power and water infrastructures is urgently needed as the water system is one of the most energy-intensive networks, an interruption in which may quickly evolve into a dramatic societal concern. This paper develops a novel analytic for uncertainty-aware day-ahead operation optimization of the interconnected power and water systems (PaWS). Joint probabilistic constraint (JPC) programming is employed to capture the uncertainties in wind resources and water demand forecasts. The proposed integrated stochastic model is presented as a non-linear non-convex optimization problem, where the non-linear hydraulic constraints in the water network are linearized using piece-wise linearization technique, and the non-convexity is efficiently tackled with a solution methodology to convert the proposed model with JPCs to a tractable mixed-integer linear programming (MILP) formulation that can be quickly solved to optimality. Here, the suggested framework is applied to a 15-node commercial-scale water network jointly operated with a power transmission system using a modified IEEE 57-bus test system. The numerical results demonstrate the of the proposed stochastic framework, resulting in cost reduction (13% on average when compared to the traditional setting) and energy saving of the integrated model under different realizations of uncertain renewable energy sources (RESs) and water demand scenarios. Additionally, the scalability of the proposed model is tested on a modified IEEE 118-bus test system connected to five water networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Demand Driven Cycamore Archetypes

Future nuclear fuel cycle options may present advantages over today’s once-through fuel cycle. Nuclear fuel cycle simulation tools assess the performance of those fuel cycles as well as the dynamics of long-term technology transitions. In many nuclear fuel cycle simulation tools, it has historically been the responsibility of the user to manually define facility deployment schemes and all facility parameters. While this is straightforward in simple fuel cycles, transitions from one fuel cycle to another can be more complex. In particular, deployment schemes for supportive fuel cycle facilities beyond the reactor become complex if the analyst desires to avoid gaps in the nuclear fuel and power supply chain during those transition scenarios. As nuclear fuel cycle analysis approaches questions regarding the feasibility and performance of the deployment schemes and technology choices during technology transition, automation of this historically manual process is necessary. The main objective of this work was to develop and demonstrate Cyclus automation capabilities toward key nuclear fuel cycle transition scenarios. While deploying reactors to meet power demand is trivial, and existed in the earliest versions of CYCLUS, automated, predictive deployment and decommissioning of other facilities is more complex. These include mining, milling, enrichment, fuel fabrication, reprocessing, and others. For example, a balanced closed fuel cycle may require ensuring that there is enough fast reactor fuel for their operation and may drive deployment of a fleet of light water reactors. This concern comprises the main challenge that drove the project effort. The Demand-Driven Cycamore Archetype project (NEUP-FY16-10512) aimed to develop CYCAMORE demand-driven deployment capabilities and thereby automate transition scenario definition. The developed software package, d3ploy, in the form of a CYCLUS Institution agent, deploys Facilities to meet the front-end and back-end demands of the fuel cycle. The University of South Carolina and the University of Illinois applied multiple algorithmic approaches to this challenge. This project developed an in situ demand-driven development schedule calculation through non-optimizing, deterministic-optimizing, and stochastic-optimizing algorithms as CYCLUS archetypes and demonstrated these new archetypes in program-supporting fuel cycle transition scenarios. Both objectives were achieved. This report documents the results and deliverables obtained toward these achievements in detail.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Adaptive PID Gain Scheduling Control for Hydropower Turbine Using Neural CDE and Stochastic Distribution Shaping

This paper introduces a gain-scheduling PID controller design strategy for hydroturbine frequency control mode. This scheme first uses real data to learn the nonlinear dynamics of the hydroturbine using neural controlled differential equations and then perturbs the obtained nonlinear system at different equilibrium points, based on which a static output feedback adaptive dynamic programming algorithm is then used to optimize the PID gains for each equilibrium point. Moreover, a continuous-time version of stochastic distribution control is proposed to further fine-tune the optimized PID gains. Finally, the controller is obtained by implementing linear interpolation between the optimized PID control gains. The simulation results show that the proposed gain-scheduling PID controller can control a larger range of operation points compared with the given fixed PID controller and the baseline method. Compared with the given fixed PID controller, the proposed gain-scheduling PID controller can regulate hydroturbine frequency against disturbances induced by power-load variation with over 50% less overshoot for some operation points.

13 HYDRO ENERGY↗

Crossing the Streams – Sampler and the TemplateEngine [Slides]

This presentation discusses Sampler, which is a versatile UQ and parametric study tool that can be applied to any SCALE Sequence. Sampler can perturb any quantity in any SCALE input. Recent work at ORNL has developed new types of covariance data that allow Sampler UQ to be applied to nearly all SCALE applications, including reactor depletion, UNF fuel characterization, source term analysis, and decay heat calculation. In SCALE 6.2 releases, CE data in transport cannot be perturbed. Sampler was originally designed for stochastic sampling with any sequence within SCALE and Parametric capability added in SCALE 6.2.2. Sampler can be used for uncertainty quantification, including sample data in static or depletion calculations and sample inputs for uncertainties in compositions and dimensions. The SCALE TemplateEngine allows for expanding templates to full inputs and the combination provides a powerful UQ tool.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Developing and Testing a Novel Stochastic Ice Microphysics Parameterization for Cloud and Climate Models Using ARM Field Campaign Data (Final Progress Report)

The major goals of this project were: 1) to use field campaign measurements from DOE’s Atmospheric Radiation Measurement (ARM) program to characterize variability of important parameters describing properties of ice particles in the atmosphere; 2) based on this observational analysis, to develop a parameterization scheme for weather and climate models that stochastically varies these parameters, and implement the new scheme into a weather model called the Weather Research and Forecasting model (WRF); 3) to use WRF coupled with the new stochastic scheme to simulate ARM field campaign thunderstorm cases and analyze how accounting for this parameter variability affects the model simulations. This work was performed jointly between the National Center for Atmospheric Research, University of Oklahoma, and University of Utah. To accomplish these goals, we extended an approach previously developed to characterize the variability in the size distribution of ice particles to parameters that are explicitly represented in models (i.e., relationships between ice particle mass and size, and between particle fall velocity and size). Our project was, to our knowledge, the first to apply observationally-constrained estimates of this parameter variability describing mass-size and fall velocity-size in a modeling framework. Our results showed efficacy of the approach, evaluated using ARM observations. Similarly, to our knowledge, work in this project was the first to propose and evaluate in detail a stochastic approach for unresolved turbulent mixing in high-resolution model simulations against detailed, benchmark large eddy simulations and ARM observations. Results showed some promising behavior, particularly with increased mixing and dilution of air in thunderstorm cores with surrounding environmental air, bringing the stochastic simulations closer to the benchmark large eddy simulations; however, results were somewhat degraded using stochastic mixing compared to observations from the AMIE/DYNAMO field campaign. This project also further refined and applied a modeling methodology called “piggybacking” that can robustly separate dynamical and thermodynamic impacts of model changes, and comparison studies of different models based on cases developed from ARM observations. Finally, this project directly supported three graduate students who completed their PhDs as well as a postdoctoral research fellow.

54 ENVIRONMENTAL SCIENCES↗

Stochastic Models, Indices & Optimization Algorithms for Pricing & Hedging Reliability Risks in Modern Power Grids: Data Plan - Princeton

We collected and cleaned the synthetic grid data produced by NREL for the Texas and New York synthetic grids. We developed a high dimensional joint stochastic model for load at the zone level, and solar and wind power productions at the asset level, capturing the spatial and temporal dependencies between all the variables, and demonstrated how such a model could be fitted to historical data. We designed and implemented a simulation engine which can produce Monte Carlo scenarios for the hourly day-ahead values of load, and solar and wind power productions at the spatial and temporal resolutions of the historical data used to fit the model. Finally we developed an open-source Python package which can, from an input grid model, efficiently use forecasts and large numbers of Monte Carlo scenarios to provide unit commitment and economic dispatch for each of these scenarios. The high dimensional stochastic model and the subsequent Monte Carlo simulation engine were implemented in the package PGscen and the corresponding UC and ED optimization programs in the package Vatic.

14 SOLAR ENERGY↗

Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs

We study solution sensitivity for nonlinear programs (NLPs) whose structures are induced by graphs. These NLPs arise in many applications such as dynamic optimization, stochastic optimization, optimization with partial differential equations, and network optimization. We illustrate that for a given pair of nodes, the sensitivity of the primal-dual solution at one node against a data perturbation at the other node decays exponentially with respect to the distance between these two nodes on the graph. In other words, the solution sensitivity decays as one moves away from the perturbation point. This result, which we call exponential decay of sensitivity, holds under the strong second-order sufficiency condition and the linear independence constraint qualification. We also present conditions under which the decay rate remains uniformly bounded; this allows us to characterize the sensitivity behavior of NLPs defined over subgraphs of infinite graphs. The theoretical developments are illustrated with numerical examples.

97 MATHEMATICS AND COMPUTING↗

RAVEN Theory Manual

RAVEN is a software framework able to perform parametric and stochastic analysis based on the response of complex system codes. The initial development was aimed at providing dynamic risk analysis capabilities to the thermohydraulic code RELAP-7, currently under development at Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose stochastic and uncertainty quantification platform, capable of communicating with any system code. In fact, the provided Application Programming Interfaces (APIs) allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating system response and explore input space using various sampling schemes such as Monte Carlo, grid, or Latin hypercube. However, RAVEN strength lies in its system feature discovery capabilities such as: constructing limit surfaces, separating regions of the input space leading to system failure, and using dynamic supervised learning techniques. The development of RAVEN started in 2012 when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework arose. RAVEN’s principal assignment is to provide the necessary software and algorithms in order to employ the concepts developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just to identify the frequency of an event potentially leading to a system failure, but the proximity (or lack thereof) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. peak pressure in a pipe) is exceeded under certain conditions. Most of the capabilities, implemented having RELAP-7 as a principal focus, are easily deployable to other system codes. For this reason, several side activates have been employed (e.g. RELAP5-3D, any MOOSE-based App, etc.) or are currently ongoing for coupling RAVEN with several different software. The aim of this document is to provide a set of commented examples that can help the user to become familiar with the RAVEN code usage.

97 MATHEMATICS AND COMPUTING↗

Bi-Level Adaptive Storage Expansion Strategy for Microgrids Using Deep Reinforcement Learning

Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches for BES expansion planning for MGs are computationally complicated. This work proposes a data-driven bi-level multi-period BES expansion planning framework to determine the siting, sizing, and timing of BES installations. The proposed planning framework unifies deep reinforcement learning (DRL) and linear programming, thereby decoupling the determinations for the integer and continuous decision variables in two time scales, respectively. In the upper level, a rainbow DRL agent with quantile regression is trained to provide dynamic planning policies to accommodate stochastic renewable energy resources (RESs), load, and battery price changes efficiently. Further, the lower level computes the optimal operation of MGs with frequency constraints to hedge the islanding contingency. The two levels communicate with one another by exchanging storage configuration and operating expenses in order to accomplish the shared goal of minimizing investment and operation costs. Comparative case studies on an MG are carried out to demonstrate the superiority of the proposed DRL-based solution to the mixed-integer linear programming counterpart on efficiency, scalability, and adaptability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗

Numerical modeling of a proof-of-principle experiment on optical stochastic cooling at an electron storage ring

Cooling of beams circulating in storage rings is critical for many applications including particle colliders and synchrotron light sources. A method enabling unprecedented beam-cooling rates, optical stochastic cooling (OSC), was recently demonstrated in the Integrable Optics Test Accelerator (IOTA) electron storage ring at Fermilab [J. Jarvis , ]. This paper describes the numerical implementation of the OSC process in the particle-tracking program and discusses the validation of the developed model with available experimental data. The model is also employed to highlight some features associated with different modes of operation of OSC. The developed simulation tool should be valuable in guiding future configurations of optical stochastic cooling and, more broadly, modeling self-field-based beam manipulations. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗