SEARCH · Search NASA

Results for “Genetic algorithms”

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.

59 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Exact block encoding of imaginary time evolution with universal quantum neural networks

We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary time propagator is implemented through an exact block encoding by means of a unitary, restricted Boltzmann machine architecture. Marginalization over the hidden-layer neurons (auxiliary qubits) creates the nonunitary action on the visible layer. Then, we introduce a unitary deep Boltzmann machine architecture in which the hidden-layer qubits are allowed to couple laterally to other hidden qubits. We prove that this wave-function is closed under the action of the imaginary time propagator and, more generally, can represent the action of a universal set of quantum gate operations. We provide analytic expressions for the coefficients for both architectures, thus enabling exact network representations of thermal states without stochastic optimization of the network parameters. In the limit of large imaginary time, the yields the ground state of the system. The number of qubits grows linearly with the number of interactions and total imaginary time for a fixed interaction order. Both networks can be readily implemented on quantum hardware via midcircuit measurements of auxiliary qubits. If only one auxiliary qubit is measured and reset, the circuit depth scales linearly with imaginary time and number of interactions, while the width is constant. Alternatively, one can employ a number of auxiliary qubits linearly proportional to the number of interactions, and circuit depth grows linearly with imaginary time only. Every midcircuit measurement has a postselection success probability, and the overall success probability is equal to the product of the probabilities of the midcircuit measurements.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Community Resilience Through Rapid Restoration Leveraging Distributed Energy Resources (DERs) and Low-Cost Sensors

Equitable and automated bottoms-up power restoration following an extreme event will be demonstrated at a site in Puerto Rico. To do so, the team will develop enhanced grid situational awareness techniques integrating behind-the-meter (BTM) distributed energy resources (DER) discovery, impedance sweeping based outage boundary detection, and feasible restoration path identification algorithms. Resilience metric will be developed and incorporated along with situational awareness information in a distributed Model Predictive Control (MPC)-based restoration optimization algorithm to control and mobilize grid assets. These algorithms will be validated through power hardware-in-the-loop experiments and ultimately, a site demonstration to show that outage recovery time and total recovered load could be improved by >20% over the baseline.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

DOE OSTI2026

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗

DOE OSTI2021

AI-Batt (Autonomous Identification of Battery Life Models) [SWR 21-36]

Autonomous Identification of Battery Life Models (AI-Batt) AI-Batt is a MATLAB code base for developing lifetime models for batteries from accelerated aging data. The code base provides many functions for processing, visualizing, and modeling battery aging data, making the data processing, exploration, and modeling workflow substantially faster. These tools are tailored for working with battery aging data sets, which usually consist of many separate time-series for each cell, with many test conditions and possible replicates at each condition, which makes it difficult to simply process or visualize the data set. Complex modeling tasks, such as cross-validation, sensitivity analysis, and uncertainty quantification have been implemented to enable thorough statistical investigation of model predictions. Additionally, several machine-learning algorithms are implemented to autonomously identify suitable models via symbolic regression. Data processing functions automatically cast data from the struct data type, which is commonly used to store experimental data, but is not an acceptable input for most algorithms, to the table data type, which can be easily used as input to any optimization algorithm. Also, the data can be separated into time-invariant and time-variant data tables, which is helpful for exploring the data set as well as developing separate models for time-variant and time-invariant aging mechanisms. For example, in aging tests with constant temperature, temperature is a time-invariant experimental condition. Visualization tools enable plotting of data, model fits, and model simulations possible with single-line function calls, empowering data exploration of complex data sets with both time-varying and time-invariant trends. Plots can be automatically generated for the whole data set, or separated by data group (groups of test replicates) or individual data series. Data points or data series can be automatically colored by the value of a variable with a variety of color maps, and model predictions can also be colored by the value of a fit statistic. Comparisons between data sets and the predictions/simulations of different models on the same data set can be easily plotted as well. Distributions of parameter values from bootstrap resampling can be plotted to visualize the reliability of parameter estimation, or determine any correlations between parameters. Modeling tools handle the complex task of creating and parsing symbolic equations for modeling battery lifetime. Equations are parsed to grab relevant data variables, parameter values, or specified sub-models for input into optimization, evaluation, or simulation functions. Models can be optimized locally (one set of parameters for each data series), bi-level (some parameters shared across the data set), or globally (single set of parameters for all data). Functions implementing symbolic regression algorithms help users to discover effective model equations, even in poorly sampled, high-dimensional data.

