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 109 records · Page 6

Evolutionary design of corrugated horn antennas

An evolutionary progranirnitzg (EP) algorithm is used to optimize pattern of a corrugated circularhorn subject to various constraints on return loss and antenna beamwidth and pattern circularity and low crosspolarization. The EP algorithm uses a Gaussian mutation operator. Examples on design synthesis of a 45 section corrugated horn, with a total of 90 optimization parameters, are presented. The results show excellent and efficient optimization of the desired horn parameters.

optimization corrugated horn antennas evolutionary↗

Evolutionary Computing for Low-thrust Navigation

The development of new mission concepts requires efficient methodologies to analyze, design and simulate the concepts before implementation. New mission concepts are increasingly considering the use of ion thrusters for fuel-efficient navigation in deep space. This paper presents parallel, evolutionary computing methods to design trajectories of spacecraft propelled by ion thrusters and to assess the trade-off between delivered payload mass and required flight time. The developed methods utilize a distributed computing environment in order to speed up computation, and use evolutionary algorithms to find globally Pareto-optimal solutions. The methods are coupled with two main traditional trajectory design approaches, which are called direct and indirect. In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. In the indirect approach, a thrust control problem is transformed into a costate control problem, and the initial values of the costate vector are optimized. The developed methods are applied to two problems: 1) an orbit transfer around the Earth and 2) a transfer between two distance retrograde orbits around Europa, the closest to Jupiter of the icy Galilean moons. The optimal solutions found with the present methods are comparable to other state-of-the-art trajectory optimizers and to analytical approximations for optimal transfers, while the required computational time is several orders of magnitude shorter than other optimizers thanks to an intelligent design of control vector discretization, advanced algorithmic parameterization, and parallel computing.

optimization↗

Aerodynamic Shape Optimization Using Hybridized Differential Evolution

An aerodynamic shape optimization method that uses an evolutionary algorithm known at Differential Evolution (DE) in conjunction with various hybridization strategies is described. DE is a simple and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems. Various hybridization strategies for DE are explored, including the use of neural networks as well as traditional local search methods. A Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the hybrid DE optimizer. The method is implemented on distributed parallel computers so that new designs can be obtained within reasonable turnaround times. Results are presented for the inverse design of a turbine airfoil from a modern jet engine. (The final paper will include at least one other aerodynamic design application). The capability of the method to search large design spaces and obtain the optimal airfoils in an automatic fashion is demonstrated.

Madavan, Nateri K.↗

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗

Space station propulsion: The advanced development program at Lewis

A reference configuration was established for the initial operating capability (IOC) station. The reference configuration has assumed hydrazine fueled thrusters as the propulsion system. This was to establish costing and as a reference for comparison when other propulsion systems are considered. An integral part of the plan to develop the Space Station is the advanced development program. The objective of this program is to provide advanced technology alternatives for the initial and evolutionary Space Station which optimize the system's functional characteristics in terms of performance, cost, and utilization. The portion of the Advanced Development Program that is concerned with auxiliary propulsion and the research and programmatic activities conducted are discussed.

Jones, R. E.↗

Space Station propulsion - The Advanced Development Program at Lewis

A reference configuration was established for the initial operating capability (IOC) station. The reference configuration has assumed hydrazine fueled thrusters as the propulsion system. This was to establish costing and as a reference for comparison when other propulsion systems are considered. An integral part of the plan to develop the Space Station is the advanced development program. The objective of this program is to provide advanced technology alternatives for the initial and evolutionary Space Station which optimize the system's functional characteristics in terms of performance, cost, and utilization. The portion of the Advanced Development Program that is concerned with auxiliary propulsion and the research and programmatic activities conducted are discussed.

Jones, R. E.↗

Dominant takeover regimes for genetic algorithms

The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler's device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solution reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems.

Noever, David↗

Evolutionary Design of a Phased Array Antenna Element

