Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2019

Efficient computation of optimal low thrust gravity perturbed orbit transfers

We have developed a new method for solving low-thrust fuel-optimal orbit transfer problems in the vicinity of a large body (planet or asteroid), considering a high-fidelity spherical harmonic gravity model. The algorithm is formulated via the indirect optimization method, leading to a two-point boundary value problem (TPBVP). We make use of a hyperbolic tangent smoothing law for performing continuation on the thrust magnitude to reduce the sharpness of the control switches in early iterations and thus promote convergence. The TPBVP is solved using the method of particular solutions (MPS) shooting method and Picard-Chebyshev numerical integration. Application of Picard-Chebyshev integration affords an avenue for increased efficiency that is not available with step-by-step integrators. We demonstrate that computing the particular solutions with only a low-fidelity force model greatly increases the efficiency of the algorithm while ultimately achieving near machine precision accuracy. A salient feature of the MPS is that it is parallelizable, and thus further speedups are available. It is also shown that, for near Earth orbits and over a small number of en-route revolutions around the Earth, only the zonal perturbation terms are required in the costate equations to obtain a solution that is accurate to machine precision and optimal to engineering precision. The proposed framework can be used for trajectory design around small asteroids and also for orbit debris rendezvous and removal tasks.

Junkins, John L.↗
NASA NTRS1972

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗
NASA NTRS1972

Computation of optimal output-feedback compensators for linear time-invariant systems

The control of linear time-invariant systems with respect to a quadratic performance criterion was considered, subject to the constraint that the control vector be a constant linear transformation of the output vector. The optimal feedback matrix, f*, was selected to optimize the expected performance, given the covariance of the initial state. It is first shown that the expected performance criterion can be expressed as the ratio of two multinomials in the element of f. This expression provides the basis for a feasible method of determining f* in the case of single-input single-output systems. A number of iterative algorithms are then proposed for the calculation of f* for multiple input-output systems. For two of these, monotone convergence is proved, but they involve the solution of nonlinear matrix equations at each iteration. Another is proposed involving the solution of Lyapunov equations at each iteration, and the gradual increase of the magnitude of a penalty function. Experience with this algorithm will be needed to determine whether or not it does, indeed, possess desirable convergence properties, and whether it can be used to determine the globally optimal f*.

Platzman, L. K.↗
NASA NTRS1983

Computation of optimal feedback strategies for interception in a horizontal plane

The problem of minimum-time interception of a target moving in a horizontal plane is studied. The target may fly a trajectory that is known at the start of the interception or try to evade the intercepting aircraft. The interceptor's optimal motion is described independently of the target in terms of an extremal trajectory map. The latter is used to develop guidelines for suboptimal approximations to the extremals. A method of constructing the feedback solution by drawing isochrones (constant minimum-time loci) is developed. Sections of the feedback solution for the interception of a straight-flying target are presented, and the construction of an isochrone for the interception of an actively evading target is demonstrated.

Rajan, N.↗
NASA NTRS1992

Structural optimization of thin shells using finite element method

The objective of the present work was the structural optimization of thin shell structures that are subjected to stress and displacement constraints. In order to accomplish this, the structural optimization computer program DESAP1 was modified and improved. In the static analysis part of the DESAP1 computer program the torsional spring elements, which are used to analyze thin, shallow shell structures, were eliminated by modifying the membrane stiffness matrix of the triangular elements in the local coordinate system and adding a fictitious rotational stiffness matrix. This simplified the DESAP1 program input, improved the accuracy of the analysis, and saved computation time. In the optimization part of the DESAP1 program the stress ratio formula, which redesigns the thickness of each finite element of the structure, was solved by an analytical method. This scheme replaced the iterative solution that was previously used in the DESAP1 program, thus increasing the accuracy and speed of the design. The modified program was used to design a thin, cylindrical shell structure with optimum weight, and the results are reported in this paper.

Gotsis, Pascal K.↗
NASA NTRS1993

