SEARCH · Engineering Papers

Results for “optimization algorithms”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,387 records · Page 77

All sources NASA NTRS DOE OSTI

NASA NTRS1994

Rapid solution of large-scale systems of equations

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Storaasli, Olaf O.↗

NASA NTRS2001

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity. However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold. One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumbersome binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back and Dasgupta and Michalesicz. We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.↗

NASA NTRS1989

An implicit and stiffly stable finite element CFD algorithm for unsteady aerodynamics

A stable and accurate finite element CFD algorithm for hyperbolic/incompletely parabolic conservation law systems is described and verified. It combines a Taylor weak statement FEM, an optimal implicit Runge-Kutta time integration algorithm, and a matrix tensor product approximate factorization linear algebra procedure. The results of computational experiments show that the developed algorithm is robust.

Baker, A. J.↗

NASA NTRS2003

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

NASA NTRS1999

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Baskaran, Subbiah↗

NASA NTRS1994

Algorithms For A Fast Universal Noiseless Coder

Report discusses some algorithms for fast, high-performance universal noiseless coder adaptively generating nearly optimal variable-length codes. Coders based on principles discussed in reports described in "Some Practical Universal Noiseless Coding Techniques" (NPO-18833) and "Optimality of Variable-Length Codes" (NPO-18834). Coding algorithms of present report independently implemented in custom-made very-large-scale integrated-circuit coding modules.

Yeh, Pen-Shu↗

NASA NTRS2014

Optimizing Vetoes for Gravitational-wave Transient Searches

Interferometric gravitational-wave detectors like LIGO, GEO600 and Virgo record a surplus of information above and beyond possible gravitational-wave events. These auxiliary channels capture information about the state of the detector and its surroundings which can be used to infer potential terrestrial noise sources of some gravitational-wave-like events. We present an algorithm addressing the ordering (or equivalently optimizing) of such information from auxiliary systems in gravitational-wave detectors to establish veto conditions in searches for gravitational-wave transients. The procedure was used to identify vetoes for searches for unmodelled transients by the LIGO and Virgo collaborations during their science runs from 2005 through 2007. In this work we present the details of the algorithm; we also use a limited amount of data from LIGO's past runs in order to examine the method, compare it with other methods, and identify its potential to characterize the instruments themselves. We examine the dependence of Receiver Operating Characteristic curves on the various parameters of the veto method and the implementation on real data. We find that the method robustly determines important auxiliary channels, ordering them by the apparent strength of their correlations to the gravitational-wave channel. This list can substantially reduce the background of noise events in the gravitational-wave data. In this way it can identify the source of glitches in the detector as well as assist in establishing confidence in the detection of gravitational-wave transients.

Transient↗

NASA NTRS2000

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity (Reeves 1997). However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold (Glover 1998). One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumber-some binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back (1996) and Dasgupta and Michalesicz (1997). We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.↗

NASA NTRS2023

Optimal Estimation Inversion of Ionospheric Electron Density from GNSS-POD Limb Measurements: Part I-Algorithm and Morphology

GNSS-LEO radio links from Precise Orbital Determination (POD) and Radio Occultation (RO) antennas have been used increasingly in characterizing the global 3D distribution and variability of ionospheric electron density (N e ). In this study, we developed an optimal estimation (OE) method to retrieve N e profiles from the slant total electron content (hTEC) measurements acquired by the GNSS-POD links at negative elevation angles (ε < 0°). Although both OE and onion-peeling (OP) methods use the Abel weighting function in the N e inversion, they are significantly different in terms of performance in the lower ionosphere. The new OE results can overcome the large N e oscillations, sometimes negative values, seen in the OP retrievals in the E-region ionosphere. In the companion paper in this Special Issue, the HmF2 and NmF2 from the OE retrieval are validated against ground-based ionosondes and radar observations, showing generally good agreements in NmF2 from all sites. Nighttime hmF2 measurements tend to agree better than the daytime when the ionosonde heights tend to be slightly lower. The OE algorithm has been applied to all GNSS-POD data acquired from the COSMIC-1 (2006–2019), COSMIC-2 (2019–present), and Spire (2019–present) constellations, showing a consistent ionospheric N e morphology. The unprecedented spatiotemporal sampling of the ionosphere from these constellations now allows a detailed analysis of the frequency–wavenumber spectra for the N e variability at different heights. In the lower ionosphere (~150 km), we found significant spectral power in DE1, DW6, DW4, SW5, and SE4 wave components, in addition to well-known DW1, SW2, and DE3 waves. In the upper ionosphere (~450 km), additional wave components are still present, including DE4, DW4, DW6, SE4, and SW4. The co-existence of eastward- and westward-propagating wave4 components implies the presence of a stationary wave4 (SPW4), as suggested by other earlier studies. Further improvements to the OE method are proposed, including a tomographic inversion technique that leverages the asymmetric sampling about the tangent point associated with GNSS-LEO links.

