Search NASASearch

SEARCH · Search NASA

Results for “Optimization methods”

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 181 records · Page 10

A dual method for optimal control problems with initial and final boundary constraints.

This paper presents two new algorithms belonging to the family of dual methods of centers. The first can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states. The second one can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states and with affine instantaneous inequality constraints on the control. Convergence is established for both algorithms. Qualitative reasoning indicates that the rate of convergence is linear.

Pironneau, O.

Statistical analysis of static shape control in space structures

The article addresses the problem of efficient analysis of the statistics of initial and corrected shape distortions in space structures. Two approaches for improving efficiency are considered. One is an adjoint technique for calculating distortion shapes: the second is a modal expansion of distortion shapes in terms of pseudo-vibration modes. The two techniques are applied to the problem of optimizing actuator locations on a 55 m radiometer antenna. The adjoint analysis technique is used with a discrete-variable optimization method. The modal approximation technique is coupled with a standard conjugate-gradient continuous optimization method. The agreement between the two sets of results is good, validating both the approximate analysis and optimality of the results.

Burdisso, Ricardo A.

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

Active control of transient rotordynamic vibration by optimal control methods

Although considerable effort has been put into the study of steady state vibration control, there are few methods applicable to transient vibration control of rotorbearing systems. In this paper optimal control theory has been adopted to minimize rotor vibration due to sudden imbalance, e.g., blade loss. The system gain matrix is obtained by choosing the weighting matrices and solving the Riccati equation. Control forces are applied to the system via a feedback loop. A seven mass rotor system is simulated for illustration. A relationship between the number of sensors and the number of modes used in the optimal control model is investigated. Comparisons of responses are made for various configurations of modes, sensors, and actuators. Furthermore, spillover effect is examined by comparing results from collocated and noncollocated sensor configurations. Results show that shaft vibration is significantly attenuated in the closed loop system.

Palazzolo, A. B.

Design and numerical evaluation of full-authority flight control systems for conventional and thruster-augmented helicopters employed in NOE operations

The development and methodology is presented for development of full-authority implicit model-following and explicit model-following optimal controllers for use on helicopters operating in the Nap-of-the Earth (NOE) environment. Pole placement, input-output frequency response, and step input response were used to evaluate handling qualities performance. The pilot was equipped with velocity-command inputs. A mathematical/computational trajectory optimization method was employed to evaluate the ability of each controller to fly NOE maneuvers. The method determines the optimal swashplate and thruster input histories from the helicopter's dynamics and the prescribed geometry and desired flying qualities of the maneuver. Three maneuvers were investigated for both the implicit and explicit controllers with and without auxiliary propulsion installed: pop-up/dash/descent, bob-up at 40 knots, and glideslope. The explicit controller proved to be superior to the implicit controller in performance and ease of design.

Perri, Todd A.

Active Mirror Predictive and Requirements Verification Software (AMP-ReVS)

This software is designed to predict large active mirror performance at various stages in the fabrication lifecycle of the mirror. It was developed for 1-meter class powered mirrors for astronomical purposes, but is extensible to other geometries. The package accepts finite element model (FEM) inputs and laboratory measured data for large optical-quality mirrors with active figure control. It computes phenomenological contributions to the surface figure error using several built-in optimization techniques. These phenomena include stresses induced in the mirror by the manufacturing process and the support structure, the test procedure, high spatial frequency errors introduced by the polishing process, and other process-dependent deleterious effects due to light-weighting of the mirror. Then, depending on the maturity of the mirror, it either predicts the best surface figure error that the mirror will attain, or it verifies that the requirements for the error sources have been met once the best surface figure error has been measured. The unique feature of this software is that it ties together physical phenomenology with wavefront sensing and control techniques and various optimization methods including convex optimization, Kalman filtering, and quadratic programming to both generate predictive models and to do requirements verification. This software combines three distinct disciplines: wavefront control, predictive models based on FEM, and requirements verification using measured data in a robust, reusable code that is applicable to any large optics for ground and space telescopes. The software also includes state-of-the-art wavefront control algorithms that allow closed-loop performance to be computed. It allows for quantitative trade studies to be performed for optical systems engineering, including computing the best surface figure error under various testing and operating conditions. After the mirror manufacturing process and testing have been completed, the software package can be used to verify that the underlying requirements have been met.

