Search NASASearch

SEARCH · Search NASA

Results for “evolutionary computing”

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 217 records · Page 12

CSI computer system/remote interface unit acceptance test results

The validation tests conducted on the Control/Structures Interaction (CSI) Computer System (CCS)/Remote Interface Unit (RIU) is discussed. The CCS/RIU consists of a commercially available, Langley Research Center (LaRC) programmed, space flight qualified computer and a flight data acquisition and filtering computer, developed at LaRC. The tests were performed in the Space Structures Research Laboratory (SSRL) and included open loop excitation, closed loop control, safing, RIU digital filtering, and RIU stand alone testing with the CSI Evolutionary Model (CEM) Phase-0 testbed. The test results indicated that the CCS/RIU system is comparable to ground based systems in performing real-time control-structure experiments.

Sparks, Dean W., Jr.

Evolutionary Development of the Simulation by Logical Modeling System (SIBYL)

Through the evolutionary development of the Simulation by Logical Modeling System (SIBYL) we have re-engineered the expensive and complex IBM mainframe based Long-term Hardware Projection Model (LHPM) to a robust cost-effective computer based mode that is easy to use. We achieved significant cost reductions and improved productivity in preparing long-term forecasts of Space Shuttle Main Engine (SSME) hardware. The LHPM for the SSME is a stochastic simulation model that projects the hardware requirements over 10 years. SIBYL is now the primary modeling tool for developing SSME logistics proposals and Program Operating Plan (POP) for NASA and divisional marketing studies.

Wu, Helen

HARMONY: Large-Scale Architecture Search for Efficient Hybrid Language Models

As large language models scale to trillions of parameters, their computational and memory requirements present critical challenges for efficient training and deployment. While Mixture of Experts (MoE) architectures enable efficient scaling through sparse parameter activation, and state-space models like Mamba offer linear-time complexity, principled methods for combining these paradigms remain undeveloped. We introduce HARMONY (Hybrid Architecture Research for Mamba, Optimized with Neural efficiencY), a multi-objective evolutionary neural architecture search framework for discovering efficient hybrid language models that integrate Transformer attention mechanisms, Mixture-of-Experts routing, and Mamba state-space components. Through large-scale distributed search using 16,384 MI250X GPUs on the Frontier supercomputer, HARMONY explores a comprehensive design space encompassing six attention variants (MHA, MQA, GQA, MLA, SWA, and Mamba-2), variable MoE configurations with both routed and shared experts, and extensive Mamba hyperparameters. Our framework discovers heterogeneous architectures that balance training performance with computational efficiency through multi-objective optimization incorporating latency penalties and fitness-based selection. Analysis of discovered architectures reveals that optimal hybrid designs favor heterogeneous component mixing rather than homogeneous patterns, with Mamba-2 and Multi-Head Latent Attention (MLA) emerging as preferred mechanisms. Discovered architectures demonstrate superior training efficiency: our best configuration achieves a final perplexity of 1.0874 with 2.38B parameters while processing 4,320 tokens/second, outperforming significantly larger manually designed models. Full-scale evaluation shows HARMONY's top architectures achieve better loss trajectories than equivalently-sized models using state-of-the-art configurations including Mixtral, Jamba, and Samba. Additionally, we demonstrate 91% weak scaling efficiency when training discovered 36B-parameter models across 1,024 GPUs. HARMONY is released as an open framework with comprehensive tools for building and training hybrid models using expert-data-pipeline parallelism, democratizing access to automated architecture design for next-generation language models.

Herron, Emily [ORNL] (ORCID:0000000273008172)

Microbial Communities in Microgravity: Simulation in Lab and on the Computer

