Search NASA⌕ Search

SEARCH · Search NASA

Results for “Evolutionary”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Tuning of MEMS Gyroscope using Evolutionary Algorithm and "Switched Drive-Angle" Method

We propose a tuning method for Micro-Electro-Mechanical Systems (MEMS) gyroscopes based on evolutionary computation that has the capacity to efficiently increase the sensitivity of MEMS gyroscopes through tuning and, furthermore, to find the optimally tuned configuration for this state of increased sensitivity. We present the results of an experiment to determine the speed and efficiency of an evolutionary algorithm applied to electrostatic tuning of MEMS micro gyros. The MEMS gyro used in this experiment is a pyrex post resonator gyro (PRG) in a closed-loop control system. A measure of the quality of tuning is given by the difference in resonant frequencies, or frequency split, for the two orthogonal rocking axes. The current implementation of the closed-loop platform is able to measure and attain a relative stability in the sub-millihertz range, leading to a reduction of the frequency split to less than 100 mHz.

Micro-Electro-Mechanical Systems (MEMS)↗
NASA NTRS2007

Evolutionary Optimization of a Geometrically Refined Truss

Structural optimization is a field of research that has experienced noteworthy growth for many years. Researchers in this area have developed optimization tools to successfully design and model structures, typically minimizing mass while maintaining certain deflection and stress constraints. Numerous optimization studies have been performed to minimize mass, deflection, and stress on a benchmark cantilever truss problem. Predominantly traditional optimization theory is applied to this problem. The cross-sectional area of each member is optimized to minimize the aforementioned objectives. This Technical Publication (TP) presents a structural optimization technique that has been previously applied to compliant mechanism design. This technique demonstrates a method that combines topology optimization, geometric refinement, finite element analysis, and two forms of evolutionary computation: genetic algorithms and differential evolution to successfully optimize a benchmark structural optimization problem. A nontraditional solution to the benchmark problem is presented in this TP, specifically a geometrically refined topological solution. The design process begins with an alternate control mesh formulation, multilevel geometric smoothing operation, and an elastostatic structural analysis. The design process is wrapped in an evolutionary computing optimization toolset.

Hull, P. V.↗
NASA NTRS2006

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗
NASA NTRS2013

Experiments with a Parallel Multi-Objective Evolutionary Algorithm for Scheduling

Evolutionary multi-objective algorithms have great potential for scheduling in those situations where tradeoffs among competing objectives represent a key requirement. One challenge, however, is runtime performance, as a consequence of evolving not just a single schedule, but an entire population, while attempting to sample the Pareto frontier as accurately and uniformly as possible. The growing availability of multi-core processors in end user workstations, and even laptops, has raised the question of the extent to which such hardware can be used to speed up evolutionary algorithms. In this paper we report on early experiments in parallelizing a Generalized Differential Evolution (GDE) algorithm for scheduling long-range activities on NASA's Deep Space Network. Initial results show that significant speedups can be achieved, but that performance does not necessarily improve as more cores are utilized. We describe our preliminary results and some initial suggestions from parallelizing the GDE algorithm. Directions for future work are outlined.

scheduling↗
NASA NTRS2009

Evolutionary Computation for the Identification of Emergent Behavior in Autonomous Systems

Over the past several years the Center for Evolutionary Computation and Automated Design at the Jet Propulsion Laboratory has developed a technique based on Evolutionary Computational Methods (ECM) that allows for the automated optimization of complex computationally modeled systems. An important application of this technique is for the identification of emergent behaviors in autonomous systems. Mobility platforms such as rovers or airborne vehicles are now being designed with autonomous mission controllers that can find trajectories over a solution space that is larger than can reasonably be tested. It is critical to identify control behaviors that are not predicted and can have surprising results (both good and bad). These emergent behaviors need to be identified, characterized and either incorporated into or isolated from the acceptable range of control characteristics. We use cluster analysis of automatically retrieved solutions to identify isolated populations of solutions with divergent behaviors.

Terrile, Richard J.↗
NASA NTRS2018

An Evolutionary Computation System Design Concept for Developing Controlled Closed Ecosystems: An Intelligent Systems Approach to Foster Gravitational Ecosystem Research for Developing Sustainable Communities in Space and on Earth

