Search NASA⌕ Search

SEARCH · Search NASA

Results for “Search algorithm”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Data Mining and Optimization Tools for Developing Engine Parameters Tools

This project was awarded for understanding the problem and developing a plan for Data Mining tools for use in designing and implementing an Engine Condition Monitoring System. Tricia Erhardt and I studied the problem domain for developing an Engine Condition Monitoring system using the sparse and non-standardized datasets to be available through a consortium at NASA Lewis Research Center. We visited NASA three times to discuss additional issues related to dataset which was not made available to us. We discussed and developed a general framework of data mining and optimization tools to extract useful information from sparse and non-standard datasets. These discussions lead to the training of Tricia Erhardt to develop Genetic Algorithm based search programs which were written in C++ and used to demonstrate the capability of GA algorithm in searching an optimal solution in noisy, datasets. From the study and discussion with NASA LeRC personnel, we then prepared a proposal, which is being submitted to NASA for future work for the development of data mining algorithms for engine conditional monitoring. The proposed set of algorithm uses wavelet processing for creating multi-resolution pyramid of tile data for GA based multi-resolution optimal search.

Dhawan, Atam P.↗
NASA NTRS1990

Random search optimization based on genetic algorithm and discriminant function

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

Kiciman, M. O.↗
NASA NTRS1989

A survey on the structured singular value

The structured singular value, U, is an important linear algebra tool to study a class of matrix perturbation problems. It is useful for analyzing the robustness of stability and performance of uncertain, (nominally) linear systems. Computation of (M) is difficult, and usually, upper and lower bounds are all that can be reliably computed. Upper bounds give conservative estimates of the sizes of allowable perturbations. The maximum singular value of a matrix M is an upper bound for (M). As an upper bound, it can be improved by finding a transformations to the data (i.e. M) which do not change the structured singular value, but do reduce the maximum singular value. Typically, upper bound algorithms involve searches over sets of transformations to yield the tightest bound. Lower bound algorithms are intelligent searches for minimum-norm solutions to multivariable polynomial equations, and are based on various optimality conditions that hold at the global (and, unfortunately, some local) minima. The current methods to compute both of these types of bounds are reviewed. Theoretical justification and extensive numerical experience with the various algorithms are covered.

Packard, Andy↗
NASA NTRS2007

Efficient Optimization of Low-Thrust Spacecraft Trajectories

A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.

Lee, Seungwon↗
NASA NTRSDate not supplied

Implementation of Combinatorial Optimization Techniques for Automated Fiber Placement Through Thickness Defect Stack-Up Minimization

The Computer Aided Process Planning (CAPP) module was developed to facilitate and accelerate the process planning workflow for Automated Fiber Placement (AFP). CAPP assists process planners in identifying optimal starting point locations and layup strategies for each ply of a laminate. Ply optimization operates on measurement and scoring of geometry-based defects such as gaps, overlaps, angle deviation, and steering. This paper expands on the established framework for analyzing defect stack-up through thickness of a laminate. Four different combinatorial optimization algorithms are implemented and evaluated: (1) genetic algorithm, (2) differential evolution, (3) particle swarm, and (4) greedy search. The algorithms identify the optimal combination of ply-level layup strategies, by scoring potential laminates on defect stacking, using two different objective functions. A final optimization approach is also presented which trades some performance for a large gain in efficiency. These approaches are compared to a randomized combination using a complex tool surface in a virtual case study. The result is a streamlined methodology for comparing different laminate-level manufacturing strategies and minimizing the through thickness defect stack up.

CAPP↗
NASA NTRS2017

Kepler Planet Detection Metrics: Window and One-Sigma Depth Functions for Data Release 25

