SEARCH · Engineering Papers

Results for “Simulated annealing”

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 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Discrete range clustering using Monte Carlo methods

For automatic obstacle avoidance guidance during rotorcraft low altitude flight, a reliable model of the nearby environment is needed. Such a model may be constructed by applying surface fitting techniques to the dense range map obtained by active sensing using radars. However, for covertness, passive sensing techniques using electro-optic sensors are desirable. As opposed to the dense range map obtained via active sensing, passive sensing algorithms produce reliable range at sparse locations, and therefore, surface fitting techniques to fill the gaps in the range measurement are not directly applicable. Both for automatic guidance and as a display for aiding the pilot, these discrete ranges need to be grouped into sets which correspond to objects in the nearby environment. The focus of this paper is on using Monte Carlo methods for clustering range points into meaningful groups. One of the aims of the paper is to explore whether simulated annealing methods offer significant advantage over the basic Monte Carlo method for this class of problems. We compare three different approaches and present application results of these algorithms to a laboratory image sequence and a helicopter flight sequence.

Chatterji, G. B.↗

NASA NTRS1992

Optical pattern recognition III; Proceedings of the Meeting, Orlando, FL, Apr. 21, 22, 1992

Consideration is given to transitioning of optical processing into systems (TOPS), optical correlator hardware, phase-only optical correlation filters, optical distortion-invariant correlation filters, and optical neural networks. Particular attention is given to a test target for optical correlators, a TOPS electronic warfare channelizer program, a portable video-rate optical correlator, a joint transform correlator employing electron trapping materials, a novelty filtered optical correlator using a photorefractive crystal, a comparison of correlation performance of smart ternary phase-amplitude filters with gray-scale and binary input scenes, real-time distortion-tolerant composite filters for automatic target identification, landscaping the correlation surface, fast designing of a circular harmonic filter using simulated annealing, feature-based correlation filters for distortion invariance, automatic target recognition using a feature-based optical neural network, and a holographic inner-product processor for pattern recognition.

Casasent, David P.↗

NASA NTRS1992

Principled halftoning based on human vision models

When models of human vision adequately measure the relative quality of candidate halftonings of an image, the problem of halftoning the image becomes equivalent to the search problem of finding a halftone that optimizes the quality metric. Because of the vast number of possible halftones, and the complexity of image quality measures, this principled approach has usually been put aside in favor of fast algorithms that seem to perform well. We find that the principled approach can lead to a range of useful halftoning algorithms, as we trade off speed for quality by varying the complexity of the quality measure and the thoroughness of the search. High quality halftones can be obtained reasonably quickly, for example, by using as a measure the vector length of the error image filtered by a contrast sensitivity function, and, as the search procedure, the sequential adjustment of individual pixels to improve the quality measure. If computational resources permit, simulated annealing can find nearly optimal solutions.

Mulligan, Jeffrey B.↗

NASA NTRS1993

Trajectory optimization for the National Aerospace Plane

The objective of this second phase research is to investigate the optimal ascent trajectory for the National Aerospace Plane (NASP) from runway take-off to orbital insertion and address the unique problems associated with the hypersonic flight trajectory optimization. The trajectory optimization problem for an aerospace plane is a highly challenging problem because of the complexity involved. Previous work has been successful in obtaining sub-optimal trajectories by using energy-state approximation and time-scale decomposition techniques. But it is known that the energy-state approximation is not valid in certain portions of the trajectory. This research aims at employing full dynamics of the aerospace plane and emphasizing direct trajectory optimization methods. The major accomplishments of this research include the first-time development of an inverse dynamics approach in trajectory optimization which enables us to generate optimal trajectories for the aerospace plane efficiently and reliably, and general analytical solutions to constrained hypersonic trajectories that has wide application in trajectory optimization as well as in guidance and flight dynamics. Optimal trajectories in abort landing and ascent augmented with rocket propulsion and thrust vectoring control were also investigated. Motivated by this study, a new global trajectory optimization tool using continuous simulated annealing and a nonlinear predictive feedback guidance law have been under investigation and some promising results have been obtained, which may well lead to more significant development and application in the near future.

Lu, Ping↗

NASA NTRS1995

A technique for optimizing grid blocks

