Search NASA⌕ Search

SEARCH · Search NASA

Results for “variational 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 217 records · Page 12

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗

Shuttle payload vibroacoustic test plan evaluation. Free flyer payload applications and sortie payload parametric variations

A preliminary assessment of vibroacoustic test plan optimization for free flyer STS payloads is presented and the effects on alternate test plans for Spacelab sortie payloads number of missions are also examined. The component vibration failure probability and the number of components in the housekeeping subassemblies are provided. Decision models are used to evaluate the cost effectiveness of seven alternate test plans using protoflight hardware.

Stahle, C. V.↗

Aerodynamic Shape Optimization using an Evolutionary Algorithm

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Hoist, Terry L.↗

A method for determining optimum phasing of a multiphase propulsion system for a single-stage vehicle with linearized inert weight

A general analytical treatment is presented of a single-stage vehicle with multiple propulsion phases. A closed-form solution for the cost and for the performance and a derivation of the optimal phasing of the propulsion are included. Linearized variations in the inert weight elements are included, and the function to be minimized can be selected. The derivation of optimal phasing results in a set of nonlinear algebraic equations for optimal fuel volumes, for which a solution method is outlined. Three specific example cases are analyzed: minimum gross lift-off weight, minimum inert weight, and a minimized general function for a two-phase vehicle. The results for the two-phase vehicle are applied to the dual-fuel rocket. Comparisons with single-fuel vehicles indicate that dual-fuel vehicles can have lower inert weight either by development of a dual-fuel engine or by parallel burning of separate engines from lift-off.

Martin, J. A.↗

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

Improved techniques for outgoing wave variational principle calculations of converged state-to-state transition probabilities for chemical reactions

Improved techniques and well-optimized basis sets are presented for application of the outgoing wave variational principle to calculate converged quantum mechanical reaction probabilities. They are illustrated with calculations for the reactions D + H2 yields HD + H with total angular momentum J = 3 and F + H2 yields HF + H with J = 0 and 3. The optimization involves the choice of distortion potential, the grid for calculating half-integrated Green's functions, the placement, width, and number of primitive distributed Gaussians, and the computationally most efficient partition between dynamically adapted and primitive basis functions. Benchmark calculations with 224-1064 channels are presented.

Mielke, Steven L.↗

Packing Optimization of Sorbent Bed Containing Dissimilar and Irregular Shaped Media

The Fire Cartridge is a packed bed air filter with two different and separate layers of media designed to provide respiratory protection from combustion products after a fire event on the International Space Station (ISS). The first layer of media is a carbon monoxide catalyst and the second layer of media is universal carbon. During development of Fire Cartridge prototypes, the two media beds were noticed to have shifted inside the cartridge. The movement of media within the cartridge can cause mixing of the bed layers, air voids, and channeling, which could cause preferential air flow and allow contaminants to pass through without removal. An optimally packed bed mitigates these risks and ensures effective removal of contaminants from the air. In order to optimally pack each layer, vertical, horizontal, and orbital agitations were investigated and a packed bulk density was calculated for each method. Packed bulk density must be calculated for each media type to accommodate variations in particle size, shape, and density. Additionally, the optimal vibration parameters must be re-evaluated for each batch of media due to variations in particle size distribution between batches. For this application it was determined that orbital vibrations achieve an optimal pack density and the two media layers can be packed by the same method. Another finding was media with a larger size distribution of particles achieve an optimal bed pack easier than media with a smaller size distribution of particles.

Holland, Nathan↗

Method for Reducing Pumping Damage to Blood

Methods are provided for minimizing damage to blood in a blood pump wherein the blood pump comprises a plurality of pump components that may affect blood damage such as clearance between pump blades and housing, number of impeller blades, rounded or flat blade edges, variations in entrance angles of blades, impeller length, and the like. The process comprises selecting a plurality of pump components believed to affect blood damage such as those listed herein before. Construction variations for each of the plurality of pump components are then selected. The pump components and variations are preferably listed in a matrix for easy visual comparison of test results. Blood is circulated through a pump configuration to test each variation of each pump component. After each test, total blood damage is determined for the blood pump. Preferably each pump component variation is tested at least three times to provide statistical results and check consistency of results. The least hemolytic variation for each pump component is preferably selected as an optimized component. If no statistical difference as to blood damage is produced for a variation of a pump component, then the variation that provides preferred hydrodynamic performance is selected. To compare the variation of pump components such as impeller and stator blade geometries, the preferred embodiment of the invention uses a stereolithography technique for realizing complex shapes within a short time period.

Bozeman, Richard J., Jr.↗

Robust Optimization Design Algorithm for High-Frequency TWTs