This document describes the window and one-sigma depth functions relevant to the Transiting Planet Search (TPS) algorithm in the Kepler pipeline (Jenkins 2002; Jenkins et al. 2017). The window function specifies the fraction of unique orbital ephemeris epochs over which three transits are observable as a function of orbital period. In this context, the epoch and orbital period, together, comprise the ephemeris of an orbiting companion, and ephemerides with the same period are considered equivalent if their epochs differ by an integer multiple of the period. The one-sigma depth function specifies the depth of a signal (in ppm) for a given light curve that results in a one-sigma detection of a transit signature as a function of orbital period when averaged over all unique orbital ephemerides. These planet detection metrics quantify the ability of TPS to detect a transiting planet signature on a star-by-star basis. They are uniquely applicable to a specific Kepler data release, since they are dependent on the details of the light curves searched and the functionality of the TPS algorithm used to perform the search. This document describes the window and one-sigma depth functions relevant to Kepler Data Release 25 (DR25), where the data were processed (Thompson et al. 2016) and searched (Twicken et al. 2016) with the SOC 9.3 pipeline. In Section 4, we describe significant differences from those reported in Kepler Data Release 24 (Burke Seader 2016) and document our verification method.

Planet Detection Metrics↗
NASA NTRS2020

Optimal Multi-Agent Search and Rescue Using Potential Field Theory

This paper presents an algorithm for efficient search and rescue using a multi-agent system of vehicles. The algorithm uses an artificial potential field combined with a time-varying reward function for visiting various points within the search area. The reward function is used to weight the attractiveness of these points in the potential field, and collision avoidance terms are used to repel vehicles from each other, which has the additional effect of reducing duplication of searching efforts. The algorithm generates velocity commands in real-time based on communication with the other vehicles. This framework allows vehicles to react in a dynamic environment, which is a significant advantage to simply following a-priori defined trajectories. Simulation results are presented to demonstrate the ability of the algorithm to cover the search area effectively. The algorithm is also compared to an exhaustive lawn-mower search pattern. This comparison is done via a Monte Carlo simulation with randomized target initial conditions and trajectories. The time to find the target improved by 16 and 30% in the mean and median, respectively. Additionally, this paper presents a method for analyzing the upper bound for time to find a target under the potential field guidance algorithm assuming a radially expanding search area.

John R Cooper↗
NASA NTRS1997

A Model-Based Approach for the Measurement of Eye Movements Using Image Processing

This paper describes a video eye-tracking algorithm which searches for the best fit of the pupil modeled as a circular disk. The algorithm is robust to common image artifacts such as the droopy eyelids and light reflections while maintaining the measurement resolution available by the centroid algorithm. The presented algorithm is used to derive the pupil size and center coordinates, and can be combined with iris-tracking techniques to measure ocular torsion. A comparison search method of pupil candidates using pixel coordinate reference lookup tables optimizes the processing requirements for a least square fit of the circular disk model. This paper includes quantitative analyses and simulation results for the resolution and the robustness of the algorithm. The algorithm presented in this paper provides a platform for a noninvasive, multidimensional eye measurement system which can be used for clinical and research applications requiring the precise recording of eye movements in three-dimensional space.

Sung, Kwangjae↗
NASA NTRSDate not supplied

Uncovering Hazards Using a Multi-Objective Optimization to Explore the Faulty State-Space

Considering resilience when designing complex engineered systems is crucial to ensure the system is safe under unexpected hazardous scenarios. Traditional risk-based approaches, such as Failure Modes and Effects Analysis (FMEA) are useful for designing the system to mitigate hazardous scenarios that can be identified by the designer, but often require experience or prior knowledge of system failures to generate. More recently, researchers have developed simulation tools that enable the designer to model large sets of hazardous scenarios (driven by both internal faults and external factors) through simulation. While these tools enable a wider scope of fault modes to be evaluated (e.g., by injecting combined set of fault modes or injecting modes at different times), the resulting assessments (like FMEA) still require knowledge of the specific modes to be evaluated. However, failure to analyze a wide variety of fault scenarios can lead to an incomplete picture of the system resilience, especially to "surprise events'' which may be difficult for the designer to identify and predict beforehand. To overcome this challenge, previous work developed a fault sampling approach for resilience simulations which would procedurally-generate a wide variety of potential faults by systematically perturbing the health states of the system. While the resulting fault modes generated covered a much larger space hazards than would be otherwise considered (and identified many unique failure trajectories which would not have otherwise been identified), it also significantly increased the computational cost of the analysis and resulted in the simulation and analysis of a large set of essentially duplicate scenarios. Additionally, as the number of dimensions in the faulty state-space increases, the full elaboration of possible modes becomes computationally infeasible, justifying the use of a more targeted search. To resolve this limitation, this work proposes the use of a multiobjective optimization algorithm to search the health state space for potential fault modes that are both (1) hazardous and (2) unique. To solve this type of problem, this work proposes the use of a cooperative co-evolutionary algorithm. To demonstrate this approach, it will be applied to a model of an autonomous rover which uses line markings to navigate, focusing on potential hazards in the drive system which could cause the rover to crash. To determine the merit of the approach, it will further be compared with the previously-presented range elaboration approach and a random mode generation approach on the basis of computational efficiency and found modes.

