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.

SourceResearch connectionFrom yearThrough year

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

At least 451 records · Page 25

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Spatial-Temporal PV Hosting Capacity Estimation and Evaluation

Evaluating Photovoltaic Hosting Capacity (PVHC) is an essential step in the process of integrating solar energy into power grids, particularly when focusing on the distribution network (DN) as the primary integration target. PVHC needs to be investigated, especially in cases where the grids are unbalanced, and their operational conditions vary spatially and temporally. This motivation prompted us to propose a scalable model tailored to this application. In this paper, we applied linearization to the alternating current optimal power flow (AC-OPF) and solar inverters, transforming the original problem into a mixed-integer linear programming (MILP) problem. Additionally, we accounted for the battery energy storage system (BESS) as a time-coupling factor for calculating PVHC. We then compared the PVHC results between the IEEE-13 bus and SMART-DS San Francisco (SFO) cases and discussed the extent to which BESS can enhance the PVHC of a DN. Furthermore, we designed a web-based graphical visualization for the SFO case, enabling user interaction with raw data and simulation results on a map through a graphical user interface (GUI). In summary, our results and findings provide valuable insights for future three-phase unbalanced AC-OPF PVHC practices and their visualization.

AC-optimal power flow↗

DOE OSTI2026

Affine Transformations to Enable Machine Learning for Semi-Quantitative EDS Analysis

Energy Dispersive X-ray Spectroscopy (EDS) is an essential technique for determining elemental concentrations and distributions within microstructures, critical for materials discovery, optimization, and qualification. However, most published EDS data is qualitative because current quantitative EDS analysis methods require extensive calibration and post-processing, limiting their practicality and widespread adoption. This work seeks to establish a framework for accelerated EDS characterization and spectrum analysis that can leverage ML to analyze correlations between various elemental compositions and resulting EDS spectra. The complex physics and data result in a high-dimensional problem that grows exponentially with the number of elements in the system and the complexity of the spectrum analysis. ML provides a way to compute and optimize the results of this highly dimensional problem in a flexible way to tailor it to the user’s specific needs and material system. However, the framework emphasizes transparency through a strictly mathematical affine transformation, so the analysis remains understandable and reviewable to facilitate adoption by the scientific community. While currently implemented methods are simplistic and unvalidated, further development and demonstration of this framework could enable high-throughput, accurate, and accessible EDS characterization.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2026

Affine Transformations to Correlate Experimental and Simulated EDS Spectra for Multi-Element Systems

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2026

Technical Report for Bayesian Optimization and Reinforcement Learning for Beam Polarization Increase in the BNL Hadron Injectors

This project developed and evaluated physics-informed Bayesian learning and machine learning (ML)-based optimization methods for improving beam polarization preservation in the BNL hadron injector chain. The work focused on uncertainty-aware digital twin modeling, Bayesian calibration of accelerator simulations using beam measurements, and data-efficient optimization strategies including Bayesian optimization and reinforcement learning. These methods were applied to injector tuning and RF control problems in realistic accelerator settings to support improved operational robustness and readiness for RHIC operations and future Electron–Ion Collider facilities. No subject inventions were disclosed under this award.

43 PARTICLE ACCELERATORS↗

DOE OSTI2024

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗

DOE OSTI2025

Leveraging differentiable programming in the inverse problem of neutron stars

Neutron stars (NSs) probe the high-density regime of the nuclear equation of state (EOS). However, inferring the EOS from observations of NSs is a computationally challenging task. Here, in this work, we efficiently solve this inverse problem by leveraging differential programming in two ways. First, we enable full Bayesian inference in under one hour of wall time on a GPU by using gradient-based samplers, without requiring pretrained machine learning emulators. Moreover, we demonstrate efficient scaling to high-dimensional parameter spaces. Second, we introduce a novel gradient-based optimization scheme that recovers the EOS of a given NS mass-radius curve. We demonstrate how our framework can reveal consistencies or tensions between nuclear physics and astrophysics. First, we show how the breakdown density of a metamodel description of the EOS can be determined from NS observations. Second, we demonstrate how degeneracies in EOS modeling using nuclear empirical parameters can influence the inverse problem during gradient-based optimization. Looking ahead, our approach opens up new theoretical studies of the relation between NS properties and the EOS, while effectively tackling the data analysis challenges brought by future detectors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2026

Biocatalyst discovery and design for plastics deconstruction: A multi‐scale perspective

