Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problem”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Fleet Algorithm Design for Pooled Rideshare: Integrating Human Factors, Simulation, and Optimization

This dissertation explores the study the integration of human factors modeling and rideshare fleet control algorithms. Pooled rideshare is a unique transportation mode offering that allows riders increased flexibility and accessibility over public transportation, and decreased cost relative to personal vehicles or traditional rideshare. Additionally, relative to personal vehicles, pooled rideshare offers reduced costs and options for those with difficulty obtaining transportation. Prior research in the space typically focused on modeling human behavior, or optimizing system performance, but a lack of integration of the concepts leads to unrealistic or underutilized outcomes. To tackle this problem, novel rideshare assignment, and repositioning strategies were designed and implemented in a simulation environment. Through a series of successive studies, improvements to current rideshare processes were identified, and beneficial outcomes for profitability, accessibility, and traffic were explored. Further, improved metrics to assess rideshare performance were designed and analyzed in the context of improved rideshare offerings. This research contributes to the field of transportation by tackling novel but pragmatic approaches to challenges facing the rideshare industry. Through the course of this dissertation, rideshares impacts on users, operators, and even regulators will be explored in detail. The justification behind the use of a simulation environment, a set of simulated regional models for testing, and the focus on realism and deployability is illustrated. The research identifies holes in potential markets for the use of both private, and public rideshare systems.

Paul, Joseph↗
DOE OSTI2024

A Deep Learning-Driven Sampling Technique to Explore the Phase Space of an RNA Stem-Loop

The folding and unfolding of RNA stem-loops are critical biological processes; however, their computational studies are often hampered by the ruggedness of their folding landscape, necessitating long simulation times at the atomistic scale. Here, we adapted DeepDriveMD (DDMD), an advanced deep learning-driven sampling technique originally developed for protein folding, to address the challenges of RNA stem-loop folding. Although tempering- and order parameter-based techniques are commonly used for similar rare-event problems, the computational costs or the need for a priori knowledge about the system often present a challenge in their effective use. DDMD overcomes these challenges by adaptively learning from an ensemble of running MD simulations using generic contact maps as the raw input. DeepDriveMD enables on-the-fly learning of a low-dimensional latent representation and guides the simulation toward the undersampled regions while optimizing the resources to explore the relevant parts of the phase space. We showed that DDMD estimates the free energy landscape of the RNA stem-loop reasonably well at room temperature. Our simulation framework runs at a constant temperature without external biasing potential, hence preserving the information on transition rates, with a computational cost much lower than that of the simulations performed with external biasing potentials. Here, we also introduced a reweighting strategy for obtaining unbiased free energy surfaces and presented a qualitative analysis of the latent space. This analysis showed that the latent space captures the relevant slow degrees of freedom for the RNA folding problem of interest. Finally, throughout the manuscript, we outlined how different parameters are selected and optimized to adapt DDMD for this system. We believe this compendium of decision-making processes will help new users adapt this technique for the rare-event sampling problems of their interest.

Gupta, Ayush↗
DOE OSTI2024

Targeted Adaptive Design

Modern advanced manufacturing and advanced materials design often require searches of relatively high-dimensional process control parameter spaces for settings that result in optimal structure, property, and performance parameters. The mapping from the former to the latter must be determined from noisy experiments or from expensive simulations. Here, we abstract this problem to a mathematical framework in which an unknown function from a control space to a design space must be ascertained by means of expensive noisy measurements, which locate control settings generating desired design features within specified tolerances, with quantified uncertainty. We describe targeted adaptive design (TAD), a new algorithm that performs this sampling task efficiently. TAD creates a Gaussian process surrogate model of the unknown mapping at each iterative stage, proposing a new batch of control settings to sample experimentally and optimizing the updated expected log-predictive probability density of the target design. TAD either stops upon locating a solution with uncertainties that fit inside the tolerance box or uses a measure of expected future information to determine that the search space has been exhausted with no solution. TAD thus embodies the exploration-exploitation tension in a manner that recalls, but is essentially different from, Bayesian optimization and optimal experimental design.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A circuit-generated quantum subspace algorithm for the variational quantum eigensolver

