Search NASA⌕ Search

SEARCH · Search NASA

Results for “Learning 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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Expanding NeMO-Net Machine Learning Capabilities for Citizen Science

NASA NeMO-Net, the neural multi-modal observation and training network for global coral reef assessment, is an open-source deep convolutional neural network and interactive active learning training software aiming to accurately assess the present and past dynamics of coral reef ecosystems through determination of percent living cover and morphology as well as mapping of spatial distribution. We present an interactive citizen science video game, released this April, for desktop and iOS devices where users interactively label morphology classifications over mm-scale 3D coral reef imagery captured using diver photomosaic imagery, the UAV enabled NASA FluidCam instrument, and satellite datasets. To date, the application has had over 40,000 downloads and over 60,000 unique coral reef classifications, each filtered through a user-based rating and expert evaluation system. We also present results from NeMO-Net’s convolutional neural network (CNN) models used to semantically segment 2D satellite imagery as well as projections of 3D coral reconstructions using user input data as training datasets. Fusing datasets using machine learning from multiple remote sensing platforms presents novel methodologies for assessing the health of coral ecosystems, which are critically endangered by a changing climate. In partnering with Mission Blue, the National Oceanic and Atmospheric Administration (NOAA), and the Living Oceans Foundation (LOF), NeMO-Net leverages an international consortium of subject matter experts to provide both proper training for citizen scientists and the generation of a labeled datasets to ingest into machine learning algorithms for global coral reef identification.

NeMO-Net↗
NASA NTRSDate not supplied

Expanding NeMO-Net Machine Learning Capabilities for Citizen Science

NASA NeMO-Net, the neural multi-modal observation and training network for global coral reef assessment, is an open-source deep convolutional neural network and interactive active learning training software aiming to accurately assess the present and past dynamics of coral reef ecosystems through determination of percent living cover and morphology as well as mapping of spatial distribution. We present an interactive citizen science video game, released this April, for desktop and iOS devices where users interactively label morphology classifications over mm-scale 3D coral reef imagery captured using diver photomosaic imagery, the UAV enabled NASA FluidCam instrument, and satellite datasets. To date, the application has had over 40,000 downloads and over60,000 unique coral reef classifications, each filtered through a user-based rating and expert evaluation system. We also present results from NeMO-Net’s convolutional neural network (CNN) models used to semantically segment 2D satellite imagery as well as projections of 3D coral reconstructions using user input data as training datasets. Fusing datasets using machine learning from multiple remote sensing platforms presents novel methodologies for assessing the health of coral ecosystems, which are critically endangered by a changing climate. In partnering with Mission Blue, the National Oceanic and Atmospheric Administration (NOAA), and the Living Oceans Foundation (LOF), NeMO-Net leverages an international consortium of subject matter experts to provide both proper training for citizen scientists and the generation of a labeled datasets to ingest into machine learning algorithms for global coral reef identification.

NeMO-Net↗
NASA NTRSDate not supplied

Collision Avoidance Approach Using Deep Reinforcement Learning

A method to enable autonomous robots moving in a 2D space collision free motivates the purposed approach for collision avoidance for autonomous UAM vehicles. Challenges of autonomous collision free navigation for both problems are similar. Agents in each environment do not know the intent, or goal, of the other. Finding the time efficient paths require some level of anticipation with neighboring agents which is computationally expensive. In the original work, these obstacles were overcome with a novel application of deep reinforcement learning which offloads the online computation to an offline learning algorithm. A value network that encodes the estimated time to the goal given the agent’s state and the observable portion of the other agent’s state is trained on a baseline policy and further refined with reinforcement learning to promote time efficient collision free navigation. Online, the value network efficiently informs the agent’s decision making in the face of uncertainty of the other agent’s next move. In this paper, challenges extending this methodology to the 3D environment of autonomous UAM vehicles with kinematic constraints are discussed and initial results shown.

Collision Avoidance↗
NASA NTRSDate not supplied

