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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Evaluation of Anomaly Detection Capability for Ground-Based Pre-Launch Shuttle Operations

This chapter will provide a thorough end-to-end description of the process for evaluation of three different data-driven algorithms for anomaly detection to select the best candidate for deployment as part of a suite of IVHM (Integrated Vehicle Health Management) technologies. These algorithms were deemed to be sufficiently mature enough to be considered viable candidates for deployment in support of the maiden launch of Ares I-X, the successor to the Space Shuttle for NASA's Constellation program. Data-driven algorithms are just one of three different types being deployed. The other two types of algorithms being deployed include a "nile-based" expert system, and a "model-based" system. Within these two categories, the deployable candidates have already been selected based upon qualitative factors such as flight heritage. For the rule-based system, SHINE (Spacecraft High-speed Inference Engine) has been selected for deployment, which is a component of BEAM (Beacon-based Exception Analysis for Multimissions), a patented technology developed at NASA's JPL (Jet Propulsion Laboratory) and serves to aid in the management and identification of operational modes. For the "model-based" system, a commercially available package developed by QSI (Qualtech Systems, Inc.), TEAMS (Testability Engineering and Maintenance System) has been selected for deployment to aid in diagnosis. In the context of this particular deployment, distinctions among the use of the terms "data-driven," "rule-based," and "model-based," can be found in. Although there are three different categories of algorithms that have been selected for deployment, our main focus in this chapter will be on the evaluation of three candidates for data-driven anomaly detection. These algorithms will be evaluated upon their capability for robustly detecting incipient faults or failures in the ground-based phase of pre-launch space shuttle operations, rather than based oil heritage as performed in previous studies. Robust detection will allow for the achievement of pre-specified minimum false alarm and/or missed detection rates in the selection of alert thresholds. All algorithms will also be optimized with respect to an aggregation of these same criteria. Our study relies upon the use of Shuttle data to act as was a proxy for and in preparation for application to Ares I-X data, which uses a very similar hardware platform for the subsystems that are being targeted (TVC - Thrust Vector Control subsystem for the SRB (Solid Rocket Booster)).

Martin, Rodney Alexander↗
NASA NTRS1983

Astronomical and statistical algorithms used in the Space Telescope guide star selection system

The construction of the Space Telescope Guide Star Catalog from digitized Schmidt survey plates covering the entire sky is described. In order to provide sufficient pointing information, the Guide Star Selection System has to contain a catalog of 20 million guide star candidates in the range of 9.0 to 14.5 visual magnitudes. An image inventory process extracts the relevant object data; after photometric and astrometric calibration the data are screened to arrive at suitable guide star candidates. The selection process for a given target takes into account geometric and photometric parameters of the field, scheduling information, and acquisition probabilities for each guide star pair.

Jenkner, H.↗
NASA NTRS2000

Ground Vibration Test Planning and Pre-Test Analysis for the X-33 Vehicle