Recent research has shown that wavefunction evolution in real and imaginary time can generate quantum subspaces with significant utility for obtaining accurate ground state energies. Inspired by these methods, we propose combining quantum subspace techniques with the variational quantum eigensolver (VQE). In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies. We call this technique the circuit subspace variational quantum eigensolver (CSVQE) algorithm. By benchmarking CSVQE on a range of quantum chemistry problems, we show that it can achieve significant error reduction in the best case compared to conventional VQE, particularly for poorly optimized circuits, greatly improving convergence rates. Furthermore, we demonstrate that when applied to circuits trapped at local minima, CSVQE can produce energies close to the global minimum of the energy landscape, making it a potentially powerful tool for diagnosing local minima.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Design and Optimization of Processing Pathways for Rare Earth Element Recovery from End-of-Life Products

In this presentation, we first discuss the benefits of targeting end-of-life (EOL) products as a feedstock. We then discuss the problem statement of designing a processing facility for recovering rare earth elements (REEs) from EOL HDDs and motors from EOL EVs/HEVs. We then discuss the most profitable pathway, and then discuss the environmental impacts associated with the processing pathway, comparing it to a processing facility in China, and find it to have lower impacts overall. We also investigate the trade-off solutions for other pathways that are not as profitable, but have lower impacts by generating Pareto Fronts. In the next portion of the presentation, Critical Materials Recycling, Inc. is discussed. We discuss how their process was found to be the optimal pathway after performing superstructure optimization, and how we are currently working with them to further optimize their process to increase profits. Finally, we wrap up with conclusions summarizing the main takeaways of the presentation.

36 MATERIALS SCIENCE↗
DOE OSTI2026

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗
DOE OSTI2025

Science & Technology Review December 2025 - Optimizing Future Design

At Lawrence Livermore National Laboratory, we focus on science and technology research to ensure our nation’s security. We also apply that expertise to solve other important national problems in energy, bioscience, and the environment. Science & Technology Review is published eight times a year to communicate, to a broad audience, the Laboratory’s scientific and technological accomplishments in fulfilling its primary missions. The publication’s goal is to help readers understand these accomplishments and appreciate their value to the individual citizen, the nation, and the world.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Correlated Noise Estimation with Quantum Sensor Networks

We address the metrological problem of estimating collective stochastic properties imprinted on a network of quantum sensors. Canonical examples include center-of-mass quadrature fluctuations in a system of bosonic modes and correlated dephasing in an ensemble of qubits (e.g., spins), bosons, or fermions. We develop a theoretical framework to determine the limits of correlated (weak) noise estimation with quantum sensor networks and reveal the requirements for entanglement advantage. Notably, an advantage emerges from the synergistic interplay between quantum correlations of the sensors and “classical” correlations of the noises. Here, we determine optimal entangled probe states and identify a sensing protocol—reminiscent of a many-body echo—that achieves the fundamental limits of measurement sensitivity for a broad class of problems, unveiling a route toward entanglement-enhanced metrology of correlated many-body phenomena.

Quantum metrology↗
DOE OSTI2024

Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Exascale Julia Grid Optimization

Simple Julia scrips for solving AC power flow, AC optimal power flow, and security-constrained AC optimal power flow. These scripts are intended for experimentation with different (possibly, new) methods, formulations, and settings for solving these power system problem. Their implementation, therefore, intentionally avoids excessive encapsulation, which makes other packages difficult to modify by non-developers.

