Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “evolutionary 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

Integrated design and experimental validation of the CSI evolutionary structure

An experimental validation of the optimization-based integrated design methodology performed under the Controls-Structures Interaction (CSI) program for a class of flexible spacecraft is reviewed. The studies have been performed using an integrated design software tool which is under development at the NASA-Langley Research Center. It is analytically and experimentally demonstrated that integrated controls-structures design can yield designs which are substantially superior to those obtained through the traditional sequential approach.

Maghami, P. G.↗

ELISA: A Tool for Optimization of Rotor Hover Performance at Low Reynolds Number in the Mars Atmosphere

The Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA) was developed in support of the Rotorcraft Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA was developed to enable aerodynamic rotor hover optimization for low Reynolds number flows in the Mars atmosphere. The first objective of the algorithm allows for unconventional airfoil parameterization and multi-objective airfoil geometry optimization using OVERFLOW. The Pareto-optimal airfoil sets are converted to a set of Pareto-optimal airfoil decks, providing the lowest drag air foil geometry for each angle of attack, removing the need to arbitrarily select the airfoils to be used in the rotor optimization. The second objective allows for rotor geometry optimization with simultaneous maximization of blade loading and minimization of rotor power using the comprehensive analysis CAMRADII. The result is a Pareto-optimal rotor set, providing the lowest power rotor for each attainable blade loading, and one of the first tools for hover-optimized rotors for high-subsonic low Reynolds number conditions. The airfoil thickness can be modified after the airfoil optimization is complete, allowing for a post-airfoil-optimization adjustment of blade thickness to facilitate conforming to external structural analyses requirements. The relevance of the code is demonstrated with case studies for the ROAMX rotor optimization for Ingenuity-sized single rotors in the Mars atmosphere, a performance study optimizing the chord and twist of Ingenuity’s coaxial rotor resulting in the Sample Recovery Helicopters candidate rotor, and high-subsonic low Reynolds number airfoil optimization providing novel insights for higher-efficiency low Reynolds number airfoil geometries and flow physics.

ELISA↗

Potential of Glassy Carbon and Silicon Carbide Photonic Structures as Electromagnetic Radiation Shields for Atmospheric Re-entry

During high-velocity atmospheric entries, space vehicles can be exposed to strong electromagnetic radiation from ionized gas in the shock layer. Glassy carbon (GC) and silicon carbide (SiC) are candidate thermal protection materials due to their high melting point and also their good thermal and mechanical properties. Based on data from shock tube experiments, a significant fraction of radiation at hypersonic entry conditions is in the frequency range from 215 to 415 THz. We propose and analyze SiC and GC photonic structures to increase the reflection of radiation in that range. For this purpose, we performed numerical optimizations of various structures using an evolutionary strategy. Among the considered structures are layered, porous, woodpile, inverse opal and guided-mode resonance structures. In order to estimate the impact of fabrication inaccuracies, the sensitivity of the reflectivity to structural imperfections is analyzed. We estimate that the reflectivity of GC photonic structures is limited to 38% in the aforementioned range, due to material absorption. However, GC material can be effective for photonic reflection of individual, strong spectral line. SiC on the other hand can be used to design a good reflector for the entire frequency range.

Komarevskiy,Nikolay↗

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↗

Scheduling Earth Observing Satellites with Evolutionary Algorithms

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.

Globus, Al↗

Optimization of the Lucy Interplanetary Trajectory via Two-Point Direct Shooting

Lucy is NASA’s next Discovery-class mission and will explore the Trojan asteroids in the Sun-Jupiter L4 and L5 regions. This paper details the design of Lucy’s interplanetary trajectory using a two-point direct shooting transcription, nonlinear programming, and monotonic basin hopping. These techniques are implemented in the Evolutionary Mission Trajectory Generator (EMTG), a trajectory optimization tool developed at NASA Goddard Space Flight Center. We present applications to the baseline trajectory design, Monte Carlo analysis, and operations.

Lucy↗

Multiobjective Optimization Using a Pareto Differential Evolution Approach

Differential Evolution is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. In this paper, the Differential Evolution algorithm is extended to multiobjective optimization problems by using a Pareto-based approach. The algorithm performs well when applied to several test optimization problems from the literature.

Madavan, Nateri K.↗

Genetic Algorithm for Optimization: Preprocessor and Algorithm

Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.

Sen, S. K.↗

A Mixed Integer Efficient Global Optimization Algorithm with Multiple Infill Strategy - Applied to a Wing Topology Optimization Problem

With the advancement in high performance computing and numerical optimization techniques,engineering design optimization problems are becoming more complex, larger scale,higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed anew optimization framework, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previouslyperceived. However, the original version of this framework, in the process of adaptive samplingto explore and exploit the design space, finds only a single sample point per iteration. The efforthere builds upon this previously developed optimization framework to include multiple infillsampling capability that combines the concept of generalized expected improvement function,unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGOwith the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficultengineering design optimization problems. The results reveal the performance of the newapproach is problem dependent. When applied to a ten-bar truss problem, the newly proposedmultiple infill strategy consistently leads to a better design solutions when compared to theexisting CPTV method (implemented with the context of the AMIEGO framework). On theother hand, when applied to a mixed-integer high fidelity wing topology optimization problem- MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferiorsolution as compared to CPTV approach. These results also reveal that a small number ofstarting points, in general, are sufficient to lead to a good overall solution.

Mixed-integer optimization↗

Automated design of spacecraft systems power subsystems