Collision Avoidance Approach Using Deep Reinforcement Learning

A method to enable autonomous robots moving in a 2D space collision free motivates the purposed approach for collision avoidance for autonomous UAM vehicles. Challenges of autonomous collision free navigation for both problems are similar. Agents in each environment do not know the intent, or goal, of the other. Finding the time efficient paths require some level of anticipation with neighboring agents which is computationally expensive. In the original work, these obstacles were overcome with a novel application of deep reinforcement learning which offloads the online computation to an offline learning algorithm. A value network that encodes the estimated time to the goal given the agent’s state and the observable portion of the other agent’s state is trained on a baseline policy and further refined with reinforcement learning to promote time efficient collision free navigation. Online, the value network efficiently informs the agent’s decision making in the face of uncertainty of the other agent’s next move. In this paper, challenges extending this methodology to the 3D environment of autonomous UAM vehicles with kinematic constraints are discussed and initial results shown.

Collision Avoidance↗
NASA NTRSDate not supplied

Health Monitoring and Prognostics in Li-ion Batteries

Space applications need to overcome a very critical challenge of predicting remaining useful life of its critical systems/subsystems, with batteries being one of them. Batteries, power electronics conditioning system and motors and one of the most critical systems. Similarly in case of electric aircrafts, computing remaining flying time is safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. To tackle and solve the prediction problem, it is essential to have awareness of the current state and health of the system, especially since it is necessary to perform condition-based predictions. To be able to accurately predict the future state of any system, it is required to possess knowledge of its current and future operations. Given models of the current and future system behavior, the general approach of model-based prognostics can be employed as a solution to the prior stated prediction problem. Two approaches are presented with battery prognostics application. The first approach presentation covers a physics based-modeling approach implemented for battery prognostics. Given models of the current and future system behavior, a general approach of model-based prognostics can be employed as a solution to the prediction problem and further for decision making. A second hybrid framework for fusing information from physics-based performance models along with deep learning algorithms for prognostics of complex safety critical systems i.e. batteries is presented. In this framework, physics-based performance models infer unobservable model parameters related to the system's components health solving a calibration problem in the deep learning approach.

Batteries↗
NASA NTRSDate not supplied

Health Monitoring and Prognostics in Li-ion Batteries

Space applications need to overcome a very critical challenge of predicting remaining useful life of its critical systems/subsystems, with batteries being one of them. Batteries, power electronics conditioning system and motors and one of the most critical systems. Similarly in case of electric aircrafts, computing remaining flying time is safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. To tackle and solve the prediction problem, it is essential to have awareness of the current state and health of the system, especially since it is necessary to perform condition-based predictions. To be able to accurately predict the future state of any system, it is required to possess knowledge of its current and future operations. Given models of the current and future system behavior, the general approach of model-based prognostics can be employed as a solution to the prior stated prediction problem. Two approaches are presented with battery prognostics application. The first approach presentation covers a physics based-modeling approach implemented for battery prognostics. Given models of the current and future system behavior, a general approach of model-based prognostics can be employed as a solution to the prediction problem and further for decision making. A second hybrid framework for fusing information from physics-based performance models along with deep learning algorithms for prognostics of complex safety critical systems i.e. batteries is presented. In this framework, physics-based performance models infer unobservable model parameters related to the system's components health solving a calibration problem in the deep learning approach.

Battery Prognostics↗
NASA NTRSDate not supplied

Automated classification of scientific publications linked to GES DISC datasets

The data collections archived and distributedby the GES DISC NASA data center arewidely utilized for various Earth Science studies.As these collections are created, many researchworks are published regarding the collections, algorithms,validations and applications. SinceGES DISC collects these publications and providestheir citations for the users, it is helpful tocategorize them based on how they relate to the datasetsthey are associated with. Specifically,whether the publication that is linked to GES DISCdataset is using it for applicational research,or if it describes the algorithm for dataset creation,or the validation of the dataset, or providesthe general overview of the data collection. Currently,this process requires simple manuallabelling, and as such, may be possible to solve viaautomation. To approach this problem, wedeveloped machine learning classifiers to predictthe category a publication belongs to. We usedmanually labeled publications as training data forsupervised machine learning algorithms:Random Forest and Naive Bayes. We achieved classificationaccuracy that is substantially betterthan the baseline accuracy, thus greatly improvingthe efficiency of the publication internalanalysis.

Rohan Dayal↗
DOE OSTI2024

Machine learning for the identification of phase transitions in interacting agent-based systems: A Desai-Zwanzig example

Deriving closed-form analytical expressions for reduced-order models, and judiciously choosing the closures leading to them, has long been the strategy of choice for studying phase- and noise-induced transitions for agent-based models (ABMs). In this paper, we propose a data-driven framework that pinpoints phase transitions for an ABM—the Desai-Zwanzig model—in its mean-field limit, using a smaller number of variables than traditional closed-form models. To this end, we use the manifold learning algorithm Diffusion Maps to identify a parsimonious set of data-driven latent variables, and we show that they are in one-to-one correspondence with the expected theoretical order parameter of the ABM. We then utilize a deep learning framework to obtain a conformal reparametrization of the data-driven coordinates that facilitates, in our example, the identification of a single parameter-dependent ordinary differential equation (ODE) in these coordinates. Additionally, we identify this ODE through a residual neural network inspired by a numerical integration scheme (forward Euler). We then use the identified ODE—enabled through an odd symmetry transformation—to construct the bifurcation diagram exhibiting the phase transition.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Neutrino Physics with Deep Learning on NOvA

The NOvA experiment has made both νμ \nu_\mu disappearance and νe \nu_e appearance measurements in Fermilab's NuMI beam, and is working on cross section measurements using near detector data. At the core of NOvA's measurements is the use of deep learning algorithms for identification and reconstruction of the neutrino flavor and energy. These algorithms, used for the first time on NOvA in 2016, yielded large improvements in selection efficiency, and will be applied to our first anti-neutrino results to be released this year. Presented here is the extension of our deep learning efforts for identification of neutrino signal events, final state identification, single particle tagging, and reconstruction using instance segmentation techniques. We will describe the new implementations of modified Convolutional Neural Networks for anti-neutrino events, single particles and their performance for analysis final states selection, standard candle measurements, and reconstruction.

Psihas, Fernanda [Indiana U.]↗
NASA NTRS1993

Retrieval of ice thickness from polarimetric SAR data

We describe a potential procedure for retrieving ice thickness from multi-frequency polarimetric SAR data for thin ice. This procedure includes first masking out the thicker ice types with a simple classifier and then deriving the thickness of the remaining pixels using a model-inversion technique. The technique used to derive ice thickness from polarimetric observations is provided by a numerical estimator or neural network. A three-layer perceptron implemented with the backpropagation algorithm is used in this investigation with several improved aspects for a faster convergence rate and a better accuracy of the neural network. These improvements include weight initialization, normalization of the output range, the selection of offset constant, and a heuristic learning algorithm. The performance of the neural network is demonstrated by using training data generated by a theoretical scattering model for sea ice matched to the database of interest. The training data are comprised of the polarimetric backscattering coefficients of thin ice and the corresponding input ice parameters to the scattering model. The retrieved ice thickness from the theoretical backscattering coefficients is compare with the input ice thickness to the scattering model to illustrate the accuracy of the inversion method. Results indicate that the network convergence rate and accuracy are higher when multi-frequency training sets are presented. In addition, the dominant backscattering coefficients in retrieving ice thickness are found by comparing the behavior of the network trained backscattering data at various incidence angels. After the neural network is trained with the theoretical backscattering data at various incidence anges, the interconnection weights between nodes are saved and applied to the experimental data to be investigated. In this paper, we illustrate the effectiveness of this technique using polarimetric SAR data collected by the JPL DC-8 radar over a sea ice scene.

Kwok, R.↗
NASA NTRS1994

