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 883 records · Page 49

All sources NASA NTRS DOE OSTI

NASA NTRS2004

Applying a Genetic Algorithm to Reconfigurable Hardware

This paper investigates the feasibility of applying genetic algorithms to solve optimization problems that are implemented entirely in reconfgurable hardware. The paper highlights the pe$ormance/design space trade-offs that must be understood to effectively implement a standard genetic algorithm within a modem Field Programmable Gate Array, FPGA, reconfgurable hardware environment and presents a case-study where this stochastic search technique is applied to standard test-case problems taken from the technical literature. In this research, the targeted FPGA-based platform and high-level design environment was the Starbridge Hypercomputing platform, which incorporates multiple Xilinx Virtex II FPGAs, and the Viva TM graphical hardware description language.

Wells, B. Earl↗

NASA NTRS1988

Near-optimal output feedback regulation of ill-conditioned linear systems

A two-time scale approximation for the linear quadratic optimal output feedback regulator program is examined. Necessary conditions for optimality, as well as an algorithm for computing locally near-optimal gains are derived. If it is assumed that the slow and fast subsystem initial conditions are uniformly distributed, optimal gains for the two-time-scale problem provide a second-order approximation to optimal closed-loop performance in the unperturbed system. This is verified with a numerical example.

Moerder, Daniel D.↗

NASA NTRS1993

Rotor design optimization using a free wake analysis

The aim of this effort was to develop a comprehensive performance optimization capability for tiltrotor and helicopter blades. The analysis incorporates the validated EHPIC (Evaluation of Hover Performance using Influence Coefficients) model of helicopter rotor aerodynamics within a general linear/quadratic programming algorithm that allows optimization using a variety of objective functions involving the performance. The resulting computer code, EHPIC/HERO (HElicopter Rotor Optimization), improves upon several features of the previous EHPIC performance model and allows optimization utilizing a wide spectrum of design variables, including twist, chord, anhedral, and sweep. The new analysis supports optimization of a variety of objective functions, including weighted measures of rotor thrust, power, and propulsive efficiency. The fundamental strength of the approach is that an efficient search for improved versions of the baseline design can be carried out while retaining the demonstrated accuracy inherent in the EHPIC free wake/vortex lattice performance analysis. Sample problems are described that demonstrate the success of this approach for several representative rotor configurations in hover and axial flight. Features that were introduced to convert earlier demonstration versions of this analysis into a generally applicable tool for researchers and designers is also discussed.

Quackenbush, Todd R.↗

NASA NTRS1992

An analytic model for footprint dispersions and its application to mission design

This is the final report on our recent research activities that are complementary to those conducted by our colleagues, Professor Farrokh Mistree and students, in the context of the Taguchi method. We have studied the mathematical model that forms the basis of the Simulation and Optimization of Rocket Trajectories (SORT) program and developed an analytic method for determining mission reliability with a reduced number of flight simulations. This method can be incorporated in a design algorithm to mathematically optimize different performance measures of a mission, thus leading to a robust and easy-to-use methodology for mission planning and design.

Rao, J. R. Jagannatha↗

NASA NTRS1993

Load Balancing Using Time Series Analysis for Soft Real Time Systems with Statistically Periodic Loads

This thesis provides design and analysis of techniques for global load balancing on ensemble architectures running soft-real-time object-oriented applications with statistically periodic loads. It focuses on estimating the instantaneous average load over all the processing elements. The major contribution is the use of explicit stochastic process models for both the loading and the averaging itself. These models are exploited via statistical time-series analysis and Bayesian inference to provide improved average load estimates, and thus to facilitate global load balancing. This thesis explains the distributed algorithms used and provides some optimality results. It also describes the algorithms' implementation and gives performance results from simulation. These results show that the authors' techniques allow more accurate estimation of the global system loading, resulting in fewer object migrations than local methods. The authors' method is shown to provide superior performance, relative not only to static load-balancing schemes but also to many adaptive load-balancing methods. Results from a preliminary analysis of another system and from simulation with a synthetic load provide some evidence of more general applicability.

LOAD CONTROL↗

NASA NTRS1993

Load Balancing Using Time Series Analysis for Soft Real Time Systems with Statistically Periodic Loads

This thesis provides design and analysis of techniques for global load balancing on ensemble architectures running soft-real-time object-oriented applications with statistically periodic loads. It focuses on estimating the instantaneous average load over all the processing elements. The major contribution is the use of explicit stochastic process models for both the loading and the averaging itself. These models are exploited via statistical time-series analysis and Bayesian inference to provide improved average load estimates, and thus to facilitate global load balancing. This thesis explains the distributed algorithms used and provides some optimality results. It also describes the algorithms' implementation and gives performance results from simulation. These results show that our techniques allow more accurate estimation of the global system load ing, resulting in fewer object migration than local methods. Our method is shown to provide superior performance, relative not only to static load-balancing schemes but also to many adaptive methods.

