Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomized algorithm”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Local design optimization for composite transport fuselage crown panels

Composite transport fuselage crown panel design and manufacturing plans were optimized to have projected cost and weight savings of 18 percent and 45 percent, respectively. These savings are close to those quoted as overall NASA ACT program goals. Three local optimization tasks were found to influence the cost and weight of fuselage crown panels. This paper summarizes the effect of each task and describes in detail the task associated with a design cost model. Studies were performed to evaluate the relationship between manufacturing cost and design details. A design tool was developed to aid in these investigations. The development of the design tool included combining cost and performance constraints with a random search optimization algorithm. The resulting software was used in a series of optimization studies that evaluated the sensitivity of design variables, guidelines, criteria, and material selection on cost. The effect of blending adjacent design points in a full scale panel subjected to changing load distributions and local variations was shown to be important. Technical issues and directions for future work were identified.

Swanson, G. D.↗
NASA NTRS2013

Automated Long - Term Scheduling for the SOFIA Airborne Observatory

The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the "Early Science" program as well as a deployment to Germany. The new observing period, known as Cycle 1, is scheduled to begin in 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA long-term schedules that will be used in operations from the Cycle 1 observing period. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.

Civeit, Thomas↗
NASA NTRS2016

DeepSAT: A Deep Learning Approach to Tree-Cover Delineation in 1-m NAIP Imagery for the Continental United States

High resolution tree cover classification maps are needed to increase the accuracy of current land ecosystem and climate model outputs. Limited studies are in place that demonstrates the state-of-the-art in deriving very high resolution (VHR) tree cover products. In addition, most methods heavily rely on commercial softwares that are difficult to scale given the region of study (e.g. continents to globe). Complexities in present approaches relate to (a) scalability of the algorithm, (b) large image data processing (compute and memory intensive), (c) computational cost, (d) massively parallel architecture, and (e) machine learning automation. In addition, VHR satellite datasets are of the order of terabytes and features extracted from these datasets are of the order of petabytes. In our present study, we have acquired the National Agriculture Imagery Program (NAIP) dataset for the Continental United States at a spatial resolution of 1-m. This data comes as image tiles (a total of quarter million image scenes with ~60 million pixels) and has a total size of ~65 terabytes for a single acquisition. Features extracted from the entire dataset would amount to ~8-10 petabytes. In our proposed approach, we have implemented a novel semi-automated machine learning algorithm rooted on the principles of "deep learning" to delineate the percentage of tree cover. Using the NASA Earth Exchange (NEX) initiative, we have developed an end-to-end architecture by integrating a segmentation module based on Statistical Region Merging, a classification algorithm using Deep Belief Network and a structured prediction algorithm using Conditional Random Fields to integrate the results from the segmentation and classification modules to create per-pixel class labels. The training process is scaled up using the power of GPUs and the prediction is scaled to quarter million NAIP tiles spanning the whole of Continental United States using the NEX HPC supercomputing cluster. An initial pilot over the state of California spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles has produced true positive rates of around 88 percent for fragmented forests and 74 percent for urban tree cover areas, with false positive rates lower than 2 percent for both landscapes.

Imagery↗
NASA NTRS2018

Silhouette-Informed Trajectory Generation Through a Wire Maze for Small UAS

Current rapidly-exploring random tree (RRT) algorithms rely on proximity query packages that often include collision checkers, tolerance verification, and distance computation algorithms for the generation of safe paths. In this paper, we broaden the information available to the path-planning algorithm by incorporating silhouette information of nearby obstacles in conflict. A silhouette-informed tree (SIT) is generated through the flight-safe region of a wire maze for a single unmanned aerial system (UAS). The silhouette is used to extract local geometric information of nearby obstacles and provide path alternatives around these obstacles. Thus, focusing the search for the generation of new tree branches near these obstacles, and decreasing the number of samples required to explore the narrow corridors within the wire maze. The SIT is then processed to extract a path that connects the initial location of the UAS with the goal, reduce the number of line segments in this path if possible, and smooth the resulting path using Pythagorean Hodograph Bezier curves. To ensure that the smoothed path remains in the flight-safe region of the configuration space, a tolerance verification algorithm for Bezier curves and convex polytopes in three dimensions is proposed. Lastly, temporal specifications are imposed on the smoothed path in the shape of an arbitrary speed profile.

Puig-Navarro, Javier↗
DOE OSTI2023

Machine Learning for Advanced Building Construction: Preprint

