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.

SourceResearch connectionFrom yearThrough year

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

At least 523 records · Page 29

All sources NASA NTRS DOE OSTI

NASA NTRS2022

Registering Articulated Objects With Human-in-the-loop Corrections

Remotely programming robots to execute tasks often relies on registering objects of interest in the robot’s environment. Frequently, these tasks involve articulating objects such as opening or closing a valve. However, existing human-in-the-loop methods for registering objects do not consider articulations and the corresponding impact to the geometry of the object, which can cause the methods to fail. In this work, we present an approach where the registration system attempts to automatically determine the object model, pose, and articulation for user-selected points using a nonlinear iterative closest point algorithm. When the automated fitting is incorrect, the operator can iteratively intervene with corrections after which the system will refit the object. We present an implementation of our fitting procedure and evaluate it with a user study that shows that it can improve user performance, in measures of time on task and task load, ease of use, and usefulness compared to a manual registration approach. We also present a situated example that demonstrates the integration of our method in an end-to-end system for articulating a remote valve.

teleoperation↗

NASA NTRS2003

Stray-Light Correction of the Marine Optical Buoy

In ocean-color remote sensing, approximately 90% of the flux at the sensor originates from atmospheric scattering, with the water-leaving radiance contributing the remaining 10% of the total flux. Consequently, errors in the measured top-of-the atmosphere radiance are magnified a factor of 10 in the determination of water-leaving radiance. Proper characterization of the atmosphere is thus a critical part of the analysis of ocean-color remote sensing data. It has always been necessary to calibrate the ocean-color satellite sensor vicariously, using in situ, ground-based results, independent of the status of the pre-flight radiometric calibration or the utility of on-board calibration strategies. Because the atmosphere contributes significantly to the measured flux at the instrument sensor, both the instrument and the atmospheric correction algorithm are simultaneously calibrated vicariously. The Marine Optical Buoy (MOBY), deployed in support of the Earth Observing System (EOS) since 1996, serves as the primary calibration station for a variety of ocean-color satellite instruments, including the Sea-viewing Wide Field-of-view Sensor (SeaWiFS), the Moderate Resolution Imaging Spectroradiometer (MODIS), the Japanese Ocean Color Temperature Scanner (OCTS) , and the French Polarization and Directionality of the Earth's Reflectances (POLDER). MOBY is located off the coast of Lanai, Hawaii. The site was selected to simplify the application of the atmospheric correction algorithms. Vicarious calibration using MOBY data allows for a thorough comparison and merger of ocean-color data from these multiple sensors.

Brown, Steven W.↗

NASA NTRS1983

Nimbus-7 total ozone algorithm

The total ozone algorithm used for the processing of Nimbus-4 BUV measurements is modified to account for off-nadir viewing of the Total Ozone Mapping Spectrometer onboard Nimbus-7 satellite. TOMS is a cross-track scanning instrument with a 50 x 50-km field of view, increasing to 150 x 150 km at the extreme off-nadir angle of 51 deg and six spectral bands in the 310-380-nm region. Consideration is given to the determination of the pressure at the reflecting surface and profile selection scheme at very high solar zenith angles. The algorithm is also applicable to the Solar Backscattered UV Experiment aboard the same satellite. The modifications provide for a better cloud height, snow correction, and improved retrievals near the terminator.

Bhartia, P. K.↗

NASA NTRS1994

Wavelet compression techniques for hyperspectral data

Hyperspectral sensors are electro-optic sensors which typically operate in visible and near infrared bands. Their characteristic property is the ability to resolve a relatively large number (i.e., tens to hundreds) of contiguous spectral bands to produce a detailed profile of the electromagnetic spectrum. In contrast, multispectral sensors measure relatively few non-contiguous spectral bands. Like multispectral sensors, hyperspectral sensors are often also imaging sensors, measuring spectra over an array of spatial resolution cells. The data produced may thus be viewed as a three dimensional array of samples in which two dimensions correspond to spatial position and the third to wavelength. Because they multiply the already large storage/transmission bandwidth requirements of conventional digital images, hyperspectral sensors generate formidable torrents of data. Their fine spectral resolution typically results in high redundancy in the spectral dimension, so that hyperspectral data sets are excellent candidates for compression. Although there have been a number of studies of compression algorithms for multispectral data, we are not aware of any published results for hyperspectral data. Three algorithms for hyperspectral data compression are compared. They were selected as representatives of three major approaches for extending conventional lossy image compression techniques to hyperspectral data. The simplest approach treats the data as an ensemble of images and compresses each image independently, ignoring the correlation between spectral bands. The second approach transforms the data to decorrelate the spectral bands, and then compresses the transformed data as a set of independent images. The third approach directly generalizes two-dimensional transform coding by applying a three-dimensional transform as part of the usual transform-quantize-entropy code procedure. The algorithms studied all use the discrete wavelet transform. In the first two cases, a wavelet transform coder was used for the two-dimensional compression. The third case used a three dimensional extension of this same algorithm.

