Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient projection”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗
NASA NTRS1973

Function space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function space algorithms, Davidon and projected gradient, are modified so that they may handle directly control variable inequality constraints. A third quasi-Newton type algorithm developed by C. G. Broyden is extended to optimal control problems. The Broyden algorithm is further modified so that it also may handle directly control variable inequality constraints. These methods along with a pure gradient and two conjugate gradient algorithms are simulated on three relatively simple yet representative bounded control problems, two of which have singular subarcs. Overall the Broyden algorithm was found to be superior. The most notable result of the study was the clear superiority of the Broyden and Davidon algorithms in producing a sharp interior control subarc.

Edge, E. R.↗
NASA NTRS1973

Optimization of structures to satisfy a flutter velocity constraint by use of quadratic equation fitting

Using the first and the second derivative of flutter velocity with respect to the parameters, the velocity hypersurface is made quadratic. This greatly simplifies the numerical procedure developed for determining the values of the design parameters such that a specified flutter velocity constraint is satisfied and the total structural mass is near a relative minimum. A search procedure is presented utilizing two gradient search methods and a gradient projection method. The procedure is applied to the design of a box beam, using finite-element representation. The results indicate that the procedure developed yields substantial design improvement satisfying the specified constraint and does converge to near a local optimum.

Motiwalla, S. K.↗
NASA NTRS1975

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS1976

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.

Edge, E. R.↗
NASA NTRS1977

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS1981

Minimum-fuel aerodynamic orbital plane change maneuvers

Several minimum-fuel, aerodynamically controlled, orbital plane change problems are formulated and solved as optimal control problems. A gradient projection algorithm is used to iteratively modify both the control functions, angle of attack and bank angle, and two control parameters to obtain the optimal trajectory. The atmospheric flight profile is combined with two Keplerian (two-body vacuum flight) arcs so that a complete orbit-to-orbit analysis results. The vehicle used in this investigation is the Space Transportation System Shuttle Orbiter. The effects of heat load constraint level and plane change angle are analysed.

Joosten, B. K.↗
NASA NTRS1984

Post and a random-walk search mode

Multidisciplinary analysis often requires optimization of nonlinear systems that are subject to constraints. Trajectory optimization is one example of this situation. The Program to Optimize Simulated Trajectories (POST) was used successfully for a number of problems. The purpose is to describe POST and a new optimization approach that has been incorporated into it. Typical uses of POST will also be illustrated. The projected-gradient approach to optimization is the preferred option in POST and is discussed. A new approach to optimization, the random-walk approach, is described, and results with the random-walk approach are presented.

Martin, J. A.↗
NASA NTRS1989

Robotic control of the seven-degree-of-freedom NASA laboratory telerobotic manipulator

A computationally efficient robotic control scheme for the NASA Laboratory Telerobotic Manipulator (LTM) is presented. This scheme utilizes the redundancy of the seven-degree-of-freedom LTM to avoid joint limits and singularities. An analysis to determine singular configurations is presented. Performance criteria are determined based on the joint limits and singularity analysis. The control scheme is developed in the framework of resolved rate control using the gradient projection method, and it does not require the generalized inverse of the Jacobian. An efficient formulation for determining the joint velocities of the LTM is obtained. This control scheme is well suited for real-time implementation, which is essential if the end-effector trajectory is continuously modified based on sensory feedback. Implementation of this scheme on a Motorola 68020 VME bus-based controller of the LTM is in progress. Simulation results demonstrating the redundancy utilization in the robotic mode are presented.

Dubey, R. V.↗
NASA NTRS1989

Kinematics and control algorithm development and simulation for a redundant two-arm robotic manipulator system

An efficient approach to cartesian motion and force control of a 7 degree of freedom (DOF) manipulator is presented. It is based on extending the active stiffness controller to the 7 DOF case in general and use of an efficient version of the gradient projection technique for solving the inverse kinematics problem. Cooperative control is achieved through appropriate configuration of individual manipulator controllers. In addition, other aspects of trajectory generation using standard techniques are integrated into the controller. The method is then applied to a specific manipulator of interest (Robotics Research T-710). Simulation of the kinematics, dynamics, and control are provided in the context of several scenarios: one pertaining to a noncontact pick and place operation; one relating to contour following where contact is made between the manipulator and environment; and one pertaining to cooperative control.

Hennessey, Michael P.↗
NASA NTRS1990

Collision avoidance of a redundant manipulator operating through a window

The problem of collision-free operation of a redundant robot manipulator through a window is addressed. The window is modeled by a polygon with the sides representing the edges of the window. A performance criterion is defined to maximize the shortest distances between the arm link axes and the edges of the window. An efficient gradient projection optimization scheme for the kinematic control of manipulators with multiple degrees of redundancy is developed and used. The effectiveness of this scheme and the validity of the performance criterion are verified through simulations of the seven-degree-of-freedom NASA Laboratory Telerobotic Manipulator (LTM), where controlling only the position of the end-effector provides three degrees of redundancy.

Zghal, H.↗
NASA NTRS1992

Minimization of the vibration energy of thin-plate structure