Basinger, Scott A.

Bingo: A Customizable Framework for Symbolic Regression with Genetic Programming

In this paper, we introduce Bingo, a flexible and customizable yet performant Python framework for symbolic regression with genetic programming. Bingo maintains a modular code structure for simple abstraction and easily swappable components. Fitness functions, selection methods, and constant optimization methods allow for easy problem-specific customization. Bingo also maintains several features for increased efficiency such as parallelism, equation simplification, and a C++ backend. We compare Bingo’s performance to other genetic programming for symbolic regression (GPSR) methods to show that it is both competitive and flexible.

machine learning

Bingo: A Customizable Framework for Symbolic Regression with Genetic Programming

In this paper, we introduce Bingo, a flexible and customizable yet performant Python framework for symbolic regression with genetic programming. Bingo maintains a modular code structure for simple abstraction and easily swappable components. Fitness functions, selection methods, and constant optimization methods allow for easy problem-specific customization. Bingo also maintains several features for increased efficiency such as parallelism, equation simplification, and a C++ backend. We compare Bingo’s performance to other genetic programming for symbolic regression (GPSR) methods to show that it is both competitive and flexible.

David Randall

One shot methods for optimal control of distributed parameter systems 1: Finite dimensional control

The efficient numerical treatment of optimal control problems governed by elliptic partial differential equations (PDEs) and systems of elliptic PDEs, where the control is finite dimensional is discussed. Distributed control as well as boundary control cases are discussed. The main characteristic of the new methods is that they are designed to solve the full optimization problem directly, rather than accelerating a descent method by an efficient multigrid solver for the equations involved. The methods use the adjoint state in order to achieve efficient smoother and a robust coarsening strategy. The main idea is the treatment of the control variables on appropriate scales, i.e., control variables that correspond to smooth functions are solved for on coarse grids depending on the smoothness of these functions. Solution of the control problems is achieved with the cost of solving the constraint equations about two to three times (by a multigrid solver). Numerical examples demonstrate the effectiveness of the method proposed in distributed control case, pointwise control and boundary control problems.

Taasan, Shlomo

A new method for optimizing multiple flyby trajectories

A new procedure has been developed which minimizes total impulsive Delta V for multiple flyby trajectories with constraints on flyby parameters and maneuver times. The method involves solving a bounds-constrained parameter optimization problem with a Newton algorithm utilizing analytic first and second derivatives. Each trajectory segment connecting consecutive maneuver points is found by first targeting from the preceding maneuver point to the parameters of the upcoming flyby and then propagating the resulting trajectory to the next maneuver point. Multi-conic techniques are used for trajectory propagation and for computation of the state transition matrix. This procedure has successfully optimized Galileo satellite tours containing up to 11 flybys.

Damario, L. A.

A forward method for optimal stochastic nonlinear and adaptive control

A computational approach is taken to solve the optimal nonlinear stochastic control problem. The approach is to systematically solve the stochastic dynamic programming equations forward in time, using a nested stochastic approximation technique. Although computationally intensive, this provides a straightforward numerical solution for this class of problems and provides an alternative to the usual dimensionality problem associated with solving the dynamic programming equations backward in time. It is shown that the cost degrades monotonically as the complexity of the algorithm is reduced. This provides a strategy for suboptimal control with clear performance/computation tradeoffs. A numerical study focusing on a generic optimal stochastic adaptive control example is included to demonstrate the feasibility of the method.

Bayard, David S.

Modal methods in optimal control synthesis

Efficient algorithms for solving linear smoother-follower problems with quadratic criteria are presented. For time-invariant systems, the algorithm consists of one backward integration of a linear vector equation and one forward integration of another linear vector equation. Furthermore, the backward and forward Riccati matrices can be expressed in terms of the eigenvalues and eigenvectors of the Euler-Lagrange equations. Hence, the gains of the forward and backward Kalman-Bucy filters and of the optimal state-feedback regulator can be determined without integration of matrix Riccati equations. A computer program has been developed, based on this method of determining the gains, to synthesize the optimal time-invariant compensator in the presence of random disturbance inputs and random measurement errors. The program also computes the rms state and control variables of the optimal closed-loop system.

Bryson, A. E., Jr.

A space radiation transport method development

