Search NASA⌕ Search

SEARCH · Search NASA

Results for “genetic algorithm optimization”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗
NASA NTRS2006

Comparison of a Convected Helmholtz and Euler Model for Impedance Eduction in Flow

Impedances educed from a well-tested convected Helmholtz model are compared to that of a recently developed linearized Euler model using two ceramic test liners under the assumed conditions or uniform flow and a plane wave source. The convected Helmholtz model is restricted to uniform mean flow whereas the linearized Euler model can account for the effect or the shear layer. Test data to educe the impedance is acquired from measurements obtained in the NASA Langley Research Center Grazing Incidence Tube for mean flow Mach numbers ranging from 0.0 to 0.5 and source frequencies ranging from 0.5 kHz to 3.0 kHz. The unknown impedance of the liner b educed by judiciously choo~ingth e impedance via an optimization method to match the measured acoustic pressure on the wall opposite the test liner. Results are presented on four spatial grids using three different optimization methods (contour deformation, Davidon-Fletcher Powell, and the Genetic Algorithm). All three optimization methods converge to the same impedance when used with the same model and to nearly identical impedances when used on different models. h anomaly was observed only at 0.5 kHz for high mean flow speeds. The anomaly is likely due to the use of measured data in a flow regime where shear layer effects are important but are neglected in the math models. Consistency between the impedances educed using the two models provides confidence that the linearized Euler model is ready For application to more realistic flows, such as those containing shear layers.

Watson, Willie R.↗
NASA NTRS2002

Bell-Curve Genetic Algorithm for Mixed Continuous and Discrete Optimization Problems

In this manuscript we have examined an extension of BCB that encompasses a mix of continuous and quasi-discrete, as well as truly-discrete applications. FVe began by testing two refinements to the discrete version of BCB. The testing of midpoint versus fitness (Tables 1 and 2) proved inconclusive. The testing of discrete normal tails versus standard mutation showed was conclusive and demonstrated that the discrete normal tails are better. Next, we implemented these refinements in a combined continuous and discrete BCB and compared the performance of two discrete distance on the hub problem. Here we found when "order does matter" it pays to take it into account.

Kincaid, Rex K.↗
NASA NTRS2015

Extension of an Object-Oriented Optimization Tool: User's Reference Manual

The National Aeronautics and Space Administration Armstrong Flight Research Center has developed a cost-effective and flexible object-oriented optimization (O (sup 3)) tool that leverages existing tools and practices and allows easy integration and adoption of new state-of-the-art software. This object-oriented framework can integrate the analysis codes for multiple disciplines, as opposed to relying on one code to perform analysis for all disciplines. Optimization can thus take place within each discipline module, or in a loop between the O (sup 3) tool and the discipline modules, or both. Six different sample mathematical problems are presented to demonstrate the performance of the O (sup 3) tool. Instructions for preparing input data for the O (sup 3) tool are detailed in this user's manual.

Multidisciplinary design optimization↗
NASA NTRS2004

Applying a Genetic Algorithm to Reconfigurable Hardware

This paper investigates the feasibility of applying genetic algorithms to solve optimization problems that are implemented entirely in reconfgurable hardware. The paper highlights the pe$ormance/design space trade-offs that must be understood to effectively implement a standard genetic algorithm within a modem Field Programmable Gate Array, FPGA, reconfgurable hardware environment and presents a case-study where this stochastic search technique is applied to standard test-case problems taken from the technical literature. In this research, the targeted FPGA-based platform and high-level design environment was the Starbridge Hypercomputing platform, which incorporates multiple Xilinx Virtex II FPGAs, and the Viva TM graphical hardware description language.

Wells, B. Earl↗
NASA NTRS1972

Comparison of genetic algorithms with conjugate gradient methods

Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.

Bosworth, J. L.↗
NASA NTRSDate not supplied

Robust Trajectory Optimization for Guided Powered Descent and Landing

A robust trajectory optimization approach for guidance algorithm gain selection for powered descent and landing is developed. This approach uses a genetic algorithm to determine optimal guidance algorithm parameters while incorporating uncertainty information from linear covariance analysis. The optimal guidance algorithm parameters are determined while accounting for environment, navigation, and vehicle property uncertainty and sensor suite fidelity. As a demonstration of this method, the optimal gains for the fractional polynomial powered descent guidance are found for the braking phase of a robotic lunar landing mission. Scenarios with differing sensor suites and sensor qualities are considered, with objective functions to minimize variability in propellant usage or terminal position. Results show that the optimal guidance algorithm gains for a given trajectory differ based on the sensor suite, and optimal guidance algorithm gains may result in up to 20% performance improvements over the baseline in propellant usage and landed accuracy.