Petra, Cosmin [Lawrence Livermore National Laborat↗
DOE OSTI2024

Integrating the Design of Desalination Technologies into Produced Water Network Optimization

The oil and gas energy sector uses billions of gallons of water for hydraulic fracturing each year to extract oil and gas. The water injected into the ground for fracturing along with naturally occurring formation water from oil wells surfaces back in the form of produced water. Produced water can contain high concentrations of total dissolved solids and is unfit for reuse outside the oil and gas industry without desalination. In semi-arid shale plays, produced water desalination for beneficial reuse could play a crucial role in alleviating water shortages and addressing extreme drought conditions. In this poster we co-optimize the design and operation of desalination technologies along with operational decisions across produced water networks. A multi-period produced water network model with simplified split-fraction-based desalination nodes is developed. Rigorous steady-state desalination mathematical models based on mechanical vapor recompression are developed and embedded at the desalination sites in the network model. An optimal common design across all periods is ensured using global capacity constraints. The solution approach is demonstrated for multi-period planning problems on networks from the PARETO open-source library. Model formulation and challenges associated with scalability are discussed.

Naik, Sakshi↗
DOE OSTI2024

Integrating the Design of Desalination Technologies into Produced Water Network Optimization

The oil and gas energy sector uses billions of gallons of water for hydraulic fracturing each year to extract oil and gas. The water injected into the ground for fracturing along with naturally occur-ring formation water from the oil wells surfaces back in the form of produced water. Produced water can contain high concentrations of total dissolved solids and is unfit for reuse outside the oil and gas industry without desalination. In semi-arid shale plays, produced water desalination for beneficial reuse could play a crucial role in alleviating water shortages and addressing extreme drought conditions. In this paper we co-optimize the design and operation of desalination technologies along with operational decisions across produced water networks. A multi-period produced water network model with simplified split-fraction-based desalination nodes is developed. Rigorous steady-state desalination mathematical models based on mechanical vapor recompression are developed and embedded at the desalination sites in the network model. An optimal common design is ensured across all periods using global capacity constraints. The solution approach is demonstrated for multi-period planning problems on networks from the PARETO open-source library. Model formulation and challenges associated with scalability are discussed.

Naik, Sakshi↗
DOE OSTI2024

Optimization of a Lethal, Combat-Relevant Model of Sterile Inflammation in Mice for Drug Candidate Screening

ABSTRACT Introduction Extensive trauma, commonly seen in wounded military Service Members, often leads to a severe sterile inflammation termed systemic inflammatory response syndrome (SIRS), which can progress to multiple organ dysfunction syndrome (MODS) and death. MODS is a serious threat to wounded Service Members, historically causing 10% of all deaths in trauma admissions at a forward deployed combat hospital. The importance of this problem will be exacerbated in large-scale combat operations, in which evacuation will be delayed and care of complex injuries at lower echelons of care may be prolonged. The main goal of this study was to optimize an existing mouse model of lethal SIRS/MODS as a therapeutic screening platform for the evaluation of immunomodulatory drugs. Materials and Methods Male C57BL/6 mice were euthanized, and the bones and muscles were collected and blended into a paste termed tissue–bone matrix (TBX). The TBX at 12.5%–20% relative to body weight of each recipient mouse was implanted into subcutaneous pouches created on the dorsum of anesthetized animals. Mice were observed for clinical scores for up to 48 hours postimplantation and euthanized at the preset point of moribundity. To test effects of anesthetics on TBX-induced mortality, animals received isoflurane or ketamine/xylazine (K/X). In a separate set of studies, mice received TBX followed by intraperitoneal injection with 20 mg/kg or 40 mg/kg Eritoran or a placebo carrier. All Eritoran studies were performed in a blinded fashion. Results We observed that K/X anesthesia significantly increased the lethality of the implanted TBX in comparison to inhaled anesthetics. Although all the mice anesthetized with isoflurane and implanted with 12.5% TBX survived for 24 hours, 60% of mice anesthetized with K/X were moribund by 24 hours postimplantation. To mimic more closely the timing of lethal SIRS/MODS following polytrauma in human patients, we extended observation to 48 hours. We performed TBX dose–response studies and found that as low as 15%, 17.5%, and 20% TBX caused moribundity/mortality in 50%, 80%, and 100% mice, respectively, over a 48-hour time period. With 17.5% TBX, we tested if moribundity/mortality could be rescued by anti-inflammatory drug Eritoran, a toll-like receptor 4 antagonist. Neither 20 mg/kg nor 40 mg/kg doses of Eritoran were found to be effective in this model. Conclusions We optimized a TBX mouse model of SIRS/MODS for the purpose of evaluating novel therapeutic interventions to prevent trauma-related pathophysiologies in wounded Service Members. Negative effects of K/X on lethality of TBX should be further evaluated, particularly in the light of widespread use of ketamine in treatment of pain. By mimicking muscle crush, bone fracture, and necrosis, the TBX model has pleiotropic effects on physiology and immunology that make it uniquely valuable as a screening tool for the evaluation of novel therapeutics against trauma-induced SIRS/MODS.

General & Internal Medicine↗
DOE OSTI2025

Adaptive Computing for Scale-Up Problems

Adaptive Computing is an application-agnostic outer loop framework to strategically deploy simulations and experiments to guide decision making for scale-up analysis. Resources are allocated over successive batches, which makes the allocation adaptive to some objective such as optimization or model training. The framework enables the characterization and management of uncertainties associated with predictive models of complex systems when scale-up questions lead to significant model extrapolation. A key advancement of this framework is its integration of multi-fidelity surrogate modeling, uncertainty management, and automated orchestration of various computing and experimentation resources into a single integrated software package. This enables efficient multi-fidelity modeling across multiple computing resources by incorporating real-world constraints such as relative queue times and throughput on individual machines into the multi-fidelity sampling decision. We discuss applications of this framework to problems in the renewable energy space, including biofuels production, material synthesis, perovskite crystal growth, and building electrical loads.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗
DOE OSTI2024

Physics-Informed Active Learning With Simultaneous Weak-Form Latent Space Dynamics Identification

The parametric greedy latent space dynamics identification (gLaSDI) framework has demonstrated promising potential for accurate and efficient modeling of high-dimensional nonlinear physical systems. However, it remains challenging to handle noisy data. Here, to enhance robustness against noise, we incorporate the weak-form estimation of nonlinear dynamics (WENDy) into gLaSDI. In the proposed weak-form gLaSDI (WgLaSDI) framework, an autoencoder and WENDy are trained simultaneously to discover intrinsic nonlinear latent-space dynamics of high-dimensional data. Compared with the standard sparse identification of nonlinear dynamics (SINDy) employed in gLaSDI, WENDy enables variance reduction and robust latent space discovery, therefore leading to more accurate and efficient reduced-order modeling. Furthermore, the greedy physics-informed active learning in WgLaSDI enables adaptive sampling of optimal training data on the fly for enhanced modeling accuracy. The effectiveness of the proposed framework is demonstrated by modeling various nonlinear dynamical problems, including viscous and inviscid Burgers' equations, time-dependent radial advection, and the Vlasov equation for plasma physics. With data that contains 5%–10% Gaussian white noise, WgLaSDI outperforms gLaSDI by orders of magnitude, achieving 1%–7% relative errors. Compared with the high-fidelity models, WgLaSDI achieves 121 to 1779x speed-up.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Solving k –SAT problems with generalized quantum measurement

We generalize the projection–based quantum measurement–driven k –SAT algorithm of Benjamin, Zhao, and Fitzsimons to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement–driven quantum control strategy elsewhere referred to as “Zeno dragging”. We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable k -SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long–time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally–trivial 2-qubit 2-SAT problem to build intuition, and then we consider the scaling of the algorithm on 3-SAT problems encoded with 4–10 qubits. We numerically investigate the scaling of 3-SAT with respect to algorithmic runtime and find that the optimized time to solution scales with qubit number n as λ n , where λ is slightly larger than $\sqrt{2}$ for unconditional dynamics and less than $\sqrt{2}$ for conditional dynamics. We assess the implications for using this analog measurement–driven approach to quantum computing in practice.

quantum information↗
DOE OSTI2026

Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation law arising from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By minimizing the reproducing kernel Hilbert space norm while penalizing kernel complexity through maximum likelihood estimation, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface flow in fracture networks and arterial blood flow. Finally, the results demonstrate that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.

Dirichlet-to-Neumann map↗