Microorganisms grow differently in spaceflight than they do on Earth. While much remains unexplained about how microgravity affects microbial growth, one dominant hypothesis is that the lack of density-driven convection in the liquid growth environment makes mixing diffusion-limited, and therefore slower. This is supported by evidence that individual microbial strains experience starvation and acid stress in microgravity. However, if it is true, then microgravity would also have measurable effects on microbes in mixed communities, because many interspecies interactions involve the exchange of soluble metabolites through the medium (cross-feeding). Specifically, cooperative cross-feeding communities would grow more slowly in microgravity, and cooperation would be less stable on evolutionary timescales. Here we describe our efforts to test this hypothesis by simulating microgravity in silico and in the lab, using a model system of Eschericia coli and Salmonella enterica that grow only when they can exchange methionine and acetate. We created CAMDLES (CFD-DEM Artificial Microgravity Developments for Living Ecosystem Simulation) as an extension of CFDEM®coupling software, to carry out computational modeling of biological flows, growth, and mass transfer in microgravity and also in laboratory artificial microgravity devices (rotating wall vessels, RWV). Using CAMDLES, we found distinct differences in growth rates between RWV and true microgravity, and we were able to identify several features, such as spatial distribution, biofilm formation, and product yield parameters, that influence the degree to which RWV growth recapitulates microgravity growth. In addition, we report on the development of a laboratory system for monitoring growth rates and species ratios of the community in RWVs, using fluorescent strains. Pairing CAMDLES with the laboratory model system allows us to generate quantitative predictions about the effects of spaceflight on organisms that will be essential to sustaining human space exploration in the long term.

microbiology

Deep Reinforcement Learning Based Control of Wind Turbines for Fast Frequency Response

In order to fulfill vital auxiliary grid services, such as load regulation, spin and non-spin reserve provision, and frequency support during emergencies, there is often a requirement for certain wind farms to operate in de-loaded modes. Leveraging the swift response capabilities of wind farms, this study demonstrates that reserving power in de-loaded modes can significantly enhance power grid stability and reliability during system contingencies. Controlling wind farms optimally for frequency support is intricate due to the nonlinearity of models and controllers and the complexity of wind farm interactions with power systems. Here, to address this challenge, this paper introduces a novel approach that integrates wind turbines into reinforcement learning-based solutions for frequency response. This innovative methodology utilizes the state-of-the-art reinforcement learning algorithm known as the surrogate-gradient-based evolutionary strategy. The proposed learning-based algorithm provides continuous control of wind farm output to rapidly stabilize system frequency and prevent unnecessary trips of under-frequency load shedding relays. To facilitate efficient training, parallel computing techniques are employed. The proposed methodology is evaluated on a modified IEEE-39 bus system, and simulation results reveal its efficacy in reliably supporting power system frequency and preventing the need for unnecessary load shedding.

