Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 955 records · Page 53

Computational methods to obtain time optimal jet engine control

Dynamic Programming and the Fletcher-Reeves Conjugate Gradient Method are two existing methods which can be applied to solve a general class of unconstrained fixed time, free right end optimal control problems. New techniques are developed to adapt these methods to solve a time optimal control problem with state variable and control constraints. Specifically, they are applied to compute a time optimal control for a jet engine control problem.

Basso, R. J.↗

Improved calculation of optimum design sensitivity

Optimum design parameter sensitivity analysis has become an important topic in recent years. The principal reasons for obtaining optimum design sensitivity information with respect to various problem parameters are (l) to predict revised optimum designs, associated with specified perturbations of the problem parameters, without re-optimizing the problem and, (2) to provide sensitivity information in multilevel optimization strategies. Methods for calculating these derivatives were proposed by several authors. The most important drawback in estimating parameter sensitivities by the current methods is that they do not allow for changes in the active constraint set. Changes in the active constraint set produce discontinuities in the optimum design sensitivities, and therefore, a correct formulation has to be cast in terms of directional derivatives. Optimum design parameter sensitivity analysis is addressed in terms of directional derivatives so as to include possible discontinuities and it also presents a method for estimating optimum design sensitivities using finite differences.

Sepulveda, Abdon E.↗

On optimal control of linear systems in the presence of multiplicative noise

This correspondence considers the problem of optimal regulator design for discrete time linear systems subjected to white state-dependent and control-dependent noise in addition to additive white noise in the input and the observations. A pseudo-deterministic problem is first defined in which multiplicative and additive input disturbances are present, but noise-free measurements of the complete state vector are available. This problem is solved via discrete dynamic programming. Next is formulated the problem in which the number of measurements is less than that of the state variables and the measurements are contaminated with state-dependent noise. The inseparability of control and estimation is brought into focus, and an 'enforced separation' solution is obtained via heuristic reasoning in which the control gains are shown to be the same as those in the pseudo-deterministic problem. An optimal linear state estimator is given in order to implement the controller.

Joshi, S. M.↗

Analytical solution of the optimal three dimensional reentry problem using Chapman's exact equations

This paper presents the general solution for the optimal three dimensional aerodynamic control of a lifting vehicle entering a planetary atmosphere. A set of dimensionless variables is introduced, and the resulting exact equations of motion have the distinctive advantage that they are completely free of the physical characteristics of the vehicle. Furthermore, a general lift-drag polar is used to define the aerodynamic control. Hence, the results obtained apply to any type of vehicle of arbitrary weight, dimensions and shape, having an arbitrary polar and entering any planetary atmosphere.

Vinh, N. X.↗

Difference equation state approximations for nonlinear hereditary control problems

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems.

Rosen, I. G.↗

Difference equation state approximations for nonlinear hereditary control problems

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems. Previously announced in STAR as N83-33589

Rosen, I. G.↗

Optimal reentry guidance for aeroassisted orbit transfer vehicles

A three-state model is presented for analyzing the problem of optimal changes in heading with minimum energy loss for a hypersonic gliding vehicle. A further model order reduction to a single state model is examined using singular perturbation theory. The optimal solution for the reduced problem defines an optimal altitude profile dependent on the current energy of the vehicle. A separate boundary-layer analysis is used to account for altitude and flight path angle dynamics, and to obtain lift and bank angle control solutions. By considering alternative approximations to solve the boundary-layer problem, three guidance laws are obtained, each having a feedback form. The guidance laws are evaluated for a hypothetical vehicle, and compared to an optimal solution obtained using a multiple shooting algorithm.

Calise, Anthony J.↗

Development of an hp-version finite element method for computational optimal control