This paper describes the results of the modal test planning and the pre-test analysis for the X-33 vehicle. The pre-test analysis included the selection of the target modes, selection of the sensor and shaker locations and the development of an accurate Test Analysis Model (TAM). For target mode selection, four techniques were considered, one based on the Modal Cost technique, one based on Balanced Singular Value technique, a technique known as the Root Sum Squared (RSS) method, and a Modal Kinetic Energy (MKE) approach. For selecting sensor locations, four techniques were also considered; one based on the Weighted Average Kinetic Energy (WAKE), one based on Guyan Reduction (GR), one emphasizing engineering judgment, and one based on an optimum sensor selection technique using Genetic Algorithm (GA) search technique combined with a criteria based on Hankel Singular Values (HSV's). For selecting shaker locations, four techniques were also considered; one based on the Weighted Average Driving Point Residue (WADPR), one based on engineering judgment and accessibility considerations, a frequency response method, and an optimum shaker location selection based on a GA search technique combined with a criteria based on HSV's. To evaluate the effectiveness of the proposed sensor and shaker locations for exciting the target modes, extensive numerical simulations were performed. Multivariate Mode Indicator Function (MMIF) was used to evaluate the effectiveness of each sensor & shaker set with respect to modal parameter identification. Several TAM reduction techniques were considered including, Guyan, IRS, Modal, and Hybrid. Based on a pre-test cross-orthogonality checks using various reduction techniques, a Hybrid TAM reduction technique was selected and was used for all three vehicle fuel level configurations.

Bedrossian, Herand↗
NASA NTRS2001

Global Positioning System Satellite Selection Method

The satellite selection method as utilized by the spaceborne Global Positioning System receiver provides navigational solutions and is designed for use in low Earth orbit. The satellite selection method is a robust algorithm that can be used a GPS receiver to select appropriate GPS satellites for use in calculating point solutions or attitude solutions. The method is takes into account the difficulty of finding a particular GPS satellite phase code, especially when the search range in greatly increased due to Doppler shifts introduced into the carrier frequency. The method starts with an update of the antenna pointing and spacecraft vectors to determine the antenna backplane direction. Next, the GPS satellites that will potentially be in view of the antenna are ranked on a list, whereby the list is generated based on the estimated attitude and position of each GPS satellite. Satellites blocked by the Earth are not entered on this list. A second list is created, whereby the GPS satellites are ranked according to their desirability for use in attitude determination. GPS satellites are ranked according to their orthogonality to the antenna backplane, and according to geometric dilution of precision considerations. After the lists are created, the channels of the spaceborne GPS receiver are assigned to various GPS satellites for acquisition and lock. Preliminary Doppler frequencies for searching are assigned to the various channels.

Frederick A Niles↗
NASA NTRS1983

Parallel solution of finite element equations

The paper examines several parallel processing solution algorithms for finite element equations arising in linear equilibrium problems. Two basic groups of algorithms, direct and iterative, are investigated with respect to a number of parallel computer architectures and associated selection criteria. The direct algorithms include: LR-Gauss, Crout, Cholesky, Cyclic Reduction and WZ-factorization. The iterative methods examined are: Accelerated Gauss-Seidel, Surrogate Stiffness, Jacobi, Series Expansion, and Energy Monte Carlo. For real-time applications, where the object is to minimize the execution time, Cyclic Reduction appears to be best suited. This assumes a computer with an unlimited number of parallel processors. However, for computers with a limited number of parallel processors that must be used efficiently, both Gauss factorization and Jacobi-like iterative methods rank favorably.

Salama, M.↗
NASA NTRS2015

A Comparison of Three Algorithms for Orion Drogue Parachute Release

The Orion Multi-Purpose Crew Vehicle is susceptible to ipping apex forward between drogue parachute release and main parachute in ation. A smart drogue release algorithm is required to select a drogue release condition that will not result in an apex forward main parachute deployment. The baseline algorithm is simple and elegant, but does not perform as well as desired in drogue failure cases. A simple modi cation to the baseline algorithm can improve performance, but can also sometimes fail to identify a good release condition. A new algorithm employing simpli ed rotational dynamics and a numeric predictor to minimize a rotational energy metric is proposed. A Monte Carlo analysis of a drogue failure scenario is used to compare the performance of the algorithms. The numeric predictor prevents more of the cases from ipping apex forward, and also results in an improvement in the capsule attitude at main bag extraction. The sensitivity of the numeric predictor to aerodynamic dispersions, errors in the navigated state, and execution rate is investigated, showing little degradation in performance.

Matz, Daniel A.↗
NASA NTRS2008

Sensor Selection and Data Validation for Reliable Integrated System Health Management

For new access to space systems with challenging mission requirements, effective implementation of integrated system health management (ISHM) must be available early in the program to support the design of systems that are safe, reliable, highly autonomous. Early ISHM availability is also needed to promote design for affordable operations; increased knowledge of functional health provided by ISHM supports construction of more efficient operations infrastructure. Lack of early ISHM inclusion in the system design process could result in retrofitting health management systems to augment and expand operational and safety requirements; thereby increasing program cost and risk due to increased instrumentation and computational complexity. Having the right sensors generating the required data to perform condition assessment, such as fault detection and isolation, with a high degree of confidence is critical to reliable operation of ISHM. Also, the data being generated by the sensors needs to be qualified to ensure that the assessments made by the ISHM is not based on faulty data. NASA Glenn Research Center has been developing technologies for sensor selection and data validation as part of the FDDR (Fault Detection, Diagnosis, and Response) element of the Upper Stage project of the Ares 1 launch vehicle development. This presentation will provide an overview of the GRC approach to sensor selection and data quality validation and will present recent results from applications that are representative of the complexity of propulsion systems for access to space vehicles. A brief overview of the sensor selection and data quality validation approaches is provided below. The NASA GRC developed Systematic Sensor Selection Strategy (S4) is a model-based procedure for systematically and quantitatively selecting an optimal sensor suite to provide overall health assessment of a host system. S4 can be logically partitioned into three major subdivisions: the knowledge base, the down-select iteration, and the final selection analysis. The knowledge base required for productive use of S4 consists of system design information and heritage experience together with a focus on components with health implications. The sensor suite down-selection is an iterative process for identifying a group of sensors that provide good fault detection and isolation for targeted fault scenarios. In the final selection analysis, a statistical evaluation algorithm provides the final robustness test for each down-selected sensor suite. NASA GRC has developed an approach to sensor data qualification that applies empirical relationships, threshold detection techniques, and Bayesian belief theory to a network of sensors related by physics (i.e., analytical redundancy) in order to identify the failure of a given sensor within the network. This data quality validation approach extends the state-of-the-art, from red-lines and reasonableness checks that flag a sensor after it fails, to include analytical redundancy-based methods that can identify a sensor in the process of failing. The focus of this effort is on understanding the proper application of analytical redundancy-based data qualification methods for onboard use in monitoring Upper Stage sensors.

Garg, Sanjay↗
NASA NTRS2014

Application of Adjoint Methodology in Various Aspects of Sonic Boom Design

One of the advances in computational design has been the development of adjoint methods allowing efficient calculation of sensitivities in gradient-based shape optimization. This paper discusses two new applications of adjoint methodology that have been developed to aid in sonic boom mitigation exercises. In the first, equivalent area targets are generated using adjoint sensitivities of selected boom metrics. These targets may then be used to drive the vehicle shape during optimization. The second application is the computation of adjoint sensitivities of boom metrics on the ground with respect to parameters such as flight conditions, propagation sampling rate, and selected inputs to the propagation algorithms. These sensitivities enable the designer to make more informed selections of flight conditions at which the chosen cost functionals are less sensitive.

Rallabhandi, Sriram K.↗
NASA NTRS1991

Nonuniform visual pattern image sequence coding

Visual Pattern Image Sequence Coding (VPISC) is a pyramidal image coding scheme which utilizes human visual system (HVS) properties to achieve low bit rates while maintaining a good perceived image quality, all with extremely low computational cost. This paper describes extensions of VPISC, termed Foveal VPISC (FVPISC) and Adaptive VPISC (AVPISC). Both algorithms produce decreased bit rates by selectively allowing some image regions to be coded at low resolution. In FVPISC, a foveation criterion is used to select a region of interest. In AVPISC, the algorithm adaptively determines which regions require high-resolution coding in order to maintain uniform image quality over the entire image.

Silsbee, Peter L.↗
NASA NTRS1983

Sensor failure detection for jet engines

Revisions to the advanced sensor failure detection, isolation, and accommodation (DIA) algorithm, developed under the sensor failure detection system program were studied to eliminate the steady state errors due to estimation filter biases. Three algorithm revisions were formulated and one revision for detailed evaluation was chosen. The selected version modifies the DIA algorithm to feedback the actual sensor outputs to the integral portion of the control for the nofailure case. In case of a failure, the estimates of the failed sensor output is fed back to the integral portion. The estimator outputs are fed back to the linear regulator portion of the control all the time. The revised algorithm is evaluated and compared to the baseline algorithm developed previously.

Beattie, E. C.↗
NASA NTRS1987

Algorithmic commonalities in the parallel environment

The ultimate aim of this project was to analyze procedures from substantially different application areas to discover what is either common or peculiar in the process of conversion to the Massively Parallel Processor (MPP). Three areas were identified: molecular dynamic simulation, production systems (rule systems), and various graphics and vision algorithms. To date, only selected graphics procedures have been investigated. They are the most readily available, and produce the most visible results. These include simple polygon patch rendering, raycasting against a constructive solid geometric model, and stochastic or fractal based textured surface algorithms. Only the simplest of conversion strategies, mapping a major loop to the array, has been investigated so far. It is not entirely satisfactory.

Mcanulty, Michael A.↗
NASA NTRS1986

Optimum retrieval of precipitable water fields from VAS and surface data

The use of VAS radiances and conventional surface data to determine the optimum resolution and accuracy of low-level precipitable water fields retrieved from geosynchronous satellite observations is examined. VAS retrievals of precipitated water (PW) are compared with various channel selections in the regression algorithm and with the split window algorithm. The split window algorithm and the linear regression algorithm are described. Consideration is given to the sounding-field-of-view (SFOV) resolution; the data reveal that the optimum resolution for the split window algorithm is at 15-60 km resolution, and 30-60 km SFOV resolution is optimal for the regression method. Statistics and images from PW retrieval experiments conducted on July 13, 1981 are presented and utilized to determine optimum channel selection. A fast contouring method for VAS sounding images is proposed.

Chesters, Dennis↗
NASA NTRS1977

Status report: Data management program algorithm evaluation activity at Marshall Space Flight Center

An algorithm evaluation activity was initiated to study the problems associated with image processing by assessing the independent and interdependent effects of registration, compression, and classification techniques on LANDSAT data for several discipline applications. The objective of the activity was to make recommendations on selected applicable image processing algorithms in terms of accuracy, cost, and timeliness or to propose alternative ways of processing the data. As a means of accomplishing this objective, an Image Coding Panel was established. The conduct of the algorithm evaluation is described.

Jayroe, R. R., Jr.↗
NASA NTRS2013

MODIS 3km Aerosol Product: Algorithm and Global Perspective

After more than a decade of producing a nominal 10 km aerosol product based on the dark target method, the MODIS aerosol team will be releasing a nominal 3 km product as part of their Collection 6 release. The new product differs from the original 10 km product only in the manner in which reflectance pixels are ingested, organized and selected by the aerosol algorithm. Overall, the 3 km product closely mirrors the 10 km product. However, the finer resolution product is able to retrieve over ocean closer to islands and coastlines, and is better able to resolve fine aerosol features such as smoke plumes over both ocean and land. In some situations, it provides retrievals over entire regions that the 10 km product barely samples. In situations traditionally difficult for the dark target algorithm, such as over bright or urban surfaces the 3 km product introduces isolated spikes of artificially high aerosol optical depth (AOD) that the 10 km algorithm avoids. Over land, globally, the 3 km product appears to be 0.01 to 0.02 higher than the 10 km product, while over ocean, the 3 km algorithm is retrieving a proportionally greater number of very low aerosol loading situations. Based on collocations with ground-based observations for only six months, expected errors associated with the 3 km land product are determined to be greater than for the 10 km product: 0.05 0.25 AOD. Over ocean, the suggestion is for expected errors to be the same as the 10 km product: 0.03 0.05 AOD. The advantage of the product is on the local scale, which will require continued evaluation not addressed here. Nevertheless, the new 3 km product is expected to provide important information complementary to existing satellite-derived products and become an important tool for the aerosol community.

Remer, L. A.↗
NASA NTRS1987

Real-time collision avoidance manipulator transfer movements

Collision free robot manipulator maneuvers for transferring a payload from one location to another in the presence of obstacles are discussed. Such maneuvers are executed by means of two algorithms running in parallel. The first algorithm performs an on-line, one step ahead acceleration optimization, with an adaptive N-step ahead precaution measure to prevent overshooting the specified forbidden joint coordinates. The second algorithm, an on-line planning algorithm, at the same time, selects the current target state and the current forbidden joint coordinates for the first algorithm. Since the task is a point to point transfer movement, the problem is dealt in robot joint space directly and the kinematic problem can be bypassed completely. A simulation example using a 2 degree-of-freedom planner robot is given.

Chen, N.↗
NASA NTRS1997

The Richness Dependence of Galaxy Cluster Correlations: Results From A Redshift Survey Of Rich APM Clusters

We analyze the spatial clustering properties of a new catalog of very rich galaxy clusters selected from the APM Galaxy Survey. These clusters are of comparable richness and space density to Abell Richness Class greater than or equal to 1 clusters, but selected using an objective algorithm from a catalog demonstrably free of artificial inhomogeneities. Evaluation of the two-point correlation function xi(sub cc)(r) for the full sample and for richer subsamples reveals that the correlation amplitude is consistent with that measured for lower richness APM clusters and X-ray selected clusters. We apply a maximum likelihood estimator to find the best fitting slope and amplitude of a power law fit to x(sub cc)(r), and to estimate the correlation length r(sub 0) (the value of r at which xi(sub cc)(r) is equal to unity). For clusters with a mean space density of 1.6 x 10(exp -6) h(exp 3) MpC(exp -3) (equivalent to the space density of Abell Richness greater than or equal to 2 clusters), we find r(sub 0) = 21.3(+11.1/-9.3) h(exp -1) Mpc (95% confidence limits). This is consistent with the weak richness dependence of xi(sub cc)(r) expected in Gaussian models of structure formation. In particular, the amplitude of xi(sub cc)(r) at all richnesses matches that of xi(sub cc)(r) for clusters selected in N-Body simulations of a low density Cold Dark Matter model.

Croft, R. A. C.↗
NASA NTRS1996

CometBoards Users Manual Release 1.0

Several nonlinear mathematical programming algorithms for structural design applications are available at present. These include the sequence of unconstrained minimizations technique, the method of feasible directions, and the sequential quadratic programming technique. The optimality criteria technique and the fully utilized design concept are two other structural design methods. A project was undertaken to bring all these design methods under a common computer environment so that a designer can select any one of these tools that may be suitable for his/her application. To facilitate selection of a design algorithm, to validate and check out the computer code, and to ascertain the relative merits of the design tools, modest finite element structural analysis programs based on the concept of stiffness and integrated force methods have been coupled to each design method. The code that contains both these design and analysis tools, by reading input information from analysis and design data files, can cast the design of a structure as a minimum-weight optimization problem. The code can then solve it with a user-specified optimization technique and a user-specified analysis method. This design code is called CometBoards, which is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for the Design of Structures. This manual describes for the user a step-by-step procedure for setting up the input data files and executing CometBoards to solve a structural design problem. The manual includes the organization of CometBoards; instructions for preparing input data files; the procedure for submitting a problem; illustrative examples; and several demonstration problems. A set of 29 structural design problems have been solved by using all the optimization methods available in CometBoards. A summary of the optimum results obtained for these problems is appended to this users manual. CometBoards, at present, is available for Posix-based Cray and Convex computers, Iris and Sun workstations, and the VM/CMS system.

Guptill, James D.↗