Gao, Wei [Argonne National Laboratory (ANL), Argon

JavaGenes: Evolving Graphs with Crossover

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Globus, Al

A combinatorially complete epistatic fitness landscape in an enzyme active site

Protein engineering often targets binding pockets or active sites which are enriched in epistasis—nonadditive interactions between amino acid substitutions—and where the combined effects of multiple single substitutions are difficult to predict. Few existing sequence-fitness datasets capture epistasis at large scale, especially for enzyme catalysis, limiting the development and assessment of model-guided enzyme engineering approaches. We present here a combinatorially complete, 160,000-variant fitness landscape across four residues in the active site of an enzyme. Assaying the native reaction of a thermostable β-subunit of tryptophan synthase (TrpB) in a nonnative environment yielded a landscape characterized by significant epistasis and many local optima. These effects prevent simulated directed evolution approaches from efficiently reaching the global optimum. There is nonetheless wide variability in the effectiveness of different directed evolution approaches, which together provide experimental benchmarks for computational and machine learning workflows. The most-fit TrpB variants contain a substitution that is nearly absent in natural TrpB sequences—a result that conservation-based predictions would not capture. Thus, although fitness prediction using evolutionary data can enrich in more-active variants, these approaches struggle to identify and differentiate among the most-active variants, even for this near-native function. Overall, this work presents a large-scale testing ground for model-guided enzyme engineering and suggests that efficient navigation of epistatic fitness landscapes can be improved by advances in both machine learning and physical modeling.

biocatalysis

How actin crosslinking and bundling proteins cooperate to generate an enhanced cell mechanical response

Actin-crosslinking proteins organize actin filaments into dynamic and complex subcellular scaffolds that orchestrate important mechanical functions, including cell motility and adhesion. Recent mutation studies have shown that individual crosslinking proteins often play seemingly non-essential roles, leading to the hypothesis that they have considerable redundancy in function. We report live-cell, in vitro, and theoretical studies testing the mechanical role of the two ubiquitous actin-crosslinking proteins, alpha-actinin and fascin, which co-localize to stress fibers and the basis of filopodia. Using live-cell particle tracking microrheology, we show that the addition of alpha-actinin and fascin elicits a cell mechanical response that is significantly greater than that originated by alpha-actinin or fascin alone. These live-cell measurements are supported by quantitative rheological measurements with reconstituted actin filament networks containing pure proteins that show that alpha-actinin and fascin can work in concert to generate enhanced cell stiffness. Computational simulations using finite element modeling qualitatively reproduce and explain the functional synergy of alpha-actinin and fascin. These findings highlight the cooperative activity of fascin and alpha-actinin and provide a strong rationale that an evolutionary advantage might be conferred by the cooperative action of multiple actin-crosslinking proteins with overlapping but non-identical biochemical properties. Thus the combination of structural proteins with similar function can provide the cell with unique properties that are required for biologically optimal responses.

Non-NASA Center

Technology test results from an intelligent, free-flying robot for crew and equipment retrieval in space

The ground-based demonstrations of Extra Vehicular Activity (EVA) Retriever, a voice-supervised, intelligent, free-flying robot, are designed to evaluate the capability to retrieve objects (astronauts, equipment, and tools) which have accidentally separated from the Space Station. The EVA Retriever software is required to autonomously plan and execute a target rendezvous, grapple, and return to base while avoiding stationary and moving obstacles with subsequent object handover. The software architecture incorporates a heirarchical decomposition of the control system that is horizontally partitioned into five major functional subsystems: sensing, perception, world model, reasoning, and acting. The design provides for supervised autonomy as the primary mode of operation. It is intended to be an evolutionary system improving in capability over time and as it earns crew trust through reliable and safe operation. This paper gives an overview of the hardware, a focus on software, and a summary of results achieved recently from both computer simulations and air bearing floor demonstrations. Limitations of the technology used are evaluated. Plans for the next phase, during which moving targets and obstacles drive realtime behavior requirements, are discussed.

Erickson, J.

Evolution of stars with suppressed core convection

Stellar evolution on the upper main sequence was computed for models of stars with cores assumed to be in radiative equilibrium, up to the point of central helium ignition. The role of the Schonberg-Chandrasekhar limit for an isothermal core is found to be critical for the evolutionary tracks. Observational data are used to rule out the hypothesis of evolution with radiative cores (in upper main-sequence stars) and, by implication, of magnetic fields that are sufficiently strong to have suppressed the core convention.

Stothers, R. B.

Evolution of stars with suppressed core convection.

Stellar evolution on the upper main sequence has been computed for models of stars with cores assumed to be in radiative equilibrium, up to the point of central helium ignition. The role of the Schoenberg-Chandrasekhar limit for an isothermal core is found to be critical for the evolutionary tracks. Observational data are used to rule out the hypothesis of evolution with radiative cores (in upper main-sequence stars) and, by implication, of magnetic fields that are sufficiently strong to have suppressed the core convection.

Stothers, R.

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms

Emergence of Complexity in Protein Functions and Metabolic Networks

In modern organisms proteins perform a majority of cellular functions, such as chemical catalysis, energy transduction and transport of material across cell walls. Although great strides have been made towards understanding protein evolution, a meaningful extrapolation from contemporary proteins to their earliest ancestors is virtually impossible. In an alternative approach, the origin of water-soluble proteins was probed through the synthesis of very large libraries of random amino acid sequences and subsequently subjecting them to in vitro evolution. In combination with computer modeling and simulations, these experiments allow us to address a number of fundamental questions about the origins of proteins. Can functionality emerge from random sequences of proteins? How did the initial repertoire of functional proteins diversify to facilitate new functions? Did this diversification proceed primarily through drawing novel functionalities from random sequences or through evolution of already existing proto-enzymes? Did protein evolution start from a pool of proteins defined by a frozen accident and other collections of proteins could start a different evolutionary pathway? Although we do not have definitive answers to these questions, important clues have been uncovered. Considerable progress has been also achieved in understanding the origins of membrane proteins. We will address this issue in the example of ion channels - proteins that mediate transport of ions across cell walls. Remarkably, despite overall complexity of these proteins in contemporary cells, their structural motifs are quite simple, with -helices being most common. By combining results of experimental and computer simulation studies on synthetic models and simple, natural channels, I will show that, even though architectures of membrane proteins are not nearly as diverse as those of water-soluble proteins, they are sufficiently flexible to adapt readily to the functional demands arising during evolution.

Pohorille, Andzej

Making tomorrow's mistakes today: Evolutionary prototyping for risk reduction and shorter development time

In the early days of JPL's solar system exploration, each spacecraft mission required its own dedicated data system with all software applications written in the mainframe's native assembly language. Although these early telemetry processing systems were a triumph of engineering in their day, since that time the computer industry has advanced to the point where it is now advantageous to replace these systems with more modern technology. The Space Flight Operations Center (SFOC) Prototype group was established in 1985 as a workstation and software laboratory. The charter of the lab was to determine if it was possible to construct a multimission telemetry processing system using commercial, off-the-shelf computers that communicated via networks. The staff of the lab mirrored that of a typical skunk works operation -- a small, multi-disciplinary team with a great deal of autonomy that could get complex tasks done quickly. In an effort to determine which approaches would be useful, the prototype group experimented with all types of operating systems, inter-process communication mechanisms, network protocols, packet size parameters. Out of that pioneering work came the confidence that a multi-mission telemetry processing system could be built using high-level languages running in a heterogeneous, networked workstation environment. Experience revealed that the operating systems on all nodes should be similar (i.e., all VMS or all PC-DOS or all UNIX), and that a unique Data Transport Subsystem tool needed to be built to address the incompatibilities of network standards, byte ordering, and socket buffering. The advantages of building a telemetry processing system based on emerging industry standards were numerous: by employing these standards, we would no longer be locked into a single vendor. When new technology came to market which offered ten times the performance at one eighth the cost, it would be possible to attach the new machine to the network, re-compile the application code, and run. In addition, we would no longer be plagued with lack of manufacturer support when we encountered obscure bugs. And maybe, hopefully, the eternal elusive goal of software portability across different vendors' platforms would finally be available. Some highlights of our prototyping efforts are described.

Friedman, Gary

On Improving Efficiency of Differential Evolution for Aerodynamic Shape Optimization Applications

Differential Evolution (DE) is a simple and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems. Although DE offers several advantages over traditional optimization approaches, its use in applications such as aerodynamic shape optimization where the objective function evaluations are computationally expensive is limited by the large number of function evaluations often required. In this paper various approaches for improving the efficiency of DE are reviewed and discussed. These approaches are implemented in a DE-based aerodynamic shape optimization method that uses a Navier-Stokes solver for the objective function evaluations. Parallelization techniques on distributed computers are used to reduce turnaround times. Results are presented for the inverse design of a turbine airfoil. The efficiency improvements achieved by the different approaches are evaluated and compared.

Madavan, Nateri K.

Mission Control Operations: Employing a New High Performance Design for Communications Links Supporting Exploration Programs

The planetary exploration programs demand a totally new examination of data multiplexing, digital communications protocols and data transmission principles for both ground and spacecraft operations. Highly adaptive communications devices on‐board and on the ground must provide the greatest possible transmitted data density between deployed crew personnel, spacecraft and ground control teams. Regarding these requirements, this proposal borrows from research into quantum mechanical computing by applying the concept of a qubit, a single bit that represents 16 states, to radio frequency (RF) communications link design for exploration programs. This concept of placing multiple character values into a single data bit can easily make the evolutionary steps needed to meet exploration mission demands. To move the qubit from the quantum mechanical research laboratory into long distance RF data transmission, this proposal utilizes polarization modulation of the RF carrier signal to represent numbers from zero to fifteen. It introduces the concept of a binary‐to‐hexadecimal converter that quickly chops any data stream into 16‐bit words and connects variously polarized feedhorns to a single‐frequency radio transmitter. Further, the concept relies on development of a receiver that uses low‐noise amplifiers and an antenna array to quickly assess carrier polarity and perform hexadecimal to binary conversion. Early testbed experiments using the International Space Station (ISS) as an operations laboratory can be implemented to provide the most cost‐effective return for research investment. The improvement in signal‐to‐noise ratio while supporting greater baseband data rates that could be achieved through this concept justifies its consideration for long‐distance exploration programs.

Jackson, Dan E., Jr.

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali