Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear 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 505 records · Page 28

Advanced launch system trajectory optimization using suboptimal control

The maximum-final mass trajectory of a proposed configuration of the Advanced Launch System is presented. A model for the two-stage rocket is given; the optimal control problem is formulated as a parameter optimization problem; and the optimal trajectory is computed using a nonlinear programming code called VF02AD. Numerical results are presented for the controls (angle of attack and velocity roll angle) and the states. After the initial rotation, the angle of attack goes to a positive value to keep the trajectory as high as possible, returns to near zero to pass through the transonic regime and satisfy the dynamic pressure constraint, returns to a positive value to keep the trajectory high and to take advantage of minimum drag at positive angle of attack due to aerodynamic shading of the booster, and then rolls off to negative values to satisfy the constraints. Because the engines cannot be throttled, the maximum dynamic pressure occurs at a single point; there is no maximum dynamic pressure subarc. To test approximations for obtaining analytical solutions for guidance, two additional optimal trajectories are computed: one using untrimmed aerodynamics and one using no atmospheric effects except for the dynamic pressure constraint. It is concluded that untrimmed aerodynamics has a negligible effect on the optimal trajectory and that approximate optimal controls should be able to be obtained by treating atmospheric effects as perturbations.

Shaver, Douglas A.↗

Overview of Sensitivity Analysis and Shape Optimization for Complex Aerodynamic Configurations

This paper presents a brief overview of some of the more recent advances in steady aerodynamic shape-design sensitivity analysis and optimization, based on advanced computational fluid dynamics. The focus here is on those methods particularly well- suited to the study of geometrically complex configurations and their potentially complex associated flow physics. When nonlinear state equations are considered in the optimization process, difficulties are found in the application of sensitivity analysis. Some techniques for circumventing such difficulties are currently being explored and are included here. Attention is directed to methods that utilize automatic differentiation to obtain aerodynamic sensitivity derivatives for both complex configurations and complex flow physics. Various examples of shape-design sensitivity analysis for unstructured-grid computational fluid dynamics algorithms are demonstrated for different formulations of the sensitivity equations. Finally, the use of advanced, unstructured-grid computational fluid dynamics in multidisciplinary analyses and multidisciplinary sensitivity analyses within future optimization processes is recommended and encouraged.

Newman, Perry A.↗

Overview of Sensitivity Analysis and Shape Optimization for Complex Aerodynamic Configurations

This paper presents a brief overview of some of the more recent advances in steady aerodynamic shape-design sensitivity analysis and optimization, based on advanced computational fluid dynamics (CFD). The focus here is on those methods particularly well-suited to the study of geometrically complex configurations and their potentially complex associated flow physics. When nonlinear state equations are considered in the optimization process, difficulties are found in the application of sensitivity analysis. Some techniques for circumventing such difficulties are currently being explored and are included here. Attention is directed to methods that utilize automatic differentiation to obtain aerodynamic sensitivity derivatives for both complex configurations and complex flow physics. Various examples of shape-design sensitivity analysis for unstructured-grid CFD algorithms are demonstrated for different formulations of the sensitivity equations. Finally, the use of advanced, unstructured-grid CFDs in multidisciplinary analyses and multidisciplinary sensitivity analyses within future optimization processes is recommended and encouraged.

Newman, James C., III↗

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

Generating Far-Infrared Radiation By Two-Wave Mixing

Far-infrared radiation 1 to 6 GHz generated by two-wave mixing in asymmetrically grown GaAs/AlxGa1-xAs multiple-quantum-well devices. Two near-infrared semiconductor diode lasers phase-locked. Outputs amplified, then combined in semiconductor nonlinear multiple-quantum-well planar waveguide. Necessary to optimize design of device with respect to three factors: high degree of confinement of electromagnetic field in nonlinear medium to maximize power density, phase matching to extend length of zone of interaction between laser beams in non-linear medium, and nonlinear susceptibility. Devices used as tunable local oscillators in heterodyne-detection radiometers.

Borenstain, Shmuel↗

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Madyastha, Raghavendra K.↗

