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 739 records · Page 41

Clustering Analysis of Commercial Vehicles Using Automatically Extracted Features from Time Series Data

Standard of practice approaches to time series cluster analysis involve careful feature engineering, often utilizing expert input to tune and select features by hand. In many cases, expert input may not be readily available, or there may not yet exist a community consensus on the ideal features for a given application. This paper compares the results of several cluster analysis methods, using both hand selected features and those extracted automatically, when applied to large geospatial time series telematics data from commercial trucking fleets. The impacts of feature selection, dimensionality reduction, and choice of clustering algorithm on the quality of clustering results are explored. Results from this analysis confirm prior results that domain agnostic features are competitive with the hand engineered features with respect to clustering quality metrics. These results also provide new insight into the most successful strategies for identifying structure in large unstructured vehicle telematics data, and suggest that time series clustering using automatic feature extraction can be an effective approach to extract structure from large scale geospatial time series data in cases when hand selected features are not available.

33 ADVANCED PROPULSION SYSTEMS↗

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.↗

Model-based Hierarchical Reinforcement Learning for Improved Physical Security Design: A Prototype

Prior work in FY24 developed an adversarial AI agent aid in path analysis of physical protection systems. This agent, trained using a model-based reinforcement learning algorithm, was able to successfully learn the most vulnerable path in facilities. It was able to extend the current state of practice for physical protection design by exhibiting dynamic behavior based on current environmental conditions. Whereas PathTrace largely performs a static, graph-based analysis, the AI agent was able to make decisions based on relative position in the facility, current conditions (was the adversarial agnet discovered?), and proximity to secondary targets. The agent demonstrated some novel capabilities, but had limitations that need to be resolved before it can be used for production purposes. For example, the adversarial agent generalizes poorly and takes a relatively long time to train. Nonetheless, there is still considerable promise for developing the adversarial agent further in order to explore even richer, more dynamic behaviors (e.g., adversary motivations, environmental debris, and more). This work considers a complementary idea; development of a planning agent. The planning agent is envisioned as an auto-complete-like tool that can help accelerate security system design by human experts. The agent would respect existing barriers and sensors placed by a human expert while offering cost-effective suggestions (i.e., implicitly balancing effectiveness with cost) to improve the design. The goal is for this agent to be part of an expert’s toolbox, not to totally upend the current state-of-practice, or to displace human experts. The ultimate goal would be concurrent training of both the adversarial and planning agent together, to learn entirely through self-play. This would represent an entirely new way of performing system deign. We selected a hierarchical, model-based reinforcement learning algorithm to serve as the planning agent. This is an extension of concepts used in the prior FY24 adversarial agent work. There, we had a single agent acting an environment. Here, we have two different sub-agents (policies), working together, to form a complete agent. There is a manager policy, which can select abstract goals on slower time scales, and a worker, which performs primitive actions to reach goals selected by the manager. It is worth noting that this class of algorithm is challenging to work with. From our understanding, our work is one of the first successful uses of model-based reinforcement learning (MBRL) in nuclear energy1 , and likely the first hierarchical model-based reinforcement learning application in nuclear energy. Further, this work is one of the first known attempts to apply AI to perform a design tasks in nuclear energy. Consequently, there were significant implementation challenges and the bulk of the work was focused on successful implementation and algorithm design. The results presented here are very low technology readiness level as a consequence of the lack of related literature, but still represent a significant step forward in the pursuit of applied AI for design.

42 ENGINEERING↗

Intelligent Life-Extending Controls for Aircraft Engines Studied