Grace E Calkins↗
NASA NTRSDate not supplied

Voxel Based Three-Dimensional Topology Optimization of Heat Exchanger Fins

Increasing interest in novel aircraft propulsion systems and potential for unwanted heat generation, or capture and reuse of waste heat, may require increasingly lightweight and high performing heat exchangers. Advances in manufacturing technologies have shown potential to create complex designs, but design tools need more flexibility. This study utilizes genetic algorithm-driven topology optimization to develop high performance heat exchanger fins for critical applications such as aerospace. The solid domain is generated using voxel representation where a voxel value of 1 indicates the solid domain and a voxel value of 0 refers to the fluid domain. The use of voxel representation somewhat matches the digitization of a model that is required to fabricate using additive manufacturing, and also allows for a highly unconstrained geometry. To test the topology optimization approach, a three-dimensional(3D)baseline offset strip fin geometry in steady laminar flow(Reynolds number = 215)with conjugate heat transfer(simultaneous solution of solid and fluid temperature fields)is optimized. New designs are generated using the genetic algorithm (GA) and sent to evaluation by the CFD software OpenFOAM; then the GA sorts and selects the reproduction pool for the following generation. This process is repeated for 60 generations. The study also investigates the effect off in material on the performance of the GA and the resulting designs. The results show that the optimal designs have overall performance improvement of 18% relative to the baseline. Additionally, a fin constructed of a lower conductivity material (such as an Inconel super alloy that might be necessary for waste heat recovery applications)results in lower overall performance improvement (11%)and optimal designs with higher pressure drop relative to their baseline, and relative to optimal designs produced using higher conductivity materials.

3D Optimization↗
NASA NTRS2006

Habitat Design Optimization and Analysis

Long-duration surface missions to the Moon and Mars will require habitats for the astronauts. The materials chosen for the habitat walls play a direct role in the protection against the harsh environments found on the surface. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. Advanced optimization techniques are necessary for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces; therefore, a habitat design optimization tool utilizing genetic algorithms has been developed. Genetic algorithms use a "survival of the fittest" philosophy, where the most fit individuals are more likely to survive and reproduce. This habitat design optimization tool is a multi-objective formulation of structural analysis, heat loss, radiation protection, and meteoroid protection. This paper presents the research and development of this tool.

SanSoucie, Michael P.↗
NASA NTRS2003

Comparison of Structural Optimization Techniques for a Nuclear Electric Space Vehicle

The purpose of this paper is to utilize the optimization method of genetic algorithms (GA) for truss design on a nuclear propulsion vehicle. Genetic Algorithms are a guided, random search that mirrors Darwin s theory of natural selection and survival of the fittest. To verify the GA s capabilities, other traditional optimization methods were used to compare the results obtained by the GA's, first on simple 2-D structures, and eventually on full-scale 3-D truss designs.

Benford, Andrew↗
NASA NTRS2004

Closed Loop System Identification with Genetic Algorithms

High performance control design for a flexible space structure is challenging since high fidelity plant models are di.cult to obtain a priori. Uncertainty in the control design models typically require a very robust, low performance control design which must be tuned on-orbit to achieve the required performance. Closed loop system identi.cation is often required to obtain a multivariable open loop plant model based on closed-loop response data. In order to provide an accurate initial plant model to guarantee convergence for standard local optimization methods, this paper presents a global parameter optimization method using genetic algorithms. A minimal representation of the state space dynamics is employed to mitigate the non-uniqueness and over-parameterization of general state space realizations. This control-relevant system identi.cation procedure stresses the joint nature of the system identi.cation and control design problem by seeking to obtain a model that minimizes the di.erence between the predicted and actual closed-loop performance.

Whorton, Mark S.↗
NASA NTRS1998

Design Optimization and Analysis of a Composite Honeycomb Intertank