We present an evolved S-band phased array antenna element design that meets the requirements of NASA's TDRS-C communications satellite scheduled for launch early next decade. The original specification called for two types of elements, one for receive only and one for transmit/receive. We were able to evolve a single element design that meets both specifications thereby simplifying the antenna and reducing testing and integration costs. The highest performance antenna found using a genetic algorithm and stochastic hill-climbing has been fabricated and tested. Laboratory results are largely consistent with simulation. Researchers have been investigating evolutionary antenna design and optimization since the early 1990s, and the field has grown in recent years its computer speed has increased and electromagnetic simulators have improved. Many antenna types have been investigated, including wire antennas, antenna arrays and quadrifilar helical antennas. In particular, our laboratory evolved a wire antenna design for NASA's Space Technology 5 (ST5) spacecraft. This antenna has been fabricated, tested, and is scheduled for launch on the three spacecraft in 2006.

Globus, Al↗

Structural Analysis Methods for Structural Health Management of Future Aerospace Vehicles

Two finite element based computational methods, Smoothing Element Analysis (SEA) and the inverse Finite Element Method (iFEM), are reviewed, and examples of their use for structural health monitoring are discussed. Due to their versatility, robustness, and computational efficiency, the methods are well suited for real-time structural health monitoring of future space vehicles, large space structures, and habitats. The methods may be effectively employed to enable real-time processing of sensing information, specifically for identifying three-dimensional deformed structural shapes as well as the internal loads. In addition, they may be used in conjunction with evolutionary algorithms to design optimally distributed sensors. These computational tools have demonstrated substantial promise for utilization in future Structural Health Management (SHM) systems.

Tessler, Alexander↗

Fast Numerical Methods for the Design of Layered Photonic Structures with Rough Interfaces

Modified boundary conditions (MBC) and a multilayer approach (MA) are proposed as fast and efficient numerical methods for the design of 1D photonic structures with rough interfaces. These methods are applicable for the structures, composed of materials with arbitrary permittivity tensor. MBC and MA are numerically validated on different types of interface roughness and permittivities of the constituent materials. The proposed methods can be combined with the 4x4 scattering matrix method as a field solver and an evolutionary strategy as an optimizer. The resulted optimization procedure is fast, accurate, numerically stable and can be used to design structures for various applications.

Komarevskiy, Nikolay↗

Synthesis Study of a 6-Element Non-Uniform Array with Tilted Elements for CLARREO Project