Time-optical spinup maneuvers of flexible spacecraft

Attitude controllers for spacecraft have been based on the assumption that the bodies being controlled are rigid. Future spacecraft, however, may be quite flexible. Many applications require spinning up/down these vehicles. In this work the minimum time control of these maneuvers is considered. The time-optimal control is shown to possess an important symmetry property. Taking advantage of this property, the necessary and sufficient conditions for optimality are transformed into a system of nonlinear algebraic equations in the control switching times during one half of the maneuver, the maneuver time, and the costates at the mid-maneuver time. These equations can be solved using a homotopy approach. Control spillover measures are introduced and upper bounds on these measures are obtained. For a special case these upper bounds can be expressed in closed form for an infinite dimensional evaluation model. Rotational stiffening effects are ignored in the optimal control analysis. Based on a heuristic argument a simple condition is given which justifies the omission of these nonlinear effects. This condition is validated by numerical simulation.

Singh, G.↗

Optimal large-angle maneuvers with vibration suppression

Some methods and applications which determine optimal maneuver controls are overviewed. The main aspects of optimal control theory are summarized and the essential ideas involved in a class of methods ('continuation' or 'homotopy' methods) which are useful in solving the resulting two-point boundary value problems are discussed. Several low dimensioned, nonlinear maneuvers of multiple rigid-body configurations using optimal momentum transfer are discussed. Several linear and nonlinear flexible-body maneuvers are then presented and include distributed controls, vibration suppression/arrest, and computational issues. Finally, the key problem areas in which future research appears most urgent are identified.

Turner, J. D.↗

Optimized System Identification

In system identification, one usually cares most about finding a model whose outputs are as close as possible to the true system outputs when the same input is applied to both. However, most system identification algorithms do not minimize this output error. Often they minimize model equation error instead, as in typical least-squares fits using a finite-difference model, and it is seen here that this distinction is significant. Here, we develop a set of system identification algorithms that minimize output error for multi-input/multi-output and multi-input/single-output systems. This is done with sequential quadratic programming iterations on the nonlinear least-squares problems, with an eigendecomposition to handle indefinite second partials. This optimization minimizes a nonlinear function of many variables, and hence can converge to local minima. To handle this problem, we start the iterations from the OKID (Observer/Kalman Identification) algorithm result. Not only has OKID proved very effective in practice, it minimizes an output error of an observer which has the property that as the data set gets large, it converges to minimizing the criterion of interest here. Hence, it is a particularly good starting point for the nonlinear iterations here. Examples show that the methods developed here eliminate the bias that is often observed using any system identification methods of either over-estimating or under-estimating the damping of vibration modes in lightly damped structures.

Juang, Jer-Nan↗

A methodology for designing robust multivariable nonlinear feedback control systems

This paper presents an outline of a methodology for the design of nonlinear dynamic compensators for nonlinear multivariable systems with guarantees of closed-loop stability, robustness, and performance. The method is an extension of the Linear-Quadratic-Gaussian with Loop-Transfer-Recovery (LQG/LTR) methodology for linear systems, thus hinging upon the idea of constructing an approximate nonlinear inverse operator for the plant. A major feature of the method is a unification of both the state-space and Input-Output formulations. The major results of the paper are: (1) Properties of the solution of certain optimal control problems; (2) New results on nonlinear estimation, including a new nonlinear observer with certain guaranteed properties; (3) The Loop Operator Recovery (LOR) procedure, and (4) Inclusion of command-following and disturbance rejection with a goal of a closed-loop stable, robust system.

Grunberg, D. B.↗

A neighboring optimal feedback control scheme for systems using discontinuous control.

The calculation and implementation of the neighboring optimal feedback control law for multiinput, nonlinear dynamical systems, using discontinuous control, is discussed. An initialization procedure is described which removes the requirement that the neighboring initial state be in the neighborhood of the nominal initial state. This procedure is a bootstrap technique for determining the most appropriate control-law gain for the neighboring initial state. The mechanization of the neighboring control law described is closed loop in that the concept of time-to-go is utilized in the determination of the control-law gains appropriate for each neighboring state. The gains are chosen such that the time-to-go until the next predicted switch time or predicted final time is the same for both the neighboring and nominal trajectories. The procedure described is utilized to solve the minimum-time satellite attitude-acquisition problem.

