Iterative solution of nonlinear optimal control problems.
Mathematical programming methods for solving nonlinear state-constrained discrete optimal control problems
DYNAMIC PROGRAMMING↗
SEARCH · Engineering Papers
Results for “Iterative methods (Mathematics)-Computer programs.”
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.
Accumulated approximation: A new method for structural optimization by iterative improvement
A new method for the solution of non-linear mathematical programming problems in the field of structural optimization is presented. It is an iterative scheme which for each iteration refines the approximation of objective and constraint functions by accumulating the function values of previously visited design points. The method has proven to be competitive for a number of well-known examples of which one is presented here. Furthermore because of the accumulation strategy, the method produces convergence even when the sensitivity analysis is inaccurate.
Rasmussen, John↗
Design of structures for optimum geometry
A general method is proposed for geometric optimization of finite element structures on the assumption that a reasonable initial geometry is specified. The number of finite elements, number of joints, and the element-joint relationships are specified and are not changed during the optimization process. The structure may be statically indeterminate and may support multiple loading conditions. Design variables include geometric and member sizing parameters. Design objectives may be minimum weight or cost, and constraints include strength and stiffness limitations. The optimization procedure is a general mathematical programming approach. An iterative design algorithm is outlined, and the method is specialized for truss structures. Design examples are given.
Vanderplaats, G. N.↗
Structural optimization via a design space hierarchy
Mathematical programming techniques provide a general approach to automated structural design. An iterative method is proposed in which design is treated as a hierarchy of subproblems, one being locally constrained and the other being locally unconstrained. It is assumed that the design space is locally convex in the case of good initial designs and that the objective and constraint functions are continuous, with continuous first derivatives. A general design algorithm is outlined for finding a move direction which will decrease the value of the objective function while maintaining a feasible design. The case of one-dimensional search in a two-variable design space is discussed. Possible applications are discussed. A major feature of the proposed algorithm is its application to problems which are inherently ill-conditioned, such as design of structures for optimum geometry.
Vanderplaats, G. N.↗
Machine learning in motion control
The existing methodologies for robot programming originate primarily from robotic applications to manufacturing, where uncertainties of the robots and their task environment may be minimized by repeated off-line modeling and identification. In space application of robots, however, a higher degree of automation is required for robot programming because of the desire of minimizing the human intervention. We discuss a new paradigm of robotic programming which is based on the concept of machine learning. The goal is to let robots practice tasks by themselves and the operational data are used to automatically improve their motion performance. The underlying mathematical problem is to solve the problem of dynamical inverse by iterative methods. One of the key questions is how to ensure the convergence of the iterative process. There have been a few small steps taken into this important approach to robot programming. We give a representative result on the convergence problem.
Su, Renjeng↗
An application of a linear programing technique to nonlinear minimax problems
A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.
Schiess, J. R.↗
Model reduction in integrated controls-structures design
It is the objective of this paper to present a model reduction technique developed for the integrated controls-structures design of flexible structures. Integrated controls-structures design problems are typically posed as nonlinear mathematical programming problems, where the design variables consist of both structural and control parameters. In the solution process, both structural and control design variables are constantly changing; therefore, the dynamic characteristics of the structure are also changing. This presents a problem in obtaining a reduced-order model for active control design and analysis which will be valid for all design points within the design space. In other words, the frequency and number of the significant modes of the structure (modes that should be included) may vary considerably throughout the design process. This is also true as the locations and/or masses of the sensors and actuators change. Moreover, since the number of design evaluations in the integrated design process could easily run into thousands, any feasible order-reduction method should not require model reduction analysis at every design iteration. In this paper a novel and efficient technique for model reduction in the integrated controls-structures design process, which addresses these issues, is presented.
Maghami, Peiman G.↗
Aerodynamic parameters of the Navion airplane extracted from flight
An iterative method, which is characterized as a maximum-likelihood minimum-variance technique, was used to extract the aerodynamic parameters of a Navion airplane from flight data. The purposes were to compare the results with parameters obtained from wind-tunnel tests and with results obtained by analog matching the same data, and to develop techniques for application of the parameter extraction program. Results from the study showed that the parameter-extraction program can produce aerodynamic parameters which will permit close estimation of the aircraft time histories used in the extraction process. The program determined an estimate of the standard deviations of the states and parameters. These estimates were used to indicate how well the calculated states fit the flight data and the confidence in the values of the estimated parameters. The study also showed that the values of the parameters were affected by the data and mathematical model used during the extraction process. Because of the lack of confidence in the parameters extracted by use of some of the sets of data, several parameters were estimated by other methods. By using a combination of methods, a set of parameters which gave a fit to the data was obtained.
Suit, W. T.↗