An adjustably-autonomous intelligent systems approach for developing Closed Ecosystems (CESs) is presented, which includes a design concept and preliminary design details for the Controlled Closed-Ecosystem Development System (CCEDS) and the Orbiting Modular Artificial-Gravity Spacecraft (OMAGS). The paper is divided into three sections: CESs, the CCEDS Design Concept, and Orbiting Fractional-Gravity Closed Ecosystems OMAGS design concept. The first section briefly describes Closed EcoSystems (CESs), complex adaptive systems, biomes, microbial microbiomes, and their relevance for the study of astrobiology. This section also discusses initial efforts in the development of Closed Environment Life Support Systems (CELSSs) for sustainable communities in space and on Earth. This section concludes with a discussion of the bioregenerative life support system challenge of and the corresponding consequences due to the inverse relationship of the very small human biomass/non-human biomass ratio overall on the Earth with respect to the extremely large human biomass/non-human-biomass ratio found in cities and the International Space Station. The second section describes the CCEDS design concept, which consists of a population of controlled colonies of CES Modules (CESMs), each an integrated CES, continually generating data for an intelligent system that operates the CESs and their CESMs. A variety of CESM types and their use are briefly described. The CCEDS intelligent system uses an evolutionary computation algorithm described in this section to develop and optimize these CESs to increase their viability duration and the size of the animals they support with the ultimate goal to support populations of humans, both on Earth and in space. The CCEDS architecture, its five control subsystems, and its five evolutionary computation levels are also discussed. The section concludes with a discussion of several CCEDS design strategies. The third section summarizes the OMAGS design concept for a spacecraft with a payload consisting of CESs in an orbiting spacecraft centrifuge that operates for at least 5 years. The spacecraft concept is described including its 150cm-radius centrifuge with a 2 ton & 3,000 liter bioscience payload capacity for 24 CESMs. The centrifuge design has four physical levels for its CESMs, each level subject to a different fractional gravity level. This section presents the spacecraft benefits of being designed and operated such that the spacecraft and payload centrifuge wheel counter-rotate resulting in net zero angular momentum and zero gyroscopic forces. Artificial-gravity generation by centripetal acceleration is also discussed. This section concludes by showing the external specifications of the CESMs and their layout in the centrifuge, followed by discussing the multi-payload module rationale. In tandem, the CCEDS and OMAGS systems can be used to foster gravitational ecosystem research for developing sustainable communities in space and on Earth.

Dorais, Gregory A.↗
NASA NTRS2019

An Evolutionary System of Mineralogy: Proposal for A Classification of Planetary Materials Based on Natural Kind Clustering

Minerals reveal the nature of the co-evolving geosphere and biosphere through billions of years of Earth history. Mineral classification systems have the potential to elucidate this rich evolutionary story; however, the present mineral taxonomy, based as it is on idealized major element chemistry and crystal structure, lacks a temporal aspect, and thus cannot reflect planetary evolution. A complementary evolutionary system of mineralogy based on the quantitative recognition of “natural kind clustering” for a wide range of condensed planetary materials with different paragenetic origins has the potential to amplify, though not supersede, the present classification system.

Philosophy of mineralogy↗
DOE OSTI2021

An adaptive granular representative volume element model with an evolutionary periodic boundary for hierarchical multiscale analysis

The hierarchical multiscale analysis normally utilizes a microscopic representative volume element (RVE) model to capture path/history-dependent macroscopic responses instead of using phenomenological constitutive models. However, for problems involving large deformation, the current RVE model used in geomechanics may lose representative properties due to the progressive distortion of the RVE box, unless a proper reinitialization is applied. This work develops an adaptive RVE model in conjunction with an evolutionary periodic boundary (EPB) algorithm for hierarchical multiscale analysis of granular materials undergoing large deformation based on a recent RVE model proposed for coupling molecular dynamics and the material point method. The proposed adaptive RVE model avoids the reinitialization of the RVE box that even undergoes extremely large shear deformation; meanwhile, it accounts for the deformation history of the RVE model and treats the interaction between boundary particles and other image particles in a more efficient way. Numerical examples with extremely large deformation are used to illustrate the adaptive granular RVE model enhanced by the proposed EPB algorithm. Furthermore, some key features of this new methodology are further discussed for clarification.