Foerster, R. E.↗

Nonlinear and adaptive estimation in reentry.

The problem of real-time estimation of a lifting reentry vehicle trajectory of the shuttle orbiter type is considered. Simulations feature large position and velocity uncertainties at radar acquisition and realistic model errors in lift, drag and other model parameters. Radar tracking and accelerometer data are simulated. Significant nonlinearities are found to exist on spacecraft acquisition. An iterated nonlinear filter is shown to perform optimally during the radar acquisition phase. An adaptive filter is shown to track time-varying model errors, such as errors in the lift and drag coefficients, down to the noise level. Such real-time model tracking (identification) is frequently required for guidance and control implementation.

Jazwinski, A. H.↗

PROFILE user's guide

User information for program PROFILE, an aerodynamics design utility for refining, plotting, and tabulating airfoil profiles is provided. The theory and implementation details for two of the more complex options are also presented. These are the REFINE option, for smoothing curvature in selected regions while retaining or seeking some specified thickness ratio, and the OPTIMIZE option, which seeks a specified curvature distribution. REFINE uses linear techniques to manipulate ordinates via the central difference approximation to second derivatives, while OPTIMIZE works directly with curvature using nonlinear least squares techniques. Use of programs QPLOT and BPLOT is also described, since all of the plots provided by PROFILE (airfoil coordinates, curvature distributions) are achieved via the general purpose QPLOT utility. BPLOT illustrates (again, via QPLOT) the shape functions used by two of PROFILE's options. The programs were designed and implemented for the Applied Aerodynamics Branch at NASA Ames Research Center, Moffett Field, California, and written in FORTRAN and run on a VAX-11/780 under VMS.

Collins, L.↗

Minimum Weight Design of a Leaf Spring Tapered in Thickness and Width for the Hubble Space Telescope-Space Support Equipment

A linear elastic solution to the problem of minimum weight design of cantilever beams with variable width and depth is presented. The solution shown is for the specific application of the Hubble Space Telescope maintenance mission hardware. During these maintenance missions, delicate instruments must be isolated from the potentially damaging vibration environment of the space shuttle cargo bay during the ascent and descent phases. The leaf springs are designed to maintain the isolation system natural frequency at a level where load transmission to the instruments in a minimum. Nonlinear programming is used for the optimization process. The weight of the beams is the objective function with the deflection and allowable bending stress as the constraint equations. The design variables are the width and depth of the beams at both the free and the fixed ends.

Rodriguez, P. I.↗

Maximum orbit plane change with heat-transfer-rate considerations

Two aerodynamic maneuvers are considered for maximizing the plane change of a circular orbit: gliding flight with a maximum thrust segment to regain lost energy (aeroglide) and constant altitude cruise with the thrust being used to cancel the drag and maintain a high energy level (aerocruise). In both cases, the stagnation heating rate is limited. For aeroglide, the controls are the angle of attack, the bank angle, the time at which the burn begins, and the length of the burn. For aerocruise, the maneuver is divided into three segments: descent, cruise, and ascent. During descent the thrust is zero, and the controls are the angle of attack and the bank angle. During cruise, the only control is the assumed-constant angle of attack. During ascent, a maximum thrust segment is used to restore lost energy, and the controls are the angle of attack and bank angle. The optimization problems are solved with a nonlinear programming code known as GRG2. Numerical results for the Maneuverable Re-entry Research Vehicle with a heating-rate limit of 100 Btu/ft(2)-s show that aerocruise gives a maximum plane change of 2 deg, which is only 1 deg larger than that of aeroglide. On the other hand, even though aerocruise requires two thrust levels, the cruise characteristics of constant altitude, velocity, thrust, and angle of attack are easy to control.

Lee, J. Y.↗