This paper discusses the application of evolutionary computing to a dynamic space vehicle power subsystem resource and performance simulation in a parallel processing environment. Our objective is to demonstrate the feasibility, application and advantage of using evolutionary computation techniques for the early design search and optimization of space systems.

optimzation space designs↗

A Globally Optimal Particle Tracking Technique for Stereo Imaging Velocimetry Experiments

An important phase of any Stereo Imaging Velocimetry experiment is particle tracking. Particle tracking seeks to identify and characterize the motion of individual particles entrained in a fluid or air experiment. We analyze a cylindrical chamber filled with water and seeded with density-matched particles. In every four-frame sequence, we identify a particle track by assigning a unique track label for each camera image. The conventional approach to particle tracking is to use an exhaustive tree-search method utilizing greedy algorithms to reduce search times. However, these types of algorithms are not optimal due to a cascade effect of incorrect decisions upon adjacent tracks. We examine the use of a guided evolutionary neural net with simulated annealing to arrive at a globally optimal assignment of tracks. The net is guided both by the minimization of the search space through the use of prior limiting assumptions about valid tracks and by a strategy which seeks to avoid high-energy intermediate states which can trap the net in a local minimum. A stochastic search algorithm is used in place of back-propagation of error to further reduce the chance of being trapped in an energy well. Global optimization is achieved by minimizing an objective function, which includes both track smoothness and particle-image utilization parameters. In this paper we describe our model and present our experimental results. We compare our results with a nonoptimizing, predictive tracker and obtain an average increase in valid track yield of 27 percent

McDowell, Mark↗

Building a Shared Definitional Model of Long Duration Human Spaceflight

In 1956, on the eve of human space travel Strughold first proposed a simple classification of the present and future stages of manned flight that identified key factors, risks and developmental stages for the evolutionary journey ahead. As we look to optimize the potential of the ISS as a gateway to new destinations, we need a current shared working definitional model of long duration human space flight to help guide our path. Initial search of formal and grey literature augmented by liaison with subject matter experts. Search strategy focused on both the use of term long duration mission and long duration spaceflight, and also broader related current and historical definitions and classification models of spaceflight. The related sea and air travel literature was also subsequently explored with a view to identifying analogous models or classification systems. There are multiple different definitions and classification systems for spaceflight including phase and type of mission, craft and payload and related risk management models. However the frequently used concepts of long duration mission and long duration spaceflight are infrequently operationally defined by authors, and no commonly referenced classical or gold standard definition or model of these terms emerged from the search. The categorization (Cat) system for sailing was found to be of potential analogous utility, with its focus on understanding the need for crew and craft autonomy at various levels of potential adversity and inability to gain outside support or return to a safe location, due to factors of time, distance and location.

Orr, M.↗

Multiobjective Aerodynamic Shape Optimization Using Pareto Differential Evolution and Generalized Response Surface Metamodels

Differential Evolution (DE) is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. The DE algorithm has been recently extended to multiobjective optimization problem by using a Pareto-based approach. In this paper, a Pareto DE algorithm is applied to multiobjective aerodynamic shape optimization problems that are characterized by computationally expensive objective function evaluations. To improve computational expensive the algorithm is coupled with generalized response surface meta-models based on artificial neural networks. Results are presented for some test optimization problems from the literature to demonstrate the capabilities of the method.

Madavan, Nateri K.↗

Controlling Tensegrity Robots through Evolution using Friction based Actuation

Traditional robotic structures have limitations in planetary exploration as their rigid structural joints are prone to damage in new and rough terrains. In contrast, robots based on tensegrity structures, composed of rods and tensile cables, offer a highly robust, lightweight, and energy efficient solution over traditional robots. In addition tensegrity robots can be highly configurable by rearranging their topology of rods, cables and motors. However, these highly configurable tensegrity robots pose a significant challenge for locomotion due to their complexity. This study investigates a control pattern for successful locomotion in tensegrity robots through an evolutionary algorithm. A twelve-rod hardware model is rapidly prototyped to utilize a new actuation method based on friction. A web-based physics simulation is created to model the twelve-rod tensegrity ball structure. Square-waves are used as control policies for the actuators of the tensegrity structure. Monte Carlo trials are run to find the most successful number of amplitudes for the square-wave control policy. From the results, an evolutionary algorithm is implemented to find the most optimized solution for locomotion of the twelve-rod tensegrity structure. The software pattern coupled with the new friction based actuation method can serve as the basis for highly efficient tensegrity robots in space exploration.

Tensegrit↗

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.↗

Deep Space Network Scheduling Using Multi-Objective Optimization with Uncertainty

We have developed a novel technique to incorporate uncertainty modeling within an evolutionary algorithm approach to multi-objective scheduling, with the goal of identifying a Pareto frontier (tradeoff curve) that recognizes the likelihood of events that can impact the schedule outcome. Our approach is particularly applicable to the generation of multiobjective optimized robust schedules, where objectives are assigned a service level, for example that we require an objective value to be greater than or equal to X with Y% confidence. We have demonstrated that such an approach can, for example, minimize scheduling on less reliable resources, based solely on a resource reliability model and not on any ad hoc heuristics. We have also investigated an alternative method of optimizing for robustness, in which we add to the set of objectives a failure risk objective to minimize. We compare the advantages and disadvantages of these two approaches. Future plans for further developing this technology include its application to space-based observatory scheduling problems.

Johnston, Mark D.↗

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.↗