Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Analysis of Waste Material Feedstocks Using Laser-Induced Breakdown Spectroscopy and Machine Learning

Predicting properties such as heating value, ash fusion temperature, and mineral ash composition from Laser-Induced Breakdown Spectroscopy (LIBS) data can make gasifiers more flexible to different feedstocks. Understanding these feedstock properties in-situ improves feedstock conversion modelling methods that allow for consistent operation, higher carbon conversion, and reduced fouling and erosion rates. The purpose of this study is to demonstrate methods for model creation that take LIBS data as predictor features and estimate higher order material properties as a function of feedstock material properties. Six samples were chosen to represent a mixture of abundant and carbon rich waste materials. LIBS measurements were performed on these samples for elemental wavelengths and intensity values. Laboratory analytical results were obtained for each sample’s heating value, proximate and ultimate analysis, mineral ash composition, ash fusion temperatures, and viscosity temperatures. Thermal conductivity was measured using a HotDisk TPS 2500S. LIBS measurements were processed and used as predictor features for machine learning (ML) models to predict the sample’s material properties. Predictor feature selection algorithms, particularly minimum redundancy maximum relevance (mRMR), reduced the dimensionality of ML models. Many modelling methods such as Gaussian process regression (GPR), regression tree, neural networks (NN), and support vector machines (SVM) were demonstrated to be effective at predicting higher order properties; however, mRMR with GPR stood out as a clear winning combination.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2026

Quantifying Operational Drivers of Multimodal Biometric Verification in Aerial Surveillance

Multimodal biometric verification is increasingly applied across operational contexts ranging from close-range security cameras and building-mounted surveillance to long-range ground sensors and unmanned aerial system (UAS) imagery. Variations in acquisition conditions—such as image resolution, viewing geometry, and motion artifacts—pose significant challenges for cross-domain algorithmic generalization. This study evaluates two independent multimodal biometric verification systems developed under the Intelligence Advanced Research Projects Activity (IARPA) Biometric Recognition and Identification at Altitude and Range (BRIAR) program, comparing performance on close-range and aerial datasets. Close-range video served as a baseline to quantify the decline in verification performance on aerial footage. The dataset included six UAS platforms, spanning small quadcopters at 10m altitude to medium-sized fixed-wing aircraft at 360m. Mixed-effects logistic regression identified image resolution (head and body pixel counts), head height, sensor characteristics, and algorithm selection as primary determinants of verification success, whereas demographic attributes and mission gait were not significant predictors. Activity type and collection site influenced performance in close-range data but had negligible impact on UAS imagery. These results clarify modality-specific strengths and limitations and highlight opportunities to enhance cross-domain biometric verification.

Peluso, Alina [ORNL] (ORCID:0000000328950406)↗
NASA NTRS1975

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS1976

AHIMSA - Ad hoc histogram information measure sensing algorithm for feature selection in the context of histogram inspired clustering techniques

An algorithm is proposed for dimensionality reduction in the context of clustering techniques based on histogram analysis. The approach is based on an evaluation of the hills and valleys in the unidimensional histograms along the different features and provides an economical means of assessing the significance of the features in a nonparametric unsupervised data environment. The method has relevance to remote sensing applications.

Dasarathy, B. V.↗
NASA NTRS1977

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
DOE OSTI2019

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗
NASA NTRS2010

Operational Dynamic Configuration Analysis

Sectors may combine or split within areas of specialization in response to changing traffic patterns. This method of managing capacity and controller workload could be made more flexible by dynamically modifying sector boundaries. Much work has been done on methods for dynamically creating new sector boundaries [1-5]. Many assessments of dynamic configuration methods assume the current day baseline configuration remains fixed [6-7]. A challenging question is how to select a dynamic configuration baseline to assess potential benefits of proposed dynamic configuration concepts. Bloem used operational sector reconfigurations as a baseline [8]. The main difficulty is that operational reconfiguration data is noisy. Reconfigurations often occur frequently to accommodate staff training or breaks, or to complete a more complicated reconfiguration through a rapid sequence of simpler reconfigurations. Gupta quantified a few aspects of airspace boundary changes from this data [9]. Most of these metrics are unique to sector combining operations and not applicable to more flexible dynamic configuration concepts. To better understand what sort of reconfigurations are acceptable or beneficial, more configuration change metrics should be developed and their distribution in current practice should be computed. This paper proposes a method to select a simple sequence of configurations among operational configurations to serve as a dynamic configuration baseline for future dynamic configuration concept assessments. New configuration change metrics are applied to the operational data to establish current day thresholds for these metrics. These thresholds are then corroborated, refined, or dismissed based on airspace practitioner feedback. The dynamic configuration baseline selection method uses a k-means clustering algorithm to select the sequence of configurations and trigger times from a given day of operational sector combination data. The clustering algorithm selects a simplified schedule containing k configurations based on stability score of the sector combinations among the raw operational configurations. In addition, the number of the selected configurations is determined based on balance between accuracy and assessment complexity.

Lai, Chok Fung↗
DOE OSTI2023

Extended Low Load Boiler Operation to Improve Performance and Economics of an Existing Coal Fired Power Plant (Final Report)

The overall goal is to improve the performance and economics of existing coal fired power plants by extending low load boiler operation to lower loads than is currently achievable. The objective of this program is to develop and validate sensor hardware and analytical algorithms to lower plant operating expenses (OPEX) for the currently operating pulverized coal utility boiler fleet. Coal fired utility boilers are increasingly under grid dispatch pressure. In some cases, the coal fired cost of generation is noncompetitive with respect to natural gas generation and subsidized renewable sources. To remain profitable and remain fully compliant with existing environmental regulations, the installed coal fired fleet must find technologies which allow it to move into a more flexible cyclic load dispatch model. Today the installed coal fired utility fleet must be cost of generation competitive, fully emissions compliant, and responsive to the variability inherent in renewable energy generation sources. In the Phase I of the project, GE Steam Power, Inc. (GE) performed modeling of different operating scenarios for low load operation using an existing full plant dynamic model developed for a 660MW steam power plant. Sensors and analytic algorithms to enable a stable and steady coal supply for low load pulverizer operation were identified and tested at the Pulverizer Development Facility (PDF) at GE’s Clean Energy Center in Bloomfield, Connecticut. Sensors and analytic algorithms to enable stable combustion for low load operation were identified and tested at the 15 MWth Industrial Scale Burner facility (ISBF) at GE’s Clean Energy Center. A concept was developed to test the sensors and control algorithms, down selected after testing, at a full-scale coal fired power plant. A budget estimate was then developed, and the concept was implemented at an existing utility power plant. The specific objectives of the experimental work were to: • Identify and select sensors and analytic algorithms for monitoring coal pulverizer operation at lower loads to provide stable operation and appropriate coal fineness at lower coal throughput; Identify and select sensors and analytic algorithms for a Boiler Flame Stability Monitor to better balance air and fuel at each burner. This enables a reduction in a coal boiler’s safe low load power level while maintaining stable flame characteristics; Develop a concept in Phase I for low load operation of a full-scale power plant and develop a budget estimate for testing and execute the test plan at an existing plant in Phase II; Validate the capability of the extended low load boiler system to extend the minimum load operating point in a safe and reliable manner on an existing full-scale utility boiler. At the completion of this experimental study, GE has developed a set of sensors and analytic algorithms, down selected after testing, that have the potential to enable safe low load operation of a utility boiler. GE has also identified a host site for testing these identified sensors and analytic algorithms. GE has generated a full set of deliverables that provide sufficient information to proceed with the next step of testing at a host site. This includes a potential host site and budget estimate for concept testing at host site. In the Phase II of the project, a series of field tests were completed to validate the extended low load boiler operation, which consisted of detailed engineering, installation, commissioning, and testing the additional sensors and analytics for the coal-fired combustion system on an existing full-scale utility boiler. The optimization work has been supported by the host plant and endorsed by their engineering and operation staff.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2019

Approximate Latent Factor Algorithm for Scenario Selection and Weighting in Transmission Expansion Planning

One major difficulty in transmission expansion planning is selecting the representative scenarios to use to evaluate candidate transmission networks. The variability in demand and renewable generation makes the inclusion of several scenarios critical when calculating reliability and cost, but including too many scenarios in an optimization is computationally intractable. To reduce the number of representative operating conditions needed to obtain an accurate approximation of the system, we propose a method rooted in multivariate statistics that exploits the latent correlative structure between different scenarios and network configurations. The proposed algorithm includes an objective and rigorous way to select a subset of scenarios that provide as much information about the system as possible, and a method to accurately approximate the system cost from that scenario subset. The result is a set of scenarios and weights that are easily incorporated into traditional transmission expansion planning formulations. We apply this to a 312-bus WECC model with 8,736 distinct operating conditions. The transmission plans found with the proposed method are more reliable and have a lower total cost than those from other scenario reduction techniques, as well as a smaller error between the expected system performance from the optimization objective and the actual system performance.

42 ENGINEERING↗
DOE OSTI2020

Uncertainty Quantification of Machine Learning Predicted Creep Property of Alumina-Forming Austenitic Alloys

The development of machine learning (ML) approaches in materials science offers the opportunity to exploit existing engineering and developmental alloy datasets, such as Oak Ridge National Laboratory (ORNL)’s consistently measured creep-rupture dataset for alumina-forming austenitic (AFA) alloys, to accelerate their further development. As a first step toward achieving ML insights for improved alloy design, the potential sources of uncertainty and their impacts on ML output are examined. It is observed that the selection of algorithms and features as well as data sampling significantly affects the performance of ML models, either positively or negatively. Further, the performance of various ML models in predicting the creep properties of AFA alloys is compared, with further evaluation by assessment of a small set of new developmental AFA alloys that were not part of the training dataset. The present study demonstrates that uncertainty quantification (UQ) is essential in materials science for evaluating the performance of ML algorithms with specifically selected feature sets and obtaining a comprehensive understanding of their limitations and the resultant capability of effective prediction in complex materials systems.

36 MATERIALS SCIENCE↗
NASA NTRS2015

Optimization of Selected Remote Sensing Algorithms for Embedded NVIDIA Kepler GPU Architecture

This paper evaluates the potential of embedded Graphic Processing Units in the Nvidias Tegra K1 for onboard processing. The performance is compared to a general purpose multi-core CPU and full fledge GPU accelerator. This study uses two algorithms: Wavelet Spectral Dimension Reduction of Hyperspectral Imagery and Automated Cloud-Cover Assessment (ACCA) Algorithm. Tegra K1 achieved 51 for ACCA algorithm and 20 for the dimension reduction algorithm, as compared to the performance of the high-end 8-core server Intel Xeon CPU with 13.5 times higher power consumption.

Riha, Lubomir↗
NASA NTRS2015

Optimization of Selected Remote Sensing Algorithms for Embedded NVIDIA Kepler GPU Architecture

This paper evaluates the potential of embedded Graphic Processing Units (GPUs) in Nvidia's Tegra K1 (based on Kepler (TM) hardware) for onboard processing. The performance is compared to a general purpose multi-core CPU (Central Processing Unit) and a fully-fledged GPU accelerator. This study uses two algorithms: Wavelet Spectral Dimension Reduction of Hyperspectral Imagery and Automated Cloud-Cover Assessment (ACCA) Algorithm. Tegra K1 achieved 51 for the ACCA algorithm and 20 for the dimension reduction algorithm, as compared to the performance of the high-end 8-core server Intel Xeon CPU with 13.5 times higher power consumption.

data reduction↗
DOE OSTI2024

An exploration of online-simulation-driven portfolio scheduling in Workflow Management Systems

Workflow Management Systems used to automate the execution of scientific workflow applications on parallel and distributed computing platforms must make scheduling decisions at runtime. A large number of workflow scheduling algorithms have been proposed in the literature, but often these algorithms are evaluated based on simplifying assumptions that may not hold in practice. Furthermore, published algorithm evaluation and/or comparison results are necessarily only for a subset of all possible scenarios, and thus may not include scenarios relevant to particular use-cases. Consequently, it is difficult for Workflow Management Systems (WMSs) developers to decide which scheduling algorithm should be implemented. To obviate this difficulty, one possible approach is to implement a portfolio of scheduling algorithms and select the most effective algorithm at runtime. One method for performing this selection is to run an online simulation for each algorithm in the portfolio. The algorithm that leads to the best performance, in simulation, is selected for future use. The above simulation-driven portfolio scheduling (SDPS) approach has been proposed in a few parallel and distributed computing contexts. The main objective of this work is to evaluate the feasibility and potential merit of SDPS if implemented in WMSs. Here we perform this evaluation using simulated WMS executions, where the simulations are instantiated from real-world platform and workflow configurations. Our main finding is that SDPS is on par with or outperforms an approach in which a single algorithm is used, where this algorithm is the one that performs best on average across all our experimental scenarios. Furthermore, we find that SDPS remains an attractive proposition even in the presence of high levels of simulation error and for simulators with relatively low levels of sophistication. In many of our experimental scenarios we find that mitigating simulation error at runtime can further improve performance. Finally, we show that simulation overhead can be made sufficiently low for SDPS to be feasible in practice.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2017

Evaluation of the Simple Safe Site Selection (S4) Hazard Detection Algorithm Using Helicopter Field Test Data

