Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithms optimization”

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 343 records · Page 19

Retrieving Top-k Hyperedge Triplets: Models and Applications

Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions can- not be faithfully modeled as collections of pairwise interactions using graphs and instead require hypergraphs. However, methods that analyze hypergraphs directly, rather than via lossy graph reductions, remain limited. Hypergraph motifs hold promise in this regard, as motif patterns serve as building blocks for larger group interactions which are inexpressible by graphs. Recent work has focused on categorizing and counting hypergraph motifs based on the existence of nodes in hyperedge intersection regions. Here, we argue that the relative sizes of hyperedge inter- sections within motifs contain varied and valuable information. We propose a suite of efficient algorithms for finding top-k triplets of hyperedges based on optimizing the sizes of these intersection patterns. This formulation uncovers interesting local patterns of interaction, finding hyperedge triplets that either (1) are the least similar with each other, (2) have the highest pairwise but not groupwise correlation, or (3) are the most similar with each other. We formalize this as a combinatorial optimization problem and design efficient algorithms based on filtering hyperedges. Our comprehensive experimental evaluation shows that the resulting hyperedge triplets yield insightful information on real-world hypergraphs. Our approach is also orders of magnitude faster than a naive baseline implementation.

hypergraphs, motifs, Combinatorial Algorithms↗

Parallel Variable Population Multi-Objective Optimizer (pvpmoo) v1.0

This is a parallel variable population multi-objective optimizer with an adaptive unified differential evolution algorithm or a genetic algorithm. It can also be used for single objective optimization. Some features of this code include: 1) The population size varies from generation to generation to save the total # of objective function evaluations. 2) The population is uniformly distributed to a number of parallel processors for simultaneous objective function evaluation. 3) The objective function evaluation can be attained from an external simulation program with control variables in its input file and objectives calculated from its output files. 4) The optimizer includes an adaptive unified differential evolution algorithm and a real value genetic algorithm. The parameters in the unified differential evolution algorithm can be chosen to attain any mutation schemes in the published literature.

Qiang, Ji↗

High speed vibration compensation using magnetic fiducials via NIMBLE

Additive manufacturing (AM) technology, specifically 3D printing, holds great promise for in-orbit manufacturing. In-space printing can significantly reduce the mass, cost, and risk of long-term space exploration by enabling replacement parts to be made as needed and reducing dependence on Earth. However, printing in a zero-gravity environment poses challenges due to the absence of a rigid ground for the print platform, which can result in vibrational and rotational forces that may impact printing integrity. Here, to address this issue, this paper proposes a novel linear magnetic position tracking algorithm, named Navigation Integrating Magnets By Linear Estimation (NIMBLE), for dynamic vibration compensation during 3D printing of truss structures in space. Compared to the most commonly used nonlinear optimization method, the NIMBLE algorithm is more than two orders of magnitude faster. With only a single 3-axis magnet sensor and a small NdFeB magnet, the NIMBLE algorithm provides a simple and easily implemented tracking solution for in-orbit 3D printing.

3D printing in space↗

Learning error distribution kernel‐enhanced neural network methodology for multi‐intersection signal control optimization

Traffic congestion has substantially induced significant mobility and energy inefficiency. Many research challenges are identified in traffic signal control and management associated with artificial intelligence (AI)-based models. For example, developing AI-driven dynamic traffic system models that accurately capture high-resolution traffic attributes and formulate robust control algorithms for traffic signal optimization is difficult. Additionally, uncertainties in traffic system modeling and control processes can further complicate traffic signal system controllability. To partially address these challenges, this study presents a novel, hybrid neural network model enhanced with a probability density function kernel shaping technique to formulate traffic system dynamics better and improve comprehensive traffic network modeling and control. The numerical experimental tests were conducted, and the results demonstrate that the proposed control approach outperforms the baseline control strategies and reduces overall average delays by 11.64% on average. By leveraging the capabilities of this innovative model, this study aims to address major challenges related to traffic congestion and energy inefficiency toward more effective and adaptable AI-based traffic control systems.