REAL TIME↗

NASA NTRS2010

Data transmission system and method

A method of transmitting data packets, where randomness is added to the schedule. Universal broadcast schedules using encoding and randomization techniques are also discussed, together with optimal randomized schedules and an approximation algorithm for finding near-optimal schedules.

Bruck, Jehoshua↗

NASA NTRS1993

Variational Trajectory Optimization Tool Set: Technical description and user's manual

The algorithms that comprise the Variational Trajectory Optimization Tool Set (VTOTS) package are briefly described. The VTOTS is a software package for solving nonlinear constrained optimal control problems from a wide range of engineering and scientific disciplines. The VTOTS package was specifically designed to minimize the amount of user programming; in fact, for problems that may be expressed in terms of analytical functions, the user needs only to define the problem in terms of symbolic variables. This version of the VTOTS does not support tabular data; thus, problems must be expressed in terms of analytical functions. The VTOTS package consists of two methods for solving nonlinear optimal control problems: a time-domain finite-element algorithm and a multiple shooting algorithm. These two algorithms, under the VTOTS package, may be run independently or jointly. The finite-element algorithm generates approximate solutions, whereas the shooting algorithm provides a more accurate solution to the optimization problem. A user's manual, some examples with results, and a brief description of the individual subroutines are included.

Bless, Robert R.↗

NASA NTRS2008

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↗

NASA NTRS1990

Iterative computation of the optimal H(infinity) norm by using two-Riccati-equation method

The two-Riccati-equation method solution to a standard H(infinity) control problem can be used to characterize all possible stabilizing optimal or suboptimal H(infinity) controllers if the optimal or suboptimal H(infinity) norm is available in the literature. An iterative algorithm for computing the optimal H(infinity) norm is proposed. The algorithm employs fixed-point, double secant and bisection to guarantee a super linear convergence.

Chang, B. C.↗

NASA NTRS1974

Optimal aeroelastic design of an oblique wing structure

A procedure is presented for determining the optimal cover panel thickness of a wing structure to meet specified strength and static aeroelastic divergence requirements for minimum weight. Efficient reanalysis techniques using discrete structural and aerodynamic methods are used in conjunction with redesign algorithms driven by optimality criteria. The optimality conditions for the divergence constraint are established, and expressions are obtained for derivatives of the dynamic pressure at divergence with respect to design variables. The procedure is applied to an oblique wing aircraft where strength and stiffness are critical design considerations for sizing the cover thickness of the wing structure.

Gwin, L. B.↗

NASA NTRS1991

Multiphase complete exchange on a circuit switched hypercube

On a distributed memory parallel computer, the complete exchange (all-to-all personalized) communication pattern requires each of n processors to send a different block of data to each of the remaining n - 1 processors. This pattern is at the heart of many important algorithms, most notably the matrix transpose. For a circuit switched hypercube of dimension d(n = 2(sup d)), two algorithms for achieving complete exchange are known. These are (1) the Standard Exchange approach that employs d transmissions of size 2(sup d-1) blocks each and is useful for small block sizes, and (2) the Optimal Circuit Switched algorithm that employs 2(sup d) - 1 transmissions of 1 block each and is best for large block sizes. A unified multiphase algorithm is described that includes these two algorithms as special cases. The complete exchange on a hypercube of dimension d and block size m is achieved by carrying out k partial exchange on subcubes of dimension d(sub i) Sigma(sup k)(sub i=1) d(sub i) = d and effective block size m(sub i) = m2(sup d-di). When k = d and all d(sub i) = 1, this corresponds to algorithm (1) above. For the case of k = 1 and d(sub i) = d, this becomes the circuit switched algorithm (2). Changing the subcube dimensions d, varies the effective block size and permits a compromise between the data permutation and block transmission overhead of (1) and the startup overhead of (2). For a hypercube of dimension d, the number of possible combinations of subcubes is p(d), the number of partitions of the integer d. This is an exponential but very slowly growing function and it is feasible over these partitions to discover the best combination for a given message size. The approach was analyzed for, and implemented on, the Intel iPSC-860 circuit switched hypercube. Measurements show good agreement with predictions and demonstrate that the multiphase approach can substantially improve performance for block sizes in the 0 to 160 byte range. This range, which corresponds to 0 to 40 floating point numbers per processor, is commonly encountered in practical numeric applications. The multiphase technique is applicable to all circuit-switched hypercubes that use the common e-cube routing strategy.

Bokhari, Shahid H.↗

NASA NTRS1992

Spatial filters for shape control