Improving Learning Performance Through Rational Resource Allocation

This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning cost and show that the problem of efficient learning can be cast as a resource optimization problem. Solutions found in this way can be significantly more efficient than the best solutions that do not account for these factors. We introduce a heuristic learning algorithm that approximately solves this optimization problem and document its performance improvements on synthetic and real-world problems.

resource optimization↗
NASA NTRS2017

Ask-the-expert: Active Learning Based Knowledge Discovery Using the Expert

Often the manual review of large data sets, either for purposes of labeling unlabeled instances or for classifying meaningful results from uninteresting (but statistically significant) ones is extremely resource intensive, especially in terms of subject matter expert (SME) time. Use of active learning has been shown to diminish this review time significantly. However, since active learning is an iterative process of learning a classifier based on a small number of SME-provided labels at each iteration, the lack of an enabling tool can hinder the process of adoption of these technologies in real-life, in spite of their labor-saving potential. In this demo we present ASK-the-Expert, an interactive tool that allows SMEs to review instances from a data set and provide labels within a single framework. ASK-the-Expert is powered by an active learning algorithm for training a classifier in the backend. We demonstrate this system in the context of an aviation safety application, but the tool can be adopted to work as a simple review and labeling tool as well, without the use of active learning.

software↗
NASA NTRSDate not supplied

Physics Informed Neural Nets for Systems Health Management

To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Development in data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. The research work presents application of physics-informed neural nets application to a representative electric powertrain for unmanned aerial vehicles. The model is composed of physics-derived and empirical equations, integrated with connected networks that are strategically placed within the model to substitute equations that are subject to large uncertainty. Polynomial fit driven by heuristics or empirical observations can be substituted by more flexible networks that can minimize the error between model predictions and observations without being restricted to a predefined functional form. This modeling strategy allows training of networks deep inside the model and unknown parameters in a single learning stage.

Physics Informed↗
NASA NTRS2005

Real-Time Principal-Component Analysis

A recently written computer program implements dominant-element-based gradient descent and dynamic initial learning rate (DOGEDYN), which was described in Method of Real-Time Principal-Component Analysis (NPO-40034) NASA Tech Briefs, Vol. 29, No. 1 (January 2005), page 59. To recapitulate: DOGEDYN is a method of sequential principal-component analysis (PCA) suitable for such applications as data compression and extraction of features from sets of data. In DOGEDYN, input data are represented as a sequence of vectors acquired at sampling times. The learning algorithm in DOGEDYN involves sequential extraction of principal vectors by means of a gradient descent in which only the dominant element is used at each iteration. Each iteration includes updating of elements of a weight matrix by amounts proportional to a dynamic initial learning rate chosen to increase the rate of convergence by compensating for the energy lost through the previous extraction of principal components. In comparison with a prior method of gradient-descent-based sequential PCA, DOGEDYN involves less computation and offers a greater rate of learning convergence. The sequential DOGEDYN computations require less memory than would parallel computations for the same purpose. The DOGEDYN software can be executed on a personal computer.

Duong, Vu↗
NASA NTRS2017

Ask-the-Expert: Active Learning Based Knowledge Discovery Using the Expert

Often the manual review of large data sets, either for purposes of labeling unlabeled instances or for classifying meaningful results from uninteresting (but statistically significant) ones is extremely resource intensive, especially in terms of subject matter expert (SME) time. Use of active learning has been shown to diminish this review time significantly. However, since active learning is an iterative process of learning a classifier based on a small number of SME-provided labels at each iteration, the lack of an enabling tool can hinder the process of adoption of these technologies in real-life, in spite of their labor-saving potential. In this demo we present ASK-the-Expert, an interactive tool that allows SMEs to review instances from a data set and provide labels within a single framework. ASK-the-Expert is powered by an active learning algorithm for training a classifier in the back end. We demonstrate this system in the context of an aviation safety application, but the tool can be adopted to work as a simple review and labeling tool as well, without the use of active learning.

