Search NASA⌕ Search

SEARCH · Search NASA

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

At least 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Multigrid one shot methods for optimal control problems: Infinite dimensional control

The multigrid one shot method for optimal control problems, governed by elliptic systems, is introduced for the infinite dimensional control space. ln this case, the control variable is a function whose discrete representation involves_an increasing number of variables with grid refinement. The minimization algorithm uses Lagrange multipliers to calculate sensitivity gradients. A preconditioned gradient descent algorithm is accelerated by a set of coarse grids. It optimizes for different scales in the representation of the control variable on different discretization levels. An analysis which reduces the problem to the boundary is introduced. It is used to approximate the two level asymptotic convergence rate, to determine the amplitude of the minimization steps, and the choice of a high pass filter to be used when necessary. The effectiveness of the method is demonstrated on a series of test problems. The new method enables the solutions of optimal control problems at the same cost of solving the corresponding analysis problems just a few times.

Arian, Eyal↗
NASA NTRS1974

Transient response of multidegree-of-freedom linear systems to forcing functions with inequality constraints

Optimal control theory is applied to analyze the transient response of discrete linear systems to forcing functions with unknown time dependence but having known bounds. Particular attention is given to forcing functions which include: (1) maximum displacement of any given mass element, (2) maximum relative displacement of any two adjacent masses, and (3) maximum acceleration of a given mass. Linear mechanical systems with an arbitrary number of degrees of freedom and only one forcing function acting are considered. In the general case, the desired forcing function is found to be a function that switches from the upper-to-lower bound and vice-versa at certain moments of time. A general procedure for finding such switching times is set forth.

Michalopoulos, C. D.↗
NASA NTRS1977

Linear tracking systems with applications to aircraft control system design

A class of optimal linear time invariant tracking systems, both in continuous time and discrete time, of which the number of inputs (which are restricted to be step functions) is equal to the number of system outputs, is studied. Along with derivation of equations and design procedures, two discretization schemes are presented, constraining either the control or its time derivative, to be a constant over each sampling period. Descriptions are given for the linearized model of the F-8C aircraft longitudinal dynamics, and the C* handling qualities criterion, which then serve as an illustration of the applications of these linear tracking designs. A suboptimal reduced state design is also presented. Numerical results are given for both the continuous time and discrete time designs.

Lee, W. H.↗
NASA NTRS1988

Algorithm For The Discrete-O timal-Output-Feedback Problem

Change in cost function due to change in feedback gain calculated. Algorithm for feedback control systems considers stochastic, infinite-time, discrete-output-feedback problem for time-invariant linear systems. Optimal-output-feedback problem formulates modern control-law-design problem in which only selected number of plant-state variables used.

Halyo, Nesim↗
NASA NTRS2004

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗
NASA NTRS1975

Optimal policies for identification of stochastic linear systems

The problem of designing closed-loop policies for identification of multiinput-multioutput linear discrete-time systems with random time-varying parameters is considered in this paper using a Bayesian approach. A sensitivity index gives a measure of performance for the closed-loop laws. The computation of the optimal laws is shown to be nontrivial, an exercise in stochastic control, but open-loop, affine, and open-loop feedback optimal inputs are shown to yield tractable problems. Numerical examples are given. For time-invariant systems, the criterion considered is shown to be related to the trace of the information matrix associated with the system.

Lopez-Toledo, A. A.↗
NASA NTRS1996

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance x,ary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are (1) determining, what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major U.S. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimility with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider un-modelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Patrick, Nicholas J. M.↗
NASA NTRS1996

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance vary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are: (1) determining what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major u.s. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort-topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimality with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider unmodelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Patrick, Nicholas J. M.↗
NASA NTRS2017

Adjoint-Based Mesh Adaptation for the Sonic Boom Signature Loudness

The mesh adaptation functionality of FUN3D is utilized to obtain a mesh optimized to calculate sonic boom ground signature loudness. During this process, the coupling between the discrete-adjoints of the computational fluid dynamics tool FUN3D and the atmospheric propagation tool sBOOM is exploited to form the error estimate. This new mesh adaptation methodology will allow generation of suitable meshes adapted to reduce the estimated errors in the ground loudness, which is an optimization metric employed in supersonic aircraft design. This new output-based adaptation could allow new insights into meshing for sonic boom analysis and design, and complements existing output-based adaptation techniques such as adaptation to reduce estimated errors in off-body pressure functional. This effort could also have implications for other coupled multidisciplinary adjoint capabilities (e.g., aeroelasticity) as well as inclusion of propagation specific parameters such as prevailing winds or non-standard atmospheric conditions. Results are discussed in the context of existing methods and appropriate conclusions are drawn as to the efficacy and efficiency of the developed capability.

Rallabhandi, Sriram K.↗
NASA NTRS2002

A Discontinuous Galerkin Discretization of the Eikonal Equation on Curved Piecewise Isoparametric Triangulated Manifolds

This viewgraph presentation provides information on optimizing the travel distance between two points on a curved surface. The presentation addresses the single source shortest path problem, fast algorithms for estimating the eikonal equation, fast schemes and barrier theorems, and the discontinuous Galerkin method, including hyperbolic causality, finite element method, scalars, and marching the discontinuous Galerkin Eikonal approximation.