Improved spacecraft shield design requires early entry of radiation constraints into the design process to maximize performance and minimize costs. As a result, we have been investigating high-speed computational procedures to allow shield analysis from the preliminary design concepts to the final design. In particular, we will discuss the progress towards a full three-dimensional and computationally efficient deterministic code for which the current HZETRN evaluates the lowest-order asymptotic term. HZETRN is the first deterministic solution to the Boltzmann equation allowing field mapping within the International Space Station (ISS) in tens of minutes using standard finite element method (FEM) geometry common to engineering design practice enabling development of integrated multidisciplinary design optimization methods. A single ray trace in ISS FEM geometry requires 14 ms and severely limits application of Monte Carlo methods to such engineering models. A potential means of improving the Monte Carlo efficiency in coupling to spacecraft geometry is given in terms of re-configurable computing and could be utilized in the final design as verification of the deterministic method optimized design. Published by Elsevier Ltd on behalf of COSPAR.

NASA Center JSC

Airfoil shape optimization using sensitivity analysis on viscous flow equations

An aerodynamic shape optimization method has previously been developed by the authors using the Euler equations and has been applied to supersonic-hypersonic nozzle designs. This method has also included a flowfield extrapolation (or flow prediction) method based on the Taylor series expansion of an existing CFD solution. The present paper reports on the extension of this method to the thin-layer Navier-Stokes equations in order to account for the viscous effects. Also, to test the method under highly nonlinear conditions, it has been applied to the transonic flows. Initially, the success of the flow prediction method is tested. Then, the overall method is demonstrated by optimizing the shapes of two supercritical transonic airfoils at zero angle of attack. The first one is shape optimized to achieve a minimum drag while obtaining a lift above a specified value. Whereas, the second one is shape optimized for a maximum lift while attaining a drag below a specified value. The results of these two cases indicate that the present method can produce successfully optimized aerodynamic shapes.

Eleshaky, Mohamed E.

An application of compound scaling to wind tunnel model design

An approach was developed for the stiffness design of aeroelastically scaled wind tunnel models. The object of designing such models is to make a structure whose stiffness matches a desired stiffness distribution. This design problem is cast as a formal constrained optimization problem and worked with two different optimization methods. A previous effort used the modified method of feasible directions (MFD) as implemented in a general purpose finite element based optimization code. In this effort, a special purpose finite element based optimization program was written and run using both MFD and compound scaling optimization methods. Results are presented comparing the final designs obtained using MFD and compound scaling.

French, Mark

Space Radiation Transport Methods Development

Improved spacecraft shield design requires early entry of radiation constraints into the design process to maximize performance and minimize costs. As a result, we have been investigating high-speed computational procedures to allow shield analysis from the preliminary design concepts to the final design. In particular, we will discuss the progress towards a full three-dimensional and computationally efficient deterministic code for which the current HZETRN evaluates the lowest order asymptotic term. HZETRN is the first deterministic solution to the Boltzmann equation allowing field mapping within the International Space Station (ISS) in tens of minutes using standard Finite Element Method (FEM) geometry common to engineering design practice enabling development of integrated multidisciplinary design optimization methods. A single ray trace in ISS FEM geometry requires 14 milliseconds and severely limits application of Monte Carlo methods to such engineering models. A potential means of improving the Monte Carlo efficiency in coupling to spacecraft geometry is given in terms of reconfigurable computing and could be utilized in the final design as verification of the deterministic method optimized design.

Wilson, J. W.

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III

Image compression system and method having optimized quantization tables

A digital image compression preprocessor for use in a discrete cosine transform-based digital image compression device is provided. The preprocessor includes a gathering mechanism for determining discrete cosine transform statistics from input digital image data. A computing mechanism is operatively coupled to the gathering mechanism to calculate a image distortion array and a rate of image compression array based upon the discrete cosine transform statistics for each possible quantization value. A dynamic programming mechanism is operatively coupled to the computing mechanism to optimize the rate of image compression array against the image distortion array such that a rate-distortion-optimal quantization table is derived. In addition, a discrete cosine transform-based digital image compression device and a discrete cosine transform-based digital image compression and decompression system are provided. Also, a method for generating a rate-distortion-optimal quantization table, using discrete cosine transform-based digital image compression, and operating a discrete cosine transform-based digital image compression and decompression system are provided.

Ratnakar, Viresh