SEARCH · Search NASA

Results for “Optimal sizing method”

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.

SourceResearch connectionFrom yearThrough year

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

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Equation-of-motion internally contracted multireference unitary coupled-cluster theory

The accurate computation of excited states remains a challenge in electronic structure theory, especially for systems with a ground state that requires a multireference treatment. In this work, we introduce a novel equation-of-motion (EOM) extension of the internally contracted multireference unitary coupled-cluster framework (ic-MRUCC), termed EOM-ic-MRUCC. EOM-ic-MRUCC follows the transform-then-diagonalize approach, in analogy to its non-unitary counterpart. By employing a projective approach to optimize the ground state, the method retains additive separability and proper scaling with system size. We show that excitation energies are size-intensive if the EOM operator satisfies the “killer” and the projective conditions. Furthermore, we propose to represent changes in the reference state upon electron excitation via projected many-body operators that span the active orbitals and show that the EOM equations formulated in this way are invariant with respect to active orbital rotations. We test the EOM-ic-MRUCC method truncated to single and double excitations by computing the potential energy curves for several excited states of a BeH2 model system, the HF molecule, and water undergoing symmetric dissociation. Across these systems, our method delivers accurate excitation energies and potential energy curves within 5 mE h (∼0.14 eV) from full configuration interaction. Here, we find that truncating the Baker–Campbell–Hausdorff series to fourfold commutators contributes negligible errors (on the order of 10 −5 E h or less), offering a practical route to highly accurate excited-state calculations with reduced computational overhead.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2023

Optimizing invader suppression to restore native species: Leveraging species traits to overcome collateral damage

Strategies to control ongoing biological invasions are often developed by modelling the invasive species' population and aiming to reduce its abundance. However, if the ultimate objective is to protect and restore native species, focussing solely on the invader may not be optimal because it does not account for (i) species interactions that can cause the invader's impacts to depend nonlinearly on its abundance, (ii) collateral damages to native species incurred due to nonspecific removal methods or (iii) native-invader trait differences. Here, to identify an invader suppression strategy that maximizes average native population size, we applied optimal control theory to a two-species model of a native species threatened by an invasive competitor. We examined trade-offs between iterative physical removals that selectively target invaders and intensifiable chemical control that is nonselective but has higher efficacy. We found that while iterative removals were capable of supporting large native populations when applied continuously, cost could be prohibitively high. In contrast, when favourable native-invader trait differences enabled native species to re-establish more quickly than invaders, intensifiable methods could achieve substantial restoration benefits at lower cost by focussing removal effort into periodic, high-efficacy events. In a metapopulation, removals that rotated among spatial patches were optimal when the native species had higher dispersal, whereas synchronous removals were preferred when native recovery was initiated locally and the invader could disperse. For a case study in Hawaiian streams, we compared how effective two alternative methods of removing invasive live-bearing fishes (poeciliids) might be at restoring the endemic freshwater goby Sicyopterus stimpsoni. We found that rotenone (a piscicidal chemical) offered superior benefits when the control budget was small and efficacy was high, but that electrofishing (use of electricity to manually collect target fish) was better with larger budgets and in many lower-efficacy scenarios. Synthesis and applications. Our findings demonstrate that, by accounting for species interactions and collateral damage, invasive species control strategies can be optimized in light of species traits. Choices about the timing, locations and types of removal events present opportunities to increase the efficiency with which invasive species suppression benefits native species.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Aerial drone fleet deployment optimization with endogenous battery replacements for direct delivery of time-sensitive products

Aerial drones offer a distinct potential to reduce the delivery time and energy consumption for the delivery of time-sensitive and small products. However, there is still a need in the relevant industry to understand the performance of drone-based delivery under different business needs and drone operating conditions. We studied a drone deployment optimization problem for direct delivery of time-sensitive products with release dates to customers maintaining a specified time window. This paper presents a new mixed-integer programming model, new valid inequalities, a new greedy heuristic algorithm, and a Genetic algorithm to help business owners optimally schedule and route their drone fleet minimizing the required fleet size, the required number of additional batteries, and total energy consumption. A realistic feature of the optimization method is that instead of replacing the drone battery after each return to the depot, it keeps track of the remaining energy in the drone battery and decides on battery replacements accounting for the drone routing and the user-specified minimum required battery energy. Numerical results based on real data from drone flight tests and prepared food delivery industry provide insights into the effect of different practical drone operating parameters on the required fleet size, the required number of battery replacements, and energy consumption. Here, results demonstrate that the proposed heuristic algorithm substantially outperforms the accelerated CPLEX in runtime while sacrificing the solution quality by a small amount. Additionally, results show that using a mixed fleet of hexacopter and quadcopter drones reduces the total energy consumption by 48.52% compared to using a homogeneous fleet of only hexacopters.

