Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problems”

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 253 records · Page 14

Aeroacoustic Optimization of Installed Propeller Configurations with Scattering and Shielding Effects

An optimization capability is developed for acoustic scattering and shielding of installed propellers and rotors, based on a spacetime Galerkin time domain boundary element method (TDBEM). The time domain approach is particularly suitable for efficient simulation of transient, rotating, and broadband noise sources such as propellers. The use of algorithmic differentiation allows efficient evaluation of design sensitivities required for gradient-based design optimization with a large number of design variables. We present a validation exercise for the coherent broadband scattering capability against an analytical solution, showing excellent agreement. We then demonstrate the optimization tool on a series of inverse design cases with broadband and rotating sources, as well as an optimization problem for a propeller-wing configuration. The results show good performance for optimization problems with the characteristics of realistic installed propeller configurations.

Maks J Groom↗

Aeroacoustic Optimization of Installed Propeller Configurations with Scattering and Shielding Effects

An optimization capability is developed for acoustic scattering and shielding of installed propellers and rotors, based on a spacetime Galerkin time domain boundary element method (TDBEM). The time domain approach is particularly suitable for efficient simulation of transient, rotating, and broadband noise sources such as propellers. The use of algorithmic differentiation allows efficient evaluation of design sensitivities required for gradient-based design optimization with a large number of design variables. We present a validation exercise for the coherent broadband scattering capability against an analytical solution, showing excellent agreement. We then demonstrate the optimization tool on a series of inverse design cases with broadband and rotating sources, as well as an optimization problem for a propeller-wing configuration. The results show good performance for optimization problems with the characteristics of realistic installed propeller configurations.

Maks J Groom↗

On the determination of optimal costly measurement strategies for linear stochastic systems.

This paper presents the formulation of a class of optimization problems dealing with selecting, at each instant of time, one measurement provided by one out of many sensors. Each measurement has an associated measurement cost. The basic problem is then to select an optimal measurement policy, during a specified observation time interval, so that a weighted combination of prediction accuracy and accumulated observation cost is optimized. The current analysis is limited to the class of linear stochastic dynamic systems and measurement subsystems. The problem of selecting the optimal measurement strategy can be transformed into a deterministic optimal control problem. It is shown that the optimal measurement policy and the associated matched Kalman-type filter can be precomputed.

Athans, M.↗

Structural optimization with aeroelastic constraints of rotor blades with straight and swept tips

This paper describes a study in which structural optimization techniques are used to minimize the n/rev vertical hub shears in forward flight, subject to aeroelastic stability constraints and frequency placement constraints. A special technique is used to build a sequence of approximate, inexpensive to solve optimization problems, the solutions of which converge to the solution of the exact, expensive to solve optimization problem. Blade configurations with both straight and swept tips, and single- and double-cell cross sections are analyzed. The results show that the approach used in this study is very efficient, and produces improved designs with a very small number of blade aeroelastic analyses.

Celi, R.↗

Canonical transformations for space trajectory optimization

Canonical transformations are developed between the Cartesian coordinates, equinoctial elements, trajectory variables, and orbital elements for coplanar space trajectory optimization problems. The canonical transformations permit the state and adjoint or their solution, transversality conditions, the optimal control, and integrals of the motion, to be transformed between any of the common sets of coordinates for planar space trajectory optimization problems. Variations on the canonical transformations shown are straightforward to develop given the group properties of the canonical transformations.

Haissig, Christine M.↗

AI techniques for a space application scheduling problem

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

Thalman, N.↗

Optimization with artificial neural network systems - A mapping principle and a comparison to gradient based methods

General formulae for mapping optimization problems into systems of ordinary differential equations associated with artificial neural networks are presented. A comparison is made to optimization using gradient-search methods. The performance measure is the settling time from an initial state to a target state. A simple analytical example illustrates a situation where dynamical systems representing artificial neural network methods would settle faster than those representing gradient-search. Settling time was investigated for a more complicated optimization problem using computer simulations. The problem was a simplified version of a problem in medical imaging: determining loci of cerebral activity from electromagnetic measurements at the scalp. The simulations showed that gradient based systems typically settled 50 to 100 times faster than systems based on current neural network optimization methods.

Leong, Harrison Monfook↗

Robust Cislunar Trajectory Optimization Via Midcourse Correction and Optical Navigation Scheduling

This paper presents a new approach to optimal trajectory design that considers uncertainties in the system, referred to herein as robust trajectory optimization. This approach assumes an existing reference trajectory and optimizes the locations of midcourse correction burns and utilization of onboard navigation sensors to minimize dispersions in ∆v or final position. Navigation errors, maneuver execution errors, orbit insertion errors, and environmental modeling errors are considered. The application in this paper is cislunar flight with the goal of injecting into a Near-Rectilinear Halo Orbit for rendezvous with a target vehicle. Two complementary optimization problems are proposed. One problem minimizes the total ∆v dispersion subject to a final position dispersion constraint. The other problem minimizes the final position dispersion subject to a total ∆v dispersion constraint. The results from each optimization problem are shown for a complete mission profile.