GNSS constellation↗

NASA NTRS1975

Hybrid computer methods for direct functional optimization

Control and trajectory optimization involves the minimization of a performance index (PI) of integral form where some optimal control law exists in a dynamic system. In this paper, a hybrid minicomputer with an adaptive random-search algorithm implements an iterative search for the optimal control. The search assumes that some initial control is randomly perturbed and a fast analog computer generates respective PI from the analog response of the dynamic system. An improved PI informs the digital computer to utilize the perturbed control as a basis for the next iteration; otherwise a new perturbation replaces the old perturbation in the next iteration. The search terminates when no further improvements occur.

Andrews, M.↗

NASA NTRS1995

A hybrid genetic algorithm for resolving closely spaced objects

A hybrid genetic algorithm is described for performing the difficult optimization task of resolving closely spaced objects appearing in space based and ground based surveillance data. This application of genetic algorithms is unusual in that it uses a powerful domain-specific operation as a genetic operator. Results of applying the algorithm to real data from telescopic observations of a star field are presented.

Abbott, R. J.↗

NASA NTRS1983

Generation and evoluation of near-optimum vertical flight profiles

The overall objectives of this research effort have been to develop and evaluate algorithms and flight management concepts for minimization of fuel or direct operating costs. These concepts are to be used for flight planning or for on-board computation and steering of turbojet transport aircraft in the vertical path. Within this research context, a computer program, called OPTIM, has been developed to use these algorithms to generate near-optimum vertical reference profiles. OPTIM contains control options to examine effects of various flight constraints on cost performance. A companion program, called TRAGEN, was developed to simulate an aircraft flying along a given vertical reference profile. TRAGEN is used to verify OPTIM's output , to examine the effects of parameter value uncertainty (such as prevailing wind), and to compare cost performance of profiles generated by different techniques. This paper describes OPTIM and TRAGEN and presents examples of the programs utility.

Sorensen, J. A.↗

NASA NTRSDate not supplied

Distributed Target Tracking With Optimal Data Migration

The paper presents an Extended Kalman Filter based framework for airborne target tracking using dynamic information fusion from multi-modal sensors with geodiversity. First, the algorithm execution location is determined using an optimal data migration strategy, next the sensors information is dynamically fused at each estimation instance using validity flag for each sensor reading, finally the target estimation is updated based on the fused innovation vector. The approach is applied to synthetic data generated from the radar and camera models located on the ground for the simulated target flight in Reflection simulation environment.

Distributed sensing↗

NASA NTRS1994

Adaptive Wing Camber Optimization: A Periodic Perturbation Approach

Available redundancy among aircraft control surfaces allows for effective wing camber modifications. As shown in the past, this fact can be used to improve aircraft performance. To date, however, algorithm developments for in-flight camber optimization have been limited. This paper presents a perturbational approach for cruise optimization through in-flight camber adaptation. The method uses, as a performance index, an indirect measurement of the instantaneous net thrust. As such, the actual performance improvement comes from the integrated effects of airframe and engine. The algorithm, whose design and robustness properties are discussed, is demonstrated on the NASA Dryden B-720 flight simulator.