Drone energy consumption↗

DOE OSTI2025

Reconstruction of beam parameters and betatron radiation spectra measured with a Compton spectrometer

The photon flux resulting from high-energy electron beam interactions with high-field systems, such as those found in the upcoming FACET-II experiments at the SLAC National Accelerator Laboratory, yields deep insight into the electron beam’s underlying dynamics during the interaction. However, extracting this information is an intricate process. To demonstrate how to approach this challenge using modern methods, this paper utilizes simulated data that models plasma wakefield acceleration-derived betatron radiation in experiments to determine reliable methods of reconstructing key beam and beam-plasma interaction properties. For betatron radiation measurements, translating the observed 200⁢ keV to 30⁢ MeV photon double-differential energy-angle spectra obtained from an advanced Compton spectrometer requires testing multiple methods to optimize the pipeline from its response to incident electron beam information. The paper compares maximum likelihood estimation and machine learning to refine the translation of photon spectra into precise electron beam metrics, such as spot size, energy, and emittance, enhancing the understanding of beam behavior within these dense, high-field environments. We also introduce machine learning and the expected maximization algorithm to reconstruct the primary photon spectrum, employing a multilayer neural network for regression analysis of the energy and angle spectra. With appropriate modifications, the advanced methods reproduce relevant incident beam parameters with high accuracy, even for beam sizes in the <10 μ⁢m range. This capacity is critical to understanding intense beam propagation and its optimization in plasma.

Beam code development & simulation techniques↗

DOE OSTI2024

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗

DOE OSTI2021

A framework for integrated dispatching and charging management of an autonomous electric vehicle ride-hailing fleet

The convergence of electrification and automated driving will introduce opportunities to improve the operation and energy-efficiency of transportation systems. This paper discusses the challenges of dispatching autonomous electric vehicles (AEVs) in a ride-hailing fleet and their interactions with charging infrastructure. An integrated decision-making framework for dispatching and charging has been proposed using system optimization approaches. An agent-based platform has been developed for simulating and testing the proposed methods. A case study using New York City taxi data has been performed with different fleet sizes, dispatching strategies, and charging networks. Advantages of optimization-based approaches for AEV fleet management have been studied and demonstrated, for example, for a fleet of 1,750 AEVs to meet 100,000 daily requests, optimization-based centralized fleet management would result in 14% more ride requests satisfied and 43% fewer zero-occupancy miles traveled than if AEVs make independent decisions based on heuristic strategy. Benefits on reducing fleet size and charging downtime from optimization approaches are also comprehensively illustrated.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Reliable and Efficient Machine Learning (Final Technical Report)

Modern scientific experiments generate massive amounts of data at a pace much faster than humans can manually analyze. While machine learning has revolutionized commercial data analysis (such as recommending movies or recognizing faces), applying these tools to complex scientific discovery is challenging because scientific answers must be precise, interpretable, and adhere to physical laws. The research under this project aims to develop new mathematical tools and computer algorithms specifically designed for scientific applications. Major progress has been made in automatically cleaning and deconstructing messy experimental data, analyzing the visual information of physical phenomena, determining the underlying physical variables, and providing rig orous mathematical analysis of interesting algorithms and concepts widely used in machine learning. This project addressed the critical gap between our ability to generate massive scientific data and our ability to extract interpretable information from it. We established mathematical foundations for Scientific Machine Learning (SciML) aimed at effective data analytics and automated discovery. Our work focused on three core objectives: (1) developing reliable feature extraction methods for dynamic high-dimensional data, (2) establishing mathematical foundations for discovering dynamics via neural networks, and (3) creating rigorous optimization techniques for these models. Key outcomes come from two fronts. On the practical side, they include the development of algorithms that significantly enhance the extraction of signals from field data, as well as the capability to handle situations that exhibit smooth variations or physical stretching due to temperature changes. They also include the creation of an automated framework for discovering fundamental state variables from raw experimental data, demonstrating the ability to identify intrinsic physical dimensions without prior knowledge of the governing laws. On the theoretical front, the research results in theoretical advances in Optimal Transport, a widely used notion in SciML, specifically regarding functions with fixed-size nodal sets, provide sharp bounds relevant to uncertainty quantification. Meanwhile, the outcomes also include the establishment of convergence theories for nonlocal gradient descent methods, enabling robust optimization with noisy data in high-dimensional settings commonly encountered in scientific modeling. The project also helps creating opportunities to train the next generation of researchers, equipping them with the necessary technical skills for today’s workplace and preparing them for future advances.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A hybrid approach to excited-state-specific variational Monte Carlo and doubly excited states