Current aircraft engine controllers are designed and operated to provide desired performance and stability margins. Except for the hard limits for extreme conditions, engine controllers do not usually take engine component life into consideration during the controller design and operation. The end result is that aircraft pilots regularly operate engines under unnecessarily harsh conditions to strive for optimum performance. The NASA Glenn Research Center and its industrial and academic partners have been working together toward an intelligent control concept that will include engine life as part of the controller design criteria. This research includes the study of the relationship between control action and engine component life as well as the design of an intelligent control algorithm to provide proper tradeoffs between performance and engine life. This approach is expected to maintain operating safety while minimizing overall operating costs. In this study, the thermomechanical fatigue (TMF) of a critical component was selected to demonstrate how an intelligent engine control algorithm can significantly extend engine life with only a very small sacrifice in performance. An intelligent engine control scheme based on modifying the high-pressure spool speed (NH) was proposed to reduce TMF damage from ground idle to takeoff. The NH acceleration schedule was optimized to minimize the TMF damage for a given rise-time constraint, which represents the performance requirement. The intelligent engine control scheme was used to simulate a commercial short-haul aircraft engine.

Guo, Ten-Huei↗

Demonstration of Prognostics-Enabled Decision Making Algorithms on a Hardware Mobile Robot Test Platform

Prognostics-enabled Decision Making (PDM) is an emerging research area that aims to integrate prognostic health information and knowledge about the future operating conditions into the process of selecting subsequent actions for the system. Previous work developing and testing PDM algorithms has been done in simulation; this paper describes the effort leading to a successful demonstration of PDM algorithms on a hardware mobile robot platform. The hardware platform, based on the K11 planetary rover prototype, was modified to allow injection of selected fault modes related to the rover’s electrical power subsystem. The PDM algorithms were adapted to the hardware platform, including development of a software module framework, a new route planner, and modifications to increase the algorithms’ robustness to sensor noise and system timing issues. A set of test scenarios was chosen to demonstrate the algorithms’ capabilities. The modifications to run with a hardware platform, the test scenarios, and the test results are described in detail. The results show a successful use of PDM algorithms on a hardware test platform to optimize mission planning in the presence of electrical system faults.

Prognosis↗

Optical selection bias and projection effects in stacked galaxy cluster weak lensing

ABSTRACT Cosmological constraints from current and upcoming galaxy cluster surveys are limited by the accuracy of cluster mass calibration. In particular, optically identified galaxy clusters are prone to selection effects that can bias the weak lensing mass calibration. We investigate the selection bias of the stacked cluster lensing signal associated with optically selected clusters, using clusters identified by the redMaPPer algorithm in the Buzzard simulations as a case study. We find that at a given cluster halo mass, the residuals of redMaPPer richness and weak lensing signal are positively correlated. As a result, for a given richness selection, the stacked lensing signal is biased high compared with what we would expect from the underlying halo mass probability distribution. The cluster lensing selection bias can thus lead to overestimated mean cluster mass and biased cosmology results. We show that the lensing selection bias exhibits a strong scale dependence and is approximately 20–60 per cent for ΔΣ at large scales. This selection bias largely originates from spurious member galaxies within ±20–60 $h^{-1}\, \rm Mpc$ along the line of sight, highlighting the importance of quantifying projection effects associated with the broad redshift distribution of member galaxies in photometric cluster surveys. While our results qualitatively agree with those in the literature, accurate quantitative modelling of the selection bias is needed to achieve the goals of cluster lensing cosmology and will require synthetic catalogues covering a wide range of galaxy–halo connection models.

79 ASTRONOMY AND ASTROPHYSICS↗

Real-time video compression algorithm for Hadamard transform processing

A real-time digital video processor using Hadamard transform techniques to reduce video bandwidth is described. The processor can be programmed with different parameters to investigate various algorithms for bandwidth compression. The processor is also adaptive in that it can select different parameter sets to tradeoff spatial resolution for temporal resolution in the regions of the picture that are moving. Algorithms used in programming the system are described along with results achieved at various levels of compression. The algorithms relate to spatial compression, temporal compression, and the adaptive selection of parameter sets.

Knauer, S. C.↗

Bio-inspired Computing for Robots