Resilience↗
NASA NTRS1993

Stochastic search in structural optimization - Genetic algorithms and simulated annealing

An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.

Hajela, Prabhat↗
NASA NTRS1990

Genetic algorithm based fuzzy control of spacecraft autonomous rendezvous

The U.S. Bureau of Mines is currently investigating ways to combine the control capabilities of fuzzy logic with the learning capabilities of genetic algorithms. Fuzzy logic allows for the uncertainty inherent in most control problems to be incorporated into conventional expert systems. Although fuzzy logic based expert systems have been used successfully for controlling a number of physical systems, the selection of acceptable fuzzy membership functions has generally been a subjective decision. High performance fuzzy membership functions for a fuzzy logic controller that manipulates a mathematical model simulating the autonomous rendezvous of spacecraft are learned using a genetic algorithm, a search technique based on the mechanics of natural genetics. The membership functions learned by the genetic algorithm provide for a more efficient fuzzy logic controller than membership functions selected by the authors for the rendezvous problem. Thus, genetic algorithms are potentially an effective and structured approach for learning fuzzy membership functions.

Karr, C. L.↗
NASA NTRS2007

Estimating Dust and Water Ice Content of the Martian Atmosphere From THEMIS Data

Researchers at JPL and Arizona State University conducted a comparative study of three candidate algorithms for estimating components of the Martian atmosphere, using raw (uncalibrated) data collected by the Thermal Emission Imaging System (THEMIS). THEMIS is an instrument onboard the Mars Odyssey spacecraft that acquires image data in five visible and nine infrared (IR) wavelength bands. The algorithms under study used data collected from eight of the nine IR bands to estimate the dust and water ice content of the atmosphere. Such an algorithm could be used in onboard data processing to trigger other algorithms that search for features of scientific interest and to reduce the volume of data transmitted to Earth. The algorithms studied were based on regression models. In the study, the optical depths estimated by these algorithms were compared with optical depths estimated in ground-based processing using fully calibrated data from both THEMIS and the Thermal Emission Spectrometer (TES). TES is an instrument onboard the Mars Global Surveyor spacecraft that also observes the planet at infrared wavelengths, but at a lower spatial resolution than THEMIS does. Of the algorithms studied, the one that performed best was based on a Gaussian Support Vector Machine regression model. The test results indicated that this algorithm, operating on the raw data, had error rates that were within the uncertainty associated with the estimates obtained by the groundbased analysis of the fully calibrated data. This level of fidelity demonstrates that these algorithms are sufficiently accurate for use in an onboard setting.

Bandfield, Joshua↗
NASA NTRS2010

A Machine-Checked Proof of A State-Space Construction Algorithm