Evans, Bruce↗

NASA NTRS1989

Robust control design for aerospace applications

Time-domain control design for stability robustness of linear systems with structured uncertainty is addressed. Upper bounds on the linear perturbation of an asymptotically stable linear system are obtained, making it possible to maintain stability by using the structural information of the uncertainty. A quantitative measure called the stability robustness index is introduced and used to design controllers for robust stability. The proposed state feedback control design algorithm can be used, for a given set of perturbations, to select the range of control effort for which the system is stability-robust. Conversely it can be used, for a given control effort, to determine the size of the tolerable perturbation. The algorithm is illustrated with examples from aircraft control and large-space-structure control problems.

Yedavalli, Rama K.↗

NASA NTRS1990

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗

NASA NTRS1974

Management of analytical redundancy in digital flight control systems for aircraft

This paper presents a design method for optimal redundancy management for nonlinear systems with application to highly maneuvering aircraft. The approach taken is based on selecting the failure states to be covered by the system design and constructing a cost function that represents the cost of making an incorrect decision. The decision logic which minimizes the cost requires a bank of extended Kalman filters running in parallel. This produces a severe computational requirement. To reduce this requirement, a suboptimal logic is developed based on using a nonlinear single-stage prediction algorithm in the filters with filter gains and decision logic selected using steady-state results obtained from a linearization of the vehicle and sensor dynamics. The design process is then applied to designing a redundancy management system for the F8-C aircraft. Results indicate that the system is superior in failure detection to a system using the same structure but using a linear single-stage prediction algorithm in the filters.

Montgomery, R. C.↗

NASA NTRS1994

Parallel Processing Systems for Passive Ranging During Helicopter Flight

The complexity of rotorcraft missions involving operations close to the ground result in high pilot workload. In order to allow a pilot time to perform mission-oriented tasks, sensor-aiding and automation of some of the guidance and control functions are highly desirable. Images from an electro-optical sensor provide a covert way of detecting objects in the flight path of a low-flying helicopter. Passive ranging consists of processing a sequence of images using techniques based on optical low computation and recursive estimation. The passive ranging algorithm has to extract obstacle information from imagery at rates varying from five to thirty or more frames per second depending on the helicopter speed. We have implemented and tested the passive ranging algorithm off-line using helicopter-collected images. However, the real-time data and computation requirements of the algorithm are beyond the capability of any off-the-shelf microprocessor or digital signal processor. This paper describes the computational requirements of the algorithm and uses parallel processing technology to meet these requirements. Various issues in the selection of a parallel processing architecture are discussed and four different computer architectures are evaluated regarding their suitability to process the algorithm in real-time. Based on this evaluation, we conclude that real-time passive ranging is a realistic goal and can be achieved with a short time.

Sridhar, Bavavar↗

NASA NTRS1999

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.↗

NASA NTRS1986

Fast algorithm for calculating chemical kinetics in turbulent reacting flow

This paper addresses the need for a fast batch chemistry solver to perform the kinetics part of a split operator formulation of turbulent reacting flows, with special attention focused on the solution of the ordinary differential equations governing a homogeneous gas-phase chemical reaction. For this purpose, a two-part predictor-corrector algorithm which incorporates an exponentially fitted trapezoidal method was developed. The algorithm performs filtering of ill-posed initial conditions, automatic step-size selection, and automatic selection of Jacobi-Newton or Newton-Raphson iteration for convergence to achieve maximum computational efficiency while observing a prescribed error tolerance. The new algorithm, termed CREK1D (combustion reaction kinetics, one-dimensional), compared favorably with the code LSODE when tested on two representative problems drawn from combustion kinetics, and is faster than LSODE.