Small scale terrain hazards, such as rocks, slopes, and craters, can pose significant risk to landing spacecraft and rover or payload deployment. Onboard Hazard Detection and Avoidance (HDA) systems scan and analyze the landing area for these hazards in real time during descent, and divert the spacecraft to the safest touchdown site. The computationally efficient Simple Safe Site Selection (S4) algorithm combined with a flash LIDAR is an HDA system geared towards small robotic spacecraft. Rather than creating and analyzing a digital elevation map (DEM) from potentially many overlapping range images, S4 operates directly on a single flash LIDAR image. Extending prior work that has analyzed S4 performance for Mars landing using extensive simulations, this paper evaluates S4 performance using actual flash LIDAR images of an artificial hazard field acquired during a 2014 helicopter field test in Death Valley, CA. In particular, we describe LIDAR characterization and calibration, creation of ground truth elevation and safety maps, creation of ground truth sensor poses, actual S4 algorithm processing, and performance analysis. The results show that the safety cost images produced by S4 are remarkably close to the ground truth safety map (computed offline by an HDA algorithm developed under the Autonomous Landing and Hazard Avoidance (ALHAT) project) at significantly reduced computational cost, confirming S4 as a viable candidate algorithm for onboard spacecraft HDA.

Luna, Michael E.↗
DOE OSTI2026

Active space selection with self-healing diffusion Monte Carlo algorithms for periodic solids

Multideterminant Diffusion Monte Carlo (DMC) displays improved accuracy over single determinant DMC. Self-Healing Diffusion Monte Carlo (SHDMC) is a DMC based method that iteratively improves a multideterminant trial wavefunction. Although configuration interaction or complete active space (CAS) methods are very accurate and computationally feasible for many systems, they are not optimal for application to solids. SHDMC is accurate and designed for application to solids, so developing SHDMC based active space selection algorithms is a worthy endeavor. Here, we present and compare active space selection algorithms that are designed for use in conjunction with SHDMC, without relying on external approaches. For benchmarking, we calculated the ground state energy of a small unit cell of graphene and compared the results with a complete basis set extrapolated selected CI and a reference SHDMC trajectory. We found that systematically expanding the active space using an “auto-branching” algorithm optimally balances accuracy with computational practicality. To the best of our knowledge, this is the first work that demonstrates completely self-contained DMC-based active space selection algorithms that do not depend on external methods for determinant selection.

Spanedda, Nicole [ORNL]↗
NASA NTRS2013

The Ocean Colour Climate Change Initiative: III. A Round-Robin Comparison on In-Water Bio-Optical Algorithms

Satellite-derived remote-sensing reflectance (Rrs) can be used for mapping biogeochemically relevant variables, such as the chlorophyll concentration and the Inherent Optical Properties (IOPs) of the water, at global scale for use in climate-change studies. Prior to generating such products, suitable algorithms have to be selected that are appropriate for the purpose. Algorithm selection needs to account for both qualitative and quantitative requirements. In this paper we develop an objective methodology designed to rank the quantitative performance of a suite of bio-optical models. The objective classification is applied using the NASA bio-Optical Marine Algorithm Dataset (NOMAD). Using in situ Rrs as input to the models, the performance of eleven semianalytical models, as well as five empirical chlorophyll algorithms and an empirical diffuse attenuation coefficient algorithm, is ranked for spectrally-resolved IOPs, chlorophyll concentration and the diffuse attenuation coefficient at 489 nm. The sensitivity of the objective classification and the uncertainty in the ranking are tested using a Monte-Carlo approach (bootstrapping). Results indicate that the performance of the semi-analytical models varies depending on the product and wavelength of interest. For chlorophyll retrieval, empirical algorithms perform better than semi-analytical models, in general. The performance of these empirical models reflects either their immunity to scale errors or instrument noise in Rrs data, or simply that the data used for model parameterisation were not independent of NOMAD. Nonetheless, uncertainty in the classification suggests that the performance of some semi-analytical algorithms at retrieving chlorophyll is comparable with the empirical algorithms. For phytoplankton absorption at 443 nm, some semi-analytical models also perform with similar accuracy to an empirical model. We discuss the potential biases, limitations and uncertainty in the approach, as well as additional qualitative considerations for algorithm selection for climate-change studies. Our classification has the potential to be routinely implemented, such that the performance of emerging algorithms can be compared with existing algorithms as they become available. In the long-term, such an approach will further aid algorithm development for ocean-colour studies.

Phytoplankton↗