This paper presents the correctness proof of Saturation, an algorithm for generating state spaces of concurrent systems, implemented in the SMART tool. Unlike the Breadth First Search exploration algorithm, which is easy to understand and formalise, Saturation is a complex algorithm, employing a mutually-recursive pair of procedures that compute a series of non-trivial, nested local fixed points, corresponding to a chaotic fixed point strategy. A pencil-and-paper proof of Saturation exists, but a machine checked proof had never been attempted. The key element of the proof is the characterisation theorem of saturated nodes in decision diagrams, stating that a saturated node represents a set of states encoding a local fixed-point with respect to firing all events affecting only the node s level and levels below. For our purpose, we have employed the Prototype Verification System (PVS) for formalising the Saturation algorithm, its data structures, and for conducting the proofs.

Catano, Nestor↗
NASA NTRS2003

Software Searches for Better Spacecraft-Navigation Models

ADAPT is a computer program that searches for better mathematical models for spacecraft navigation. The task of tuning trajectory-determination models for interplanetary navigation is complex, requiring an intensive search of multiple dynamical and nondynamical models that yield trajectory solutions with minimal errors. By automating the search, ADAPT eases the task of human analysts and enables them to consider wider ranges of potential solutions. ADAPT uses genetic algorithms to search a range of relevant parameters in a user-selected design space to arrive at values for those parameters that best fit the measured spacecraft-tracking data. The user s guide for ADAPT reviews the theoretical basis of the program and presents two example applications. One example is that of selecting a solar-radiation model for the Mars Pathfinder (MPF) mission using MPF tracking data and an extended Kalman filter from prior spacecraft-navigation software. The second example is of the use of tracking data from the Stardust spacecraft mission combined with a pseudo-epoch-state batch filter and an empirical small-forces model to find improved impulse models for use during Stardust attitude adjustments.

Ely, Todd↗
NASA NTRS2021

Systematic KMTNet Planetary Anomaly Search. I. OGLE-2019-BLG-1053Lb, a BuriedTerrestrial Planet

In order to exhume the buried signatures of “missing planetary caustics” in Korea Microlensing Telescope Network (KMTNet) data, we conducted a systematic anomaly search of the residuals from point-source point-lens fits, based on a modified version of the KMTNet Event Finder algorithm. This search revealed the lowest-mass-ratio planetary caustic to date in the microlensing event OGLE-2019-BLG-1053, for which the planetary signal had not been noticed before. The planetary system has a planet–host mass ratio ofq= (1.25±0.13) × 10−5. A Bayesian analysis yielded estimates of the mass of the host star, Mhost =-0.61+0.29 -0.24 Mo, the mass of its planet, Mplanet =-2.48 +1.19 -0.98 Mo, the projected planet – host separation, a^= 3.4 +0.5/-0.5 au, and the lens distance, DL =-6.8 +0.6 -0.90kpc.The discovery of this very-low-mass-ratio planet illustrates the utility of our method and opens a new window for a large and homogeneous sample to study the microlensing planet–host mass ratio function down to q∼ 10−5.

Exoplanet detection methods↗
NASA NTRS2020

Integrating the Science Opportunity Analyzer with a Reusable Opportunity Search Framework

In our interactions with the Science Opportunity Analyzer (SOA) software, we recognized how its ability to search for geometric events in space is a need for robotic space missions in general. To satisfy this need, we propose the Tychonis framework, which is built upon the principles of: (1) separations of concerns, (2) extensibility, (3) reusability, and (4) independent verification and validation. Tychonis’ separation of concerns results in the availability of different constructs to model geometric events and search for them. These constructs can be extended by users as needed and reused across missions without changes. Given the low coupling between concerns, and the fact Tychonis can be augmented in isolation, its constructs can be validated independently from other pieces of software. This paper elaborates on these topics and presents an integration case study between Tychonis and SOA that relies on the concept of dynamic integration. Dynamic integration entails that augmentations of the framework are reflected automatically in the host application without any changes to the host application’s code. The SOA-Tychonis integration case study can be extrapolated to other tools that need to search for geometric events as the pattern repeats across implementations: (i) the manipulation of a user interface to model opportunities, (ii) the execution of algorithms to search for opportunities, and (iii) the presentation of search results to users. Overall, Tychonis’ is a story about how the application of proven software principles and good design choices can reduce risk and cost to space missions

Soria, Manel↗