Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “GENETICS”

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

Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

Benford, Andrew↗
NASA NTRS2005

Preliminary Design of a Manned Nuclear Electric Propulsion Vehicle Using Genetic Algorithms

Nuclear electric propulsion (NEP) vehicles will be needed for future manned missions to Mars and beyond. Candidate designs must be identified for further detailed design from a large array of possibilities. Genetic algorithms have proven their utility in conceptual design studies by effectively searching a large design space to pinpoint unique optimal designs. This research combined analysis codes for NEP subsystems with a genetic algorithm. The use of penalty functions with scaling ratios was investigated to increase computational efficiency. Also, the selection of design variables for optimization was considered to reduce computation time without losing beneficial design search space. Finally, trend analysis of a reference mission to the asteroids yielded a group of candidate designs for further analysis.

Irwin, Ryan W.↗
NASA NTRS2002

Hybrid Neural-Network: Genetic Algorithm Technique for Aircraft Engine Performance Diagnostics Developed and Demonstrated

As part of the NASA Aviation Safety Program, a unique model-based diagnostics method that employs neural networks and genetic algorithms for aircraft engine performance diagnostics has been developed and demonstrated at the NASA Glenn Research Center against a nonlinear gas turbine engine model. Neural networks are applied to estimate the internal health condition of the engine, and genetic algorithms are used for sensor fault detection, isolation, and quantification. This hybrid architecture combines the excellent nonlinear estimation capabilities of neural networks with the capability to rank the likelihood of various faults given a specific sensor suite signature. The method requires a significantly smaller data training set than a neural network approach alone does, and it performs the combined engine health monitoring objectives of performance diagnostics and sensor fault detection and isolation in the presence of nominal and degraded engine health conditions.

Kobayashi, Takahisa↗
NASA NTRS2005

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗
NASA NTRS1998

New Results in Astrodynamics Using Genetic Algorithms

Generic algorithms have gained popularity as an effective procedure for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a brief survey of the use of genetic algorithms to solve astrodynamics problems is presented and is followed by new results obtained from applying a Pareto genetic algorithm to the optimization of low-thrust interplanetary spacecraft missions.

generic algorithms optimization problems astrodyna↗
NASA NTRS2013

Automatic Data Filter Customization Using a Genetic Algorithm

This work predicts whether a retrieval algorithm will usefully determine CO2 concentration from an input spectrum of GOSAT (Greenhouse Gases Observing Satellite). This was done to eliminate needless runtime on atmospheric soundings that would never yield useful results. A space of 50 dimensions was examined for predictive power on the final CO2 results. Retrieval algorithms are frequently expensive to run, and wasted effort defeats requirements and expends needless resources. This algorithm could be used to help predict and filter unneeded runs in any computationally expensive regime. Traditional methods such as the Fischer discriminant analysis and decision trees can attempt to predict whether a sounding will be properly processed. However, this work sought to detect a subsection of the dimensional space that can be simply filtered out to eliminate unwanted runs. LDAs (linear discriminant analyses) and other systems examine the entire data and judge a "best fit," giving equal weight to complex and problematic regions as well as simple, clear-cut regions. In this implementation, a genetic space of "left" and "right" thresholds outside of which all data are rejected was defined. These left/right pairs are created for each of the 50 input dimensions. A genetic algorithm then runs through countless potential filter settings using a JPL computer cluster, optimizing the tossed-out data s yield (proper vs. improper run removal) and number of points tossed. This solution is robust to an arbitrary decision boundary within the data and avoids the global optimization problem of whole-dataset fitting using LDA or decision trees. It filters out runs that would not have produced useful CO2 values to save needless computation. This would be an algorithmic preprocessing improvement to any computationally expensive system.

Mandrake, Lukas↗
NASA NTRS2014

Preliminary Structural Design Using Topology Optimization with a Comparison of Results from Gradient and Genetic Algorithm Methods

In this paper, genetic algorithm based and gradient-based topology optimization is presented in application to a real hardware design problem. Preliminary design of a planetary lander mockup structure is accomplished using these methods that prove to provide major weight savings by addressing the structural efficiency during the design cycle. This paper presents two alternative formulations of the topology optimization problem. The first is the widely-used gradient-based implementation using commercially available algorithms. The second is formulated using genetic algorithms and internally developed capabilities. These two approaches are applied to a practical design problem for hardware that has been built, tested and proven to be functional. Both formulations converged on similar solutions and therefore were proven to be equally valid implementations of the process. This paper discusses both of these formulations at a high level.

Burt, Adam O.↗
NASA NTRS2014

Optimization of a Lunar Pallet Lander Reinforcement Structure Using a Genetic Algorithm

In this paper, a unique system level spacecraft design optimization will be presented. A Genetic Algorithm is used to design the global pattern of the reinforcing structure, while a gradient routine is used to adequately stiffen the sub-structure. The system level structural design includes determining the optimal physical location (and number) of reinforcing beams of a lunar pallet lander deck structure. Design of the substructure includes determining placement of secondary stiffeners and the number of rivets required for assembly.. In this optimization, several considerations are taken into account. The primary objective was to raise the primary natural frequencies of the structure such that the Pallet Lander primary structure does not significantly couple with the launch vehicle. A secondary objective is to determine how to properly stiffen the reinforcing beams so that the beam web resists the shear buckling load imparted by the spacecraft components mounted to the pallet lander deck during launch and landing. A third objective is that the calculated stress does not exceed the allowable strength of the material. These design requirements must be met while, minimizing the overall mass of the spacecraft. The final paper will discuss how the optimization was implemented as well as the results. While driven by optimization algorithms, the primary purpose of this effort was to demonstrate the capability of genetic algorithms to enable design automation in the preliminary design cycle. By developing a routine that can automatically generate designs through the use of Finite Element Analysis, considerable design efficiencies, both in time and overall product, can be obtained over more traditional brute force design methods.