42 ENGINEERING↗
DOE OSTI2020

Grain boundary structure search by using an evolutionary algorithm with effective mutation methods

Grain boundaries (GBs) accommodate the misorientation between adjacent grains in a polycrystalline material. GBs are geometrically described by the macroscopic and microscopic degrees of freedom. Besides, at the atomistic level, GBs exhibit complicated behaviors under varying thermodynamic conditions. The complexity of atomistic GB structures demands stochastic searching for possible states. The effectiveness of stochastic search methods relies on techniques to recreate and select atomistic structures. In this work, we developed a new mutation operator that can induce direct and collective atomistic structure changes to boost the search efficiency of exploring GB structures with evolutionary algorithms (EA). We implemented the mutation methods along with innovative selection, crossover, boundary condition preprocessing methods to form an EA-based package to explore GB structures in grand canonical ensembles with atomistic simulations. We used this package to study the [001] symmetric tilt grain boundaries (STGBs) in FCC copper (Cu), the [110] STGBs in BCC tungsten (W), and the $[1\bar{2}10]$ STGBs in HCP magnesium (Mg). The results show that our design and implementation based on new mutation procedures, selection, and boundary conditions provide a high-quality search of atomistic GB structures in the grand canonical ensemble for different crystal lattices.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Simulating policy interventions in the interfirm diffusion of low-carbon technologies: An agent-based evolutionary game model

Policy interventions are frequently used by authorities around the world to mitigate carbon emissions. However, economic systems are essentially complex adaptive systems, which often exhibit unexpected responses to exogenous interventions and leave intervenors in a dilemma, even if the interventions are elaborately designed. To explore the behaviors of the diffusion system regarding low-carbon technologies, this study builds an agent-based model (ABM) to simulate enterprises' reactions to multiple policy interventions aimed at spurring low-carbon technology diffusion. The simulated enterprises are in a complex network where they play evolutionary games with their neighbors, which enables the model to possess two critical features of economic systems: adaptiveness and equilibrium. The model reveals a dilemma of policy interventions: intuitively, carbon taxes, asymmetric penalties (only imposed on un-low-carbon enterprises) and subsidies can improve the diffusion, which is consistent with previous research; counter-intuitively, all these policies turn out to be inefficient or even harmful to low-carbon enterprises because of the diffusion system's high adaptiveness. Specifically, when carbon taxes and penalties increase, both the low-carbon and un-low-carbon enterprises end up with the equilibrium of equivalent but lower profits. In contrast, all the enterprises earn equivalent but more profits even though subsidies are only given to the low-carbon enterprises, which implies that the un-low-carbon enterprises (indirectly) grab a portion of the subsidies and accordingly weaken the incentive effect of subsidies. These system behaviors are summarized as "equalizing effect" because the system tends to equalize the impact of both positive and negative interventions among all enterprises even though the policy interventions are asymmetrically imposed on one type of the enterprises. The findings also indicate that policies implemented to enlarge green market sizes can help policymakers bypass the dilemma.

Agent-based modeling↗
DOE OSTI2025

Predicting metal-binding proteins and structures through integration of evolutionary-scale and physics-based modeling

Metals are essential elements in all living organisms, binding to approximately 50% of proteins. They serve to stabilize proteins, catalyze reactions, regulate activities, and fulfill various physiological and pathological functions. While there have been many advancements in determining the structures of protein-metal complexes, numerous metal-binding proteins still need to be identified through computational methods and validated through experiments. Here, to address this need, we have developed the ESMBind workflow, which combines evolutionary scale modeling (ESM) for metal-binding prediction and physics-based protein-metal modeling. Our approach utilizes the ESM-2 and ESM-IF models to predict metal-binding probability at the residue level. In addition, we have designed a metal-placement method and energy minimization technique to generate detailed 3D structures of protein-metal complexes. Our workflow outperforms other models in terms of residue and 3D-level predictions. To demonstrate its effectiveness, we applied the workflow to 142 uncharacterized fungal pathogen proteins and predicted metal-binding proteins involved in fungal infection and virulence.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Multiobjective optimization of nuclear microreactor reactivity control system operation with swarm and evolutionary algorithms