Living creatures may provide algorithms to enable active sensing/control systems in robots. Active sensing could enable planetary rovers to feel their way in unknown environments. The surface of Jupiter's moon Europa consists of fractured ice over a liquid sea that may contain microbes similar to those on Earth. To explore such extreme environments, NASA needs robots that autonomously survive, navigate, and gather scientific data. They will be too far away for guidance from Earth. They must sense their environment and control their own movements to avoid obstacles or investigate a science opportunity. To meet this challenge, CICT's Information Technology Strategic Research (ITSR) Project is funding neurobiologists at NASA's Jet Propulsion Laboratory (JPL) and selected universities to search for biologically inspired algorithms that enable robust active sensing and control for exploratory robots. Sources for these algorithms are living creatures, including rats and electric fish.

Laufenberg, Larry↗

Reliable fusion of control and sensing in intelligent machines

Although robotics research has produced a wealth of sophisticated control and sensing algorithms, very little research has been aimed at reliably combining these control and sensing strategies so that a specific task can be executed. To improve the reliability of robotic systems, analytic techniques are developed for calculating the probability that a particular combination of control and sensing algorithms will satisfy the required specifications. The probability can then be used to assess the reliability of the design. An entropy formulation is first used to quickly eliminate designs not capable of meeting the specifications. Next, a framework for analyzing reliability based on the first order second moment methods of structural engineering is proposed. To ensure performance over an interval of time, lower bounds on the reliability of meeting a set of quadratic specifications with a Gaussian discrete time invariant control system are derived. A case study analyzing visual positioning in robotic system is considered. The reliability of meeting timing and positioning specifications in the presence of camera pixel truncation, forward and inverse kinematic errors, and Gaussian joint measurement noise is determined. This information is used to select a visual sensing strategy, a kinematic algorithm, and a discrete compensator capable of accomplishing the desired task. Simulation results using PUMA 560 kinematic and dynamic characteristics are presented.

Mcinroy, John E.↗

Pneumatic distortion compensation for aircraft surface pressure sensing devices

In this paper a technique of compensating for pneumatic distortion in aircraft surface pressure sensing devices is developed. The compensation allows conventional pressure sensing technology to obtain improved unsteady pressure measurements. Pressure distortion caused by frictional attenuation and pneumatic resonance within the sensing system makes obtaining unsteady pressure measurements by conventional sensors difficult. Typically, most of the distortion occurs within the pneumatic tubing used to transmit pressure impulses from the surface of the aircraft to the measurement transducer. This paper develops a second-order distortion model that accurately describes the behavior of the primary wave harmonic of the pneumatic tubing. The model is expressed in state-variable form and is coupled with standard results from minimum-variance estimation theory to develop an algorithm to compensate for the effects of pneumatic distortion. Both postflight and real-time algorithms are developed and evaluated using simulated and flight data. Covariance selection and filter-tuning examples are presented. Results presented verify that, given appropriate covariance magnitudes, the algorithms accurately reconstruct surface pressure values from remotely sensed pressure measurements.

Whitmore, Stephen A.↗

Real-time video compression algorithm for Hadamard transform processing

A real-time digital video processor using Hadamard transform techniques to reduce video bandwidth is described. The processor can be programmed with different parameters to investigate various algorithms for bandwidth compression. The processor is also adaptive in that it can select different parameter sets to trade off spatial resolution for temporal resolution in the regions of the picture that are moving. Algorithms used in programming the system are described along with results achieved at various levels of compression. The algorithms relate to spatial compression, temporal compression, and the adaptive selection of parameter sets.

Knauer, S. C.↗

Full Duplex, Spread Spectrum Radio System