A new technique for automatically combining grid blocks of a given block-structured grid into logically-rectangular clusters which are 'optimal' is presented. This technique uses the simulated annealing optimization method to reorganize the blocks into an optimum configuration, that is, one which minimizes a user-defined objective function such as the number of clusters or the differential in the sizes of all the clusters. The clusters which result from applying the technique to two different two-dimensional configurations are presented for a variety of objective function definitions. In all cases, the automatically-generated clusters are significantly better than the original clusters. While this new technique can be applied to block-structured grids generated from any source, it is particularly useful for operating on block-structured grids containing many blocks, such as those produced by the emerging automatic block-structured grid generators.

Dannenhoffer, John F., III↗

NASA NTRS1994

The stability of perfect elliptic disks. 1: The maximum streaming case

Self-consistent distribution functions are constructed for two-dimensional perfect elliptic disks (for which the potential is exactly integrable) in the limit of maximum streaming; these are tested for stability by N-body integration. To obtain a discrete representation for each model, simulated annealing is used to choose a set of orbits which sample the distribution function and reproduce the required density profile while carrying the greatest possible amount of angular momentum. A quiet start technique is developed to place particles on these orbits uniformly in action-angle space, making the initial conditions as smooth as possible. The roundest models exhibit spiral instabilities similar to those of cold axisymmetric disks; the most elongated models show bending instabilities like those seen in prolate systems. Between these extremes, there is a range of axial ratios 0.25 approximately less than b/a approximately less than 0.6 within which these models appear to be stable. All the methods developed in this investigation can easily be extended to integrable potentials in three dimensions.

Levine, Stephen E.↗

NASA NTRS1994

Resolving the 180-degree ambiguity in vector magnetic field measurements: The 'minimum' energy solution

I present a robust algorithm that resolves the 180-deg ambiguity in measurements of the solar vector magnetic field. The technique simultaneously minimizes both the divergence of the magnetic field and the electric current density using a simulated annealing algorithm. This results in the field orientation with approximately minimum free energy. The technique is well-founded physically and is simple to implement.

Metcalf, Thomas R.↗

NASA NTRS1995

Program Classifies Multiple-Frequency Polarimetric SAR Data

POLMAP computer program classifies multifrequency, polarimetric synthetic-aperture-radar (SAR) data into homogeneous classes of radar back-scatter. Software implements maximum-a-posteriori classification scheme. Performs by use of simulated-annealing procedure, takes much longer to compute than ICM solution, but it maximizes posteriori distribution of classes for whole scene. Input statistics of image classes must be created by some independent means, and supplied as input to POLMAP. Used as input to image processing application program. Written in FORTRAN 77.

Rignot, Eric↗

NASA NTRS1996

Development of Multiobjective Optimization Techniques for Sonic Boom Minimization

A discrete, semi-analytical sensitivity analysis procedure has been developed for calculating aerodynamic design sensitivities. The sensitivities of the flow variables and the grid coordinates are numerically calculated using direct differentiation of the respective discretized governing equations. The sensitivity analysis techniques are adapted within a parabolized Navier Stokes equations solver. Aerodynamic design sensitivities for high speed wing-body configurations are calculated using the semi-analytical sensitivity analysis procedures. Representative results obtained compare well with those obtained using the finite difference approach and establish the computational efficiency and accuracy of the semi-analytical procedures. Multidisciplinary design optimization procedures have been developed for aerospace applications namely, gas turbine blades and high speed wing-body configurations. In complex applications, the coupled optimization problems are decomposed into sublevels using multilevel decomposition techniques. In cases with multiple objective functions, formal multiobjective formulation such as the Kreisselmeier-Steinhauser function approach and the modified global criteria approach have been used. Nonlinear programming techniques for continuous design variables and a hybrid optimization technique, based on a simulated annealing algorithm, for discrete design variables have been used for solving the optimization problems. The optimization procedure for gas turbine blades improves the aerodynamic and heat transfer characteristics of the blades. The two-dimensional, blade-to-blade aerodynamic analysis is performed using a panel code. The blade heat transfer analysis is performed using an in-house developed finite element procedure. The optimization procedure yields blade shapes with significantly improved velocity and temperature distributions. The multidisciplinary design optimization procedures for high speed wing-body configurations simultaneously improve the aerodynamic, the sonic boom and the structural characteristics of the aircraft. The flow solution is obtained using a comprehensive parabolized Navier Stokes solver. Sonic boom analysis is performed using an extrapolation procedure. The aircraft wing load carrying member is modeled as either an isotropic or a composite box beam. The isotropic box beam is analyzed using thin wall theory. The composite box beam is analyzed using a finite element procedure. The developed optimization procedures yield significant improvements in all the performance criteria and provide interesting design trade-offs. The semi-analytical sensitivity analysis techniques offer significant computational savings and allow the use of comprehensive analysis procedures within design optimization studies.