Espana, Martin↗

NASA NTRS2003

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗

NASA NTRS2021

Small UAV Flight Planning in Urban Environments

This work proposes a fast algorithm for generating obstacle-free and wind-efficient flight paths at a constant above-ground-level altitude in urban environments because a fast flight path planning algorithm is an essential function or service needed for enabling small unmanned aerial vehicle (sUAV) to operate in urban environments within Class G airspace. The proposed method first converts the 3D path planning problem to a 2D problem by constructing an obstacle map at a given above-ground-level altitude. A quad-tree decomposition is then used to build a search space in terms of obstacle occupancy and wind difference. The wind cost of traveling through each cell is defined based on energy consumption under various wind conditions. A repulsive potential is also adopted to make sure that the flight plans stay away from obstacles. The Theta* search algorithm, a variant of A* algorithm, is applied to mitigate the path angle change constraints introduced by grid-based graphs. With the Theta* and postsmoothing techniques, an obstacle-free, wind efficient, and constant above-ground-level flight plan can be quickly generated for sUAV operations in urban environments while meeting the lateral path angle constraints. The results showed that the path planning algorithm is efficient and can be finished within several seconds. With a proper choice of wind coefficient, the proposed path planning algorithm outperforms the multiple-shooting trajectory optimization method even in an obstacle-free environment. With the flexibility of incorporating other geo-related costs and computation efficiency, the proposed algorithm shows the potential for real-time flight path planning in complex urban environments.

Path planning↗

NASA NTRS1998

Variable-Complexity Multidisciplinary Optimization on Parallel Computers

This report covers work conducted under grant NAG1-1562 for the NASA High Performance Computing and Communications Program (HPCCP) from December 7, 1993, to December 31, 1997. The objective of the research was to develop new multidisciplinary design optimization (MDO) techniques which exploit parallel computing to reduce the computational burden of aircraft MDO. The design of the High-Speed Civil Transport (HSCT) air-craft was selected as a test case to demonstrate the utility of our MDO methods. The three major tasks of this research grant included: development of parallel multipoint approximation methods for the aerodynamic design of the HSCT, use of parallel multipoint approximation methods for structural optimization of the HSCT, mathematical and algorithmic development including support in the integration of parallel computation for items (1) and (2). These tasks have been accomplished with the development of a response surface methodology that incorporates multi-fidelity models. For the aerodynamic design we were able to optimize with up to 20 design variables using hundreds of expensive Euler analyses together with thousands of inexpensive linear theory simulations. We have thereby demonstrated the application of CFD to a large aerodynamic design problem. For the predicting structural weight we were able to combine hundreds of structural optimizations of refined finite element models with thousands of optimizations based on coarse models. Computations have been carried out on the Intel Paragon with up to 128 nodes. The parallel computation allowed us to perform combined aerodynamic-structural optimization using state of the art models of a complex aircraft configurations.

Grossman, Bernard↗

NASA NTRS1983

Development of a Multilevel Optimization Approach to the Design of Modern Engineering Systems

A general algorithm is proposed which carries out the design process iteratively, starting at the top of the hierarchy and proceeding downward. Each subproblem is optimized separately for fixed controls from higher level subproblems. An optimum sensitivity analysis is then performed which determines the sensitivity of the subproblem design to changes in higher level subproblem controls. The resulting sensitivity derivatives are used to construct constraints which force the controlling subproblems into chosing their own designs so as to improve the lower levels subproblem designs while satisfying their own constraints. The applicability of the proposed algorithm is demonstrated by devising a four-level hierarchy to perform the simultaneous aerodynamic and structural design of a high-performance sailplane wing for maximum cross-country speed. Finally, the concepts discussed are applied to the two-level minimum weight structural design of the sailplane wing. The numerical experiments show that discontinuities in the sensitivity derivatives may delay convergence, but that the algorithm is robust enough to overcome these discontinuities and produce low-weight feasible designs, regardless of whether the optimization is started from the feasible space or the infeasible one.

Barthelemy, J. F. M.↗