To improve the marketability of novel microreactor designs, there is a need for automated and optimal control of these reactors. This paper presents a methodology for performing multiobjective optimization of control drum operation for a microreactor under normal and off-nominal conditions. Here, two different case studies are used where the control drum configuration is optimized for the reactor to be critical with some desired power distribution that would satisfy peaking limits. A surrogate model for power distribution is developed based on a feedforward neural network. The process for determining weights for scalarization of the multiobjective optimization problem is also detailed. Six optimization algorithms: evolutionary strategies, differential evolution, grey wolf optimization, Harris hawks optimization, moth flame optimization and particle swarm optimization, are all applied to these cases and the results analyzed. Although all these algorithms will demonstrate optima-seeking behavior, for real-time control it is necessary to identify the best algorithm to efficiently provide reasonable optima without operator interference. The moth flame optimization algorithm was found to perform particularly well on both cases. Overall, it was found that the algorithms capable of supplying the best optima were also the most consistent. Finally, the found optima were verified with the original model used to train surrogates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

GBOpt: Grain boundary structure optimization using Monte Carlo and evolutionary algorithms

Polycrystalline materials are made of many small crystals separated by grain boundaries (GBs), whose atomic structure strongly influences material properties. Because the structure of a GB determines its properties, the optimal structure must be known in order to determine those impacts. There are many ways of placing atoms in the GB region, but the optimal structure is defined as the one that gives the lowest value of a target property (typically energy). GB structure optimization has been successfully demonstrated using stochastic and evolutionary methods, but no reusable, community-maintained open-source workflow has been developed. GBOpt (Grain Boundary Optimization) is an open-source Python package that creates that workflow, where we have presently implemented two approaches: Markov Chain Monte Carlo, and genetic algorithm based on elite selection. We demonstrate this capability by successfully reproducing the known optimal structures of a specific GB in two materials, and point interested readers to the GitHub repository for additional examples, including optimization for different properties. Both of the implemented approaches recovered the known structures, with the genetic algorithm approach finding the optimal structure faster on average.

99 - GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

Dynamic RNA acetylation revealed by quantitative cross-evolutionary mapping

N 4 -acetylcytidine (ac 4 C) is an ancient and highly conserved RNA modification that is present on tRNA and rRNA and has recently been investigated in eukaryotic mRNA. However, the distribution, dynamics and functions of cytidine acetylation have yet to be fully elucidated. In this work, we report ac 4 C-seq, a chemical genomic method for the transcriptome-wide quantitative mapping of ac 4 C at single-nucleotide resolution. In human and yeast mRNAs, ac 4 C sites are not detected but can be induced—at a conserved sequence motif—via the ectopic overexpression of eukaryotic acetyltransferase complexes. By contrast, cross-evolutionary profiling revealed unprecedented levels of ac 4 C across hundreds of residues in rRNA, tRNA, non-coding RNA and mRNA from hyperthermophilic archaea. Ac 4 C is markedly induced in response to increases in temperature, and acetyltransferase-deficient archaeal strains exhibit temperature-dependent growth defects. Visualization of wild-type and acetyltransferase-deficient archaeal ribosomes by cryo-electron microscopy provided structural insights into the temperature-dependent distribution of ac 4 C and its potential thermoadaptive role. Our studies quantitatively define the ac 4 C landscape, providing a technical and conceptual foundation for elucidating the role of this modification in biology and disease.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Variational quantum reinforcement learning via evolutionary optimization

Abstract Recent advances in classical reinforcement learning (RL) and quantum computation point to a promising direction for performing RL on a quantum computer. However, potential applications in quantum RL are limited by the number of qubits available in modern quantum devices. Here, we present two frameworks for deep quantum RL tasks using gradient-free evolutionary optimization. First, we apply the amplitude encoding scheme to the Cart-Pole problem, where we demonstrate the quantum advantage of parameter saving using amplitude encoding. Second, we propose a hybrid framework where the quantum RL agents are equipped with a hybrid tensor network-variational quantum circuit (TN-VQC) architecture to handle inputs of dimensions exceeding the number of qubits. This allows us to perform quantum RL in the MiniGrid environment with 147-dimensional inputs. The hybrid TN-VQC architecture provides a natural way to perform efficient compression of the input dimension, enabling further quantum RL applications on noisy intermediate-scale quantum devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Patterns of genomic variation reveal a single evolutionary origin of the wild allotetraploid Mimulus sookensis