Chattopadhyay, Aditi↗

NASA NTRS1998

Stochastic Methods for Aircraft Design

The global stochastic optimization method, simulated annealing (SA), was adapted and applied to various problems in aircraft design. The research was aimed at overcoming the problem of finding an optimal design in a space with multiple minima and roughness ubiquitous to numerically generated nonlinear objective functions. SA was modified to reduce the number of objective function evaluations for an optimal design, historically the main criticism of stochastic methods. SA was applied to many CFD/MDO problems including: low sonic-boom bodies, minimum drag on supersonic fore-bodies, minimum drag on supersonic aeroelastic fore-bodies, minimum drag on HSCT aeroelastic wings, FLOPS preliminary design code, another preliminary aircraft design study with vortex lattice aerodynamics, HSR complete aircraft aerodynamics. In every case, SA provided a simple, robust and reliable optimization method which found optimal designs in order 100 objective function evaluations. Perhaps most importantly, from this academic/industrial project, technology has been successfully transferred; this method is the method of choice for optimization problems at Northrop Grumman.

Pelz, Richard B.↗

NASA NTRS2000

From Coexpression to Coregulation: An Approach to Inferring Transcriptional Regulation Among Gene Classes from Large-Scale Expression Data

We provide preliminary evidence that existing algorithms for inferring small-scale gene regulation networks from gene expression data can be adapted to large-scale gene expression data coming from hybridization microarrays. The essential steps are (I) clustering many genes by their expression time-course data into a minimal set of clusters of co-expressed genes, (2) theoretically modeling the various conditions under which the time-courses are measured using a continuous-time analog recurrent neural network for the cluster mean time-courses, (3) fitting such a regulatory model to the cluster mean time courses by simulated annealing with weight decay, and (4) analysing several such fits for commonalities in the circuit parameter sets including the connection matrices. This procedure can be used to assess the adequacy of existing and future gene expression time-course data sets for determining transcriptional regulatory relationships such as coregulation.

Mjolsness, Eric↗

NASA NTRS2001

Hydrogeology of Basins on Mars

This document summarizes the work accomplished under NASA Grant NAG5-3870. Emphasis was put on the development of the FIDO rover, a prototype for the twin-Mers which will be operating on the surface of Mars in 2004, specifically the primary work was the analysis of FIDO field trials. The grantees also analyzed VIKING Lander 1 XRFS and Pathfinder APXS data. Results show that the Viking site chemistry is consistent with an andesite, and the Pathfinder site is consistent with a basaltic andesite. The grantees also worked to demonstrate the capability to simulate annealing methods to apply to the inversion of remote sensing data. They performed an initial analyses of Sojourner engineering telemetry and imaging data. They performed initial analyses of Viking Lander Stereo Images, and of Hematite deposits in Terra Meridiani. They also acquired and analyzed the New Goldstone radar data.

Arvidson, Raymond E.↗

NASA NTRS2002

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

Hughes, Steven P.↗

NASA NTRS2003

Structural Basis for "Flip-Flop" Action of Human Pyruvate Dehydrogenase

The derivative of vitamin B1, thiamin pyrophosphate is a cofactor of pyruvate dehydrogenase, a component enzyme of the mitochondrial pyruvate dehydrogenase multienzyme complex that plays a major role in directing energy metabolism in the cell. This cofactor is used to cleave the C(sup alpha)-C(=O) bond of pyruvate followed by reductive acetyl transfer to lipoyl-dihydrolipoamide acetyltransferase. In alpha(sub 2)beta(sub 2)-tetrameric human pyruvate dehydrogenase, there are two cofactor binding sites, each of them being a center of independently conducted, although highly coordinated enzymatic reactions. The dynamic nonequivalence of two, otherwise chemically equivalent, catalytic sites can now be understood based on the recently determined crystal structure of the holo-form of human pyruvate dehydrogenase at 1.95A resolution. The structure of pyruvate dehydrogenase was determined using a combination of MAD phasing and molecular replacement followed by rounds of torsion-angles molecular-dynamics simulated-annealing refinement. The final pyruvate dehydrogenase structure included coordinates for all protein amino acids two cofactor molecules, two magnesium and two potassium ions, and 742 water molecules. The structure was refined to R = 0.202 and R(sub free) = 0.244. Our structural analysis of the enzyme folding and domain assembly identified a simple mechanism of this protein motion required for the conduct of catalytic action.

