Search NASA⌕ Search

SEARCH · Search NASA

Results for “Program 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Improved method for transonic airfoil design-by-optimization

An improved method for use of optimization techniques in transonic airfoil design is demonstrated. FLO6QNM incorporates a modified quasi-Newton optimization package, and is shown to be more reliable and efficient than the method developed previously at NASA-Ames, which used the COPES/CONMIN optimization program. The design codes are compared on a series of test cases with known solutions, and the effects of problem scaling, proximity of initial point to solution, and objective function precision are studied. In contrast to the older method, well-converged solutions are shown to be attainable in the context of engineering design using computational fluid dynamics tools, a new result. The improvements are due to better performance by the optimization routine and to the use of problem-adaptive finite difference step sizes for gradient evaluation.

Kennelly, R. A., Jr.↗
NASA NTRS1989

Error analysis for semi-analytic displacement derivatives with respect to shape and sizing variables

Sensitivity analysis is fundamental to the solution of structural optimization problems. Consequently, much research has focused on the efficient computation of static displacement derivatives. As originally developed, these methods relied on analytical representations for the derivatives of the structural stiffness matrix (K) with respect to the design variables (b sub i). To extend these methods for use with complex finite element formulations and facilitate their implementation into structural optimization programs using the general finite element method analysis codes, the semi-analytic method was developed. In this method the matrix the derivative of K/the derivative b sub i is approximated by finite difference. Although it is well known that the accuracy of the semi-analytic method is dependent on the finite difference parameter, recent work has suggested that more fundamental inaccuracies exist in the method when used for shape optimization. Another study has argued qualitatively that these errors are related to nonuniform errors in the stiffness matrix derivatives. The accuracy of the semi-analytic method is investigated. A general framework was developed for the error analysis and then it is shown analytically that the errors in the method are entirely accounted for by errors in delta K/delta b sub i. Furthermore, it is demonstrated that acceptable accuracy in the derivatives can be obtained through careful selection of the finite difference parameter.

Fenyes, Peter A.↗
NASA NTRS1986

An adaptive guidance algorithm for an aerodynamically assisted orbital plane change maneuver

Using analysis results from the post trajectory optimization program, an adaptive guidance algorithm is developed to compensate for density, aerodynamic and thrust perturbations during an atmospheric orbital plane change maneuver. The maneuver offers increased mission flexibility along with potential fuel savings for future reentry vehicles. Although designed to guide a proposed NASA Entry Research Vehicle, the algorithm is sufficiently generic for a range of future entry vehicles. The plane change analysis provides insight suggesting a straight-forward algorithm based on an optimized nominal command profile. Bank angle, angle of attack, and engine thrust level, ignition and cutoff times are modulated to adjust the vehicle's trajectory to achieve the desired end-conditions. A performance evaluation of the scheme demonstrates a capability to guide to within 0.05 degrees of the desired plane change and five nautical miles of the desired apogee altitude while maintaining heating constraints. The algorithm is tested under off-nominal conditions of + or -30% density biases, two density profile models, + or -15% aerodynamic uncertainty, and a 33% thrust loss and for various combinations of these conditions.

Blissit, J. A.↗
NASA NTRS2012

Preliminary Sizing Study of Ares-I and Ares-V Liquid Hydrogen Tanks

A preliminary sizing study of two cryogenic propellant tanks was performed using a FORTRAN optimization program to determine weight efficient orthogrid designs for the tank barrels sections only. Various tensile and compressive failure modes were considered, including general buckling of cylinders with a shell buckling knockdown factor. Eight independent combinations of three design requirements were also considered and their effects on the tanks weight. The approach was to investigate each design case with a variable shell buckling knockdown factor, determining the most weight efficient combination of orthogrid design parameters. Numerous optimization analyses were performed, and the results presented herein compare the effects of the different design requirements and shell buckling knockdown factor. Through a series of comparisons between design requirements or shell buckling knockdown factors, the relative change in overall tank barrel weights is shown. The findings indicate that the design requirements can substantually increase the tank weight while a less conservative shell buckling knockdown factor can modestly reduce the tank weight.

Oliver, Stanley T.↗
NASA NTRS1979

Combined strength and aeroelastic wing synthesis via constraint approximation

A numerical optimization program using constraint approximations for preliminary sizing of wing structural design parameters to satisfy simultaneous strength and aeroelastic requirements is described. The effects of wing flexibility on loads and flutter are included. The iterative procedure approximates wing internal load distributions and flutter response in generating design constraints. Though a linear Taylor series approximation to the variation of flutter speed is made, constraints in general are formulated as nonlinear and solved in a minimum weight problem using a feasible directions search. The technique is demonstrated for the determination of the optimal ply orientations and for simultaneous sizing for strength and flutter with simple constraint approximations.

Mullen, J., Jr.↗
NASA NTRS1989

An integrated approach to the optimum design of actively controlled composite wings