Smith, Kandler [National Renewable Energy Lab. (NR↗

DOE OSTI2024

Recognizing Blazars Using Radio Morphology from the VLA Sky Survey

Abstract Blazars are radio-loud active galactic nuclei whose jets have a very small angle to our line of sight. Observationally, the radio emissions are mostly compact or compact-core with a one-sided jet. With 2.″5 resolution at 3 GHz, the Very Large Array Sky Survey (VLASS) enables us to resolve the structure of some blazar candidates in the sky north of decl. −40°. We introduce an algorithm to classify radio sources as either blazar-like or non-blazar-like based on their morphology in the VLASS images. We apply our algorithm to three existing catalogs, including one of the known blazars (Roma-BzCAT) and two blazar candidates identified by Wide-field Infrared Survey Explorer colors and radio emission (WIBRaLS, KDEBLLACS). We show that in all three catalogs, there are objects with morphologies inconsistent with being blazars. Considering all the catalogs, more than 12% of the candidates are unlikely to be blazars, based on this analysis. Notably, we show that 3% of the Roma-BzCATconfirmedblazars could be a misclassification based on their VLASS morphology. The resulting table with all sources and their radio morphological classification is available online.

Astronomy & Astrophysics↗

DOE OSTI2024

Trust-Based Detection and Mitigation of Cyber Attacks in Distributed Cooperative Control of Islanded AC Microgrids

In this study, we address the challenge of detecting and mitigating cyber attacks in the distributed cooperative control of islanded AC microgrids, with a particular focus on detecting False Data Injection Attacks (FDIAs), a significant threat to the Smart Grid (SG). The SG integrates traditional power systems with communication networks, creating a complex system with numerous vulnerable links, making it a prime target for cyber attacks. These attacks can lead to the disclosure of private data, control network failures, and even blackouts. Unlike machine learning-based approaches that require extensive datasets and mathematical models dependent on accurate system modeling, our method is free from such dependencies. To enhance the microgrid’s resilience against these threats, we propose a resilient control algorithm by introducing a novel trustworthiness parameter into the traditional cooperative control algorithm. Our method evaluates the trustworthiness of distributed energy resources (DERs) based on their voltage measurements and exchanged information, using Kullback-Leibler (KL) divergence to dynamically adjust control actions. We validated our approach through simulations on both the IEEE-34 bus feeder system with eight DERs and a larger microgrid with twenty-two DERs. The results demonstrated a detection accuracy of around 100%, with millisecond range mitigation time, ensuring rapid system recovery. Additionally, our method improved system stability by up to almost 100% under attack scenarios, showcasing its effectiveness in promptly detecting attacks and maintaining system resilience. These findings highlight the potential of our approach to enhance the security and stability of microgrid systems in the face of cyber threats.

Computer Science↗

DOE OSTI2026

Integration of ultra-low coverage whole-genome sequences for reconstructing the evolutionary history of Galapagos giant tortoises

Genomic data from contemporary and historical samples often need to be coupled for evolutionary reconstructions of multitaxon complexes. However, the genetic data recovered from historical samples may result only in ultra-low coverage whole-genome sequences (ulcWGS; <0.15× depth), leading to inaccurate evolutionary inferences given a preponderance of missing data. Using the Galapagos giant tortoise radiation as a study system (Chelonoidis spp., composed of 13 extant and four extinct lineages), we assembled a novel methodological pipeline that removes potential noise introduced by the missing data and enhances the evolutionary signal from ulcWGS samples. We leveraged existing tools for phylogenomic placement (EPA-ng), population genomic structure (smartsnp) and admixture (Admixfrog, NGSadmix) to demonstrate that the evolutionary history of samples can be uncovered with sequencing depths as low as 0.008–0.139×. Importantly, these approaches do not use genotype imputation of the ulcWGS samples, which would require extensive reference datasets. Our application to two cases of extinct lineages of Galapagos giant tortoises, with and without references from the same lineage, demonstrates the general value of the approach. We confirm where the extinct lineages from San Cristóbal and Santa Fe islands fit into the Galapagos giant tortoise radiation, and that these lineages were evolutionarily distinct entities.

ancient DNA↗

DOE OSTI2026

The ABCs of phase retrieval: Connecting the acronyms of scanning transmission electron microscopy

High-resolution scanning transmission electron microscopy (S/TEM) is an indispensable tool for characterizing the structure and properties of materials down to the atomic scale. Conventional S/TEM imaging, however, is limited by the phase problem, whereby the phase of the electron exit wave is lost upon detection. Recent advances in diffractive imaging and 4D-STEM have enabled a range of phase-retrieval techniques that computationally reconstruct the missing information encoded in the phase of the transmission function. These approaches offer improved dose efficiency and enhanced sensitivity to weakly scattering signals, extending quantitative imaging to beam-sensitive materials composed of light elements. In this work, we introduce the phase problem in electron microscopy and survey the diverse landscape of phase-retrieval techniques used in the field. Despite their many acronyms and algorithmic variations, these techniques share a common physical and mathematical foundation. We present a unified framework that connects these seemingly distinct methods, from parallax imaging and tilt-corrected bright-field (tcBF-STEM), to aberration-corrected bright-field (acBF-STEM), optimum bright-field (OBF-STEM) and single-sideband (SSB) ptychography, as well as first-moment integrated center of mass techniques (iCOM) and iterative ptychographic algorithms. Based on these insights, we discuss the opportunities and practical limitations of applying these methods across different materials systems, detector designs, and microscope configurations.Graphical abstractRepresentative electron microscopy configurations used for phase retrieval and diffractive imaging in S/TEM: (a) Zernike phase-contrast transmission electron microscopy (TEM), (b) small-convergence-angle four-dimensional scanning transmission electron microscopy (4D-STEM) for nanobeam-based phase reconstruction methods, and (c) large-convergence-angle 4D-STEM for ptychographic and related diffractive imaging techniques reviewed in this work.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Integrated Simulation of Weld Residual Stress Evolution and Crack Propagation Using XFEM

Nuclear power plant components operate in environments that promote multiple degradation mecha- nisms, several of which involve crack initiation and growth. An ongoing effort in the U.S. Department of Energy’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program is developing a general capability within the Multiphysics Object Oriented Simulation Environment (MOOSE) framework for simulating three-dimensional crack growth under a range of driving conditions, including fatigue, stress corrosion cracking (SCC), brittle fracture, and stress-relaxation cracking. This report demonstrates an end-to-end workflow that uses this capability to model weld-residual-stress-driven SCC in the J-groove weld of a pressurized-water reactor control rod drive mechanism penetration in the vessel head. The workflow consists of a thermomechanical welding simulation with temperature-dependent plasticity, followed by cooldown to ambient conditions, and a restart of the simulation using the MOOSE extended finite element method (XFEM) module to propagate a three-dimensional crack through the residual stress field. New welding capabilities were developed to properly initialize newly activated elements in the weld region, and robustness improvements were made to the mesh-based algorithm for defining cutting planes in the 3D XFEM algorithm, allowing it to handle complex crack fronts and stress fields. Together these advances allowed the simulated SCC crack to grow from an initial elliptical flaw in the weld, across the weld, through the tube wall, and almost to the triple point (where the weld, tube, and reactor pressure vessel head intersect) over roughly 36 years of simulated service. These results demonstrate a workflow that can be extended to fully three-dimensional welding simulations and more complex crack interaction problems.

42 - ENGINEERING↗

DOE OSTI2026

Predicting Band-Gap of Inorganic Materials Using Neuromorphic Graph Learning

Predicting properties of inorganic materials is a heavily researched topic, with several new prediction approaches emerging as competitors. One such competitor is graph neural networks, which leverage the structure of the graph to aid in the prediction process. In this work, we propose integration of neuromorphic computation into the graph neural network pipeline. We call this approach Neuromorphic Graph Learning (NGL). We utilize the NGL approach to leverage evolutionary algorithms and a novel Spike Pipeline for Raster Analysis (SPIRE) for the prediction of band gap in inorganic materials.

Mulet, Ian [University of Tennessee (UT)]↗

DOE OSTI2026

Advancing Protein Display on Bacterial Spores through an Extensive Survey of Coat Components

The profound stability of bacterial spores makes them a promising platform for biotechnological applications like biocatalysis, bioremediation, drug delivery, etc. However, though the Bacillus subtilis spore is composed of >40 types of proteins, only ∼12 have been explored as fusion carriers for protein display. Here, we assessed the suitability of 33 spore proteins (SPs) as enzyme display carriers by direct allele tagging at native genomic loci. Of the 33 SPs investigated, 26 formed functional fusions with β-glucuronidase (GUS)─a ∼272 kDa homotetramer. This almost triples the number of SPs assessed for enzyme display and doubles the number of functional fusions documented in the literature. We quantitatively assessed 1) SP promoter activation dynamics, 2) GUS activity on spores, 3) surface availability, and 4) protection from thermal and proteolytic degradation. Multicopy expression and pairwise coexpression of the most promising SP-GUS fusions highlighted the complexity of spore structure/assembly and the difficulty in predicting compatibility between different SP fusions. We also assessed the suitability of engineered spores to degrade PET (polyethylene terephthalate) films and found that surface-exposed SPs were most effective. Beyond the broad survey, a key outcome of our work was the identification of SscA (small spore coat assembly protein A) as an effective spore display carrier. SscA supported enzyme activity at least 4-fold higher than any other SP, including the well-established anchor, CotY. We attribute this to its promoter, which demonstrated early and sustained activation relative to other SPs and its small size (∼3 kDa), which likely minimally interferes with enzyme folding, oligomerization, and activity. Labeling and genetic studies, its hydrophobic nature, and low surface availability suggest that SscA assembles within the inner spore coat, which makes it stabilizing and suitable for many biocatalytic applications. Overall, this work serves as a knowledge base to advance the biotechnological utility of B. subtilis spores.

