Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “predictive 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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

Dynamics and Control of Quadcopter in Uncertain Environment

We consider problem of dynamics, control, and uncertainty quantification for quadcopter. We use the 6DOF model of quadcopter dynamics, linear quadratic regulator and linear quadratic Gaussian control of quadcopter in the presence of dynamical disturbances, measurement noise, hidden dynamical variables, dashing GPS signal, and wind gusts to predict quadcopter trajectory. We identify key sources of uncertainties and report on progress in development of a system that estimates the probability of safety-critical events using a set of algorithms based on the trajectory predictions.

uncertainty quantification↗
DOE OSTI2021

A General Framework to Learn Tertiary Structure for Protein Sequence Characterization

During the past five years, deep-learning algorithms have enabled ground-breaking progress towards the prediction of tertiary structure from a protein sequence. Very recently, we developed SAdLSA, a new computational algorithm for protein sequence comparison via deep-learning of protein structural alignments. SAdLSA shows significant improvement over established sequence alignment methods. In this contribution, we show that SAdLSA provides a general machine-learning framework for structurally characterizing protein sequences. By aligning a protein sequence against itself, SAdLSA generates a fold distogram for the input sequence, including challenging cases whose structural folds were not present in the training set. About 70% of the predicted distograms are statistically significant. Although at present the accuracy of the intra-sequence distogram predicted by SAdLSA self-alignment is not as good as deep-learning algorithms specifically trained for distogram prediction, it is remarkable that the prediction of single protein structures is encoded by an algorithm that learns ensembles of pairwise structural comparisons, without being explicitly trained to recognize individual structural folds. As such, SAdLSA can not only predict protein folds for individual sequences, but also detects subtle, yet significant, structural relationships between multiple protein sequences using the same deep-learning neural network. The former reduces to a special case in this general framework for protein sequence annotation.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1986

Optimization methods and silicon solar cell numerical models

The goal of this project is the development of an optimization algorithm for use with a solar cell model. It is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junctions depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm has been developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAPID). SCAPID uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the operation of a solar cell. A major obstacle is that the numerical methods used in SCAPID require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the value associated with the maximum efficiency. This problem has been alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution. Adapting SCAPID so that it could be called iteratively by the optimization code provided another means of reducing the cpu time required to complete an optimization. Instead of calculating the entire I-V curve, as is usually done in SCAPID, only the efficiency is calculated (maximum power voltage and current) and the solution from previous calculations is used to initiate the next solution.

Girardini, K.↗
DOE OSTI2021

PAGANI: a parallel adaptive GPU algorithm for numerical integration

We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core utilization is difficult to achieve because the adaptive work-load can vary greatly across the integration space and is impossible to predict a priori. Existing parallel algorithms utilize sequential computations on independent processors, which results in bottlenecks due to the need for data redistribution and processor synchronization. Our algorithm employs a high-throughput approach in which all existing sub-regions are processed and sub-divided in parallel. Repeated sub-region classification and filtering improves upon a brute-force approach and allows the algorithm to make efficient use of computation and memory resources. A CUDA implementation shows orders of magnitude speedup over the fastest open-source CPU method and extends the achievable accuracy for difficult integrands. Our algorithm typically outperforms other existing deterministic parallel methods.

Sakiotis, Ioannis↗
NASA NTRS2010

Algorithm for Lossless Compression of Calibrated Hyperspectral Imagery

A two-stage predictive method was developed for lossless compression of calibrated hyperspectral imagery. The first prediction stage uses a conventional linear predictor intended to exploit spatial and/or spectral dependencies in the data. The compressor tabulates counts of the past values of the difference between this initial prediction and the actual sample value. To form the ultimate predicted value, in the second stage, these counts are combined with an adaptively updated weight function intended to capture information about data regularities introduced by the calibration process. Finally, prediction residuals are losslessly encoded using adaptive arithmetic coding. Algorithms of this type are commonly tested on a readily available collection of images from the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral imager. On the standard calibrated AVIRIS hyperspectral images that are most widely used for compression benchmarking, the new compressor provides more than 0.5 bits/sample improvement over the previous best compression results. The algorithm has been implemented in Mathematica. The compression algorithm was demonstrated as beneficial on 12-bit calibrated AVIRIS images.

Kiely, Aaron B.↗
NASA NTRS2018

Prediction of Solar Energetic Particle Event Peak Proton Intensity Using a Simple Algorithm Based on CME Speed and Direction and Observations of Associated Solar Phenomena