GUI↗
NASA NTRS2020

Machine Learning-Based Predictive Analytics for Aircraft Engine Conceptual Design

Big data and artificial intelligence/machine learning are transforming the global business environment. Data is now the most valuable asset for enterprises in every industry. Companies are using data-driven insights for competitive advantage. With that, the adoption of machine learning-based data analytics is rapidly taking hold across various industries, producing autonomous systems that support human decision-making. This work explored the application of machine learning to aircraft engine conceptual design. Supervised machine-learning algorithms for regression and classification were employed to study patterns in an existing, open-source database of production and research turbofan engines, and resulting in predictive analytics for use in predicting performance of new turbofan designs. Specifically, the author developed machine learning-based analytics to predict cruise thrust specific fuel consumption (TSFC) and core sizes of high-efficiency turbofan engines, using engine design parameters as the input. The predictive analytics were trained and deployed in Keras, an open-source neural networks application program interface (API) written in Python, with Google’s TensorFlow (an open source library for numerical computation) serving as the backend engine. The promising results of the predictive analytics show that machine-learning techniques merit further exploration for application in aircraft engine conceptual design.

deep-learning↗
DOE OSTI2024

Dimensionally Aligned Signal Projection Algorithms Library

Dimensionally aligned signal projection (DASP) algorithms are used to analyze fast Fourier transforms (FFTs) and generate visualizations that help focus on the harmonics for specific signals. At a high level, these algorithms extract the FFT segments around each harmonic frequency center, and then align them in equally sized arrays ordered by increasing distance from the base frequency. This allows for a focused view of the harmonic frequencies, which, among other use cases, can enable machine learning algorithms to more easily identify salient patterns. This work seeks to provide an effective open-source implementation of the DASP algorithms proposed by Vann et al. (2018) as well as functionality to help explore and test how these algorithms work with an interactive dashboard and signal-generation tool. The DASP library is implemented in Python and contains four types of algorithms for implementing these feature engineering techniques: fixed harmonically aligned signal projection (HASP), decimating HASP, interpolating HASP, and frequency aligned signal projection (FASP). Each algorithm returns a numerical array, which can be visualized as an image. The HASP algorithms are variations of the algorithms originally presented by Vann et al. (2018). For consistency, FASP, which is the terminology used for the short-time Fourier transform (STFT), has been implemented as part of the library to provide a similar interface to the STFT of the raw signal. Additionally, the library contains an algorithm to generate artificial signals with basic customizations such as the base frequency, sample rate, duration, number of harmonics, noise, and number of signals. Finally, the library provides multiple interactive visualizations, each of which is implemented using IPyWidgets and works in a Jupyter environment. A dashboard-style visualization is provided, which contains some common signal-processing visual components (signal, FFT, spectogram) updating in unison with the HASP functions (see Figure 1 below). Separate from the dashboard, an independent visualization is provided for each of the DASP algorithms as well as for the artifical signal generator. These visualizations are included in the library to aid in developing an intuitive understanding how the algorithms are affected by different input signals and parameter selections.

harmonics↗
NASA NTRS2005

Multi Agent Reward Analysis for Learning in Noisy Domains

In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronounced in continuous, noisy domains ill-suited to simple table backup schemes commonly used in TD(lambda)/Q-learning. In this paper, we present a new reward evaluation method that allows the tradeoff between coordination among the agents and the difficulty of the learning problem each agent faces to be visualized. This method is independent of the learning algorithm and is only a function of the problem domain and the agents reward structure. We then use this reward efficiency visualization method to determine an effective reward without performing extensive simulations. We test this method in both a static and a dynamic multi-rover learning domain where the agents have continuous state spaces and where their actions are noisy (e.g., the agents movement decisions are not always carried out properly). Our results show that in the more difficult dynamic domain, the reward efficiency visualization method provides a two order of magnitude speedup in selecting a good reward. Most importantly it allows one to quickly create and verify rewards tailored to the observational limitations of the domain.

Tumer, Kagan↗