The importance of interactions among the various disciplines in airplane wing design has been recognized for quite some time. With the introduction of high gain, high authority control systems and the design of thin, flexible, lightweight composite wings, the integrated treatment of control systems, flight mechanics and dynamic aeroelasticity became a necessity. A research program is underway now aimed at extending structural synthesis concepts and methods to the integrated synthesis of lifting surfaces, spanning the disciplines of structures, aerodynamics and control for both analysis and design. Mathematical modeling techniques are carefully selected to be accurate enough for preliminary design purposes of the complicated, built-up lifting surfaces of real aircraft with their multiple design criteria and tight constraints. The presentation opens with some observations on the multidisciplinary nature of wing design. A brief review of some available state of the art practical wing optimization programs and a brief review of current research effort in the field serve to illuminate the motivation and support the direction taken in our research. The goals of this research effort are presented, followed by a description of the analysis and behavior sensitivity techniques used. The presentation concludes with a status report and some forecast of upcoming progress.

Livne, E.↗
NASA NTRS1986

Optimal partitioning of random programs across two processors

The optimal partitioning of random distributed programs is discussed. It is concluded that the optimal partitioning of a homogeneous random program over a homogeneous distributed system either assigns all modules to a single processor, or distributes the modules as evenly as possible among all processors. The analysis rests heavily on the approximation which equates the expected maximum of a set of independent random variables with the set's maximum expectation. The results are strengthened by providing an approximation-free proof of this result for two processors under general conditions on the module execution time distribution. It is also shown that use of this approximation causes two of the previous central results to be false.

Nicol, D. M.↗
NASA NTRS1985

Large scale structural synthesis

A general purpose optimization program is coupled to a large scale finite element program to provide an efficient tool for structural synthesis. The resulting interface program may be used to design structures for minimum weight, subject to constraints on stress, displacement, and vibration frequencies. A variety of state-of-the-art techniques are employed, including design variable linking, constraint deletion, reciprocal variables, and formal approximations. The capability is demonstrated with the design of a gear housing using 30 design variables and over 5000 nonlinear inequality constraints. The finite element model consists of over 1600 elements and 7000 displacement degrees of freedom. The design required six detailed finite element analyses and approximately one hour on a Cray-1s supercomputer. It is concluded that structures of practical size and complexity can be efficiently designed using numerical optimization.

Vanderplaats, G. N.↗
NASA NTRS2019

Scenario Complexity for Unmanned Aircraft System Traffic

This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time apA quick and accurate assessment of complexity for a given traffic scenario can help plan and schedule flights to alleviate traffic bottleneck and mitigate operation risks, especially for unmanned aerial system traffic management where high traffic density or complexity is expected. This work introduces a traffic scenario complexity metric that was constructed based on the number of potential conflicts weighted by the conflict resolution cost associated. The cost associated with a conflict is calculated based on the corresponding conflict resolution maneuvers. To obtain the conflict resolution maneuvers, a MILP-based optimization was formulated with the vehicle model and conflict management parameters incorporated. To evaluate the complexity metrics, an approach of using measurements from high-fidelity simulations was proposed. The scenario complexity measurements for 920 random-generated scenarios were obtained through high-fidelity simulations and treated as the ground truth. Two statistics methods: Pearson and Alternative Conditional Expectations were applied for analysis. The results showed that the number of flights has low correlation with the scenario complexity according to the correlation coefficients calculated by both methods. The Alternative Conditional Expectations method shows that the proposed scenario complexity metric has better correlation with the ground truth than the number of potential conflicts.plications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.

traffic complexity↗
NASA NTRS1989

Optimal partitioning of random programs across two processors

The optimal partitioning of random-distributed programs is discussed. It is concluded that the optimal partitioning of a homogeneous random program over a homogeneous distributed system either assigns all modules to a single processor, or distributes the modules as evenly as possible among all processors. The analysis rests heavily on the approximation which equates the expected maximum of a set of independent random variables with the set's maximum expectation. The results are strengthened by providing an approximation-free proof of this result for two processors under general conditions on the module execution time distribution. It is also shown that use of this approximation causes two of the previous central results to be false.

Nicol, David M.↗
NASA NTRS1963

Optimizations of Human Restraint Systems for Short-Period Acceleration

A restraint system's main function is to restrain its occupant when his vehicle is subjected to acceleration. If the restraint system is rigid and well-fitting (to eliminate slack) then it will transmit the vehicle acceleration to its occupant without modifying it in any way. Few present-day restraint systems are stiff enough to give this one-to-one transmission characteristic, and depending upon their dynamic characteristics and the nature of the vehicle's acceleration-time history, they will either magnify or attenuate the acceleration. Obviously an optimum restraint system will give maximum attenuation of an input acceleration. In the general case of an arbitrary acceleration input, a computer must be used to determine the optimum dynamic characteristics for the restraint system. Analytical solutions can be obtained for certain simple cases, however, and these cases are considered in this paper, after the concept of dynamic models of the human body is introduced. The paper concludes with a description of an analog computer specially developed for the Air Force to handle completely general mechanical restraint optimization programs of this type, where the acceleration input may be any arbitrary function of time.

Payne, P. R.↗