Barth, TIm↗
NASA NTRS1980

Modeling and Analysis of Power Processing Systems (MAPPS). Volume 1: Technical report

Computer aided design and analysis techniques were applied to power processing equipment. Topics covered include: (1) discrete time domain analysis of switching regulators for performance analysis; (2) design optimization of power converters using augmented Lagrangian penalty function technique; (3) investigation of current-injected multiloop controlled switching regulators; and (4) application of optimization for Navy VSTOL energy power system. The generation of the mathematical models and the development and application of computer aided design techniques to solve the different mathematical models are discussed. Recommendations are made for future work that would enhance the application of the computer aided design techniques for power processing systems.

Lee, F. C.↗
NASA NTRS1987

The dynamics and control of large flexible space structures X, part 1

The effect of delay in the control system input on the stability of a continuously acting controller which is designed without considering the delay is studied. The stability analysis of a second order plant is studied analytically and verified numerically. For this example it is found that the system becomes unstable for a delay which is equivalent to only 16 percent of its natural period of motion. It is also observed that even a small amount of natural damping in the system can increase the amount of delay that can be tolerated before the onset of instability. The delay problem is formulated in the discrete time domain and an analysis procedure suggested. The maximum principle from optimal control theory is applied to minimize the time required for the slewing of a general rigid spacecraft. The slewing motion need not be restricted to a single axis maneuver. The minimum slewing time is calculated based on a quasi-linearization algorithm for the resulting two point boundary value problem. Numerical examples based on the rigidized in-orbit model of the SCOLE also include the more general reflector line-of-sight slewing maneuvers.

Bainum, Peter M.↗
NASA NTRS1993

Self-organization in neural networks - Applications in structural optimization

The present paper discusses the applicability of ART (Adaptive Resonance Theory) networks, and the Hopfield and Elastic networks, in problems of structural analysis and design. A characteristic of these network architectures is the ability to classify patterns presented as inputs into specific categories. The categories may themselves represent distinct procedural solution strategies. The paper shows how this property can be adapted in the structural analysis and design problem. A second application is the use of Hopfield and Elastic networks in optimization problems. Of particular interest are problems characterized by the presence of discrete and integer design variables. The parallel computing architecture that is typical of neural networks is shown to be effective in such problems. Results of preliminary implementations in structural design problems are also included in the paper.

Hajela, Prabhat↗
NASA NTRS1997

Remote Sensing Applications for Antrim Shale Fracture Characterization, Michigan Basin

Advanced Research International (ARI) sent seven staff members to the 1997 International Coalbed Methane Symposium, held in Tuscaloosa, Alabama from May 12-17. ARI gave a short course on risk reduction strategies, including remote fracture detection, for coalbed methane exploration and development that was attended by about 25 coalbed methane industry professionals; and presented a paper entitled 'Optimizing coalbed methane cavity completion operations with the application of a new discrete element model.' We met with many potential clients and discussed our fracture detection services. China has vast coalbed methane resources, but is still highly dependent on coal-and wood-burning. This workshop, sponsored by the United Nations, was intended to help China develop its less-polluting energy reserves. ARI is successfully finding new applications for its fracture detection services. Coalbed methane exploration became an important market in this quarter, with the inception of a joint industry/government collaboration between ARI, Texaco and DOE to use remote fracture detection to identify areas with good potential for coalbed methane production in the Ferron Coal Trend of central Utah. Geothermal energy exploration is another emerging market for ARI, where fracture detection is applied to identify pathways for groundwater recharge, movement, and the locations of potential geothermal reservoirs. Ari continued work on two industry/government collaborations to demonstrate fracture detection to potential clients. Also completed the technical content layout for multimedia CD-ROM that describes our remote fracture detection services.

Kuuskraa, Vello↗
NASA NTRS2017

Robotically Assembled Aerospace Structures: Digital Material Assembly using a Gantry-Type Assembler

This paper evaluates the development of automated assembly techniques for discrete lattice structures using a multi-axis gantry type CNC machine. These lattices are made of discrete components called digital materials. We present the development of a specialized end effector that works in conjunction with the CNC machine to assemble these lattices. With this configuration we are able to place voxels at a rate of 1.5 per minute. The scalability of digital material structures due to the incremental modular assembly is one of its key traits and an important metric of interest. We investigate the build times of a 5x5 beam structure on the scale of 1 meter (325 parts), 10 meters (3,250 parts), and 30 meters (9,750 parts). Utilizing the current configuration with a single end effector, performing serial assembly with a globally fixed feed station at the edge of the build volume, the build time increases according to a scaling law of n4, where n is the build scale. Build times can be reduced significantly by integrating feed systems into the gantry itself, resulting in a scaling law of n3. A completely serial assembly process will encounter time limitations as build scale increases. Automated assembly for digital materials can assemble high performance structures from discrete parts, and techniques such as built in feed systems, parallelization, and optimization of the fastening process will yield much higher throughput.

Mechanical Structure↗