Intertanks, the structure between tanks of launch vehicles, are prime candidates for weight reduction of rockets. This paper discusses the optimization and detailed analysis of a 96 in (2.44 m) diameter, 77 in (1.85 m) tall intertank. The structure has composite face sheets and an aluminum honeycomb core. The ends taper to a thick built up laminate for a double lap bolted shear joint. It is made in 8 full length panels joined with bonded double lap joints. The nominal load is 4000 lb/in (7 x 10(exp 5) N/m). Optimization is by Genetic Algorithm and minimizes weight by varying C, core thickness, number and orientation of acreage and buildup plies, and the size, number and spacing of bolts. A variety of cases were run with populations up to 2000 and chromosomes as long as 150 bits. Constraints were buckling, face stresses (normal, shear, wrinkling and dimpling, bolt stress, and bolt hole stresses (bearing, net tension, wedge splitting, shear out and tension/shear out). Analysis is by a combination of theoretical solutions and empirical data. After optimization, a series of coupon tests were performed in conjunction with a rigorous analysis involving a variety of finite element models. The analysis and test resulted in several small changes to the optimized design. The intertank has undergone a 250,000 lb (1.1 x 10(exp 6) N) limit load test and been mated with a composite liquid hydrogen tank. The tank/intertank unit is being installed in a test stand where it will see 200 thermal/load cycles. Afterwards the intertank will be demated and loaded in compression to failure.

Finckenor, Jeffrey↗
NASA NTRS1999

Design Optimization and Analysis of a Composite Honeycomb Intertank

Intertanks, the structure between tanks of launch vehicles, are prime candidates for weight reduction of rockets. This paper discusses the optimization and detailed follow up analysis and testing of a 96 in. diameter, 77 in. tall intertank. The structure has composite face sheets with an aluminum honeycomb core. The ends taper to a thick built up laminate for a double lap bolted splice joint interface. It is made in 8 full length panels joined with bonded double lap joints. The nominal load is 4000 lb/in. Optimization is by Genetic Algorithm and minimizes weight by varying core thickness, number and orientation of acreage and buildup plies, and the size, number and spacing of bolts. A variety of design cases were run with populations up to 2000 and chromosomes as long as 150 bits. Constraints were buckling; face stresses (normal, shear, wrinkling and dimpling); bolt stress; and bolt hole stresses (bearing, net tension, wedge splitting, shear out and tension/shear out). Analysis is by a combination of elasticity solutions and empirical data. After optimization, a series of coupon tests were performed in conjunction with a rigorous analysis involving a variety of finite element models. This analysis and testing resulted in several small changes to the optimized design. The equation used for hole bearing strength was found to be inadequate, resulting in thicker ends. The core thickness increased 0.05", and potting compound was added in the taper to strengthen the facesheet bond. The intertank has undergone a 250,000 lb limit load test and been mated with a composite liquid hydrogen tank. The tank/intertank unit is being installed in a test stand where it will see 200 thermal/load cycles. Afterwards the intertank will be demated and loaded in compression to failure.

Finckenor, Jeff↗
NASA NTRS2021

Monte Carlo Tree Search Methods for the Earth-Observing Satellite Scheduling Problem

This work explores on-board planning for the single spacecraft, multiple ground station Earth-observing satellite scheduling problem through artificial neural network function approximation of state–action value estimates generated by Monte Carlo tree search (MCTS). An extensive hyperparameter search is conducted for MCTS on the basis of performance, safety, and downlink opportunity utilization to determine the best hyperparameter combination for data generation. A hyperparameter search is also conducted on neural network architectures. The learned behavior of each network is explored, and each network architecture’s robustness to orbits and epochs outside of the training distributions is investigated. Furthermore, each algorithm is compared with a genetic algorithm, which serves to provide a baseline for optimality. MCTS is shown to compute near-optimal solutions in comparison to the genetic algorithm. The state–action value networks are shown to match or exceed the performance of MCTS in six orders of magnitude less execution time, showing promise for execution on board spacecraft.

Adam P. Herrmann↗
NASA NTRS2010

Multivariate Methods for Prediction of Geologic Sample Composition with Laser-Induced Breakdown Spectroscopy

Laser-induced breakdown spectroscopy (LIBS) uses pulses of laser light to ablate a material from the surface of a sample and produce an expanding plasma. The optical emission from the plasma produces a spectrum which can be used to classify target materials and estimate their composition. The ChemCam instrument on the Mars Science Laboratory (MSL) mission will use LIBS to rapidly analyze targets remotely, allowing more resource- and time-intensive in-situ analyses to be reserved for targets of particular interest. ChemCam will also be used to analyze samples that are not reachable by the rover's in-situ instruments. Due to these tactical and scientific roles, it is important that ChemCam-derived sample compositions are as accurate as possible. We have compared the results of partial least squares (PLS), multilayer perceptron (MLP) artificial neural networks (ANNs), and cascade correlation (CC) ANNs to determine which technique yields better estimates of quantitative element abundances in rock and mineral samples. The number of hidden nodes in the MLP ANNs was optimized using a genetic algorithm. The influence of two data preprocessing techniques were also investigated: genetic algorithm feature selection and averaging the spectra for each training sample prior to training the PLS and ANN algorithms. We used a ChemCam-like laboratory stand-off LIBS system to collect spectra of 30 pressed powder geostandards and a diverse suite of 196 geologic slab samples of known bulk composition. We tested the performance of PLS and ANNs on a subset of these samples, choosing to focus on silicate rocks and minerals with a loss on ignition of less than 2 percent. This resulted in a set of 22 pressed powder geostandards and 80 geologic samples. Four of the geostandards were used as a validation set and 18 were used as the training set for the algorithms. We found that PLS typically resulted in the lowest average absolute error in its predictions, but that the optimized MLP ANN and the CC ANN often gave results comparable to PLS. Averaging the spectra for each training sample and/or using feature selection to choose a small subset of wavelengths to use for predictions gave mixed results, with degraded performance in some cases and similar or slightly improved performance in other cases. However, training time was significantly reduced for both PLS and ANN methods by implementing feature selection, making this a potentially appealing method for initial, rapid-turn-around analyses necessary for Chemcam's tactical role on MSL. Choice of training samples has a strong influence on the accuracy of predictions. We are currently investigating the use of clustering algorithms (e.g. k-means, neural gas, etc.) to identify training sets that are spectrally similar to the unknown samples that are being predicted, and therefore result in improved predictions

Morris, Richard↗
NASA NTRS2018

Optimization of Second Fault Detection Thresholds to Maximize Mission POS

In order to support manned spaceflight safety requirements, the Space Launch System (SLS) has defined program-level requirements for key systems to ensure successful operation under single fault conditions. To accommodate this with regards to Navigation, the SLS utilizes an internally redundant Inertial Navigation System (INS) with built-in capability to detect, isolate, and recover from first failure conditions and still maintain adherence to performance requirements. The unit utilizes multiple hardware- and software-level techniques to enable detection, isolation, and recovery from these events in terms of its built-in Fault Detection, Isolation, and Recovery (FDIR) algorithms. Successful operation is defined in terms of sufficient navigation accuracy at insertion while operating under worst case single sensor outages (gyroscope and accelerometer faults at launch). In addition to first fault detection and recovery, the SLS program has also levied requirements relating to the capability of the INS to detect a second fault, tracking any unacceptable uncertainty in knowledge of the vehicle's state. This detection functionality is required in order to feed abort analysis and ensure crew safety. Increases in navigation state error and sensor faults can drive the vehicle outside of its operational as-designed environments and outside of its performance envelope causing loss of mission, or worse, loss of crew. The criteria for operation under second faults allows for a larger set of achievable missions in terms of potential fault conditions, due to the INS operating at the edge of its capability. As this performance is defined and controlled at the vehicle level, it allows for the use of system level margins to increase probability of mission success on the operational edges of the design space. Due to the implications of the vehicle response to abort conditions (such as a potentially failed INS), it is important to consider a wide range of failure scenarios in terms of both magnitude and time. As such, the Navigation team is taking advantage of the INS's capability to schedule and change fault detection thresholds in flight. These values are optimized along a nominal trajectory in order to maximize probability of mission success, and reducing the probability of false positives (defined as when the INS would report a second fault condition resulting in loss of mission, but the vehicle would still meet insertion requirements within system-level margins). This paper will describe an optimization approach using Genetic Algorithms to tune the threshold parameters to maximize vehicle resilience to second fault events as a function of potential fault magnitude and time of fault over an ascent mission profile. The analysis approach, and performance assessment of the results will be presented to demonstrate the applicability of this process to second fault detection to maximize mission probability of success.

Anzalone, Evan↗