Linear Covariance Analysis↗

The molecular matching problem

Molecular chemistry contains many difficult optimization problems that have begun to attract the attention of optimizers in the Operations Research community. Problems including protein folding, molecular conformation, molecular similarity, and molecular matching have been addressed. Minimum energy conformations for simple molecular structures such as water clusters, Lennard-Jones microclusters, and short polypeptides have dominated the literature to date. However, a variety of interesting problems exist and we focus here on a molecular structure matching (MSM) problem.

Kincaid, Rex K.↗

Application of decomposition techniques to the preliminary design of a transport aircraft

A nonlinear constrained optimization problem describing the preliminary design process for a transport aircraft has been formulated. A multifaceted decomposition of the optimization problem has been made. Flight dynamics, flexible aircraft loads and deformations, and preliminary structural design subproblems appear prominently in the decomposition. The use of design process decomposition for scheduling design projects, a new system integration approach to configuration control, and the application of object-centered programming to a new generation of design tools are discussed.

Rogan, J. E.↗

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗

Construction and parameterization of all static and dynamic H2-optimal state feedback solutions, optimal fixed modes, and fixed decoupling zeros

This paper considers an H2 optimization problem via state feedback. The class of problems dealt with here are general singular type which have a left invertible transfer matrix function from the control input to the controlled output. This class subsumes the regular H2 optimization problems. The paper constructs and parameterizes all the static and dynamic H2 optimal state feedback solutions. Moreover, all the eigenvalues of an optimal closed-loop system are characterized. All optimal closed-loop systems share a set of eigenvalues which are termed here as the optimal fixed modes. Every H2 optimal controller must assign among the closed-loop eigenvalues the set of optimal fixed modes. This set of optimal fixed modes includes a set of optimal fixed decoupling zeros which shows the minimum absolutely necessary number and locations of pole-zero cancellations present in any H2 optimal design. It is shown that both the sets of optimal fixed modes and optimal fixed decoupling zeros do not vary depending upon whether the static or the dynamic controllers are used.

Chen, Ben M.↗

Combined optimal control and estimation.

Combined optimization problem, equivalent to dual control problem, considering determination of optimal control policies for plant under random disturbances, using iterative equations

CONTROL SYSTEM↗

Rapid optimization of multiple-burn rocket flights.

Different formulations of the fuel optimization problem for multiple burn trajectories are considered. It is shown that certain customary idealizing assumptions lead to an ill-posed optimization problem for which no solution exists. Several ways are discussed for avoiding such difficulties by more realistic problem statements. An iterative solution of the boundary value problem is presented together with efficient coast arc computations, the right end conditions for various orbital missions, and some test results.

Brown, K. R.↗

Distributed Optimization

We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.

Macready, William↗

Overall Traveling-Wave-Tube Efficiency Improved By Optimized Multistage Depressed Collector Design

Depressed Collector Design The microwave traveling wave tube (TWT) is used widely for space communications and high-power airborne transmitting sources. One of the most important features in designing a TWT is overall efficiency. Yet, overall TWT efficiency is strongly dependent on the efficiency of the electron beam collector, particularly for high values of collector efficiency. For these reasons, the NASA Glenn Research Center developed an optimization algorithm based on simulated annealing to quickly design highly efficient multistage depressed collectors (MDC's). Simulated annealing is a strategy for solving highly nonlinear combinatorial optimization problems. Its major advantage over other methods is its ability to avoid becoming trapped in local minima. Simulated annealing is based on an analogy to statistical thermodynamics, specifically the physical process of annealing: heating a material to a temperature that permits many atomic rearrangements and then cooling it carefully and slowly, until it freezes into a strong, minimum-energy crystalline structure. This minimum energy crystal corresponds to the optimal solution of a mathematical optimization problem. The TWT used as a baseline for optimization was the 32-GHz, 10-W, helical TWT developed for the Cassini mission to Saturn. The method of collector analysis and design used was a 2-1/2-dimensional computational procedure that employs two types of codes, a large signal analysis code and an electron trajectory code. The large signal analysis code produces the spatial, energetic, and temporal distributions of the spent beam entering the MDC. An electron trajectory code uses the resultant data to perform the actual collector analysis. The MDC was optimized for maximum MDC efficiency and minimum final kinetic energy of all collected electrons (to reduce heat transfer). The preceding figure shows the geometric and electrical configuration of an optimized collector with an efficiency of 93.8 percent. The results show the improvement in collector efficiency from 89.7 to 93.8 percent, resulting in an increase of three overall efficiency points. In addition, the time to design a highly efficient MDC was reduced from a month to a few days. All work was done in-house at Glenn for the High Rate Data Delivery Program. Future plans include optimizing the MDC and TWT interaction circuit in tandem to further improve overall TWT efficiency.

Vaden, Karl R.↗