Bacillus subtilis↗

DOE OSTI2025

Bridging Additive Manufacturing and Electronics Printing in the Age of AI

Printing techniques have been instrumental in developing flexible and stretchable electronics, including organic light-emitting diode displays, organic thin film transistor arrays, electronic skins, organic electrochemical transistors for biosensors and neuromorphic computing, as well as flexible solar cells with low-cost processes such as inkjet printing, ultrasonic nozzle, roll-to-roll coating. The rise of additive manufacturing provides even more opportunities to print electronics in automated and customizable ways. In this work, we will review the current technologies of printing electronics (including printed batteries, supercapacitors, fuel cells, and sensors), especially with 3D printing. In this age of ongoing AI revolution, the application of AI algorithms is discussed in terms of combining them with 3D printing and electronics printing for a future with automated optimization, sustainable design, and customizable and scalable manufacturing.

Chemistry↗

DOE OSTI2025

Multi-Resolution UAV Path Replanning for Inspection of Tailings Dams

Autonomous inspection of large and complex structures with a commercial unmanned aerial vehicle (UAV) is a challenging problem that has been addressed in recent years. In this paper, we address the global motion planning problem of creating autonomous inspection missions for UAVs considering photogrammetry constraints. We focus on the inspection of large tailings dams, which are dam structures used to store waste byproducts of mining. Our method uses a prior sparse point cloud of the dam to generate a voxel grid, where paths satisfying photogrammetry constraints are tested for collisions. We then apply the A* algorithm as a local planner to avoid obstacles within the global mission. Moreover, we address the problem of changing routes online by using octree-based multi-resolution grids for efficient and fast pathfinding. Our results, obtained using tridimensional maps of an actual coal mine tailings dam, show that using octrees for multi-resolution motion planning is faster than using a fixed voxel grid in online missions while inspecting large structures.