The purpose of this research effort was to begin the study of the application of hp-version finite elements to the numerical solution of optimal control problems. Under NAG-939, the hybrid MACSYMA/FORTRAN code GENCODE was developed which utilized h-version finite elements to successfully approximate solutions to a wide class of optimal control problems. In that code the means for improvement of the solution was the refinement of the time-discretization mesh. With the extension to hp-version finite elements, the degrees of freedom include both nodal values and extra interior values associated with the unknown states, co-states, and controls, the number of which depends on the order of the shape functions in each element. One possible drawback is the increased computational effort within each element required in implementing hp-version finite elements. We are trying to determine whether this computational effort is sufficiently offset by the reduction in the number of time elements used and improved Newton-Raphson convergence so as to be useful in solving optimal control problems in real time. Because certain of the element interior unknowns can be eliminated at the element level by solving a small set of nonlinear algebraic equations in which the nodal values are taken as given, the scheme may turn out to be especially powerful in a parallel computing environment. A different processor could be assigned to each element. The number of processors, strictly speaking, is not required to be any larger than the number of sub-regions which are free of discontinuities of any kind.

Hodges, Dewey H.↗

Aerodynamic Shape Optimization Benchmarks with Error Control and Automatic Parameterization

Results are presented for four optimization benchmark problems posed by the AIAA Aerodynamic Design Optimization Discussion Group. The benchmarks are intended to exercise optimization frameworks on representative airfoil and wing design problems. All problems involve drag minimization subject to geometric and aerodynamic constraints. Our design approach involves two forms of adaptation. First, the shape parameterization is gradually and automatically enriched from an initially coarse search space. Second, adjoint solutions are used to drive adaptive mesh refinement to control discretization error. The error threshold is tailored so that the nest meshes, with the greatest accuracy, are used only when nearing the optimum. On the inviscid airfoil design problem, while reducing the drag by a factor of 10, we show how the combination of progressive parameterization and tiered discretization error control can dramatically accelerate the optimization. On the viscous airfoil design problem, we use inviscid analysis-driven optimization to reduce the total drag by a factor of two. Next, we improve the span efficiency factor of a wing by performing twist optimization. Finally, we optimize the Common Research Model wing, managing to hold drag roughly fixed, while targeting an initially-violated pitching moment constraint. Our approach aims to introduce greater complexity and accuracy only when necessary to improve the design, and also support a greater degree of automation.

Anderson, George R.↗

Small Body GN&C Research Report: A Robust Model Predictive Control Algorithm with Guaranteed Resolvability

A robustly stabilizing MPC (model predictive control) algorithm for uncertain nonlinear systems is developed that guarantees the resolvability of the associated finite-horizon optimal control problem in a receding-horizon implementation. The control consists of two components; (i) feedforward, and (ii) feedback part. Feed-forward control is obtained by online solution of a finite-horizon optimal control problem for the nominal system dynamics. The feedback control policy is designed off-line based on a bound on the uncertainty in the system model. The entire controller is shown to be robustly stabilizing with a region of attraction composed of initial states for which the finite-horizon optimal control problem is feasible. The controller design for this algorithm is demonstrated on a class of systems with uncertain nonlinear terms that have norm-bounded derivatives, and derivatives in polytopes. An illustrative numerical example is also provided.

model predictive control algorithm (MPC)↗

Vehicle control for fuel optimization

The problem of predicting the minimum fuel trajectory for a six degree of freedom vehicle which has a motion characterized by the first order differential equations of translational and rotational dynamics is considered. The thrust direction and center of gravity of the vehicle are assumed to be fixed with respect to the vehicle. Thrust magnitude and the control moment are used as control variables and appear linearly in the equation of motion. Pontryagin's Maximum Principle is used to solve the variational problem. With this formulation, the extremal controls are bang-bang with the exception of the singular case.

Dannenberg, K. D.↗

A robust model predictive control algorithm for uncertain nonlinear systems that guarantees resolvability

