Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient descent 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.

44 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

Gradient optimization and nonlinear control

The book represents an introduction to computation in control by an iterative, gradient, numerical method, where linearity is not assumed. The general language and approach used are those of elementary functional analysis. The particular gradient method that is emphasized and used is conjugate gradient descent, a well known method exhibiting quadratic convergence while requiring very little more computation than simple steepest descent. Constraints are not dealt with directly, but rather the approach is to introduce them as penalty terms in the criterion. General conjugate gradient descent methods are developed and applied to problems in control.

Hasdorff, L.↗
NASA NTRS1988

Transformation techniques for minimax optimal control problems and their application to optimal flight trajectories in a windshear - Optimal abort landing trajectories

The optimal-control problem of abort-landing trajectories in the presence of low-altitude wind shear is investigated analytically. The vertical-plane Newtonian motion of a point-mass aircraft in a steady wind field is modeled, and a sequential gradient-restoration algorithm is applied. Numerical results showing the effects of wind-shear intensity, initial altitude, and power-setting rate are presented in extensive graphs and discussed in detail. Optimal trajectories for strong or severe wind shears are found to begin with a descent, followed by level flight and then an ascent after leaving the shear region.

Miele, A.↗
NASA NTRS2006

Multiclass Reduced-Set Support Vector Machines

There are well-established methods for reducing the number of support vectors in a trained binary support vector machine, often with minimal impact on accuracy. We show how reduced-set methods can be applied to multiclass SVMs made up of several binary SVMs, with significantly better results than reducing each binary SVM independently. Our approach is based on Burges' approach that constructs each reduced-set vector as the pre-image of a vector in kernel space, but we extend this by recomputing the SVM weights and bias optimally using the original SVM objective function. This leads to greater accuracy for a binary reduced-set SVM, and also allows vectors to be 'shared' between multiple binary SVMs for greater multiclass accuracy with fewer reduced-set vectors. We also propose computing pre-images using differential evolution, which we have found to be more robust than gradient descent alone. We show experimental results on a variety of problems and find that this new approach is consistently better than previous multiclass reduced-set methods, sometimes with a dramatic difference.

reduced set methods↗
NASA NTRS2004

Algorithm for Training a Recurrent Multilayer Perceptron

An improved algorithm has been devised for training a recurrent multilayer perceptron (RMLP) for optimal performance in predicting the behavior of a complex, dynamic, and noisy system multiple time steps into the future. [An RMLP is a computational neural network with self-feedback and cross-talk (both delayed by one time step) among neurons in hidden layers]. Like other neural-network-training algorithms, this algorithm adjusts network biases and synaptic-connection weights according to a gradient-descent rule. The distinguishing feature of this algorithm is a combination of global feedback (the use of predictions as well as the current output value in computing the gradient at each time step) and recursiveness. The recursive aspect of the algorithm lies in the inclusion of the gradient of predictions at each time step with respect to the predictions at the preceding time step; this recursion enables the RMLP to learn the dynamics. It has been conjectured that carrying the recursion to even earlier time steps would enable the RMLP to represent a noisier, more complex system.

Parlos, Alexander G.↗
NASA NTRS1996

Cascade Error Projection: A Learning Algorithm for Hardware Implementation