Traveling-wave tubes (TWTs), such as the Ka-band (26-GHz) model recently developed for the Lunar Reconnaissance Orbiter, are essential as communication amplifiers in spacecraft for virtually all near- and deep-space missions. This innovation is a computational design algorithm that, for the first time, optimizes the efficiency and output power of a TWT while taking into account the effects of dimensional tolerance variations. Because they are primary power consumers and power generation is very expensive in space, much effort has been exerted over the last 30 years to increase the power efficiency of TWTs. However, at frequencies higher than about 60 GHz, efficiencies of TWTs are still quite low. A major reason is that at higher frequencies, dimensional tolerance variations from conventional micromachining techniques become relatively large with respect to the circuit dimensions. When this is the case, conventional design- optimization procedures, which ignore dimensional variations, provide inaccurate designs for which the actual amplifier performance substantially under-performs that of the design. Thus, this new, robust TWT optimization design algorithm was created to take account of and ameliorate the deleterious effects of dimensional variations and to increase efficiency, power, and yield of high-frequency TWTs. This design algorithm can help extend the use of TWTs into the terahertz frequency regime of 300-3000 GHz. Currently, these frequencies are under-utilized because of the lack of efficient amplifiers, thus this regime is known as the "terahertz gap." The development of an efficient terahertz TWT amplifier could enable breakthrough applications in space science molecular spectroscopy, remote sensing, nondestructive testing, high-resolution "through-the-wall" imaging, biomedical imaging, and detection of explosives and toxic biochemical agents.

Wilson, Jeffrey D.↗

Implementation of Topology Optimization Using OpenMDAO

Topology optimization is one of the widely known branches among the structural optimization, and it distinguishes itself by a large design domain and versatility. It can determine the optimal design out of an infinite number of configurations, thereby drawing interest from both industry and academia with regards to its applicability to additive manufacturing. However, its implementation is often a daunting task for engineers in practice. One of the issues is the programming effort required whenever the implementation requires any changes, ranging from subtle tweaks to drastic changes in the problem definition, and the derivative computation must be correspondingly updated after any change. The implementation, therefore, is not only time-consuming but also repetitive and susceptible to human-induced errors. In this regard, topology optimization implementations stand to benefit from reusability, ease of restructuring, and modularity. In this work, we propose OpenMDAO, a computational framework for multidisciplinary design optimization (MDO), as a generic platform for topology optimization. Two widely used topology optimization techniquesâ€"density-based and level-setâ€"are implemented as a demonstration. These techniques are implemented in a decomposed manner, with the aid of the modular architecture of OpenMDAO as well as state-of-the-art numerical methods. Variations on the density-based topology optimization approach are shown to demonstrate the modularity and automation for derivative computation that OpenMDAO provides.

Chung, Hayoung↗

Optimal inference with chaotic dynamics

Nonlinear mappings that exhibit chaotic, seemingly random, evolution have appeal as models of dynamic systems. Their deterministic evolution, vis-a-vis Markov evolutions, results in much simpler optimal detection and estimation algorithms. The variation of a chaotic parameter (mu) results in diverse evolutions, suggesting a simple but rich source of model variations. For the specific mapping examined, this latter possibility is problematic due to the extreme sensitivity on mu of the evolution in the chaotic regime.

Harger, R. O.↗

Accurate interlaminar stress recovery from finite element analysis

The accuracy and robustness of a two-dimensional smoothing methodology is examined for the problem of recovering accurate interlaminar shear stress distributions in laminated composite and sandwich plates. The smoothing methodology is based on a variational formulation which combines discrete least-squares and penalty-constraint functionals in a single variational form. The smoothing analysis utilizes optimal strains computed at discrete locations in a finite element analysis. These discrete strain data are smoothed with a smoothing element discretization, producing superior accuracy strains and their first gradients. The approach enables the resulting smooth strain field to be practically C1-continuous throughout the domain of smoothing, exhibiting superconvergent properties of the smoothed quantity. The continuous strain gradients are also obtained directly from the solution. The recovered strain gradients are subsequently employed in the integration o equilibrium equations to obtain accurate interlaminar shear stresses. The problem is a simply-supported rectangular plate under a doubly sinusoidal load. The problem has an exact analytic solution which serves as a measure of goodness of the recovered interlaminar shear stresses. The method has the versatility of being applicable to the analysis of rather general and complex structures built of distinct components and materials, such as found in aircraft design. For these types of structures, the smoothing is achieved with 'patches', each patch covering the domain in which the smoothed quantity is physically continuous.

Tessler, Alexander↗

On the Efficacy of Source Code Optimizations for Cache-Based Systems

Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates - as reported by a cache simulation tool, and confirmed by hardware counters - only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.

VanderWijngaart, Rob F.↗

On the Efficacy of Source Code Optimizations for Cache-Based Systems

Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates-as reported by a cache simulation tool, and confirmed by hardware counters-only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.

VanderWijngaart, Rob F.↗

The Development of Design Tools for Fault Tolerant Quantum Dot Cellular Automata Based Logic

We are developing software to explore the fault tolerance of quantum dot cellular automata gate architectures in the presence of manufacturing variations and device defects. The Topology Optimization Methodology using Applied Statistics (TOMAS) framework extends the capabilities of the A Quantum Interconnected Network Array Simulator (AQUINAS) by adding front-end and back-end software and creating an environment that integrates all of these components. The front-end tools establish all simulation parameters, configure the simulation system, automate the Monte Carlo generation of simulation files, and execute the simulation of these files. The back-end tools perform automated data parsing, statistical analysis and report generation.

Armstrong, Curtis D.↗