Abstract Polyploidy occurs across the tree of life and is especially common in plants. Because newly formed cytotypes are often incompatible with their progenitors, polyploidy is also said to trigger “instantaneous” speciation. If a polyploid can self-fertilize or reproduce asexually, it is even possible for one individual to produce an entirely new lineage, but how often this scenario occurs is unclear. Here, we investigate the evolutionary history of the wild allotetraploid Mimulus sookensis, which was formed through hybridization between self-compatible, diploid species in the Mimulus guttatus complex. We generate a chromosome-scale reference assembly for M. sookensis and define its distinct subgenomes. Despite previous reports suggesting multiple origins of this highly selfing polyploid, we discover patterns of population genomic variation that provide unambiguous support for a single origin. One M. sookensis subgenome is clearly derived from the selfer Mimulus nasutus, which organellar variation suggests is the maternal progenitor. The ancestor of the other subgenome is less certain, but it shares variation with both Mimulus decorus and M. guttatus, two outcrossing diploids with geographic ranges that overlap broadly with M. sookensis. This study establishes M. sookensis as an example of instantaneous speciation, likely facilitated by the polyploid’s predisposition to self-fertilize.

Environmental Sciences & Ecology↗
DOE OSTI2021

Physics-Informed Evolutionary Strategy Based Control for Mitigating Delayed Voltage Recovery

Here, in this work we propose a novel data-driven, real-time power system voltage stability control method based on the physics-informed guided meta evolutionary strategy (ES). The main objective is to quickly provide an adaptive control strategy to secure system voltage stability. The problem is challenging due to the high-dimensional feature of the power system model and the fast-changing and uncertain nature of power system operation scenarios. To this end, a model-free and derivative-free guided ES method is applied. The method is further combined with a meta-learning strategy to make the learnt control policy automatically adapted to unseen operation conditions and fault scenarios, which is highly desired for real-time emergency control. Last but not least, physical knowledge is embedded in the above method through a trainable action mask technique to rule out unnecessary load shedding actions for better learning and control performance. Case studies on the IEEE 300-bus system and comparisons with other state-of-the-art benchmark methods verify the superiority of the proposed physics-informed guided meta ES method in realizing fast and adaptive power system voltage stability control.

42 ENGINEERING↗
DOE OSTI2022

Avoiding excess computation in asynchronous evolutionary algorithms

Abstract Asynchronous evolutionary algorithms are becoming increasingly popular as a means of making full use of many processors while solving computationally expensive search and optimization problems. These algorithms excel at keeping large clusters fully utilized, but may sometimes inefficiently sample an excess of fast‐evaluating solutions at the expense of higher‐quality, slow‐evaluating ones. We have previously introduced a steady‐state parent selection strategy, SWEET (“Selection whilE EvaluaTing”), that sometimes selects individuals that are still being evaluated and allows them to reproduce early. We perform a takeover‐time analysis that confirms that this strategy gives slow‐evaluating individuals that have higher fitnesses an increased ability to multiply in the population. We also find that SWEET appears effective at improving optimization performance on problems in which solution quality is positively correlated with evaluation time. We evaluate our approach on six simulated real‐valued optimization problems and three real‐world applications: an autonomous vehicle controller problem that involves tuning a spiking neural network and two adversarial EA problems. We further evaluate SWEET versus a basic asynchronous process in a simulated setting. We present evidence that SWEET outperforms basic asynchronous processes in a use‐case in which performance is positively correlated with evaluation time, and performs comparably (and often better) than basic asynchronous processes in several use‐cases where performance is negatively correlated with evaluation time. That said, in the cases where performance and evaluation time are negatively correlated the variance of outcomes for SWEET is notably high.

97 MATHEMATICS AND COMPUTING↗