High-efficiency retrofits can play a key role in reducing carbon emissions associated with buildings if processes can be scaled-up to reduce cost, time, and disruption. Here we demonstrate an artificial intelligence/computer vision (AI/CV)- enabled framework for converting exterior build scans and dimensional data directly into manufacturing and installation specifications for overclad panels. In our workflow point clouds associated with LiDAR-scanned buildings are segmented into a facade feature space, vectorized features are extracted using an iterative random-sampling consensus algorithm, and from this representation an optimal panel design plan satisfying manufacturing constraints is generated. This system and the corresponding construction process is demonstrated on a test facade structure constructed at the National Renewable Energy Laboratory (NREL). We also include a brief summary of a techno-economic study designed to estimate the potential energy and cost impact of this new system.

building retrofits↗
DOE OSTI2023

Machine Learning for Advanced Building Construction

High-efficiency retrofits can play a key role in reducing carbon emissions associated with buildings if processes can be scaled-up to reduce cost, time, and disruption. Here we demonstrate an artificial intelligence/computer vision (AI/CV)-enabled framework for converting exterior build scans and dimensional data directly into manufacturing and installation specifications for overclad panels. In our workflow point clouds associated with LiDAR-scanned buildings are segmented into a facade feature space, vectorized features are extracted using an iterative random-sampling consensus algorithm, and from this representation an optimal panel design plan satisfying manufacturing constraints is generated. This system and the corresponding construction process is demonstrated on a test facade structure constructed at the National Renewable Energy Laboratory (NREL). We also include a brief summary of a techno-economic study designed to estimate the potential energy and cost impact of this new system.

build scans↗
DOE OSTI2025

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗
DOE OSTI2025

Digital twin framework for PIP-II linac: AI-driven multi-scale modeling from ion source to 800 MeV

The PIP-II superconducting linac at Fermilab is designed to deliver multi-megawatt proton beams for neutrino physics and other high-intensity applications. To expedite commissioning and enhance operational reliability, we have developed an EPICS-based data flow framework that seamlessly integrates digital twins (DT) with physical twins (PT). These digital twins comprise high-fidelity beam dynamics models or data-driven surrogate models connected to their physical counterparts through real-time diagnostics and advanced machine-learning algorithms.Central to this framework is Linac_Gen, an accelerated simulation tool that incorporates convolutional neural networks, random forests, and genetic algorithms to provide up to a tenfold speedup in optimizing the accelerator geometry model. An EPICS translator layer ensures interoperability by efficiently mapping lattice parameters across diverse simulation platforms.Our EPICS-based framework supports multiple operational modes—monitoring, passive learning, closed-loop control, and online learning—covering the entire machine lifecycle. By leveraging HPC resources and multi-objective optimization techniques, the digital twin enables adaptive trajectory correction, real-time fault detection, and predictive modeling of beam stability. This comprehensive approach paves the way for robust, high-intensity operation and data-driven accelerator R&D at Fermilab.

Pathak, Abhishek [Fermilab]↗
DOE OSTI2021

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2001

Extrapolation of the dna fragment-size distribution after high-dose irradiation to predict effects at low doses

The patterns of DSBs induced in the genome are different for sparsely and densely ionizing radiations: In the former case, the patterns are well described by a random-breakage model; in the latter, a more sophisticated tool is needed. We used a Monte Carlo algorithm with a random-walk geometry of chromatin, and a track structure defined by the radial distribution of energy deposition from an incident ion, to fit the PFGE data for fragment-size distribution after high-dose irradiation. These fits determined the unknown parameters of the model, enabling the extrapolation of data for high-dose irradiation to the low doses that are relevant for NASA space radiation research. The randomly-located-clusters formalism was used to speed the simulations. It was shown that only one adjustable parameter, Q, the track efficiency parameter, was necessary to predict DNA fragment sizes for wide ranges of doses. This parameter was determined for a variety of radiations and LETs and was used to predict the DSB patterns at the HPRT locus of the human X chromosome after low-dose irradiation. It was found that high-LET radiation would be more likely than low-LET radiation to induce additional DSBs within the HPRT gene if this gene already contained one DSB.

NASA Discipline Radiation Health↗
NASA NTRSDate not supplied

Mapping National Forest Aboveground Biomass in Mexico By Integrating GEDI and Landsat Times Series Data