Ciszak, Ewa↗

NASA NTRS2003

Binary-Phase Fourier Gratings for Nonuniform Array Generation

We describe a design method for a binary-phase Fourier grating that generates an array of spots with nonuniform, user-defined intensities symmetric about the zeroth order. Like the Dammann fanout grating approach, the binary-phase Fourier grating uses only two phase levels in its grating surface profile to generate the final spot array. Unlike the Dammann fanout grating approach, this method allows for the generation of nonuniform, user-defined intensities within the final fanout pattern. Restrictions governing the specification and realization of the array's individual spot intensities are discussed. Design methods used to realize the grating employ both simulated annealing and nonlinear optimization approaches to locate optimal solutions to the grating design problem. The end-use application driving this development operates in the near- to mid-infrared spectrum - allowing for higher resolution in grating specification and fabrication with respect to wavelength than may be available in visible spectrum applications. Fabrication of a grating generating a user-defined nine spot pattern is accomplished in GaAs for the near-infrared. Characterization of the grating is provided through the measurement of individual spot intensities, array uniformity, and overall efficiency. Final measurements are compared to calculated values with a discussion of the results.

Keys, Andrew S.↗

NASA NTRS2002

Reliability and Productivity Modeling for the Optimization of Separated Spacecraft Interferometers

As technological systems grow in capability, they also grow in complexity. Due to this complexity, it is no longer possible for a designer to use engineering judgement to identify the components that have the largest impact on system life cycle metrics, such as reliability, productivity, cost, and cost effectiveness. One way of identifying these key components is to build quantitative models and analysis tools that can be used to aid the designer in making high level architecture decisions. Once these key components have been identified, two main approaches to improving a system using these components exist: add redundancy or improve the reliability of the component. In reality, the most effective approach to almost any system will be some combination of these two approaches, in varying orders of magnitude for each component. Therefore, this research tries to answer the question of how to divide funds, between adding redundancy and improving the reliability of components, to most cost effectively improve the life cycle metrics of a system. While this question is relevant to any complex system, this research focuses on one type of system in particular: Separate Spacecraft Interferometers (SSI). Quantitative models are developed to analyze the key life cycle metrics of different SSI system architectures. Next, tools are developed to compare a given set of architectures in terms of total performance, by coupling different life cycle metrics together into one performance metric. Optimization tools, such as simulated annealing and genetic algorithms, are then used to search the entire design space to find the "optimal" architecture design. Sensitivity analysis tools have been developed to determine how sensitive the results of these analyses are to uncertain user defined parameters. Finally, several possibilities for the future work that could be done in this area of research are presented.

Kenny, Sean↗

NASA NTRS2004

Multi-Agent Methods for the Configuration of Random Nanocomputers

As computational devices continue to shrink, the cost of manufacturing such devices is expected to grow exponentially. One alternative to the costly, detailed design and assembly of conventional computers is to place the nano-electronic components randomly on a chip. The price for such a trivial assembly process is that the resulting chip would not be programmable by conventional means. In this work, we show that such random nanocomputers can be adaptively programmed using multi-agent methods. This is accomplished through the optimization of an associated high dimensional error function. By representing each of the independent variables as a reinforcement learning agent, we are able to achieve convergence must faster than with other methods, including simulated annealing. Standard combinational logic circuits such as adders and multipliers are implemented in a straightforward manner. In addition, we show that the intrinsic flexibility of these adaptive methods allows the random computers to be reconfigured easily, making them reusable. Recovery from faults is also demonstrated.

Lawson, John W.↗

NASA NTRS2004

Improving Search Algorithms by Using Intelligent Coordinates

We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent eta is self-interested; it sets its variable to maximize its own function g (sub eta). Three factors govern such a distributed algorithm's performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit alI three factors by modifying a search algorithm's exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based player engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

Wolpert, David H.↗