Search NASA⌕ Search

SEARCH · Search NASA

Results for “objective function”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

SICOPOLIS-AD v1: an open-source adjoint modeling framework for ice sheet simulation enabled by the algorithmic differentiation tool OpenAD

We present a new capability of the ice sheet model SICOPOLIS that enables flexible adjoint code generation via source transformation using the open-source algorithmic differentiation (AD) tool OpenAD.The adjoint code enables efficient calculation of the sensitivities of a scalar-valued objective function or quantity of interest (QoI) to a range of important, often spatially varying and uncertain model input variables, including initial and boundary conditions, as well as model parameters.Compared to earlier work on the adjoint code generation of SICOPOLIS, our work makes several important advances:(i) it is embedded within the up-to-date trunk of the SICOPOLIS repository – accounting for 1.5 decades of code development and improvements – and is readily available to the wider community;(ii) the AD tool used, OpenAD, is an open-source tool;(iii) the adjoint code developed is applicable to both Greenland and Antarctica, including grounded ice as well as floating ice shelves, with an extended choice of thermodynamical representations.A number of code refactorization steps were required. They are discussed in detail in an Appendix as they hold lessons for the application of AD to legacy codes at large.As an example application, we examine the sensitivity of the total Antarctic Ice Sheet volume to changes in initial ice thickness, austral summer precipitation, and basal and surface temperatures across the ice sheet.Simulations of Antarctica with floating ice shelves show that over 100 years of simulation the sensitivity of total ice sheet volume to the initial ice thickness and precipitation is almost uniformly positive, while the sensitivities to surface and basal temperature are almost uniformly negative. Sensitivity to austral summer precipitation is largest on floating ice shelves from Queen Maud to Queen Mary Land. The largest sensitivity to initial ice thickness is at outlet glaciers around Antarctica. Comparison between total ice sheet volume sensitivities to surface and basal temperature shows that surface temperature sensitivities are higher broadly across the floating ice shelves, while basal temperature sensitivities are highest at the grounding lines of floating ice shelves and outlet glaciers. A uniformly perturbed region of East Antarctica reveals that, among the four control variables tested here, total ice sheet volume is the most sensitive to variations in austral summer precipitation as formulated in SICOPOLIS.Comparison between adjoint- and finite-difference-derived sensitivities shows good agreement, lending confidence that the AD tool is producing correct adjoint code.The new modeling infrastructure is freely available at http://www.sicopolis.net (last access: 2 April 2020) under the development trunk.

58 GEOSCIENCES↗
DOE OSTI2022

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗
DOE OSTI2026

Reference floating wind array designs for three representative regions

This work presents the systematic development of three open-source reference floating wind array designs. The designs are tailored to representative site conditions for three regions of the United States: Humboldt Bay off the coast of California, the Gulf of Maine, and the Gulf of America. We adopted existing reference designs for the individual 15 MW turbines, semisubmersible floating platforms, substations, mooring systems, and power cables – integrating and adapting them as needed for each location. We adapted existing dynamic cable designs to use larger conductor sizes to meet the arrays' power transmission requirements, and we set up redundant mooring systems for each substation. The layout of each array is a uniform-grid design optimized to approximately minimize the levelized cost of energy (LCOE) within a square lease area while satisfying spatial constraints. These constraints ensure adequate clearances between adjacent turbines and between underwater components during the layout optimization to prevent clashing and ensure that all components reside within the lease boundaries. Substations are included to allow accounting for intra-array cable costs. They are placed within the uniform grid to maintain the navigability of the arrays. For each feasible layout considered, annual energy production and cable routing costs are calculated and updated in the LCOE objective function. After the optimization, we refined the cable routing with a mix of algorithmic and manual methods to ensure that the cables avoid mooring system components and approach the substation with adequate clearances. We confirmed the suitability of each reference array's layout by comparing the wake losses at each wind heading angle to the wind rose, observing that the optimized layouts largely avoid wake losses in the predominant wind directions. These reference arrays provide open-source baseline designs to enable future research and innovation of floating wind technology at the array scale.

17 WIND ENERGY↗
DOE OSTI2022

FLOW Estimation and Rose Superposition (FLOWERS): an integral approach to engineering wake models

Abstract. Annual energy production (AEP) is often the objective function in wind plant layout optimization studies. The conventional method to compute AEP for a wind farm is to first evaluate power production for each discrete wind direction and speed using either computational fluid dynamics simulations or engineering wake models. The AEP is then calculated by weighted-averaging (based on the wind rose at the wind farm site) the power produced across all wind directions and speeds. We propose a novel formulation for time-averaged wake velocity that incorporates an analytical integral of a wake deficit model across every wind direction. This approach computes the average flow field more efficiently, and layout optimization is an obvious application to exploit this benefit. The clear advantage of this new approach is that the layout optimization produces solutions with comparable AEP performance yet is completed 2 orders of magnitude faster. The analytical integral and the use of a Fourier expansion to express the wind speed and wind direction frequency create a relatively smooth solution space for the gradient-based optimizer to excel in comparison to the existing weighted-averaging power calculation.

