Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 721 records · Page 40

Inclusion of known integrals in the optimal trajectory problem

The classical problem of determination of the rocket trajectory which minimizes mass expenditure during motion between two points in the field of a single gravitating body is analyzed. The known integrals of the system are incorporated into the adjoint equations resulting in a reduction from a seventh-order adjoint system to a third-order adjoint system. The first case which is treated in that of planar motion under specific end conditions. In this case a regularization of the recently derived equations is achieved. The general three-dimensional case is also reduced from a seventh-order adjoint system to a third-order adjoint system. In this case a regularization has not been found.

Burns, R. E.↗

A solution to the problem of optimizing the fuel bias for a liquid propellant rocket by an application of the central limit theorem

A method of determining the fuel bias for a bipropellant liquid rocket that minimizes outage associated penalties on payload potential is presented. A fuel bias so derived is normally called the optimum fuel bias. The subjects discussed are: (1) probability density function of outage, (2) computer program listing, and (3) choosing the optimum fuel bias.

Viera, W. J.↗

Study of genetic direct search algorithms for function optimization

The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.

Zeigler, B. P.↗

Nonlinear singularly perturbed optimal control problems with singular arcs

Singular perturbation techniques are studied for dealing with singular arc problems by analyzing a relatively low-order but otherwise general system. This system encompasses many flight mechanic problems including Goddard's problem and a version of the minimum time-to-climb problem. Boundary layer solutions are constructed which are stable and reach the outer solution in a finite time. A uniformly valid composite solution is then formed from the reduced and boundary layer solutions. The value of the approximate solution is that it is relatively easy to obtain and does not involve singular arcs. To illustrate the utility of the results, the technique is used to obtain an approximate solution of a simplified version of the aircraft minimum time-to-climb problem.

Ardema, M. D.↗