The goal of this project was to support the development of a full duplex, spread spectrum voice communications system. The assembly and testing of a prototype system consisting of a Harris PRISM spread spectrum radio, a TMS320C54x signal processing development board and a Zilog Z80180 microprocessor was underway at the start of this project. The efforts under this project were the development of multiple access schemes, analysis of full duplex voice feedback delays, and the development and analysis of forward error correction (FEC) algorithms. The multiple access analysis involved the selection between code division multiple access (CDMA), frequency division multiple access (FDMA) and time division multiple access (TDMA). Full duplex voice feedback analysis involved the analysis of packet size and delays associated with full loop voice feedback for confirmation of radio system performance. FEC analysis included studies of the performance under the expected burst error scenario with the relatively short packet lengths, and analysis of implementation in the TMS320C54x digital signal processor. When the capabilities and the limitations of the components used were considered, the multiple access scheme chosen was a combination TDMA/FDMA scheme that will provide up to eight users on each of three separate frequencies. Packets to and from each user will consist of 16 samples at a rate of 8,000 samples per second for a total of 2 ms of voice information. The resulting voice feedback delay will therefore be 4 - 6 ms. The most practical FEC algorithm for implementation was a convolutional code with a Viterbi decoder. Interleaving of the bits of each packet will be required to offset the effects of burst errors.

Harvey, Bruce A.↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

Spectroscopic CCD surveys for quasars at large redshift. 3: The Palomar Transit Grism Survey catalog

This paper reports the initial results of the Palomar Transit Grism Survey (PTGS). The PTGS was designed to produce a sample of z greater than 2.7 quasars that were identified by well-defined selection criteria. The survey consists of six narrow (approximately equal to 8.5 min wide) strips of sky; the total effective area is 61.47 sq deg. Low-resolution slitless spectra, covering the wavelength range from 4400 to 7500 A, were obtained for approximately 600 000 objects. The wavelength- and flux-calibrated spectra were searched for emission lines with an automatic software algorithm. A total to 1655 emission features in the grism data satisfied our signal-to-noise ratio and equivalent width selection criteria; subsequent slit spectroscopy of the candidates confirmed the existence of 1052 lines (928 different objects). Six groups of emission lines were detected in the survey: Lyman alpha + N V, C IV, C III1, Mg II, H Beta + (O III), and H alpha + (S II). More than two-thirds of the candidates are low-redshift (z less than 0.45) emission-line galaxies; ninety objects are high-redshift quasars (z greater than 2.7) detected via their Lyman alpha + N V emission lines. The survey contains three previously unknown quasars brighter than 17th magnitude; all three have redshifts of approximately equal to 1.3. In this paper we present the observational properties of the survey, the algorithms used to select the emission-line candidates, and the catalog of emission-line objects.

Schneider, Donald P.↗

Automated Generation and Assessment of Autonomous Systems Test Cases

This slide presentation reviews some of the issues concerning verification and validation testing of autonomous spacecraft routinely culminates in the exploration of anomalous or faulted mission-like scenarios using the work involved during the Dawn mission's tests as examples. Prioritizing which scenarios to develop usually comes down to focusing on the most vulnerable areas and ensuring the best return on investment of test time. Rules-of-thumb strategies often come into play, such as injecting applicable anomalies prior to, during, and after system state changes; or, creating cases that ensure good safety-net algorithm coverage. Although experience and judgment in test selection can lead to high levels of confidence about the majority of a system's autonomy, it's likely that important test cases are overlooked. One method to fill in potential test coverage gaps is to automatically generate and execute test cases using algorithms that ensure desirable properties about the coverage. For example, generate cases for all possible fault monitors, and across all state change boundaries. Of course, the scope of coverage is determined by the test environment capabilities, where a faster-than-real-time, high-fidelity, software-only simulation would allow the broadest coverage. Even real-time systems that can be replicated and run in parallel, and that have reliable set-up and operations features provide an excellent resource for automated testing. Making detailed predictions for the outcome of such tests can be difficult, and when algorithmic means are employed to produce hundreds or even thousands of cases, generating predicts individually is impractical, and generating predicts with tools requires executable models of the design and environment that themselves require a complete test program. Therefore, evaluating the results of large number of mission scenario tests poses special challenges. A good approach to address this problem is to automatically score the results based on a range of metrics. Although the specific means of scoring depends highly on the application, the use of formal scoring - metrics has high value in identifying and prioritizing anomalies, and in presenting an overall picture of the state of the test program. In this paper we present a case study based on automatic generation and assessment of faulted test runs for the Dawn mission, and discuss its role in optimizing the allocation of resources for completing the test program.