An optimization method is proposed to reduce the vibration of thin plate structures. The method is based on a finite element shell analysis, a modal analysis, and a structural optimization method. In the finite element analysis, a triangular shell element with 18 dof is used. In the optimization, the overall vibration energy of the structure is adopted as the objective function, and it is minimized at the given exciting frequency by varying the thickness of the elements. The technique of modal analysis is used to derive the sensitivity of the vibration energy with respect to the design variables. The sensitivity is represented by the sensitivities of both eigenvalues and eigenvectors. The optimum value is computed by the gradient projection method and a unidimensional search procedure under the constraint condition of constant weight. A computer code, based on the proposed method, is developed and is applied to design problems using a beam and a plate as test cases. It is confirmed that the vibration energy is reduced at the given exciting frequency. For the beam excited by a frequency slightly less than the fundamental natural frequency, the optimized shape is close to the beam of uniform strength.

Inoue, Katsumi↗
NASA NTRS1992

Optimum design of a gearbox for low vibration

A computer program was developed for designing a low vibration gearbox. The code is based on a finite element shell analysis, a modal analysis, and a structural optimization method. In the finite element analysis, a triangular shell element with 18 degrees-of-freedom is used. In the optimization method, the overall vibration energy of the gearbox is used as the objective function and is minimized at the exciting frequency by varying the finite element thickness. Modal analysis is used to derive the sensitivity of the vibration energy with respect to the design variable. The sensitivity is representative of both eigenvalues and eigenvectors. The optimum value is computed by the gradient projection method and a unidimensional search procedure under the constraint condition of constant weight. The computer code is applied to a design problem derived from an experimental gearbox in use at the NASA Lewis Research Center. The top plate and two side plates of the gearbox are redesigned and the contribution of each surface to the total vibration is determined. Results show that optimization of the top plate alone is effective in reducing total gearbox vibration.

Inoue, Katsumi↗
NASA NTRS1991

A Lagrange multiplier based divide and conquer finite element algorithm

A novel domain decomposition method based on a hybrid variational principle is presented. Prior to any computation, a given finite element mesh is torn into a set of totally disconnected submeshes. First, an incomplete solution is computed in each subdomain. Next, the compatibility of the displacement field at the interface nodes is enforced via discrete, polynomial and/or piecewise polynomial Lagrange multipliers. In the static case, each floating subdomain induces a local singularity that is resolved very efficiently. The interface problem associated with this domain decomposition method is, in general, indefinite and of variable size. A dedicated conjugate projected gradient algorithm is developed for solving the latter problem when it is not feasible to explicitly assemble the interface operator. When implemented on local memory multiprocessors, the proposed methodology requires less interprocessor communication than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory and compares favorably with factorization based parallel direct methods.

Farhat, C.↗
NASA NTRS1992

Collision avoidance of a multiple degree of redundancy manipulator operating through a window

The problem of collision-free operation of a multiple-degree-of-redundancy manipulator operating through a window is addressed. An efficient gradient projection optimization scheme is presented for the kinematic control of manipulators with multiple degrees of redundancy. This scheme was developed for dextrous robotic and telerobotic applications in space station construction as well as in congested shop floor environment. A performance criterion is defined to maximize the shortest distances between the manipulator links and the edges of the window. Effectiveness of this scheme and the validity of the performance criterion are verified through simulations of the seven-degree-of-freedom NASA Laboratory Telerobotic Manipulator.

Zghal, H.↗
NASA NTRS1994

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality.

Orourke, Thomas P.↗
NASA NTRS1995

Minimization of the Vibration Energy of Thin-Plate Structures and the Application to the Reduction of Gearbox Vibration

While the vibration analysis of gear systems has been developed, a systematic approach to the reduction of gearbox vibration has been lacking. The technique of reducing vibration by shifting natural frequencies is proposed here for gearboxes and other thin-plate structures using the theories of finite elements, modal analysis, and optimization. A triangular shell element with 18 degrees of freedom is developed for structural and dynamic analysis. To optimize, the overall vibration energy is adopted as the objective function to be minimized at the excitation frequency by varying the design variable (element thickness) under the constraint of overall constant weight. Modal analysis is used to determine the sensitivity of the vibration energy as a function of the eigenvalues and eigenvectors. The optimum design is found by the gradient projection method and a unidimensional search procedure. By applying the computer code to design problems for beams and plates, it was verified that the proposed method is effective in reducing vibration energy. The computer code is also applied to redesign the NASA Lewis gear noise rig test gearbox housing. As one example, only the shape of the top plate is varied, and the vibration energy levels of all the surfaces are reduced, yielding an overall reduction of 1/5 compared to the initial design. As a second example, the shapes of the top and two side plates are varied to yield an overall reduction in vibration energy of 1/30.

Inoue, Katsumi↗
NASA NTRS2010

Asymptotic Linearity of Optimal Control Modification Adaptive Law with Analytical Stability Margins

Optimal control modification has been developed to improve robustness to model-reference adaptive control. For systems with linear matched uncertainty, optimal control modification adaptive law can be shown by a singular perturbation argument to possess an outer solution that exhibits a linear asymptotic property. Analytical expressions of phase and time delay margins for the outer solution can be obtained. Using the gradient projection operator, a free design parameter of the adaptive law can be selected to satisfy stability margins.

Nguyen, Nhan T.↗