Mexico is one of the countries with great potential for the UN's Reducing Emissions from Deforestation and Forest Degradation (REDD+) program, a key nature-based solution for the forest sector. To monitor carbon stock changes, there is a growing demand for unbiased Monitoring Reporting Verification (MRV) systems to facilitate effective forest management and climate change mitigation strategies. Remote sensing-based national aboveground biomass density (AGBD) estimation over Mexico is scarce and often limited to one-time static mapping, leading to spatiotemporal inconsistency in inputs. As an effort under NASA's Carbon Monitoring System (CMS) program, we have developed a remote sensing-based approach to create consistent historical AGBD maps of Mexico using multi-stream remote sensing data, including spaceborne lidar GEDI and long-term Landsat time series, as well as topographic information. We employ the continuous change detection and classification (CCDC) algorithm for temporal modeling of Landsat surface reflectance, followed by the inference of forest AGBD using a random forest machine learning algorithm with the temporal information of land surface dynamics extracted by the CCDC as input. GEDI provides unprecedented forest structure and AGBD sampling datasets for model training and validation practices. In this presentation, we share the progress made in developing a spatially explicit mapping of historical AGBD changes associated with land surface changes and post-disturbance landscapes.

Taejin Park↗
DOE OSTI2021

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗
DOE OSTI2021

A Machine Learning-Based Vulnerability Analysis for Cascading Failures of Integrated Power-Gas Systems

This article proposes a cascading failure simulation (CFS) method and a hybrid machine learning method for vulnerability analysis of integrated power-gas systems (IPGSs). The CFS method is designed to study the propagating process of cascading failures between the two systems, generating data for machine learning with initial states randomly sampled. The proposed method considers generator and gas well ramping, transmission line and gas pipeline tripping, island issue handling and load shedding strategies. Then, a hybrid machine learning model with a combined random forest (RF) classification and regression algorithms is proposed to investigate the impact of random initial states on the vulnerability metrics of IPGSs. Extensive case studies are carried out on three test IPGSs to verify the proposed models and algorithms. Simulation results show that the proposed models and algorithms can achieve high accuracy for the vulnerability analysis of IPGSs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

The use of random decrement technique for identification of structural modes of vibration

An algorithm is developed to obtain the free responses of a structure from its random responses due to some unknown or known random input or inputs, using the random-decrement technique without changing time correlation between signals. The algorithm is tested using random responses from a 'generalized payload' model and from the 'Space Shuttle' model. The resulting free responses are then used to identify the modal characteristics of the two systems.

Ibrahim, S. R.↗
NASA NTRS2021

Machine Learning to Predict Joint Performance in Epoxy Composites Based on Process Parameters

Polymer matrix composites are gaining popularity in the aerospace industry due to their high specific strength, fatigue properties, and processability. However, based on current FAA certification guidelines, manufacturers utilizing current state-of-the-art composites made with adhesive bonds commonly install redundant fasteners to guarantee the strength of these adhesively bonded composite parts. The number of fasteners in a single-aisle commercial transport aircraft is typically on the order of 105, which reduces manufacturing rate, increases cost tremendously, and reduces the advantage of the specific strength composites provide. Due to this, the Adhesive Free Bonding of Composites (AERoBOND) project at NASA Langley Research Center has developed a novel assembly process to manufacture complex composite parts without the use of adhesives and fasteners. However, optimization of the process is currently challenging due to the complex and interdependent process parameters. To assist with the optimization, four machine learning algorithms utilizing gradient boosting decision trees were created to provide predictions for the mechanical and characterization properties of the composite parts. Approximately 200 random states from each algorithm were tested, and the models from each state were isolated and analyzed based on their accuracy, a validation process, and their feature importance. This analysis concluded that the models created from the machine learning algorithms could accelerate a parametric study for the AERoBOND process by rapidly optimizing process parameters to achieve desired performance characteristics.

Brennen Michael Middleton↗
NASA NTRSDate not supplied

Machine Learning to Predict Joint Performance in Epoxy Composites Based on Process Parameters

Polymer matrix composites are gaining popularity in the aerospace industry due to their high specific strength, fatigue properties, and processability. However, based on current FAA certification guidelines, manufacturers utilizing current state-of-the art composites made with adhesive bonds commonly install redundant fasteners to guarantee the strength of these adhesively bonded composite parts.1,2 The number of fasteners in a single-aisle commercial transport aircraft is typically on the order of 105, which reduces manufacturing rate, increases cost tremendously, and reduces the advantage of the specific strength composites provide. Due to this, the Adhesive Free Bonding of Composites (AERoBOND) project at NASA Langley Research Center has developed a novel assembly process to manufacture complex composite parts without the use of adhesives and fasteners.1 However, optimization of the process is currently challenging due to the complex and interdependent process parameters. To assist with the optimization, four machine learning algorithms utilizing gradient boosting decision trees were created to provide predictions for the mechanical and characterization properties of the composite parts. Approximately 200 random states from each algorithm were tested, and the models from each state were isolated and analyzed based on their accuracy, a validation process, and their feature importance. This analysis concluded that the models created from the machine learning algorithms could accelerate a parametric study for the AERoBOND process by rapidly optimizing process parameters to achieve desired performance characteristics.

Brennen M Middleton↗