Recently there has emerged a new class of sensors, called spatial filters, for structures which respond over a significant gauge length. Examples include piezoelectric laminate PVDF film, modal domain optical fiber sensors, and holographic sensors. These sensors have a unique capability in that they can be fabricated to locally alter their sensitivity to the measurand. In this paper we discuss how these sensors can be used for the implementation of control algorithms for the suppression of acoustic radiation from flexible structures. Based on this relationship between the total power radiated to the far field to the modal velocities of the structure, we show how the sensor placement to optimize the control algorithm to suppress the radiated power.

Lindner, Douglas K.↗

NASA NTRS2009

Motion Cueing Algorithm Modification for Improved Turbulence Simulation

Atmospheric turbulence cueing produced by flight simulator motion systems has been less than satisfactory because the turbulence profiles have been attenuated by the motion cueing algorithms. Cardullo and Ellor initially addressed this problem by directly porting the turbulence model output to the motion system. Reid and Robinson addressed the problem by employing a parallel aircraft model, which is only stimulated by the turbulence inputs and adding a filter specially designed to pass the higher turbulence frequencies. There have been advances in motion cueing algorithm development at the Man-Machine Systems Laboratory, at SUNY Binghamton. In particular, the system used to generate turbulence cues has been studied. The Reid approach, implemented by Telban and Cardullo, was employed to augment the optimal motion cueing algorithm installed at the NASA LaRC Simulation Laboratory, driving the Visual Motion Simulator. In this implementation, the output of the primary flight channel was added to the output of the turbulence channel and then sent through a non-linear cueing filter. The cueing filter is an adaptive filter; therefore, it is not desirable for the output of the turbulence channel to be augmented by this type of filter. The likelihood of the signal becoming divergent was also an issue in this design. After testing on-site it became apparent that the architecture of the turbulence algorithm was generating unacceptable cues. As mentioned above, this cueing algorithm comprised a filter that was designed to operate at low bandwidth. Therefore, the turbulence was also filtered, augmenting the cues generated by the model. If any filtering is to be done to the turbulence, it will utilize a filter with a much higher bandwidth, above the frequencies produced by the aircraft response to turbulence. The authors have developed an implementation wherein only the signal from the primary flight channel passes through the nonlinear cueing filter. This paper discusses three new algorithms. Testing shows that the new methods provide the pilot with a more realistic sensation of turbulence; the cues are not attenuated by algorithm. Results of offline testing show the credibility of the models. Offline test verification was based primarily on the evaluation of the power spectral density of the outputs and the time response.

Ercole, Anthony V.↗

NASA NTRS2011

TPSAS-NF1676L-12441-DND

The increasing presence of airport surface surveillance technologies has spawned a strong interest in airport surface traffic management research; the vast majority has assumed that the airport’s runway configuration is known and constant. Tactical Runway Configuration Management (TRCM), one component of NASA’s System Oriented Runway Management concept, plans the airport configuration to optimize traffic efficiency for the forecast weather, traffic, and other factors. While planning runway configuration can provide benefit and is required by other automation concepts, larger benefits are possible by planning other airport configuration decisions, such as runway assignment policies, that are currently made manually by controllers. A laboratory prototype of the TRCM algorithm which selects optimal airport configuration schedules has been implemented and studied within a simulation environment. The presentation will describe simulation results for several airports, under various weather and traffic conditions. The sequence of airport configurations recommended by TRCM result in significantly less delay than the airport configurations that were actually used by controllers, illustrating both the potential benefit from airport configuration optimization and the ability of TRCM to provide effective airport configuration schedules. The application to several, distinct airports demonstrates the approach is capable of handling the differences between airports with a common algorithm, while providing decision support that respects the current procedures at those airports. Consequently, TRCM is able to be deployed to any airport within the current National Airspace System. The TRCM algorithmic approach is also extensible to future operational scenarios. NASA is in the process of transferring the initial TRCM technology to the FAA. Future research will extend the concept and algorithm to provide coordinated plans for metroplex airports and study NextGen applications.

Stephen Atkins↗

NASA NTRS2011

TPSAS-NF1676L-12263-DND

Stephen Atkins↗

NASA NTRS1996

Genetic algorithms in conceptual design of a light-weight, low-noise, tilt-rotor aircraft

This report outlines research accomplishments in the area of using genetic algorithms (GA) for the design and optimization of rotorcraft. It discusses the genetic algorithm as a search and optimization tool, outlines a procedure for using the GA in the conceptual design of helicopters, and applies the GA method to the acoustic design of rotors.

Wells, Valana L.↗

NASA NTRS1996

Genetic algorithms in conceptual design of a light-weight, low-noise, tilt-rotor aircraft

Wells, Valana L.↗