A robustly stabilizing MPC (model predictive control) algorithm for uncertain nonlinear systems is developed that guarantees resolvability. With resolvability, initial feasibility of the finite-horizon optimal control problem implies future feasibility in a receding-horizon framework. The control consists of two components; (i) feed-forward, and (ii) feedback part. Feed-forward control is obtained by online solution of a finite-horizon optimal control problem for the nominal system dynamics. The feedback control policy is designed off-line based on a bound on the uncertainty in the system model. The entire controller is shown to be robustly stabilizing with a region of attraction composed of initial states for which the finite-horizon optimal control problem is feasible. The controller design for this algorithm is demonstrated on a class of systems with uncertain nonlinear terms that have norm-bounded derivatives and derivatives in polytopes. An illustrative numerical example is also provided.

feed - forward↗

Optimal Control within the Context of Multidisciplinary Design, Analysis, and Optimization

Multidisciplinary design, analysis and optimization involves modeling the interactions of complex systems across a variety of disciplines. The optimization of such systems can be a computationally expensive exercise with multiple levels of nested nonlinear solvers running under an optimizer.The application of optimal control in project development often involves performing trajectory optimization for fixed vehicle designs or parametric sweeps across some key vehicle properties.This information is then relayed to the subsystem design teams who update their designs and relay some bulk characteristics back to the trajectory optimization procedure.This iteration is then repeated until the design closes.However, with increasing interest in more tightly coupled systems, such as electric and hybrid-electric aircraft propulsion and boundary layer ingestion, this process is prone to ignore subtle coupling between vehicle subsystem designs and vehicle operation on a given mission.Integrating trajectory optimization into a tightly coupled multidisciplinary design procedure can be computationally prohibitive, depending on the complexity of the subsystem analyses and the optimal control technique applied.To address these issues a new optimal control software tool, Dymos, has been developed.Dymos is built upon NASA's OpenMDAO software and can leverage its capabilities to efficiently compute gradients for the optimization and optimize complex models in parallel on distributed memory systems.This report provides some explanation into the numerical methods employed in Dymos and provides several use cases that demonstrate its performance on traditional optimal control problems and improvements ino techniques have been used extensively in recent decades to solve a variety of optimal control problems, typically in the form of aerospace vehicle trajectory optimization.

pseudospectral↗

Computational issues in optimal tuning and placement of passive dampers

The effectiveness of viscous elements in introducing damping in a structure is a function of several variables including their number, their location in the structure, and their physical properties. In this paper, the optimal damper placement and tuning problem is posed to optimize these variables. Both discrete and continuous optimization problems are formulated and solved corresponding, respectively, to the problems of placement of passive elements and to the tuning of their parameters. The paper particularly emphasizes the critical computational issues resulting from the optimization formulations. Numerical results involving a lightly damped testbed structure are presented.

Chu, C. C.↗

Optimal stabilization of discrete event systems

An optimal stabilization problem for discrete event systems (DES) is addressed. A class of not necessarily finite state 'logical' DES models is utilized which can also model the costs for events to occur. Let P and A denote two such models. Suppose that P characterizes the valid behavior of a dynamical system and A represents certain design objectives which specify the allowable DES behavior which is 'contained in' the valid behavior. An optimal control problem for P and A is how to choose the sequence of inputs to P so that the DES behavior lies in A (i.e., it is allowable) and so that a performance index defined in terms of the costs of the events is minimized. Two solutions are provided to an optimal stabilization problem, i.e. how to find a sequence of inputs that results in an optimal state trajectory which cycles in a pre-specified set.

Passino, Kevin M.↗

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗

A new proof of the Jacobi necessary condition

A new proof is given for Jacobi's no-conjugate-point necessary condition. For a certain class of linear-quadratic optimal control problems it is shown that the existence of a conjugate point in the interior of the extremal implies the existence of control perturbations that lead to a reduction in cost. In a well-known way, through the concept of the accessory minimum problem, this results in a no-conjugate-point condition for general optimal control problems. Important ideas used in this work are adopted from Breakwell and Ho (1965). In contrast to earlier results, the new proof also applies if the coefficient functions of time associated with the accessory minimum problem have any finite number of discontinuities.

Seywald, Hans↗