42 ENGINEERING↗

DOE OSTI2022

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Using scalable computer vision to automate high-throughput semiconductor characterization

Abstract High-throughput materials synthesis methods, crucial for discovering novel functional materials, face a bottleneck in property characterization. These high-throughput synthesis tools produce 10 4 samples per hour using ink-based deposition while most characterization methods are either slow (conventional rates of 10 1 samples per hour) or rigid (e.g., designed for standard thin films), resulting in a bottleneck. To address this, we propose automated characterization (autocharacterization) tools that leverage adaptive computer vision for an 85x faster throughput compared to non-automated workflows. Our tools include a generalizable composition mapping tool and two scalable autocharacterization algorithms that: (1) autonomously compute the band gaps of 200 compositions in 6 minutes, and (2) autonomously compute the environmental stability of 200 compositions in 20 minutes, achieving 98.5% and 96.9% accuracy, respectively, when benchmarked against domain expert manual evaluation. These tools, demonstrated on the formamidinium (FA) and methylammonium (MA) mixed-cation perovskite system FA 1−x MA x PbI 3 , 0 ≤ x ≤ 1, significantly accelerate the characterization process, synchronizing it closer to the rate of high-throughput synthesis.

Science & Technology - Other Topics↗

DOE OSTI2025

Tensorized Interior Radiative Heat Transfer for a Scalable and Calibrated Building Energy Simulator