Plastic waste accumulation poses significant environmental challenges due to a lack of economical solutions for the molecular deconstruction of diverse synthetic polymers. Biological‐based degradation offers promise but is hindered by the crystallinity, hydrophobicity, and additive complexity of plastics, which restrict biocatalyst access and activity. To address these problems, we propose a multi‐scale framework that combines detailed materials characterization, optimization of plastic‐biomolecular interfacial interactions, and enhancement of biocatalytic kinetics to develop effective plastic‐deconstructing enzymes. This approach leverages principles from reaction kinetics, transport and interfacial phenomena, and enzyme engineering to systematically address barriers across diverse plastic types. Our framework aims to accelerate the discovery and optimization of biocatalysts capable of scalable, selective, and efficient deconstruction of plastic waste. These advances hold potential to enable sustainable biological recycling and upcycling pathways, contributing to global efforts in mitigating plastic pollution and promoting circular material economies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

CHARGE-MAP: An integrated framework to study the multicriteria EV charging infrastructure expansion problem

The widespread adoption of electric vehicles (EVs) in recent years has necessitated the development of effective charging infrastructures. However, charging infrastructure expansion is a multifaceted problem that requires careful consideration of the existing infrastructure, spatiotemporal distribution of charging demands, power-grid capacity, and budget constraints. Here, to approach this complex problem, we present CHARGE-MAP, a data-driven simulation-optimization framework, focused on ensuring meaningful charging experience for individual EV owners. CHARGE-MAP integrates three modules: an agent-based simulation module that estimates spatiotemporal distribution of charging demands by modeling EV adopter mobility and charging behavior; an optimization module that determines optimal new charging station/charger locations and capacities, while minimizing expected detour distances and wait-times with a limited number of new stations; and a power module that determines how to connect the stations to the power grid while maintaining its stability. Using the state of Virginia (consisting of 95 counties and 38 independent cities) as a case study, our results show that CHARGE-MAP can meet the demand of ~198,600 predicted EVs with 1,305 new public charging stations and 2,164 new chargers. It reduces average detour distances for charging by 66% and wait-times at stations by 72% compared to the existing infrastructure. Furthermore, transformer capacity requirement analysis reveals that only 1.8% of residential transformers require upgrades, while over 80% of commercial charging locations can be supported with modest transformer infrastructure (25 to 50 kVA). This indicates that targeted investments can facilitate cost-effective EV integration. Consequently, CHARGE-MAP provides policymakers and urban planners with crucial data-driven insights for effective EV charging infrastructure expansion. Sign up for PNAS alerts.

charging infrastructure↗

DOE OSTI2025

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

DOE OSTI2025

Efficient near-field ptychography reconstruction using the Hessian operator

X-ray ptychography is a powerful and robust coherent imaging method providing access to the complex object and probe (illumination). Ptychography reconstruction is typically performed using first-order methods due to their computational efficiency. Higher-order methods, while potentially more accurate, are often prohibitively expensive in terms of computation. In this study, we present a mathematical framework for reconstruction using second-order information derived from an efficient computation of the bilinear Hessian and Hessian operator. The formulation is provided for Gaussian-based models, enabling the simultaneous reconstruction of the object, probe, and object positions. Synthetic data tests, along with experimental near-field ptychography data processing, demonstrate a ten-fold reduction in computation time compared to first-order methods. The derived formulas for computing the Hessians, along with the strategies for incorporating them into optimization schemes, are well-structured and easily adaptable to various ptychography problem formulations.

Carlsson, Marcus [Lund Univ. (Sweden)] (ORCID:0000↗

DOE OSTI2025

Reducing the Parameter Dependency of Phase-Picking Neural Networks with Dice Loss

Training a neural network for picking seismic phase arrivals has been commonly posed as a segmentation problem. It is a highly imbalanced segmentation problem in the sense that the background vastly dominates the foreground because we are trying to pick the optimal single sample point that represents the arrival of a seismic phase in a many seconds long time window. Here, we test the Dice loss, which is a preferred loss function for highly imbalanced image segmentation problems. We show that phase-picking neural networks trained on the Dice loss behave in a binary fashion for which the prediction output is almost always either nearly 1 or nearly 0. This feature removes the strong dependence of data processing workflows on the prediction score threshold, which is an otherwise critical parameter to determine when using neural networks trained on the cross-entropy loss. When strategically used, models trained on the Dice loss can reduce the parameter dependency of machine learning-based seismic monitoring.

58 GEOSCIENCES↗

DOE OSTI2025

FuSED – Users Manual – (V.5.26)

The Fusion of Simulation, Experiment, and Data (FuSED) team provides a set of tools for solving inverse problems in structural dynamics (InverseSD) and thermal physics (InverseAria), a sensor placement optimization tool via Optimal Experimental Design (OED), and a decision boundary tool using SVMs (TRACE). These methods are used for designing experiments, model calibration, and verification/validation analysis of systems. This document provides a user’s guide.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

A robust approach to Gaussian process implementation

Abstract. Gaussian process (GP) regression is a flexible modeling technique used to predict outputs and to capture uncertainty in the predictions. However, the GP regression process becomes computationally intensive when the training spatial dataset has a large number of observations. To address this challenge, we introduce a scalable GP algorithm, termed MuyGPs, which incorporates nearest-neighbor and leave-one-out cross-validation during training. This approach enables the evaluation of large spatial datasets with state-of-the-art accuracy and speed in certain spatial problems. Despite these advantages, conventional quadratic loss functions used in the MuyGPs optimization, such as root mean squared error (RMSE), are highly influenced by outliers. We explore the behavior of MuyGPs in cases involving outlying observations and, subsequently, develop a robust approach to handle and mitigate their impact. Specifically, we introduce a novel leave-one-out loss function based on the pseudo-Huber function (LOOPH) that effectively accounts for outliers in large spatial datasets within the MuyGPs framework. Our simulation study shows that the LOOPH loss method maintains accuracy despite outlying observations, establishing MuyGPs as a powerful tool for mitigating unusual observation impacts in the large data regime. In the analysis of US ozone data, MuyGPs provides accurate predictions and uncertainty quantification, demonstrating its utility in managing data anomalies. Through these efforts, we advance the understanding of GP regression in spatial contexts.

Mukangango, Juliette↗

DOE OSTI2025

Evaluation of probability density function descriptions for three-component Rayleigh–Taylor mixing

Results from simulations of a three-component Rayleigh–Taylor (RT) mixing problem are presented. These simulations are conducted in heavy–light–heavy and heavy–intermediate–light configurations, and each of these configurations are further considered in high- and low-Reynolds-number regimes. This results in RT-unstable flow with one or both interfaces initially unstable, permitting the influence of problem configuration on the statistical description of three-component RT-driven mixing to be considered. Mass fraction covariances are observed to undergo a sign change through the mixing layer in all four configurations considered. This appears to be unique to the multi-component case and represents another way in which multi-component RT mixing differs from the two-component case. Qualitative and quantitative comparisons of joint and marginal probability density function (PDF) descriptions of species concentration are made. Three-, five-, and six-parameter model PDFs are compared against simulation data to assess how accurately they describe the mixing, and it is found that three-component mixing requires at least a five-parameter model PDF to accurately describe the mixing. Notably, the marginal distributions of three-component mixing do not appear to conform to a beta distribution, representing a departure from the classical two-component RT case. In conclusion, statistical neutrality also appears to influence the optimal choice of model PDF, which is found to be a function of problem configuration.

Large-eddy simulation↗

DOE OSTI2025

Feedforward equilibrium trajectory optimization with GSPulse

One of the common tasks required for designing new plasma scenarios or evaluating capabilities of a tokamak is to design the desired equilibria using a Grad-Shafranov (GS) equilibrium solver. However, most standard equilibrium solvers are time-independent and do not include dynamic effects such as plasma current flux consumption, induced vessel currents, or voltage constraints. Another class of tools, plasma equilibrium evolution simulators, do include time-dependent effects. These are generally structured to solve the forward problem of evolving the plasma equilibrium given feedback-controlled voltages. In this work, we introduce GSPulse, a novel algorithm for equilibrium trajectory optimization, that is more akin to a pulse planner than a pulse simulator. GSPulse includes time-dependent effects and solves the inverse problem: given a user-specified set of target equilibrium shapes, as well as limits on the coil currents and voltages, the optimizer returns trajectories of the voltages, currents, and achievable equilibria. This task is useful for scoping performance of a tokamak and exploring the space of achievable pulses. The computed equilibria satisfy both Grad-Shafranov force balance and axisymmetric circuit dynamics. The optimization is performed by restructuring the free-boundary equilibrium evolution equations into a form where it is computationally efficient to optimize the entire dynamic sequence. GSPulse can solve for hundreds of equilibria simultaneously within a few minutes. GSPulse has been validated against NSTX-U and MAST-U experiments and against SPARC feedback control simulations, and is being used to perform scenario design for SPARC. The computed trajectories can be used as feedforward inputs that are connected to the feedback controller to inform and improve feedback performance. The code for GSPulse is available open-source at github.com/jwai-cfs/GSPulse_public.

equilibrium↗

DOE OSTI2025

RLGBS: Reinforcement Learning-Guided Beam Search for process optimization in a paper machine dryer section

Paper drying is responsible for over two-thirds of energy consumption in the U.S. pulp and paper industry, presenting significant potential for energy savings through optimization of process parameters. Current approaches often assume fixed operating conditions, neglecting dynamic ambient and process variations that limit achievable savings and real-world applicability. To this end, we develop a physics-based simulation environment for a paper machine dryer section and propose a reinforcement learning (RL) framework to minimize overall energy consumption by optimizing drying process parameters under diverse operating conditions. To mitigate overdrying and numerical instabilities caused by suboptimal local RL actions, we introduce Reinforcement Learning-Guided Beam Search (RLGBS), which explores multiple action sequences in parallel using beam search. Instead of making step-by-step decisions, RLGBS prioritizes solutions based on cumulative probability, reducing the impact of individual suboptimal actions. Experiments demonstrate that RLGBS achieves consistent energy savings under unseen operating conditions not encountered during training, outperforming conventional RL methods. While validated in drying optimization, this framework is broadly applicable to other RL-based industrial process control problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2024

Robust cooperative control strategy for a platoon of connected and autonomous vehicles against sensor errors and control errors simultaneously in a real-world driving environment

In a real-world driving environment, a platoon of connected and autonomous vehicles (CAVs) is subject to many internal and external disturbances, resulting in uncertain vehicle dynamics. In general, the disturbances can be categorized into two types: disturbances due to vehicle sensor errors (e.g., GPS error) and disturbances due to vehicle control errors (e.g., actuator delay). In the literature, many control strategies have been proposed to improve the robustness of the CAV platoon against uncertain vehicle dynamics induced by these disturbances. However, most of these strategies only consider one type of disturbance and cannot tackle both types of disturbances simultaneously. Furthermore, they are designed to maximize the benefits of each vehicle in the platoon independently, which can deteriorate the performance of the platoon. Here, to address these problems, this study proposes a robust cooperative control (RCC) strategy to maneuver the vehicles in the platoon cooperatively to counteract the impacts of both types of disturbances. The RCC strategy is developed based on a minimax problem, where the maximization subproblem seeks to find the worst inputs for the uncertainty terms in the vehicle dynamics equation to minimize the platoon performance, while the minimization subproblem seeks to find the optimal control decisions for all subsequent vehicles to maximize the platoon performance in the worst case. To solve the minimax problem, this study proposes a globally convergent solution algorithm. It can solve the minimax problem very efficiently to enable real time deployment of the RCC strategy. Numerical application indicates that compared to the existing methods, the RCC strategy can dramatically improve the robustness of the CAV platoon against the uncertain vehicle dynamics induced by both vehicle state detection errors and vehicle control errors. Therefore, it can maneuver the CAV platoon safely and efficiently in a real-world driving environment.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2024

SCIMON: Scientific Inspiration Machines Optimized for Novelty

We explore and enhance the ability of neu- ral language models to generate novel scien- tific directions grounded in literature. Work on literature-based hypothesis generation has traditionally focused on binary link prediction— severely limiting the expressivity of hypothe- ses. This line of work also does not focus on optimizing novelty. We take a dramatic depar- ture with a novel setting in which models use as input background contexts (e.g., problems, experimental settings, goals), and output natu- ral language ideas grounded in literature. We present SCIMON, a modeling framework that uses retrieval of “inspirations” from past scien- tific papers, and explicitly optimizes for novelty by iteratively comparing to prior papers and up- dating idea suggestions until sufficient novelty is achieved. Comprehensive evaluations reveal that GPT-4 tends to generate ideas with over- all low technical depth and novelty, while our methods partially mitigate this issue. Our work represents a first step toward evaluating and developing language models that generate new ideas derived from the scientific literature.

Ji, Heng↗