Burt, Adam↗
NASA NTRS2006

Pattern-Based Genetic Algorithm for Airborne Conflict Resolution

NASA has developed the Autonomous Operations Planner (AOP) airborne decision support tool to explore advanced air traffic control concepts that include delegating separation authority to aircraft. A key element of the AOP is its strategic conflict resolution (CR) algorithm, which must resolve conflicts while maintaining conformance with traffic flow management constraints. While a previous CR algorithm, which focused on broader flight plan optimization objectives as a part of conflict resolution, had successfully been developed, new research has identified the need for resolution routes the users find more acceptable (i.e., simpler and more intuitive). A new CR algorithm is presented that uses a combination of pattern-based maneuvers and a genetic algorithm to achieve these new objectives. Several lateral and vertical maneuver patterns are defined and the application of the genetic algorithm explained. A new approach to defining a conflicted fitness function using estimates of the local conflict region around a conflicted trajectory is also presented. Preliminary performance characteristics of the implemented algorithm are provided.

Vivona, Robert A.↗
NASA NTRSDate not supplied

Genetic Determinants of Microbial Survival in Space

Space flight agencies envision a future for humankind beyond Earth, including missions back to the Moon and to Mars in the coming decades. Sending humans into space inevitably includes their microbiomes as well, leading to trillions of bacteria being shed in their living areas. These bacteria shape the lives of their hosts as well as their environment; thus, it is crucial to understand the adaptations of these microbial spacefarers in spaceflight conditions. We aimed to elucidate the genetic determinants of microbial survival in space using a pan-genome analysis of 12 genera cultured from the International Space Station (ISS) from 2017 to 2018. Analysis was performed on each of the genera individually with terrestrial analogs to identify the core and accessory genomes of the spaceflight and terrestrial strains. We then compared the flight and terrestrial core and accessory genomes for each genera using a Bray-Curtis index and visualized the resulting dissimilarity using an Non-Metric Dimensional Scaling plot. The core proteins available in only the spaceflight organisms were then manually characterized for function and genomic location. In every core genome comparison in each genus, there was significant dissimilarity in the core of the spaceflight organisms when compared to the terrestrial organisms. This trend was present in some of the accessory genomes, but was not ubiquitous. Functional analysis of the core content of the ISS genomes showed the majority of genes unique to the core were clustered by location. These gene clusters suggested a set of genetic determinants confer survival in spacecraft-built environments, notably through the uptake of extracellular DNA such as bacteriophage and plasmids. The clear difference between spaceflight and terrestrial microorganisms shows that spaceflight conditions are selective, which has long term implications for their human hosts and environments.

MoBE↗
NASA NTRSDate not supplied

Bingo: A Customizable Framework for Symbolic Regression with Genetic Programming

In this paper, we introduce Bingo, a flexible and customizable yet performant Python framework for symbolic regression with genetic programming. Bingo maintains a modular code structure for simple abstraction and easily swappable components. Fitness functions, selection methods, and constant optimization methods allow for easy problem-specific customization. Bingo also maintains several features for increased efficiency such as parallelism, equation simplification, and a C++ backend. We compare Bingo’s performance to other genetic programming for symbolic regression (GPSR) methods to show that it is both competitive and flexible.

machine learning↗
NASA NTRSDate not supplied

Bingo: A Customizable Framework for Symbolic Regression with Genetic Programming

In this paper, we introduce Bingo, a flexible and customizable yet performant Python framework for symbolic regression with genetic programming. Bingo maintains a modular code structure for simple abstraction and easily swappable components. Fitness functions, selection methods, and constant optimization methods allow for easy problem-specific customization. Bingo also maintains several features for increased efficiency such as parallelism, equation simplification, and a C++ backend. We compare Bingo’s performance to other genetic programming for symbolic regression (GPSR) methods to show that it is both competitive and flexible.

David Randall↗
DOE OSTI2021

Genetically engineered Foot and Mouth Disease Virus and related proteins, polynucleotides, compositions, methods and systems

Genetically engineered Foot and Mouth Disease Virus (FMDV) and related engineered proteins and polynucleotides, nanolipoprotein particles, compositions, methods and systems are described. The genetically engineered FMDV is modified by the strategic insertion of a protein tag into select regions of the FMDV genome which encode viral proteins that are exposed on the surface of the FMDV viral capsid. The inserted protein tag is displayed as a decoration or attachment on the viral capsid surface.

Rieder, Aida Elizabeth↗
DOE OSTI2022

Synthesis of bioproducts from lignin-derived aromatics by genetically modified microorganisms

The present invention provides for a method of converting a depolymerized lignin aromatic compound into a bioproduct, comprising: (a) providing a composition comprising a depolymerized lignin aromatic compound, optionally a depolymerized cellulose, and optionally a depolymerized hemicellulose, and (b) introducing a genetically modified microorganism to the composition, wherein the genetically modified microorganism is capable of converting the depolymerized lignin aromatic compound into a bioproduct; such that the depolymerized lignin aromatic compound is converted into a bioproduct.

Gladden, John M.↗
DOE OSTI2023

Genetically engineered foot and mouth disease virus and related proteins, polynucleotides, compositions, methods and systems

Genetically engineered Foot and Mouth Disease Virus (FMDV) and related engineered proteins and polynucleotides, nanolipoprotein particles, compositions, methods and systems are described. The genetically engineered FMDV is modified by the strategic insertion of a protein tag into select regions of the FMDV genome which encode viral proteins that are exposed on the surface of the FMDV viral capsid. The inserted protein tag is displayed as a decoration or attachment on the viral capsid surface.

Rieder, Aida E.↗