Building energy simulation is a critical tool for developing and testing advanced control strategies, such as Reinforcement Learning (RL), to provide demand flexibility and affordable energy costs. The recently introduced Smart Buildings Control Suite (sbsim) provides a lightweight, scalable, and data-calibrated simulation environment based on a 2D finite-difference model. However, the initial model primarily focused on conductive and convective heat transfer, neglecting the significant impact of long-wave radiative heat exchange between interior surfaces. This paper presents a significant extension to the sbsim framework by incorporating a physically-grounded model for interior radiative heat transfer. Our primary contribution is the development and integration of a fully tensorized radiative heat transfer module, which preserves the computational efficiency and scalability of the original simulator. This was achieved by developing a pipeline for view factor calculation, including an algorithm to identify directly seeing surfaces within complex floor plans, and formulating the net radiation equations for efficient execution on modern hardware accelerators. We validate the numerical accuracy of our tensorized implementation by comparing its results against a traditional iterative approach, demonstrating identical outcomes. This enhancement increases the physical fidelity of sbsim, enabling more accurate training of RL agents for building energy optimization.

Ham, Sang woo↗

DOE OSTI2024

Hamiltonian switching control of noisy bipartite qubit systems

Abstract We develop a Hamiltonian switching ansatz for bipartite control that is inspired by the quantum approximate optimization algorithm, to mitigate environmental noise on qubits. We demonstrate the control for a central spin coupled to bath spins via isotropic Heisenberg interactions, and then make physical applications to the protection of quantum gates performed on superconducting transmon qubits coupling to environmental two-level-systems (TLSs) through dipole-dipole interactions, as well as on such qubits coupled to both TLSs and a Lindblad bath. The control field is classical and acts only on the system qubits. We use reinforcement learning with policy gradient to optimize the Hamiltonian switching control protocols, using a fidelity objective for specific target quantum gates. We use this approach to demonstrate effective suppression of both coherent and dissipative noise, with numerical studies achieving target gate implementations with fidelities over 0.9999 (four nines) in the majority of our test cases and showing improvement beyond this to values of 0.999 999 999 (nine nines) upon a subsequent optimization by GRadient Ascent Pulse Engineering (GRAPE). We analyze how the control depth, total evolution time, number of environmental TLS, and choice of optimization method affect the fidelity achieved by the optimal protocols and reveal some critical behaviors of bipartite control of quantum gates.

Physics↗