17 WIND ENERGY↗
DOE OSTI2021

Dataset from: "Adjoint methods for quasisymmetry of vacuum fields on a surface"

Adjoint methods can speed up stellarator optimisation by providing gradient information more efficiently compared to finite-difference evaluations. Adjoint methods are herein applied to vacuum magnetic fields, with objective functions targeting quasisymmetry and a rotational transform value on a surface. To measure quasisymmetry, a novel way of evaluating approximate flux coordinates on a single flux surface without the assumption of a neighbourhood of flux surfaces is proposed. The shape gradients obtained from the adjoint formalism are evaluated numerically and verified against finite-difference evaluations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Design and Optimization of Processes for Recovering Rare Earth Elements from End-of-Life Hard Disk Drives

In this conference paper, we propose a superstructure-based approach to finding the optimal pathways for recovering rare earth elements in their commercialized rare earth oxide form from end-of-life HDDs. The proposed superstructure was modeled as a MILP optimization problem, selecting the net present value as the objective function. Whenever possible, costing data taken from the literature was used to inform this mode. However, due to the novelty of this research area data were often not available thus requiring the generation of flowsheets that were implemented in Aspen Plus. To establish the base case optimal result, projections for the number of EOL HDDs in the U.S. available for recycling and estimates of the projected rare earth oxide prices over the lifetime of the plant were used to inform the model. The model was then expanded to include the recycling of EOL HDDs generated prior to the beginning of plant production (period ranging from 2006 through 2024).

Laliwala, Chris↗
DOE OSTI2020

Enforcing constraints for time series prediction in supervised, unsupervised and reinforcement learning

We assume that we are given a time series of data from a dynamical system and our task is to learn the flow map of the dynamical system. We present a collection of results on how to enforce constraints coming from the dynamical system in order to accelerate the training of deep neural networks to represent the flow map of the system as well as increase their predictive ability. In particular, we provide ways to enforce constraints during training for all three major modes of learning, namely supervised, unsupervised and reinforcement learning. In general, the dynamic constraints need to include terms which are analogous to memory terms in model reduction formalisms. Such memory terms act as a restoring force which corrects the errors committed by the learned flow map during prediction. For supervised learning, the constraints are added to the objective function. For the case of unsupervised learning, in particular generative adversarial networks, the constraints are introduced by augmenting the input of the discriminator. Finally, for the case of reinforcement learning and in particular actor-critic methods, the constraints are added to the reward function. In addition, for the reinforcement learning case, we present a novel approach based on homotopy of the action-value function in order to stabilize and accelerate training. We use numerical results for the Lorenz system to illustrate the various constructions.

Stinis, Panagiotis↗
DOE OSTI2020

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow: Preprint

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2020

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗
DOE OSTI2022

A Hybrid Reinforcement Learning-MPC Approach for Distribution System Critical Load Restoration: Preprint

This paper proposes a hybrid control approach for distribution system critical load restoration, combining deep reinforcement learning (RL) and model predictive control (MPC) aiming at maximizing total restored load following an extreme event. RL determines a policy for quantifying operating reserve requirements, thereby hedging against uncertainty, while MPC models grid operations incorporating RL policy actions, i.e., the reserve requirement, renewable (wind and solar) power predictions, and load demand forecasts. We formulate the reserve requirement determination problem as a sequential decision making problem based on the Markov Decision Process (MDP) and design an RL learning environment based on the OpenAI Gym framework and MPC. The RL agent reward and MPC objective function aim to maximize and monotonically increase total restored load and minimize load shedding and renewable power curtailment. The RL algorithm is trained off-line using historical forecast of renewable generation and load demand. The method is tested using a modified IEEE 13-bus distribution test feeder containing wind turbine, photovoltaic, microturbine and battery. Case studies demonstrated that the proposed method outperforms other operating reserve determination methods.

distribution system↗
DOE OSTI2021

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗
DOE OSTI2022

Model Predictive Control for a Grid-interactive Efficient Thermal Storage-integrated Heat Pump System

Building heating and cooling systems can be used to overcome the mismatch between the intermittent supply of renewable power and the fluctuating demand for electricity. A novel underground thermal energy storage integrated with a dual-source heat pump has been proposed to mitigate the mismatch while meeting the thermal demand of buildings efficiently. Conventional thermostat control with heuristic rules cannot provide intelligent decisions to maximize the thermal efficiency and flexibility of the proposed system. Advanced control strategies like model predictive control (MPC) have provided a new paradigm for grid-interactive efficient building operation with the advancement of computation and sensing. This study developed an MPC for the proposed system to provide grid service for Demand Side Management and minimize the operating cost of building owners. A control-oriented dynamic model of the proposed system has been developed. Given an objective function and proper constraints, an optimization problem is formulated to determine the optimal control strategy of the system. Dynamic Programming is adopted to solve the optimization problem. A rule-based control (RBC) is also developed to achieve similar goals. Short-term simulations are conducted to compare the system performance resulting from the two controls. The simulation results indicate that the MPC performs more intelligently than the RBC in charging thermal energy storage and selecting heat pump sources by taking advantage of the predicted cooling demands of the building and the performance of the integrated system. As a result, the MPC could save energy and reduce operating costs compared with the RBC. A case study shows that, for a 3-day operation, the MPC saves 36.9% energy and reduces 38.5% operating cost compared with the RBC.