We assess whether a formula obtained by Richardson et al. (2014,https://doi.org/10.1007/s11207-014-0524-8) relating the peak intensity of 14- to 24-MeV protons in a solar energetic particle (SEP) event at 1 AU to the solar event location and the speed of the associated coronal mass ejection (CME) may be used in a scheme to predict the intensity of an SEP event at any location at this heliocentric distance. Starting with all 334 CMEs in the CCMC/SWRC DONKI database in October 2011 to July 2012, we use the CME speed and direction to predict the proton intensity at Earth and the two Solar Terrestrial Relations Observatory spacecraft using this formula. Since most (85%)of these CMEs were not in fact associated with SEP events, many SEP events are predicted that are not actually observed. Such cases may be reduced by considering whether type II or type III radio emissions accompany the CMEs, or by selecting faster, wider CMEs. This method is also applied to predict the SEP intensities associated with 1,100 CMEs observed by the Solar and Heliospheric Observatory Large Angle and Spectrometric Coronagraph during 1997-2006 in solar cycle 23. Various skill scores are calculated, which assess different aspects of the skill of the SEP predictions. We conclude that the Richardson et al. (2014) formula has potential as a simple empirical SEP intensity prediction tool.

coronal mass ejections↗
DOE OSTI2020

Coupling High-Throughput Experiments and Regression Algorithms to Optimize PGM-Free ORR Electrocatalyst Synthesis

Over the past decades, significant improvement has been achieved in the performance of platinum group metal-free (PGM-free) materials as an alternative to Pt-based electrocatalysts for oxygen reduction reaction (ORR). However, further progress in ORR activity requires evaluation of precursors and synthesis approaches. In response to this challenge, we generated a first of its kind experimental data set of 36 samples using high-throughput synthesis and activity measurements. Several control parameters (e.g., Fe precursor identity, the precursor content, and pyrolysis temperature) were varied. We then developed several state-of-the-art machine learning (ML) based regression models to predict ORR activity, dependent on selected synthesis variables. Through an iterative algorithm, higher prediction accuracy (smaller root-mean-square error) was achieved. We identified that gradient boosting regression (GBR) and support vector regression (SVR), among several methods, work best for this data set. Aided by our ML-based surrogate models, we decided to alter catalyst synthesis conditions, which resulted in a 36% increase in measured ORR activity in comparison to the maximum ORR mass activity value of 21.9 A/g catalyst in the original data set. Overall, this combined experiment and machine learning approach represents a promising path forward toward developing highly efficient next-generation ORR electrocatalysts and, more generally, functional materials.

25 ENERGY STORAGE↗
DOE OSTI2023

A Predictive Prescription Framework for Stochastic Unit Commitment Using Boosting Ensemble Learning Algorithms

To take unit commitment (UC) decisions under uncertain load, most existing stochastic optimization (SO) frameworks adopt a generic representation of uncertainty. While load levels that materialize on a particular day are influenced by various covariates (such as the day of the week or temperature), SO frameworks typically disregard such side observations, wasting actionable information that could significantly enhance decision quality. Here, this article proposes a contextual SO (CSO) framework for UC under uncertain load, which can effectively exploit covariate observations in conjunction with a class of machine learning (ML) algorithms to improve the out-of-sample performance of UC decisions. It shows how three ML algorithms, adaptive boosting, gradient boosted trees, and extreme gradient boosting, can be used to this end, constituting the first application of these algorithms in any CSO framework. Using real-world data harvested from the New York ISO grid, we measure the out-of-sample performance of the framework in terms of total operation cost, shed load values, locational marginal prices, and total payments by the loads, against several benchmark methods proposed in the literature. The article has an online companion (Yurdakul et al.), wherein we present additional results and lay out further mathematical formulations used in this work.

42 ENGINEERING↗
DOE OSTI2024

Autonomous Emergency Landing for Fixed-Wing Aircraft with Energy-Constrained Closed-Loop Prediction

Here this paper presents a new approach for autonomous motion planning for aircraft suffering from a loss-of-thrust emergency. Specifically, we show how modifications to the Closed-Loop Rapidly exploring Random Trees (CL-RRT) framework combined with controlled energy dissipation can enable rapid and effective kinodynamic motion planning. This CL-RRT Glide algorithm uses closed-loop prediction not only for node connections but also to estimate the remaining energy and prune infeasible paths. This greatly speeds up the search process, which is essential for emergency situations. In addition, we improve the ability of the gliding aircraft to reach a goal position and energy state. We do so by creating a Dissipative Total Energy Control Scheme (TECS). Dissipative TECS enables the glider to lose excess altitude in order to reach a desired energy level. Simulation results illustrate how the proposed methods enable faster motion planning. We also integrate the system into a small unmanned aerial vehicle system and experimentally demonstrate autonomous glide planning and execution during a motor-failure event. This type of algorithm can primarily benefit unmanned aircraft but can also serve to assist pilots in stressful emergency situations.

42 ENGINEERING↗
DOE OSTI2024

SIGHT: Stacked Integration of Geospatial Hierarchical Typologies for Inferring Building Characteristics

Building characteristics are often absent in building stock datasets, particularly in regions most vulnerable to climate change and requiring effective disaster management strategies. Traditional machine learning approaches, while widely used to predict building attributes, typically neglect the spatial context of the data, leading to less accurate and reliable outcomes. To address these challenges, this paper introduces a novel algorithm, the Stacked Integration of Geospatial Hierarchical Typologies. This algorithm adapts a meta-learning framework to incorporate geospatial context into the predictive modeling process. We demonstrate the utility of the algorithm through two primary use cases: building use type classification and building height prediction. The algorithm consistently achieved or exceeded a 0.94 macro average F1 score across five geographically distinct countries for building use type classification. For building height prediction, it accurately predicted heights with a root mean square error of 3.01 in a comprehensive study using roughly 3.6 million buildings in Japan. These results underscore the benefits of integrating spatial hierarchies into machine learning models, enhancing both predictive accuracy and reliability in geospatial modeling. This work introduces a new algorithm to address the pervasive data sparsity issue in existing building stock datasets.

Adams, Daniel [ORNL] (ORCID:0000000196950577)↗
DOE OSTI2022

Optimal Voltage Control in Low-Observable Unbalanced Distribution Systems

The increased integration of distributed energy resources (DERs) in distribution systems brings both advantages and technical challenges. High levels of DERs can often cause over/under voltage problems. Classical voltage control algorithms are based on full knowledge of voltage states across all nodes in the system. However, this may not be a practical assumption since many locations in distribution systems are unobservable. Therefore, this paper proposes a new model predictive control (MPC) based control algorithm that accounts for system unobservability to efficiently eliminate voltage violations with as low as 50% fraction of observable nodes. Additionally, an analytical voltage sensitivity framework is employed to quickly determine the change in voltage states due to PV injections. The effectiveness of the proposed method is validated via simulations on the unbalanced IEEE 37 node test system.

Abujubbeh, Mohammad↗
DOE OSTI2021

Application of Sequential Design of Experiments (SDoE) to Large Pilot-Scale Solvent-Based CO2 Capture Process at Technology Centre Mongstad (TCM)

The United States Department of Energy’s Carbon Capture Simulation for Industry Impact (CCSI2) program has developed a framework for sequential design of experiments (SDoE) that aims to maximize knowledge gained from budget- and schedule-limited pilot scale testing. SDoE was applied to the planning and execution of campaigns for testing CO2 capture systems at pilot-scale in order to optimally allocate resources available for the testing. In this methodology, a stochastic process model is developed by quantifying the parametric uncertainty in submodels of interest; for a solvent-based CO2 capture system, these may include physical properties and equipment performance submodels (e.g., mass transfer, interfacial area). This uncertainty is propagated through the full process model, over variable operating conditions, for estimating the resulting uncertainty in key model outputs (e.g., percentage of CO2 capture, solvent regeneration energy requirement). In developing a data collection plan, the predicted output uncertainty is incorporated into an algorithm that seeks simultaneously to select process operating conditions for which the predicted uncertainty is relatively high and to ensure that the entire space of operation is well represented. This test plan is then used to guide operation of the pilot plant at varying steady-state conditions, with resulting process data incorporated into the existing model using Bayesian inference to refine parameter distributions. The updated stochastic model, with reduced parametric uncertainty from data collected, is then used to guide additional data collection, thus the sequential nature of the experimental design. The SDoE process was implemented at the pilot test unit (12 MWe in scale) at Norway’s Technology Centre Mongstad (TCM) in a summer 2018 test campaign with aqueous monoethanolamine (MEA). During the test campaign, the varied operating conditions included the flowrates of circulated solvent, flue gas, and reboiler steam and the CO2 concentration in the flue gas. The process data were used to update probability distributions of mass transfer and interfacial area parameters of a stochastic process model developed by the CCSI2 team. Two iterations of the SDoE process were executed, resulting in the uncertainty in model predicted CO2 capture percentage decreasing by an average of 58.0 ± 4.7% over the full input space of interest. This work demonstrates the potential of the SDoE process for model refinement through reduction in process model parametric uncertainty, and ultimately risk in scale-up, in CO2 capture technology performance.

carbon capture↗
NASA NTRS2002

Resource Selection Using Execution and Queue Wait Time Predictions

Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learning techniques and simulations of scheduling algorithms. We find that our execution time prediction techniques have an average error of 37 percent of the execution times for trace data recorded from SGI Origins at NASA Ames Research Center and that this error is 67 percent lower than the error of user estimates. We also find that the error when predicting how long applications will wait in scheduling queues is 95 percent of mean queue wait times when using our execution time predictions and this is 57 percent lower than if we use user execution time estimates.

Warren, Smith↗
NASA NTRS2002

Resource Selection Using Execution and Queue Wait Time Predictions

Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learning techniques and simulations of scheduling algorithms. We find that our execution time prediction techniques have an average error of 37 percent of the execution times for trace data recorded from SGI Origins at NASA Ames Research Center and that this error is 67 percent lower than the error of user estimates. We also find that the error when predicting how long applications will wait in scheduling queues is 95 percent of mean queue wait times when using our execution time predictions and this is 57 percent lower than if we use user execution time estimates.

Smith, Warren↗
NASA NTRS1997

Neural Generalized Predictive Control: A Newton-Raphson Implementation

An efficient implementation of Generalized Predictive Control using a multi-layer feedforward neural network as the plant's nonlinear model is presented. In using Newton-Raphson as the optimization algorithm, the number of iterations needed for convergence is significantly reduced from other techniques. The main cost of the Newton-Raphson algorithm is in the calculation of the Hessian, but even with this overhead the low iteration numbers make Newton-Raphson faster than other techniques and a viable algorithm for real-time control. This paper presents a detailed derivation of the Neural Generalized Predictive Control algorithm with Newton-Raphson as the minimization algorithm. Simulation results show convergence to a good solution within two iterations and timing data show that real-time control is possible. Comments about the algorithm's implementation are also included.

Soloway, Donald↗
DOE OSTI2021

A Comparison of Machine Learning Methods to Forecast Tropospheric Ozone Levels in Delhi

Ground-level ozone is a pollutant that is harmful to urban populations, particularly in developing countries where it is present in significant quantities. It greatly increases the risk of heart and lung diseases and harms agricultural crops. This study hypothesized that, as a secondary pollutant, ground-level ozone is amenable to 24 h forecasting based on measurements of weather conditions and primary pollutants such as nitrogen oxides and volatile organic compounds. We developed software to analyze hourly records of 12 air pollutants and 5 weather variables over the course of one year in Delhi, India. To determine the best predictive model, eight machine learning algorithms were tuned, trained, tested, and compared using cross-validation with hourly data for a full year. The algorithms, ranked by R2 values, were XGBoost (0.61), Random Forest (0.61), K-Nearest Neighbor Regression (0.55), Support Vector Regression (0.48), Decision Trees (0.43), AdaBoost (0.39), and linear regression (0.39). When trained by separate seasons across five years, the predictive capabilities of all models increased, with a maximum R 2 of 0.75 during winter. Bidirectional Long Short-Term Memory was the least accurate model for annual training, but had some of the best predictions for seasonal training. Out of five air quality index categories, the XGBoost model was able to predict the correct category 24 h in advance 90% of the time when trained with full-year data. Separated by season, winter is considerably more predictable (97.3%), followed by post-monsoon (92.8%), monsoon (90.3%), and summer (88.9%). These results show the importance of training machine learning methods with season-specific data sets and comparing a large number of methods for specific applications.

54 ENVIRONMENTAL SCIENCES↗
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↗
NASA NTRS1990

Multi-sensor analysis techniques for SSME safety monitoring

Two algorithms were developed which utilized multi-sensor analysis techniques to complement the current Space Shuttle Main Engine (SSME) safety monitoring system. The first algorithm analyzed the accumulative error between actual and predicted values of the engine parameter set, while the second algorithm combined these error terms into a response pattern and correlated each pattern with a standard pattern. These algorithms were applied to twelve SSME anomalous test firings and were found to produce improved failure detection times in eight of those twelve compared to the current engine safety monitoring system. Of the eight detected anomalous test firings, the first algorithm detected all eight, while the second algorithm detected seven of the eight. No false alarms were indicated by either algorithm for twelve nominal test firings. An initial parametric study of these algorithms for optimized parameter selection is presented and algorithm robustness to sensor failure is demonstrated.

Maul, William A., III↗