Radhakrishnan, K.↗

NASA NTRS2016

Time Series Explorer: Bayesian Blocks with Generalized Profiles and in Higher Dimensions

The Time Series Explorer (TSE) is a project aimed at provided new and advanced time series analysis algorithms in two forms: a tool kit and an automated pipeline applying selected tools in machine learning settings. I will present a sketch of TSE with emphasis on time-domain modeling in general and recent improvements of the Bayesian Block (BB) algorithm in particular. This includes generalizing the shape of the elementary blocks from the current constant-rate model to general shapes, such as two-sided exponentials. Related topics will include extension of BB to higher dimensions and a novel way to detect and characterize short time-scale bursts in time-tagged event data. The Fermi Gamma Ray Space Telescope light curve for the Crab Nebula will be used as an example for all of the algorithms discussed. This work is in collaboration with Tom Loredo.

Bayesian Block (BB) algorithm↗

NASA NTRS2019

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

The newly developed Trajectory Option Set (TOS), a preference-weighted set of alternative routes submitted by flight operators, is a capability in the U.S. traffic flow management system that enables automated trajectory negotiation between flight operators and Air Navigation Service Providers. The objective of this paper is to describe and demonstrate an approach for automatically generating pre-departure and airborne TOSs that have a high probability of operational acceptance. The approach uses hierarchical clustering of historical route data to identify route candidates. The probability of operational acceptance is then estimated using predictors trained on historical flight plan amendment data using supervised machine learning algorithms, allowing the routes with highest probability of operational acceptance to be selected for the TOS. Features used describe historical route usage, difference in flight time and downstream demand to capacity imbalance. A random forest was found to be the best performing algorithm for learning operational acceptability, with a model accuracy of 0.96. The approach is demonstrated for an historical pre-departure flight from Dallas/Fort Worth International Airport to Newark Liberty International Airport.

Evans, Antony↗

NASA NTRS2019

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

Evans, Antony↗

NASA NTRS2017

Station Keeping with an Autonomous Underwater Glider Using a Predictive Model of Ocean Currents

We investigate the use of an autonomous underwater glider as a platform for a virtual mooring. Our approach uses a simple vehicle motion model, a predictive model of ocean currents, and a greedy search algorithm in order to simulate possible actions available to the vehicle and select an action to minimize the distance from the target point. Results from a 19 day experiment in October 2016 near Monterey Bay are presented where we test our control algorithm as well as investigate the effect of a glider’s dive profile on its ability to act as a virtual mooring.

Chien, Steve↗

NASA NTRS2019

Everybody Needs Somebody Sometimes: Validation of Adaptive Recovery in Robotic Space Operations

This work assesses an adaptive approach to fault recovery in autonomous robotic space operations, which uses indicators of opportunity, such as physiological state measurements and observations of past human assistant performance, to inform future selections. We validated our reinforcement learning approach using data we collected from humans executing simulated mission scenarios. We present a method of structuring human-factors experiments that permits collection of relevant indicator of opportunity and assigned assistance task performance data, as well as evaluation of our adaptive approach, without requiring large numbers of test subjects. Application of our reinforcement learning algorithm to our experimental data shows that our adaptive assistant selection approach can achieve lower cumulative regret compared to existing non-adaptive baseline approaches when using real human data. Our work has applications beyond space robotics to any application where autonomy failures may occur that require external intervention.

Human-centered robotics↗

NASA NTRS1995

Next generation fire suppressants

