SEARCH · Engineering Papers
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.
Computer program finds values of independent variables which minimize the dependent variable. This optimization program has been used on the F-1 and J-2 engine programs to establish minimum film coolant requirements.
Overall program completeness is optimized by selecting the ordered set of observations and targets that maximizes the efficiency for the ensemble of stars. We describe the optimization approach and report on completeness sensitivity to instrument throughput, inner working angle, instrument sensitivity, observational overhead, exo-zodiacal brightness, and target revisit constraints.
The design of a composite panel requires some way of finding the minimum thickness laminate which will withstand the load requirements without failure. The mathematical complexity of this problem dictates the use of nonlinear optimization techniques. Specialized laminate optimization programs were developed which are compact and efficient enough to run on microcomputers. Only stresses at a point and inplane loads and deflections are considered. The programs are simple to use and require no knowledge of optimization. Techniques are developed which find minimum thickness laminates with either ply ratios or ply angles as design variables. A method is presented for finding the optimum orientation for the axis of symmetry of an orthotropic laminate. The orthotropic laminate program uses an approximate failure theory, which speed up computations dramatically.
The JPL-IDEAS antenna structure analysis and design optimization computer program was modified to process half structure models of symmetric structures subjected to arbitrary external static loads, synthesize the performance, and optimize the design of the full structure. Significant savings in computation time and cost (more than 50%) were achieved compared to the cost of full model computer runs. The addition of the new reflective symmetry analysis design capabilities to the IDEAS program allows processing of structure models whose size would otherwise prevent automated design optimization. The new program produced synthesized full model iterative design results identical to those of actual full model program executions at substantially reduced cost, time, and computer storage.
Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.
A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparsion was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.
A performance-analysis computer program, that was developed explicitly to generate optimum electric propulsion trajectory data for missions of interest in the exploration of the solar system is presented. The program was primarily designed to evaluate the performance capabilities of electric propulsion systems, and in the simulation of a wide variety of interplanetary missions. A numerical integration of the two-body, three-dimensional equations of motion and the Euler-Lagrange equations was used in the program. Transversality conditions which permit the rapid generation of converged maximum-payload trajectory data, and the optimization of numerous other performance indices for which no transversality conditions exist are included. The ability to simulate constrained optimum solutions, including trajectories having specified propulsion time and constant thrust cone angle, is also in the program. The program was designed to handle multiple-target missions with various types of encounters, such as rendezvous, stopover, orbital capture, and flyby. Performance requirements for a variety of launch vehicles can be determined.
The modifications and improvements made to the HILTOP electric propulsion trajectory optimization computer program up through the end of 1974 is described. New program features include the simulation of power degradation, housekeeping power, launch asymptote declination optimization, and powered and unpowered ballistic multiple swingby missions with an optional deep space burn. The report contains the new analysis describing these features, a complete description of program input quantities, and sample cases of computer output illustrating the new program capabilities.
Digital computer program for interplanetary trajectory optimization and variable thrust data
For abstract, see N75-28084.
The thermal vacuum test optimization model developed to provide an approach to the optimization of a test program based on prediction of flight performance with a single flight option in mind is extended to consider reflight as in space shuttle missions. The concept of 'utility', developed under the name of 'availability', is used to follow performance through the various options encountered when the capabilities of reflight and retrievability of space shuttle are available. Also, a 'lost value' model is modified to produce a measure of the probability of a mission's success, achieving a desired utility using a minimal cost test strategy. The resulting matrix of probabilities and their associated costs provides a means for project management to evaluate various test and reflight strategies.
Optimal trajectory geometry and thrust programming
Modifications and improvements are described that were made to the HILTOP electric propulsion trajectory optimization computer program during calendar years 1973 and 1974. New program features include the simulation of power degradation, housekeeping power, launch asymptote declination optimization, and powered and unpowered ballistic multiple swingby missions with an optional deep space burn.
Optimization of space vehicle thrust program with prespecified thrust directions - flight mechanics
Computer program, OPEX 2, determines minimum weight, volume, or cost for shields. Program incorporates improved coding, simplified data input, spherical geometry, and an expanded output. Method is capable of altering dose-thickness relationship when a shield layer has been removed.
The mathematical statement of the general nonlinear optimization problem is given as follows: find the vector of design variables, X, that will minimize f(X) subject to G sub J (x) + or - 0 j=1,m H sub K hk(X) = 0 k=1,l X Lower I approx less than X sub I approx. less than X U over I i = 1,N. The vector of design variables, X, includes all those variables which may be changed by the ADS program in order to arrive at the optimum design. The objective function F(X) to be minimized may be weight, cost or some other performance measure. If the objective is to be maximized, this is accomplished by minimizing -F(X). The inequality constraints include limits on stress, deformation, aeroelastic response or controllability, as examples, and may be nonlinear implicit functions of the design variables, X. The equality constraints h sub k(X) represent conditions that must be satisfied precisely for the design to be acceptable. Equality constraints are not fully operational in version 1.0 of the ADS program, although they are available in the Augmented Lagrange Multiplier method. The side constraints given by the last equation are used to directly limit the region of search for the optimum. The ADS program will never consider a design which is not within these limits.
Copernicus is a spacecraft trajectory design and optimization application developed at the NASA Johnson Space Center. Copernicus is written in Fortran and uses many features of the latest language standards. The tool is used for a wide range of projects at NASA, including the upcoming Artemis missions to flight test the Orion spacecraft and then return humans to the Moon. This presentation gives a brief overview of the software, its history, how it was designed, and how it is used.
This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.