Theory and computation of optimal low- and medium-thrust transfers

This report presents the formulation of the optimal low- and medium-thrust orbit transfer control problem and methods for numerical solution of the problem. The problem formulation is for final mass maximization and allows for second-harmonic oblateness, atmospheric drag, and three-dimensional, non-coplanar, non-aligned elliptic terminal orbits. We setup some examples to demonstrate the ability of two indirect methods to solve the resulting TPBVP's. The methods demonstrated are the multiple-point shooting method as formulated in H. J. Oberle's subroutine BOUNDSCO, and the minimizing boundary-condition method (MBCM). We find that although both methods can converge solutions, there are trade-offs to using either method. BOUNDSCO has very poor convergence for guesses that do not exhibit the correct switching structure. MBCM, however, converges for a wider range of guesses. However, BOUNDSCO's multi-point structure allows more freedom in quesses by increasing the node points as opposed to only quessing the initial state in MBCM. Finally, we note an additional drawback for BOUNDSCO: the routine does not supply information to the users routines for switching function polarity but only the location of a preset number of switching points.

Chuang, C.-H.↗
NASA NTRS1993

Computer facilities optimization studies

A comprehensive plan was developed to determine the best options for integrating and upgrading various ADP systems in scientific research environments, such as at NASA Ames Research Center.

Lyle, Gilbert C.↗
NASA NTRS1993

Computation of optimal low- and medium-thrust orbit transfers

This paper presents the formulation of the optimal low- and medium-thrust orbit transfer control problem, numerical methods for solution, and numerical solutions of the problem. The problem formulation is for final mass maximization and allows for second-harmonic oblateness, atmospheric drag, and 3D noncoplanar nonaligned elliptic terminal orbits. We set up examples to demonstrate the ability of two indirect methods to solve the resulting two point boundary value problems (TPBVP). The methods demonstrated are the multiple point shooting method as formulated in Oberle's (1987) subroutine BOUNDSCO, and the minimizing boundary-condition method (MBCM). We find that although both methods can converge solutions, there are tradeoffs to using either method. We present numerical solutions of planar transfers in which both the initial orbit exit and final orbit entry points have been optimized. These solutions include two- and three-burn transfers. The methods used show an ability to handle thrust down to at least T/W(o) = O(10 exp -3). They also show similar convergence abilities with or without the oblateness and drag terms. We discuss the issue of maximizing with respect to the final time and provide evidence that implies a local optimum at a maximum final time for a given number of burns.

Chuang, C.-H.↗
NASA NTRS1994

Theory and computation of optimal low- and medium-thrust transfers

This report describes the current state of development of methods for calculating optimal orbital transfers with large numbers of burns. Reported on first is the homotopy-motivated and so-called direction correction method. So far this method has been partially tested with one solver; the final step has yet to be implemented. Second is the patched transfer method. This method is rooted in some simplifying approximations made on the original optimal control problem. The transfer is broken up into single-burn segments, each single-burn solved as a predictor step and the whole problem then solved with a corrector step.

Chuang, C.-H.↗
NASA NTRS1997

Aeroelastic, CFD, and Dynamic Computation and Optimization for Buffet and Flutter Application

The work presented in this paper include: 'Coupled and Uncoupled Bending-Torsion Responses of Twin-Tail Buffet'; 'Fluid/Structure Twin Tail Buffet Response Over a Wide Range of Angles of Attack'; 'Resent Advances in Multidisciplinary Aeronautical Problems of Fluids/Structures/Dynamics Interaction'; and'Development of a Coupled Fluid/Structure Aeroelastic Solver with Applications to Vortex Breakdown induced Twin Tail Buffeting.

Kandil, Osama A.↗
NASA NTRS1994

Massively Parallel Algorithms for Real-Time Wavefront Control of a Dense Adaptive Optics System

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. We have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. We develop a novel algorithm, designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, our algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures.

massively↗