Spectrex, Inc., located in Cedar Grove, NJ is a manufacturer of fire detection and suppression equipment. Spectrex is one of the original pioneers in high speed fire detection and suppression systems for combat vehicles. Spectrex has installed fire suppressions systems in thousands of combat vehicles and ships throughout the world. Additionally, they manufacture flame explosion detectors, ship damage control systems, and optical gas and vapor detectors. The culmination of several years of research and development has recently produced an innovative electro-optical continuous monitoring systems called SharpEye 20/20I IR(sup 3) and SAFEYE that provide fast and reliable gas, vapor, aerosol, flame, and explosion detection. SharpEye 20/20I IR(sup 3) is a self-contained triple spectrum flame detector which scans for oscillating IR radiation (1 to 10 Hz) in the spectral bands ranging from 4.0 to 5.0 microns and uses programmed algorithms to check the ratio and correlation of data received by the three sensors to make the system highly immune to false alarms. It is extremely sensitive as it can detect a 1 x 1 square foot gasoline pan fire at 200 feet in less than 3 seconds. The sensitivity is user programmable, offering 4 ranges of detection. SAFEYE is comprised of a selected number of multispectral ban microprocessors controlled detectors which are in communication with one or more radiation sources that is projected along a 600 feet optical path. The signals from the selected narrow bands are processed and analyzed by highly sophisticated algorithms. It is ideal for high risk, remote, large areas such as petroleum and chemical manufacturing sites, waste dumps, aircraft cargo bays, and ship compartments. The SAFEYE will perform direct readings of the presence or rate of rise of concentrations of gases, vapors, or aerosols at the range of parts per million and provide alarms at various set points at different levels of concentrations.

Brown, Jerry A.↗

NASA NTRS2016

Improving Nocturnal Fire Detection with the VIIRS Day-Night Band

Building on existing techniques for satellite remote sensing of fires, this paper takes advantage of the day-night band (DNB) aboard the Visible Infrared Imaging Radiometer Suite (VIIRS) to develop the Firelight Detection Algorithm (FILDA), which characterizes fire pixels based on both visible-light and infrared (IR) signatures at night. By adjusting fire pixel selection criteria to include visible-light signatures, FILDA allows for significantly improved detection of pixels with smaller and/or cooler subpixel hotspots than the operational Interface Data Processing System (IDPS) algorithm. VIIRS scenes with near-coincident Advanced Spaceborne Thermal Emission and Reflection (ASTER) overpasses are examined after applying the operational VIIRS fire product algorithm and including a modified "candidate fire pixel selection" approach from FILDA that lowers the 4-μm brightness temperature (BT) threshold but includes a minimum DNB radiance. FILDA is shown to be effective in detecting gas flares and characterizing fire lines during large forest fires (such as the Rim Fire in California and High Park fire in Colorado). Compared with the operational VIIRS fire algorithm for the study period, FILDA shows a large increase (up to 90%) in the number of detected fire pixels that can be verified with the finer resolution ASTER data (90 m). Part (30%) of this increase is likely due to a combined use of DNB and lower 4-μm BT thresholds for fire detection in FILDA. Although further studies are needed, quantitative use of the DNB to improve fire detection could lead to reduced response times to wildfires and better estimate of fire characteristics (smoldering and flaming) at night.

Day-night band↗

NASA NTRS1996

A PDE Sensitivity Equation Method for Optimal Aerodynamic Design

The use of gradient based optimization algorithms in inverse design is well established as a practical approach to aerodynamic design. A typical procedure uses a simulation scheme to evaluate the objective function (from the approximate states) and its gradient, then passes this information to an optimization algorithm. Once the simulation scheme (CFD flow solver) has been selected and used to provide approximate function evaluations, there are several possible approaches to the problem of computing gradients. One popular method is to differentiate the simulation scheme and compute design sensitivities that are then used to obtain gradients. Although this black-box approach has many advantages in shape optimization problems, one must compute mesh sensitivities in order to compute the design sensitivity. In this paper, we present an alternative approach using the PDE sensitivity equation to develop algorithms for computing gradients. This approach has the advantage that mesh sensitivities need not be computed. Moreover, when it is possible to use the CFD scheme for both the forward problem and the sensitivity equation, then there are computational advantages. An apparent disadvantage of this approach is that it does not always produce consistent derivatives. However, for a proper combination of discretization schemes, one can show asymptotic consistency under mesh refinement, which is often sufficient to guarantee convergence of the optimal design algorithm. In particular, we show that when asymptotically consistent schemes are combined with a trust-region optimization algorithm, the resulting optimal design method converges. We denote this approach as the sensitivity equation method. The sensitivity equation method is presented, convergence results are given and the approach is illustrated on two optimal design problems involving shocks.

Borggaard, Jeff↗