Testing challenges↗

Quantum model learning agent: characterisation of quantum systems through machine learning

Accurate models of real quantum systems are important for investigating their behaviour, yet are difficult to distil empirically. Here, we report an algorithm—the quantum model learning agent (QMLA)—to reverse engineer Hamiltonian descriptions of a target system. We test the performance of QMLA on a number of simulated experiments, demonstrating several mechanisms for the design of candidate Hamiltonian models and simultaneously entertaining numerous hypotheses about the nature of the physical interactions governing the system under study. QMLA is shown to identify the true model in the majority of instances, when provided with limited a priori information, and control of the experimental setup. Our protocol can explore Ising, Heisenberg and Hubbard families of models in parallel, reliably identifying the family which best describes the system dynamics. We demonstrate QMLA operating on large model spaces by incorporating a genetic algorithm to formulate new hypothetical models. The selection of models whose features propagate to the next generation is based upon an objective function inspired by the Elo rating scheme, typically used to rate competitors in games such as chess and football. In all instances, our protocol finds models that exhibit F 1 score ≥ 0.88 when compared with the true model, and it precisely identifies the true model in 72% of cases, whilst exploring a space of over 250 000 potential models. By testing which interactions actually occur in the target system, QMLA is a viable tool for both the exploration of fundamental physics and the characterisation and calibration of quantum devices.

97 MATHEMATICS AND COMPUTING↗

Standalone Hazard Evaluation and Refinement From Instrument Findings (S.H.E.R.I.F.)

The Standalone Hazard Evaluation From Instrument Findings (SHERIF) system is a set of novel algorithms and associated framework designed to support the generation of Digital Elevation Maps (DEMs) from multiple LiDAR scans and perform Hazard Detection (HD) and Safe Site Identification (SSI) with no dependencies on other onboard systems. SHERIF can employ several techniques to perform robust 3D keypoint extraction and Point Cloud registration (PCR) on disparate LiDAR scans of a planetary surface to generate a DEM which evolves over the course of a trajectory. The framework also supports a variety of Hazard Detection and Safe Site Identification algorithms which can be applied to the evolving DEM being produced. SHERIF features a robust and modular construction, allowing the user a high degree of flexibility in selecting and implementing whichever keypoint identificaiton, PCR and HD/SSI algorithms they may prefer, while maintaining the data products and sensor independence of the core SHERIF framework. SHERIF was recently evaluated via simulation and hardware-in-the-loop experimental testing at NASA Johnson Space Center.

hazard detection↗

Standalone Hazard Evaluation and Refinement From Instrument Findings (S.H.E.R.I.F.)

The Standalone Hazard Evaluation From Instrument Findings (SHERIF) system is a set of novel algorithms and associated framework designed to support the generation of Digital Elevation Maps (DEMs) from multiple LiDAR scans and perform Hazard Detection (HD) and Safe Site Identification (SSI) with no dependencies on other onboard systems. SHERIF can employ several techniques to perform robust 3D keypoint extraction and Point Cloud registration (PCR) on disparate LiDAR scans of a planetary surface to generate a DEM which evolves over the course of a trajectory. The framework also supports a variety of Hazard Detection and Safe Site Identification algorithms which can be applied to the evolving DEM being produced. SHERIF features a robust and modular construction, allowing the user a high degree of flexibility in selecting and implementing whichever keypoint identificaiton, PCR and HD/SSI algorithms they may prefer, while maintaining the data products and sensor independence of the core SHERIF framework. SHERIF was recently evaluated via simulation and hardware-in-the-loop experimental testing at NASA Johnson Space Center.

hazard detection↗