In this paper, we workout a detailed mathematical analysis for a new learning algorithm termed Cascade Error Projection (CEP) and a general learning frame work. This frame work can be used to obtain the cascade correlation learning algorithm by choosing a particular set of parameters. Furthermore, CEP learning algorithm is operated only on one layer, whereas the other set of weights can be calculated deterministically. In association with the dynamical stepsize change concept to convert the weight update from infinite space into a finite space, the relation between the current stepsize and the previous energy level is also given and the estimation procedure for optimal stepsize is used for validation of our proposed technique. The weight values of zero are used for starting the learning for every layer, and a single hidden unit is applied instead of using a pool of candidate hidden units similar to cascade correlation scheme. Therefore, simplicity in hardware implementation is also obtained. Furthermore, this analysis allows us to select from other methods (such as the conjugate gradient descent or the Newton's second order) one of which will be a good candidate for the learning technique. The choice of learning technique depends on the constraints of the problem (e.g., speed, performance, and hardware implementation); one technique may be more suitable than others. Moreover, for a discrete weight space, the theoretical analysis presents the capability of learning with limited weight quantization. Finally, 5- to 8-bit parity and chaotic time series prediction problems are investigated; the simulation results demonstrate that 4-bit or more weight quantization is sufficient for learning neural network using CEP. In addition, it is demonstrated that this technique is able to compensate for less bit weight resolution by incorporating additional hidden units. However, generation result may suffer somewhat with lower bit weight quantization.

Duong, Tuan A.↗
NASA NTRS2025

Hardware in the Loop Performance of Terrestrial Powered Descent Dual Quaternion Guidance With A Custom First-Order Solver

The Safe & Precise Landing Integrated Capabilities Evolution (SPLICE) program continues to push the development of advanced descent and landing technologies. This paper will focus on the improvements made to the SPLICE Dual Quaternion Guidance (DQG) algorithm, which is a critical software component for generating approach phase and hazard avoidance trajectories. The trajectory performance of SPLICE DQG will be evaluated in preparation for a terrestrial flight test that incorporates a hazard avoidance maneuver. Additionally, the implementation of a customized first order Proportional-Integral Projected Gradient solver will be reviewed, along with preliminary execution results on the SPLICE Descent and Landing Computer (DLC).

SPLICE↗
NASA NTRS1985

Optimal landing of a helicopter in autorotation

Gliding descent in autorotation is a maneuver used by helicopter pilots in case of engine failure. The landing of a helicopter in autorotation is formulated as a nonlinear optimal control problem. The OH-58A helicopter was used. Helicopter vertical and horizontal velocities, vertical and horizontal displacement, and the rotor angle speed were modeled. An empirical approximation for the induced veloctiy in the vortex-ring state were provided. The cost function of the optimal control problem is a weighted sum of the squared horizontal and vertical components of the helicopter velocity at touchdown. Optimal trajectories are calculated for entry conditions well within the horizontal-vertical restriction curve, with the helicopter initially in hover or forwared flight. The resultant two-point boundary value problem with path equality constraints was successfully solved using the Sequential Gradient Restoration Technique.

Lee, A. Y. N.↗
NASA NTRSDate not supplied

Progress on Inverse Estimation Technique of Non-Linear Pitch Damping Coefficient Curves Using Free-Flight CFD Generated Trajectories

Characterization of entry vehicle pitch damping coefficient curves is crucial to ensure appropriate re-entry and overall mission success. The pitch damping coefficient (C_(m_q )+C_(m_α ̇ )) is used to encapsulate the oscillatory growth or decay of a body during a trajectory. The inverse estimation technique utilizes an existing Free-Flight CFD (FF-CFD) dataset and wraps a reconstruction algorithm in an optimizer. The reconstruction integrates the planar equations of motion derived by Schoenenberger, Queen [1] using Python’s scipy.integrate.solve_ivp. The optimizer’s objective function is the normalized 𝐿2 residual of the angle of attack peaks between the reconstructed trajectory and the original data produced with FF-CFD. Inclusion of the peak times in this residual calculation allows for simultaneous optimization of the pitch moment coefficient, C_(m_α ). This residual equation is shown below in Eq. 1. The optimizer scipy.optimize.minimize was used with the gradient-based Powell method for the analysis presented, however the differential evolution method was investigated as means of comparison, and was found to produce marginally lower residual values with prohibitively longer run times. Further, the pitch damping curve is found by fitting a cubic interpolation function to a set of (α, (C_(m_q )+C_(m_α ̇ ))) control points, where the α points are held constant and the (C_(m_q )+C_(m_α ̇ )) values are the optimized parameters. The pitch moment curve uses a linear interpolation between the minimum and maximum α in the dataset. FF-CFD generated trajectories using the Dragonfly capsule geometry with the Genesis ballistic range model parameters were simulated and used for this analysis. These FF-CFD trajectories simulate planar motion, as restricted by the reconstructing the equations of motion, of three different cases: 1-DoF (free-to-pitch), 2-DoF (free-to-pitch and heave), and 3-DoF (free-to-pitch, heave, and decelerate). Pitch damping coefficient curves generated using this inverse estimation curve technique with FF-CFD 1-DoF Dragonfly data are found in Fig. 1. Preliminary results reconstructing ballistic range shots using these FF-CFD derived predictions of the pitch damping curve (Fig. 1) are shown in Fig. 2. It should be noted that the ballistic range shot used a Genesis model whereas the FF-CFD data used a Dragonfly geometry, however these geometries are similar.

entry↗