This paper presents the results of a preliminary study of the gain/pattern properties of a 6-element Radio Occultation (RO) array for the proposed CLARREO (Climate Absolute Radiance and Refractivity Observatory (CLARREO) Project. CLARREO is one of the 4 highest priority missions recommended in the National Research Council Earth Science Decadal Survey.

spatial arrays↗

Techno-economic Analysis of Novel PV Plant Designs for Extreme Cost Reductions

A techno-economic analysis is underway examining the cost and performance of future large-scale photovoltaic (PV) plant components, including bifacial modules, tandem modules, increased plant voltage architectures, and module-level power electronics. Integration of these components into PV plant designs is compared with current PV technologies based on levelized cost of electricity (LCOE). Baseline models are developed and validated against recorded PV plant performance data. Expected cost and performance data of future PV technologies are incorporated into the baseline models. An evolutionary algorithm is utilized to optimize PV plant configuration, technology combination, and LCOE. This paper focuses on the bifacial module analysis.

14 SOLAR ENERGY↗

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. Several approaches that have proven effective for other evolutionary algorithms are modified and 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 standard test optimization problems and for the inverse design of a turbine airfoil. The efficiency improvements achieved by the different approaches are evaluated and compared.

Madavan, Nateri K.↗

ARENA: Adversary-Resistant Evolving Neural Architectures

Neural networks are becoming the cornerstone for national security prediction tasks. However, designing them requires significant research and trial/error, as they have many hyperparameters, including their computation graph (“architecture”). Neural architecture search (NAS) employs secondary optimizers to search for architectures maximizing objectives like accuracy. Evolutionary algorithms (EAs) are the most used class of optimizer for NAS. However, existing Python libraries for writing EAs limit the complexity of experiments a user can design. In this project, we built ARENA, a Python framework that encodes complex, hyper-realistic EAs. ARENA collects detailed information as it runs and is flexible enough to encode non-EA search algorithms. We tested ARENA on 4 toy optimization problems by encoding 3 search algorithms for each—random search, an EA, and simulated annealing. We also designed an EA that performs NAS on the MNIST dataset. Our experiments suggest the potential for immediate mission impact through solving lab-wide optimization problems.

97 MATHEMATICS AND COMPUTING↗

Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems

A technique based on Evolutionary Computational Methods (ECMs) was developed that allows for the automated optimization of complex computationally modeled systems, such as autonomous systems. The primary technology, which enables the ECM to find optimal solutions in complex search spaces, derives from evolutionary algorithms such as the genetic algorithm and differential evolution. These methods are based on biological processes, particularly genetics, and define an iterative process that evolves parameter sets into an optimum. Evolutionary computation is a method that operates on a population of existing computational-based engineering models (or simulators) and competes them using biologically inspired genetic operators on large parallel cluster computers. The result is the ability to automatically find design optimizations and trades, and thereby greatly amplify the role of the system engineer.

Terrile, Richard J.↗

Optimization of Low Reynolds Number Airfoils for Martian Rotor Applications Using an Evolutionary Algorithm

The Mars Helicopter (MH) will be flying on the NASA Mars 2020 rover mission scheduled to launch in July of 2020. Research is being performed at the Jet Propulsion Laboratory (JPL) and NASA Ames Research Center to extend the current capabilities and develop the Mars Science Helicopter (MSH) as the next possible step for Martian rotorcraft. The low atmospheric density and the relatively small-scale rotors result in very low chord-based Reynolds number flows over the rotor airfoils. The low Reynolds number regime results in rapid performance degradation for conventional airfoils due to laminar separation without reattachment. Unconventional airfoil shapes with sharp leading edges are explored and optimized for aerodynamic performance at representative Reynolds-Mach combinations for a concept rotor. Sharp leading edges initiate immediate flow separation, and the occurrence of large-scale vortex shedding is found to contribute to the relative performance increase of the optimized airfoils, compared to conventional airfoil shapes. The oscillations are shown to occur independent from laminar-turbulent transition and therefore result in sustainable performance at lower Reynolds numbers. Comparisons are presented to conventional airfoil shapes and peak lift-to-drag ratio increases between 17% and 41% are observed for similar section lift.

Koning, Witold J.↗

A Novel Multi-Spacecraft Interplanetary Global Trajectory Optimization Transcription

As the frontier of space exploration continues to advance, so does the design complexity of future interplanetary missions. One avenue of this increasing complexity includes a class of designs known as "Distributed Spacecraft Missions"; missions where multiple spacecraft coordinate to perform shared objectives. Current approaches for the global trajectory optimization of these Multi-Vehicle Missions (MVMs) are prone to shortcomings including laborious iterative design, considerable human-in-the-loop effort, treatment of the multi-vehicle problem as multiple separate trajectory optimization subproblems (resulting in suboptimal solutions where the whole is less than the sum of its parts), and poor handling of coordination objectives and constraints. There are only a handful of software platforms in existence capable of fully-automated, rapid, interplanetary mission and systems global optimization including the Parallel Global Multiobjective Optimizer (PaGMO), the Gravity Assisted Low-thrust Local Optimization Program (GALLOP), and the Evolutionary Mission Trajectory Generator (EMTG). However, none of these tools is capable of performing such tasks for MVM designs. The work outlined in this paper lays the groundwork for a technique to begin addressing these shortcomings. We present a fully-automated technique which frames interplanetary MVMs as Multi-Objective, Multi-Agent Hybrid Optimal Control Problems (MOMA HOCP). First, the basic functionality of this technique is validated on the single-vehicle problem of reproducing the Cassini interplanetary cruise.

Interplanetary↗