Wang, Hong [Oak Ridge National Laboratory (ORNL), ↗

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

The document presents recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. An amine-based CO2 capture case study is presented to demonstrate the utility of PyROS for large-scale process models. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data-driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high-performance functional materials. Surrogate-based active learning, continually improving its surrogate model by iteratively including high-quality data points, has emerged as a cost-effective data-driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM-based active learning.

active learning↗

Deploying Mobility-On-Demand for All by Optimizing Paratransit Services

While on-demand ride-sharing services have become popular in recent years, traditional on-demand transit services cannot be used by everyone, e.g., people who use wheelchairs. Paratransit services, operated by public transit agencies, are a critical infrastructure that offers door-to-door transportation assistance for individuals who face challenges in using standard transit routes. However, with declining ridership and mounting financial pressure, public transit agencies in the USA struggle to operate existing services. We collaborate with a public transit agency from the southern USA, highlight the specific nuances of paratransit optimization, and present a vehicle routing problem formulation for optimizing paratransit. We validate our approach using real-world data from the transit agency, present results from an actual pilot deployment of the proposed approach in the city, and show how the proposed approach comprehensively outperforms existing approaches used by the transit agency. To the best of our knowledge, this work presents one of the first examples of using open-source algorithmic approaches for paratransit optimization.

Pavia, Sophie↗

Self-Aware Local Autonomous and Semi-Cooperative Control for Cross-Layered Resilience (SLAC3R)

The objective of this work is to develop and demonstrate novel, adaptive, lightweight algorithms that enable the decision-making agents in a large cyber-physical network to act both autonomously and in collaborative harmony to enforce assured resilience across spatiotemporal layers, even under unforeseen adversarial scenarios (e.g., high- impact-low-probability events). Towards this end, the proposed solution will serve as minimally invasive add-on layers that bridge the existing (faster, reactive) local myopic controls and (slower, predictive) centralized optimization. Importantly, the proposed algorithms will enable the multi-agent network to autonomously and collaboratively enforce resilient operation under no or limited communication environment typical of severe cyber- physical adversarial events. The expected outcome of this effort is a suite of prototype, open-source, software algorithms for safety-aware local autonomous and semi-cooperative control (SLAC3R), demonstrated on networked microgrids (via RD2C/Thrust-1 OPAL-RT testbed).

97 MATHEMATICS AND COMPUTING↗

A continuous calibration of the ATLAS flavour-tagging classifiers via optimal transportation maps

A calibration of the ATLAS flavour-tagging algorithms using a new calibration procedure based on optimal transportation maps is presented. Simultaneous, continuous corrections to the b-jet, c-jet, and light-flavour jet classification probabilities from jet-tagging algorithms in simulation are derived for b-jets using $t\bar{t} \rightarrow e\mu \nu \nu bb$ data. After application of the derived calibration maps, closure between simulation and observation is achieved for jet flavour observables used in ATLAS analyses of Large Hadron Collider (LHC) Run 2 proton-proton collision data. This continuous calibration opens up new possibilities for the future use of jet flavour information in LHC analyses and also serves as a guide for deriving high-dimensional corrections to simulation via transportation maps, an important development for a broad range of inference tasks.

Aad, G. [Aix-Marseille Université] (ORCID:00000002↗

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↗

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗

Modeling plasticity-mediated void growth at the single crystal scale: A physics-informed machine learning approach

Modeling the evolution of voids during plastic flow as well as their effects on plastic dissipation is critical for both component manufacturing and lifetime estimation purposes. To this end, we propose a rate-dependent constitutive model to homogenize the effects of semi-randomly distributed voids on single crystal plasticity whilst capturing void interaction and plastic anisotropy. Here, this present work focuses on the case of face centered cubic crystals to introduce an anisotropic gauge function applicable within the crystal plasticity formalism. The approach combines analytical methods to describe the micromechanics of the system in combination with symbolic regression to capture analytically intractable mechanisms from data. The hybrid framework uses a physics-informed genetic programming-based symbolic regression algorithm to solve a multiform optimization problem simultaneously producing a new gauge function and a new strain rate equation. This is also a multi-objective optimization problem with many competing objectives. A new search and selection step is introduced to the genetic algorithm that promotes convergence toward a global solution that better satisfies all the objectives. Overall, the symbolic equations produced leverage data-driven methods to achieve greater accuracy than comparable alternatives on an analytically intractable problem while maintaining model transparency.

36 MATERIALS SCIENCE↗

Rapid Bayesian High Entropy Alloy Designs Fabricated via Wire Arc Additive Manufacturing

Purpose: This project seeks to demonstrate a new high-throughput (rapid) alloy design technique applied to creating new high entropy alloys (HEAs) for extreme environments. High entropy alloys shift the design paradigm from being focused on a single principal element (e.g. nickel-based alloys) to target alloys that include high atomic fractions (X >10%) of multiple elements. These HEA materials can exhibit sluggish diffusion and enhanced corrosion resistance, ideal for potential applications in advanced ultra supercritical (A-USC) steam cycles for power generation. Scope: The addition of multiple elements in high atomic fractions creates an enormous design space that cannot easily be investigated by traditional material design strategies such as designed of experiments (DOE). This project utilizes a Bayesian machine learning algorithm that has been modified to work with calculation of phase diagrams (CALPHAD) software. This Bayesian algorithm reduces manual inputs and increase the likelihood of achieving an optimal solution. Compositional inputs to this algorithm will be assessed using existing material property models for high temperature strength and corrosion resistance. The target for alloy performance will be a 15% (~100 ⁰C) increase in allowable service temperature beyond heat-resistant stainless steels while maintaining or improving alloy cost and corrosion resistance. Haynes 230 was selected as a baseline, which is 57 wt% Ni with 22 wt% Cr 14 wt% W, and 2 wt% Mo as solid solution strengtheners. In addition to rapid design via Bayesian machine learning, the alloys were rapidly fabricated using a multi-wire arc additive manufacturing (mWAAM) technique which allows for precise control of alloy composition and assessing of alloy design “windows” to study composition effects. Build speeds for wire-arc additive processes are among the highest for additive technologies enabling rapid and reliable sample fabrication when compared to conventional methods such as arc button melting. The mWAAM samples will be rapidly characterized via instrumented indentation for room temperature modulus and strength and for elevated temperature strength via hot hardness tests. After being screened with hardness testing, potential alloys will be further evaluated with conventional microscopy techniques including scanning electron microscopy (SEM) and transmission electron microscopy (TEM) to assess agreement with modeling results. The most promising compositions will also be evaluated by printing full sized tensile specimens for mechanical behavior tests at elevated temperatures. Results: Bayesian machine learning of a single performance function was initially used to optimize five performance metrics: 1) single phase stability, 2) yield strength, 3) creep resistance (low diffusion coefficient), 4) freezing range (weldability), and 5) material cost. The single performance function was suboptimal as assumptions had to be made about the results while formulating the optimization. A goal-oriented Bayesian optimization strategy (Hanaoka, 2021) was implemented with CALPHAD for use with the five metrics above. This multi-objective Bayesian optimization (MOBO) enabled the design of NiCrCoFe alloys with V and W additions. A base composition of NiCoCr was selected as Ni provides a stable FCC matrix, Cr aids corrosion/oxidation resistance, and Co is a solid-solutions strengthener that also improves creep by increasing the activation energy. Fe helps reduce diffusion coefficients and cost. Finally, V and W were selected for their reasonable solubility and high atomic misfit to aid in solid solution strengthening. Cracking of the mWAAM specimens was an early issue, and the Easton solidification cracking model (Easton et al., 2014a) was selected for addition to the MOBO function. High performing alloys fabricated by mWAAM included Ni 28 Cr 25 Co 26 Fe 15 V 8 and Ni 62 Cr 18 Co 1 Fe 3 W 15 . It was observed that even after adapting the mWAAM process for W, the W did not fully dissolve. To fully evaluate the Ni 62 Cr 18 Co 1 Fe 3 W 15 composition, a cored wire (80-20 NiCr sheath/powder core) was manufactured and printed via WAAM, and HIP’ing was utilized to homogenize and densify the printed alloy. The V and W alloys produced met metrics 1 (solid solution), 4 (solidification cracking), and 5 (cost). However, an unmodeled mechanism of thermal stress cracking was identified in the WAAM produced materials, perhaps exacerbated by the lack of grain boundary strengthening elements (B, C). Conclusions & Recommendations: A high-throughput (rapid) alloy design technique was applied to designing and manufacturing new high entropy alloys (HEAs) for extreme environments utilizing MOBO and mWAAM. The developed process was rapid and effective in addressing the mechanisms included in the model. The lack of grain boundary strengthening element additions (e.g., B, C) was a simplification that likely produced thermal stress cracking that turned into a large part of the investigation. Additions on the order of 0.005 wt% B and 0.05 wt% C likely would have minimized thermal stress grain boundary cracking. Overall, the high throughput design strategy is promising for rapid design of metrics-driven alloys for advanced ultra supercritical (A-USC) steam cycles for power generation. The MOBO and mWAAM process could be commercialized to accelerate metrics-driven alloy design. In addition, the cored-wire process utilized for scale-up is a promising high-volume process for WAAM alloy development and scale-up.

36 MATERIALS SCIENCE↗

Modeling and Optimization of Zeolites for Contaminant Removal from Coal Combustion Impoundment Leachates

Coal Combustion Residual (CCR) landfills in the U.S. can lead to elevated contaminant concentrations in groundwater and runoff, particularly of arsenic, boron, and selenium. Zeolites can be readily synthesized from materials contained within the coal combustion ash impoundments and can be cation-exchanged to enhance adsorption capacity, selectivity, and reactivity. However, the optimization of zeolites becomes a daunting task when accounting for the variety of Si:Al ratios, the species of extra-framework cations present, and the zeolite pore structure. Molecular simulations provide methods to study and guide the design of zeolites for the sorption of contaminants from aqueous solution. In this work, models that predict the sorption of arsenic, boron, and selenium from water using cation-exchanged zeolites. Because of the lack of experimental adsorption data for these species of contaminants, models were parametrized to reproduce the results of first-principles calculations and then used to predict sorption for zeolites for a dataset containing 6000 combinations of zeolites and sorption conditions. Machine learning was used to train a model to predict sorption for materials in this database based on the results of the molecular simulations. Next, a genetic algorithm was used to optimize zeolites for the removal of each contaminant from aqueous solution for individual impoundment sites based on contaminant concentrations reported by the Electric Power Research Institute.

Findley, John↗

Direct structural retrieval from gas-phase ultrafast diffraction data using a genetic algorithm

Ultrafast scattering techniques such as ultrafast electron diffraction and ultrafast x-ray diffraction have been utilized to elucidate the structural dynamics, reaction intermediates, and final products in molecular reactions following photoexcitation. The time-dependent structures are typically not directly retrieved from the experimental data, but they rely on comparison with calculations. The genetic algorithm (GA), a global optimization strategy, can be used to retrieve the molecular structures directly from diffraction patterns without any theoretical input. However, the robustness of the GA with respect to real experimental conditions such as a limited momentum transfer range, noise, and artifacts has not been studied in detail. In this work, we characterize the performance of the GA with simulated data that mimic realistic experimental conditions. We have developed and implemented a variant of the GA specific to diffraction measurements which performs better in the presence of imperfect data compared to the standard implementation of the GA. We demonstrate this method with both synthetic data and experimental ultrafast electron diffraction data on the UV-induced photodissociation of trifluoroiodomethane (C⁢F 3⁡ I) molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗

Multi-Objective Optimization of Uranium Target Assembly–3: A Comparison of Genetic and Traditional Methods

Commonly produced as a byproduct of uranium fission, 99 Mo is a key medical isotope that is in high demand in the United States. An international goal is to switch from medical isotope production technologies that require highly enriched uranium to medical isotope production technologies that require only low-enriched uranium. Niowave Inc. is contributing to this goal by developing an accelerator-driven subcritical assembly called the Uranium Target Assembly (UTA). This work compares the performance of Dakota’s Multi-Objective Genetic Algorithm (MOGA) against traditional sensitivity analysis in the neutronic optimization of the UTA-3 system. The design objectives are k-eigenvalue (k eff ) and natural uranium fission power, which are directly correlated with the amount of 99 Mo produced. Dakota:MOGA did not perform as well as human engineering ingenuity in optimization studies with high numbers of input parameters, such as fuel rod type selection and fuel rod placement. However, Dakota:MOGA did outperform traditional sensitivity analysis in optimization studies with fewer than 20 parameters and revealed the degree to which each parameter influences the optimal design space for k eff and natural uranium fission power (to a lesser extent). As the design model became more complex in the final stage of design, the computational resources required to calculate the design objective values in the Monte Carlo N-Particle transport code from selected input parameter combinations limited Dakota:MOGA’s performance, and, unfortunately, human intervention was required to discern the optimal design space. In conclusion, future work will attempt to reduce computational resource constraints by incorporating areduced-order neutronics model into the optimization cycle.

Accelerator-driven systems↗