We extend our hybrid linear-method/accelerated-descent variational Monte Carlo optimization approach to excited states and investigate its efficacy in double excitations. In addition to showing a superior statistical efficiency when compared to the linear method, our tests on small molecules show good energetic agreement with benchmark methods. We also demonstrate the ability to treat double excitations in systems that are too large for a full treatment by using selected configuration interaction methods via an application to 4-aminobenzonitrile. Finally, we investigate the stability of state-specific variance optimization against collapse to other states’ variance minima and find that symmetry, Ansatz quality, and sample size all have roles to play in achieving stability.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

CASSCF with Extremely Large Active Spaces Using the Adaptive Sampling Configuration Interaction Method

The complete active space self-consistent field (CASSCF) method is the principal approach employed for studying strongly correlated systems. However, exact CASSCF can only be performed on small active spaces of ~20 electrons in ~20 orbitals due to exponential growth in the computational cost. Here, we show that employing the Adaptive Sampling Configuration Interaction (ASCI) method as an approximate Full CI solver in the active space allows CASSCF-like calculations within chemical accuracy (<1 kcal/mol for relative energies) in active spaces with more than ~50 active electrons in ~50 active orbitals, significantly increasing the sizes of systems amenable to accurate multiconfigurational treatment. The main challenge with using any selected CI-based approximate CASSCF is the orbital optimization problem; they tend to exhibit large numbers of local minima in orbital space due to their lack of invariance to active–active rotations (in addition to the local minima that exist in exact CASSCF). We highlight methods that can avoid spurious local extrema as a practical solution to the orbital optimization problem. We employ ASCI-SCF to demonstrate a lack of polyradical character in moderately sized periacenes with up to 52 correlated electrons and compare against heat-bath CI on an iron porphyrin system with more than 40 correlated electrons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Data-Driven Energy Resilience Assessment and Enhancement in Urban Communities: A Case Study in Detroit

This paper presents a data-driven framework for assessing and enhancing energy resilience in urban communities. The resilience assessment is based on two datasets: 1) annual aggregated power outage data and 2) 15-minute interval outage data. High-impact, low-probability (HILP) events are identified within these datasets to evaluate community resilience under extreme conditions. To enhance resilience, an optimization framework utilizing mixed integer linear programming is developed to determine the optimal sizing and placement of solar photovoltaic (PV) systems and battery energy storage systems (BESS). This method offers a cost-effective and practical solution for improving energy resilience in vulnerable communities. Furthermore, a case study of the City of Detroit in Michigan demonstrates the effectiveness of the framework through simulation and validation.

Energy resilience assessment↗

DOE OSTI2022

Noble Gas Management: SBMOF 1 vs. NUCON Carbon

Pacific Northwest National Laboratory (PNNL), in collaboration with Flibe Energy, Inc., demonstrated the fabrication of metal organic frameworks (MOFs) into engineered beads to manage off-gases released from molten salt reactors. Among the many MOF options, SBMOF 1 was selected as an ideal sorbent to manage off-gases released from a molten salt reactor because its pore size is optimal. The SBMOF 1 was synthesized and fabricated into engineered particles using three different methods, with and without polymers. All the engineered particles were exposed to Co-60 radiation (1,000 kGy) to demonstrate their radiation stability. Single column breakthrough experiments were performed at different temperatures, activation conditions, flow rates, and off-gas compositions to optimize the Xe capacity at the breakthrough point and at saturation. The Xe loading in SBMOF 1 was compared with that of standard solid sorbent (Nucon carbon) under identical conditions. Based on the single column experiments, SBMOF 1 outperforms the Nucon carbon at all the temperatures and reduces the mass (to as little as 55%) of sorbent needed to achieve the same performance as carbon. The bed volume is also reduced, down to 48% of that of Nucon carbon, when the MOF is used. These results clearly demonstrate improvement in the amount of adsorbent needed and show a reduction in bed volume compared to traditional sorbent material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗

DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Data-Driven Generic Turbines for Distributed Wind Modeling, Optimization, and Economic Studies

As distributed energy resources (DER) become less expensive and more popular, utilities, project developers, and customers have an increasing need to model the performance of existing and proposed DER systems. Distributed wind has been shown to have widespread economic potential but is often represented by a simplified model in - or excluded from - DER modeling tools and studies. There is often no economic imperative to extend models and studies to give full consideration to distributed wind. We present a set of data-driven generic turbines derived from 16 years of annual distributed wind market survey data. The proposed methodology can be used to derive generic turbines from separate or updated data sets. Finally, a mixed-integer linear programming approach to optimal distributed wind project sizing is used to demonstrate the generic turbine models. Combined, these models and methods can reduce barriers to considering distributed wind in modeling tools and studies.

Reiman, Andrew P.↗

DOE OSTI2021

A learning-augmented approach for AC optimal power flow

Because of the high nonlinearity of AC optimal power flow (OPF), numerous efforts have been made in recent decades to find efficient methods. Machine learning (ML) has proven to significantly reduce the computational costs in many real-world problems. Thus, this paper develops a learning-augmented method for solving AC OPF, which integrates both power network equations and ML to yield near-optimal solutions. More specifically, ML models are developed to first predict bus voltage magnitudes and angles. Then, physics-based network equations are employed to calculate the power injection at different buses. Three ML algorithms, i.e., random forest, multi-target decision tree, and extreme learning machine, are explored and compared. To evaluate the efficiency of the proposed learning-augmented AC OPF solver, the MATPOWER Interior Point Solver is adopted as a baseline. Case studies on both 500-bus and 4918-bus test networks show that the proposed learning-augmented method has reduced the computational time by 15–100 times depending on the network size with a minimal loss in optimality.

42 ENGINEERING↗

DOE OSTI2025

Equity-driven Planning of Distributed Solar PV using Optimal Transport

Typically, distribution system planning processes do not explicitly incorporate energy equity considerations, such as identifying consumers most affected by energy costs and determining how investments in the distribution system can address existing energy burden imbalances. This paper proposes a novel optimal transport (OT)-based method to improve the energy burden distribution of consumers. The approach involves the strategic siting and sizing of solar PV in order to assist customers with high energy burden and improve the overall energy burden distribution of the community. The desired energy burden distribution is defined using the equal distribution equivalent (EDE) concept. The OT-based method is then used to estimate the distributed solar PV capacity to be installed at various locations and the tariffs to be adjusted, all while improving the energy burden distribution and providing valuable insights into distributed generation (DG) planning. The results on IEEE 37 bus test system demonstrate how DG planning, considering EDE and OT, can help reduce the energy burden of low-income consumers. Additionally, the approach also reveals optimal tariff adjustments needed to ensure revenue neutrality for distribution utilities.

Optimal transport, equal distribution equivalent, ↗

DOE OSTI2022

Turbine scale and siting considerations in wind plant layout optimization and implications for capacity density

Improvements in wind energy technology, reduced costs, and ambitious clean energy goals have led to projections of high wind contribution in coming years. Developing methodologies to design wind plants with a variety of siting constraints and turbine sizes helps enable high wind penetration, and gain a better understanding of how wind plants are sensitive to setback constraints and turbine design. In this paper, we present a two-step optimization method to simultaneously determine the optimal number of turbines and their locations in a wind plant domain divided into many small, discrete parcels. We present the optimized performance metrics of a wind plant optimized with different turbine sizes and ratings, and with different siting restrictions within the wind plant. Our results indicate that taller and larger turbines are more sensitive to increasing siting constraints. We also compare the optimal wind plant layouts and performance for wind plants optimized for minimum COE and maximum profit. Wind plants optimized for profit had 130%-190% of the capacity of plants optimized for COE, which demonstrates that the optimal results are greatly affected by the objective function, which should be carefully considered. Finally, in this paper we demonstrate the effect of increasing siting constraints on wind plant capacity density, and how the results change when different land areas are used to calculate capacity density. When using the entire wind plant boundary area to determine capacity density, increasing siting constraints decreases the capacity density. However, when we only use the available area (the area left after removing the siting constraints) to calculate the capacity density, increasing the siting constraints increases capacity density. This is a critical insight because of how capacity density is typically defined and used in research, and has important implications for assessment of technical potential and capacity expansion modeling, as well as future wind deployment potential.

17 WIND ENERGY↗