A simple differential game.
Necessary and sufficient conditions for optimal strategies for differential /two person zero-sum/ game with sum determined by ordinary differential equations
Leitmann, G.↗
SEARCH · Search NASA
Results for “strategy 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.
Some relations between the discrete and continuous minimum time problems
Continuous and discrete minimum time problems relationships and state space portraits during application of optimal strategies to system
Pokoski, J.↗
Multiple-stage quantitative games
Multistage two player zero-sum games with state determined by difference equations, deriving optimal strategy pair satisfying saddle point condition
Blaquiere, A.↗
A multilevel optimization of large-scale dynamic systems
A multilevel feedback control scheme is proposed for optimization of large-scale systems composed of a number of (not necessarily weakly coupled) subsystems. Local controllers are used to optimize each subsystem, ignoring the interconnections. Then, a global controller may be applied to minimize the effect of interconnections and improve the performance of the overall system. At the cost of suboptimal performance, this optimization strategy ensures invariance of suboptimality and stability of the systems under structural perturbations whereby subsystems are disconnected and again connected during operation.
Siljak, D. D.↗
Combat games
A mathematical formulation is proposed of a combat game between two opponents with offensive capabilities and offensive objective is proposed. Resolution of the combat involves solving two differential games with state constraints. Depending on the game dynamics and parameters, the combat can terminate in one of four ways: the first player wins; the second player wins; a draw (neither wins); or joint capture. In the first two cases, the optimal strategies of the two players are determined from suitable zero-sum games, whereas in the latter two the relevant games are nonzero-sum. Further, to avoid certain technical difficulties, the concept of a delta-combat game is introduced.
Ardema, M. D.↗
Supersonic airfoil optimization
A procedure for the optimization of supersonic airfoils is presented. A nonlinear, full-potential solver (NCOREL) is coupled with a numerical optimizer (CONMIN). The NCOREL code is a three-dimensional supersonic marching method, however, only two-dimensional (conical) results are used for the airfoil problem. Each airfoil evaluated in the NCOREL aerodynamic code is composed of a linear combination of user-specified basis airfoils. The weighting factors of the basis airfoils plus the angle of attack form the design variable vector. The inviscid drag coefficient is minimized subject to lift and crossflow Mach number gradient constraints. The optimization strategy is found to be extremely important for the efficient determination of an optimum airfoil.
Pittman, J. L.↗
A computer simulator for development of engineering system design methodologies
A computer program designed to simulate and improve engineering system design methodology is described. The simulator mimics the qualitative behavior and data couplings occurring among the subsystems of a complex engineering system. It eliminates the engineering analyses in the subsystems by replacing them with judiciously chosen analytical functions. With the cost of analysis eliminated, the simulator is used for experimentation with a large variety of candidate algorithms for multilevel design optimization to choose the best ones for the actual application. Thus, the simulator serves as a development tool for multilevel design optimization strategy. The simulator concept, implementation, and status are described and illustrated with examples.
Padula, S. L.↗
Optimal placement of tuning masses for vibration reduction in helicopter rotor blades
Described are methods for reducing vibration in helicopter rotor blades by determining optimum sizes and locations of tuning masses through formal mathematical optimization techniques. An optimization procedure is developed which employs the tuning masses and corresponding locations as design variables which are systematically changed to achieve low values of shear without a large mass penalty. The finite-element structural analysis of the blade and the optimization formulation require development of discretized expressions for two performance parameters: modal shaping parameter and modal shear amplitude. Matrix expressions for both quantities and their sensitivity derivatives are developed. Three optimization strategies are developed and tested. The first is based on minimizing the modal shaping parameter which indirectly reduces the modal shear amplitudes corresponding to each harmonic of airload. The second strategy reduces these amplitudes directly, and the third strategy reduces the shear as a function of time during a revolution of the blade. The first strategy works well for reducing the shear for one mode responding to a single harmonic of the airload, but has been found in some cases to be ineffective for more than one mode. The second and third strategies give similar results and show excellent reduction of the shear with a low mass penalty.
Pritchard, Jocelyn I.↗
Optimal placement of tuning masses for vibration reduction in helicopter rotor blades
Methods are presented for the reduction of helicopter rotor blade vibration through a formal mathematical optimization technique determination of optimum tuning mass sizes and locations; these are used as design variables that are systematically changed to achieve low values of shear without large mass penalty. Matrix expressions are obtained for the modal shaping parameter and modal shear amplitude that are required for FEM structural analysis of the blade as well as the optimization formulation. Sensitivity derivatives are also obtained. Three different optimization strategies are developed and tested.
Pritchard, Jocelyn I.↗
Optimization of large matrix calculations for execution on the Cray X-MP vector supercomputer
A considerable volume of large computational computer codes were developed for NASA over the past twenty-five years. This code represents algorithms developed for machines of earlier generation. With the emergence of the vector supercomputer as a viable, commercially available machine, an opportunity exists to evaluate optimization strategies to improve the efficiency of existing software. This result is primarily due to architectural differences in the latest generation of large-scale machines and the earlier, mostly uniprocessor, machines. A sofware package being used by NASA to perform computations on large matrices is described, and a strategy for conversion to the Cray X-MP vector supercomputer is also described.
Hornfeck, William A.↗
Computational architecture for integrated controls and structures design
To facilitate the development of control structure interaction (CSI) design methodology, a computational architecture for interdisciplinary design of active structures is presented. The emphasis of the computational procedure is to exploit existing sparse matrix structural analysis techniques, in-core data transfer with control synthesis programs, and versatility in the optimization methodology to avoid unnecessary structural or control calculations. The architecture is designed such that all required structure, control and optimization analyses are performed within one program. Hence, the optimization strategy is not unduly constrained by cold starts of existing structural analysis and control synthesis packages.
Belvin, W. Keith↗
A Boltzmann machine for the organization of intelligent machines
A three-tier structure consisting of organization, coordination, and execution levels forms the architecture of an intelligent machine using the principle of increasing precision with decreasing intelligence from a hierarchically intelligent control. This system has been formulated as a probabilistic model, where uncertainty and imprecision can be expressed in terms of entropies. The optimal strategy for decision planning and task execution can be found by minimizing the total entropy in the system. The focus is on the design of the organization level as a Boltzmann machine. Since this level is responsible for planning the actions of the machine, the Boltzmann machine is reformulated to use entropy as the cost function to be minimized. Simulated annealing, expanding subinterval random search, and the genetic algorithm are presented as search techniques to efficiently find the desired action sequence and illustrated with numerical examples.
Moed, Michael C.↗
Analysis and design technology for high-speed aircraft structures
Recent high-speed aircraft structures research activities at NASA Langley Research Center are described. The following topics are covered: the development of analytical and numerical solutions to global and local thermal and structural problems, experimental verification of analysis methods, identification of failure mechanisms, and the incorporation of analysis methods into design and optimization strategies. The paper describes recent NASA Langley advances in analysis and design methods, structural and thermal concepts, and test methods.
Starnes, James H., Jr.↗
Intelligent data management for real-time spacecraft monitoring
Real-time AI systems have begun to address the challenge of restructuring problem solving to meet real-time constraints by making key trade-offs that pursue less than optimal strategies with minimal impact on system goals. Several approaches for adapting to dynamic changes in system operating conditions are known. However, simultaneously adapting system decision criteria in a principled way has been difficult. Towards this end, a general technique for dynamically making such trade-offs using a combination of decision theory and domain knowledge has been developed. Multi-attribute utility theory (MAUT), a decision theoretic approach for making one-time decisions is discussed and dynamic trade-off evaluation is described as a knowledge-based extension of MAUT that is suitable for highly dynamic real-time environments, and provides an example of dynamic trade-off evaluation applied to a specific data management trade-off in a real-world spacecraft monitoring application.
Schwuttke, Ursula M.↗
Adjoint methods for aerodynamic wing design
A model inverse design problem is used to investigate the effect of flow discontinuities on the optimization process. The optimization involves finding the cross-sectional area distribution of a duct that produces velocities that closely match a targeted velocity distribution. Quasi-one-dimensional flow theory is used, and the target is chosen to have a shock wave in its distribution. The objective function which quantifies the difference between the targeted and calculated velocity distributions may become non-smooth due to the interaction between the shock and the discretization of the flowfield. This paper offers two techniques to resolve the resulting problems for the optimization algorithms. The first, shock-fitting, involves careful integration of the objective function through the shock wave. The second, coordinate straining with shock penalty, uses a coordinate transformation to align the calculated shock with the target and then adds a penalty proportional to the square of the distance between the shocks. The techniques are tested using several popular sensitivity and optimization methods, including finite-differences, and direct and adjoint discrete sensitivity methods. Two optimization strategies, Gauss-Newton and sequential quadratic programming (SQP), are used to drive the objective function to a minimum.
Grossman, Bernard↗
Aerodynamic shape optimization using preconditioned conjugate gradient methods
In an effort to further improve upon the latest advancements made in aerodynamic shape optimization procedures, a systematic study is performed to examine several current solution methodologies as applied to various aspects of the optimization procedure. It is demonstrated that preconditioned conjugate gradient-like methodologies dramatically decrease the computational efforts required for such procedures. The design problem investigated is the shape optimization of the upper and lower surfaces of an initially symmetric (NACA-012) airfoil in inviscid transonic flow and at zero degree angle-of-attack. The complete surface shape is represented using a Bezier-Bernstein polynomial. The present optimization method then automatically obtains supercritical airfoil shapes over a variety of freestream Mach numbers. Furthermore, the best optimization strategy examined resulted in a factor of 8 decrease in computational time as well as a factor of 4 decrease in memory over the most efficient strategies in current use.
Burgreen, Greg W.↗
Improved calculation of optimum design sensitivity
Optimum design parameter sensitivity analysis has become an important topic in recent years. The principal reasons for obtaining optimum design sensitivity information with respect to various problem parameters are (l) to predict revised optimum designs, associated with specified perturbations of the problem parameters, without re-optimizing the problem and, (2) to provide sensitivity information in multilevel optimization strategies. Methods for calculating these derivatives were proposed by several authors. The most important drawback in estimating parameter sensitivities by the current methods is that they do not allow for changes in the active constraint set. Changes in the active constraint set produce discontinuities in the optimum design sensitivities, and therefore, a correct formulation has to be cast in terms of directional derivatives. Optimum design parameter sensitivity analysis is addressed in terms of directional derivatives so as to include possible discontinuities and it also presents a method for estimating optimum design sensitivities using finite differences.
Sepulveda, Abdon E.↗
Implementation of ADI: Schemes on MIMD parallel computers
In order to simulate the effects of the impingement of hot exhaust jets of High Performance Aircraft on landing surfaces a multi-disciplinary computation coupling flow dynamics to heat conduction in the runway needs to be carried out. Such simulations, which are essentially unsteady, require very large computational power in order to be completed within a reasonable time frame of the order of an hour. Such power can be furnished by the latest generation of massively parallel computers. These remove the bottleneck of ever more congested data paths to one or a few highly specialized central processing units (CPU's) by having many off-the-shelf CPU's work independently on their own data, and exchange information only when needed. During the past year the first phase of this project was completed, in which the optimal strategy for mapping an ADI-algorithm for the three dimensional unsteady heat equation to a MIMD parallel computer was identified. This was done by implementing and comparing three different domain decomposition techniques that define the tasks for the CPU's in the parallel machine. These implementations were done for a Cartesian grid and Dirichlet boundary conditions. The most promising technique was then used to implement the heat equation solver on a general curvilinear grid with a suite of nontrivial boundary conditions. Finally, this technique was also used to implement the Scalar Penta-diagonal (SP) benchmark, which was taken from the NAS Parallel Benchmarks report. All implementations were done in the programming language C on the Intel iPSC/860 computer.
Vanderwijngaart, Rob F.↗