Shi, Liang↗
DOE OSTI2022

A Hybrid Reinforcement Learning-MPC Approach for Distribution System Critical Load Restoration

This paper proposes a hybrid control approach for distribution system critical load restoration, combining deep reinforcement learning (RL) and model predictive control (MPC) aiming at maximizing total restored load following an extreme event. RL determines a policy for quantifying operating reserve requirements, thereby hedging against uncertainty, while MPC models grid operations incorporating RL policy actions (i.e., reserve requirements), renewable (wind and solar) power predictions, and load demand forecasts. We formulate the reserve requirement determination problem as a sequential decision-making problem based on the Markov Decision Process (MDP) and design an RL learning environment based on the OpenAI Gym framework and MPC simulation. The RL agent reward and MPC objective function aim to maximize and monotonically increase total restored load and minimize load shedding and renewable power curtailment. The RL algorithm is trained offline using a historical forecast of renewable generation and load demand. The method is tested using a modified IEEE 13-bus distribution test feeder containing wind turbine, photovoltaic, microturbine, and battery. Case studies demonstrated that the proposed method outperforms other policies with static operating reserves.

distribution system↗
DOE OSTI2022

Digital Twin Development for Real Time Optimization

In the real-time optimization operation process of the integrated energy system, digital twin (DT) can support operators to find optimal dispatching strategy. In this research, the DT framework interfacing (external) system-level simulation model, RAVEN, and Python-based optimization framework has been developed. Simple demonstration of finding optimal input values minimizing an objective function with the DT framework has been presented.

25 ENERGY STORAGE↗
DOE OSTI2022

Reconfiguration of power grids during abnormal conditions using reclosers and distributed energy resources

Apparatus and methods are disclosed for restoring operation of a power grid comprising a plurality of reclosers and distributed energy resources (DERs) responsive to abnormal conditions by determining and implementing a reconfiguration for the power grid. The reconfiguration can specify respective new statuses for one or more of the reclosers and/or respective quantities of reactive power to be supplied by one or more of the DERs. The reconfiguration can be determined based on a plurality of constraints using an objective function, the constraints being determined based at least in part on recloser status data and/or DER power generation capability data. Respective cleared quantities of reactive power for the DERs to supply to the reconfigured power grid can be determined via a transactive control scheme, and the reconfiguration can be updated prior to implementation based on the results of the transactive control scheme.

Radhakrishnan, Nikitha↗
DOE OSTI2024

Recycling Rare Earth Elements from End-of-Life Electric and Hybrid Electric Vehicle Motors

In this paper, we propose a superstructure-based approach to finding the optimal pathways for recovering rare earth elements in their commercialized rare earth oxide form from end-of-life EV and HEV motors. The proposed superstructure was modeled as a MILP optimization problem, selecting the net present value as the objective function. Whenever possible, costing data taken from the literature was used to inform this mode. However, due to the novelty of this research area data were often not available thus requiring the generation of flowsheets that were implemented in Aspen Plus.

Laliwala, Chris↗
DOE OSTI2024

Enabling Scale-Up Through Multi-Fidelity Adaptive Computing

We present ideas from our ongoing work in adaptive computing - an optimization framework that allows us to strategically deploy various fidelity level experiments and simulations to guide decision making. The framework aims to enable uncertainty quantified scale-up of simulations and experiments, which causes increased complexity. A key feature of the framework is the integration of user-specified local model trustworthiness estimates. Adaptive sampling strategies allow us to optimally exploit the multiple fidelity level information and trustworthiness measures to arrive at the best decisions within a highly limited budget of objective function evaluations.

adaptive sampling↗
DOE OSTI2025

Robust Multi-fidelity Bayesian Optimization with Deep Kernel and Partition

Multi-fidelity Bayesian optimization (MFBO) is a powerful approach that utilizes lowfidelity, cost-effective sources to expedite the exploration and exploitation of a high-fidelity objective function. Existing MFBO methods with theoretical foundations either lack justification for performance improvements over single-fidelity optimization or rely on strong assumptions about the relationships between fidelity sources to construct surrogate models and direct queries to low-fidelity sources. To mitigate the dependency on cross-fidelity assumptions while maintaining the advantages of low-fidelity queries, we introduce a random sampling and partition-based MFBO framework with deep kernel learning. This framework is robust to cross-fidelity model misspecification and explicitly illustrates the benefits of low-fidelity queries. Our results demonstrate that the proposed algorithm effectively manages complex cross-fidelity relationships and efficiently optimizes the target fidelity function.

Zhang, Fengxue [University of Chicago, Illinois, U↗