Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution 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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

Optimization of continuous one-dimensional structures under steady harmonic excitation

The paper examines some questions relating to the optimal design of continuous one-dimensional structures driven by harmonically oscillating loads. Optimal-control methods are applied to a cantilever bar driven sinusoidally by an axial force at its tip to illustrate the minimum-weight design of one-dimensional structures under dynamic excitation. Realistic constraints are imposed during the optimizations, including a maximum allowable stress amplitude at any point along the bar and a minimum cross-sectional area. It is shown that in the absence of damping, the design space may contain many disjoint feasible regions, and multiple optima can exist. Detailed solutions are obtained for continuous bars with an excitation frequency less than, and then greater than, the fundamental free-vibration frequency. It is found that above a certain excitation frequency, two or more arcs with different constraints characterize the optimal designs. It is concluded that when more than two different constrained arcs characterize the optimal solution, the continuum approach may be impractical, and finite-element approximations may offer the only alternative.

Johnson, E. H.↗
NASA NTRS1989

Selection of active member locations in adaptive structures

The effective use of multiple passive and active members in adaptive structures necessitates that these members be optimally distributed throughout the structure. In truss structures, the problem falls into the class of combinatorial optimization for which the solution becomes exceedingly intractable as the problem size increases. This is overcome by using the simulated annealing algorithm to obtain near optimal locations for passive and/or active members. The maximization of the rate of energy dissipation over a finite time period as the measure of optimality is adopted. The selection of optimal locations for both passive and active members is consistently treated through the use of the energy dissipation rate criterion within the simulated annealing algorithm. Numerical examples are used to illustrate the effectiveness of the methodology for large truss structures.

Chen, G.-S.↗
NASA NTRS2016

An Efficient Ray-Tracing Method for Determining Terrain Intercepts in EDL Simulations

The calculation of a ray's intercept from an arbitrary point in space to a prescribed surface is a common task in computer simulations. The arbitrary point often represents an object that is moving according to the simulation, while the prescribed surface is fixed in a defined frame. For detailed simulations, this surface becomes complex, taking the form of real-world objects such as mountains, craters or valleys which require more advanced methods to accurately calculate a ray's intercept location. Incorporation of these complex surfaces has commonly been implemented in graphics systems that utilize highly optimized graphics processing units to analyze such features. This paper proposes a simplified method that does not require computationally intensive graphics solutions, but rather an optimized ray-tracing method for an assumed terrain dataset. This approach was developed for the Mars Science Laboratory mission which landed on the complex terrain of Gale Crater. First, this paper begins with a discussion of the simulation used to implement the model and the applicability of finding surface intercepts with respect to atmosphere modeling, altitude determination, radar modeling, and contact forces influencing vehicle dynamics. Next, the derivation and assumptions of the intercept finding method are presented. Key assumptions are noted making the routines specific to only certain types of surface data sets that are equidistantly spaced in longitude and latitude. The derivation of the method relies on ray-tracing, requiring discussion on the formulation of the ray with respect to the terrain datasets. Further discussion includes techniques for ray initialization in order to optimize the intercept search. Then, the model implementation for various new applications in the simulation are demonstrated. Finally, a validation of the accuracy is presented along with the corresponding data sets used in the validation. A performance summary of the method will be shown using the analysis from the Mars Science Laboratory's terminal descent sensing model. Alternate uses will also be shown for determining horizon maps and orbiter set times.

Shidner, Jeremy D.↗
NASA NTRS1995

An all-at-once reduced Hessian SQP scheme for aerodynamic design optimization

This paper introduces a computational scheme for solving a class of aerodynamic design problems that can be posed as nonlinear equality constrained optimizations. The scheme treats the flow and design variables as independent variables, and solves the constrained optimization problem via reduced Hessian successive quadratic programming. It updates the design and flow variables simultaneously at each iteration and allows flow variables to be infeasible before convergence. The solution of an adjoint flow equation is never needed. In addition, a range space basis is chosen so that in a certain sense the 'cross term' ignored in reduced Hessian SQP methods is minimized. Numerical results for a nozzle design using the quasi-one-dimensional Euler equations show that this scheme is computationally efficient and robust. The computational cost of a typical nozzle design is only a fraction more than that of the corresponding analysis flow calculation. Superlinear convergence is also observed, which agrees with the theoretical properties of this scheme. All optimal solutions are obtained by starting far away from the final solution.

Feng, Dan↗
NASA NTRS1986

Time scale analysis of a closed-loop discrete optimal control system

A two-time scale discrete control system is considered. The closed-loop optimal linear quadratic (LQ) regulator for the system requires the solution of a full-order algebraic matrix Riccati equation. Alternatively, the original system is decomposed into reduced-order slow and fast subsystems. The closed-loop optimal control of the subsystems requires the solution of two algebraic matrix Riccati equations of order lower than that required for the full-order system. A composite, closed-loop suboptimal control is created from the sum of the slow and fast feedback optimal controls. Numerical results obtained for an aircraft model show a very close agreement between the exact (optimal) solutions and computationally simpler composite (suboptimal) solutions. The main advantage of the method is the considerable reduction in the overall computational requirements for the closed-loop optimal control of digital flight systems.

Naidu, D. S.↗
DOE OSTI2024

How Much Reserve Fuel: Quantifying the Maximal Energy Cost of System Disturbances

Motivated by the design question of additional fuel needed to complete a task in an uncertain environment, this paper introduces metrics to quantify the maximal additional energy used by a control system in the presence of bounded disturbances, compared to a nominal, disturbance-free system. In particular, we consider the task of finite-time stabilization for a linear, time-invariant system. We compare the nominal energy required to achieve this task in the disturbance-free system to the worst-case energy over all feasible disturbances. Solving for the worst-case energy over all disturbances first leads to an optimal control problem with a least-squares solution, and then an infinite-dimensional optimization problem where we derive an upper bound on the solution. The comparison of energies is accomplished using additive and multiplicative metrics, for which we derive bounds. Simulation examples on an ADMIRE fighter jet model demonstrate the practicability of these metrics, and their variation with the distance of the initial condition from the origin and the task completion time.

koopman operator, resilience↗
DOE OSTI2024

Improving Additive Manufactured Component Performance through Multi-Scale Microstructure Simulation and Process Optimization

The purpose of this project was to utilize computational tools to understand the relationships between processing, microstructure, and properties for additively manufactured (AM) aluminum alloys for automotive applications, and to provide an engineering solution for helping to optimize process conditions. The project leverages ORNL developments in computational modeling, including AM process modeling, phase-field based microstructure evolution predictions, and data analytics techniques for mapping process conditions to material outcomes. The project utilized an Al-Cu-Mn-Zr alloy as a model material for studying formation of defects and microstructural features in response to variations in process conditions. Based on both pre-existing experimental data and simulation results, statistical process maps were constructed to identify regions of process space with minimal defect formation and advantageous microstructures and properties. The software tools used for this purpose were successful disseminated to GM, who were able to successful compile the relevant HPC codes within their own computing ecosystem and perform initial calculations to reproduce ORNL results.

36 MATERIALS SCIENCE↗
NASA NTRS1978

Specific-optimal control with a dual minimal-order observer-based compensator

The steady-state optimal control of a linear time-invariant stochastic system by means of a minimal-order dual-observer-based compensator is considered in this paper. The structure of the compensator is fixed while the associated gains are to be chosen so as to minimize a quadratic penalty on the plant state. Necessary and sufficient conditions for optimality are given, and an explicit solution is displayed. Salient features pertaining to the optimal system are: a decoupling property, a projection property, and an innovation property. Finally, it is shown that this design corresponds to a singular LQG problem, which is precisely the dual of another singular LQG problem: namely Newmann's problem. A complete picture is then given showing clearly the correspondence between the two designs.

Blanvillain, P. J.↗
NASA NTRS2015

Kodiak: An Implementation Framework for Branch and Bound Algorithms

Recursive branch and bound algorithms are often used to refine and isolate solutions to several classes of global optimization problems. A rigorous computation framework for the solution of systems of equations and inequalities involving nonlinear real arithmetic over hyper-rectangular variable and parameter domains is presented. It is derived from a generic branch and bound algorithm that has been formally verified, and utilizes self-validating enclosure methods, namely interval arithmetic and, for polynomials and rational functions, Bernstein expansion. Since bounds computed by these enclosure methods are sound, this approach may be used reliably in software verification tools. Advantage is taken of the partial derivatives of the constraint functions involved in the system, firstly to reduce the branching factor by the use of bisection heuristics and secondly to permit the computation of bifurcation sets for systems of ordinary differential equations. The associated software development, Kodiak, is presented, along with examples of three different branch and bound problem types it implements.

Smith, Andrew P.↗
NASA NTRS1993

Calibration of a synthetic aperture radiometer

Calibration algorithms for a synthetic aperture microwave radiometer are presented. The calibration is geared to Earth remote sensing applications, and is demonstrated on an airborne prototype of thinned array imager. Two approaches to the system calibration are presented; the first utilizes commonly available reference brightness temperature scenes, such as open water, and the second utilizes data collected on the antenna range. Both algorithms yield spatial response information which is cast in matrix form and inverted to obtain the image reconstruction formula. Experimental results are examined, and errors in some reconstructed images are linked to the present prototype antenna design. Algorithms for improving the synthesized antenna pattern side lobe performance are also presented. In one solution, the pattern efficiency is optimized by minimizing the pattern outside a defined beam. In another solution, the patterns are matched to a desired model pattern by the method of least squared errors. Both techniques offer an attractive alternative to aperture weighting.

Tanner, Alan B.↗
NASA NTRS1992

On options for interdisciplinary analysis and design optimization

The interdisciplinary optimization of engineering systems is discussed from the standpoint of the computational alternatives available to the designer. The analysis of such systems typically requires the solution of coupled systems of nonlinear algebraic equations. The solution procedure is necessarily iterative in nature. It is shown that the system can be solved by fixed point iteration, by Newton's method, or by a combination of the two. However, the need for sensitivity analysis may affect the choice of analysis solution method. Similarly, the optimization of the system can be formulated in several ways that are discussed in the paper. It is shown that the effect of the topology of the interaction between disciplines is a key factor in the choice of analysis, sensitivity and optimization methods. Several examples are presented to illustrate the discussion.

Haftka, R. T.↗
DOE OSTI2025

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗
NASA NTRS1995

Aerodynamic optimization studies on advanced architecture computers

The approach to carrying out multi-discipline aerospace design studies in the future, especially in massively parallel computing environments, comprises of choosing (1) suitable solvers to compute solutions to equations characterizing a discipline, and (2) efficient optimization methods. In addition, for aerodynamic optimization problems, (3) smart methodologies must be selected to modify the surface shape. In this research effort, a 'direct' optimization method is implemented on the Cray C-90 to improve aerodynamic design. It is coupled with an existing implicit Navier-Stokes solver, OVERFLOW, to compute flow solutions. The optimization method is chosen such that it can accomodate multi-discipline optimization in future computations. In the work , however, only single discipline aerodynamic optimization will be included.

Chawla, Kalpana↗
NASA NTRS1977

Coplanar tail-chase aerial combat as a differential game

A reduced-order version of the one-on-one aerial combat problem is studied as a pursuit-evasion differential game. The coplanar motion takes place at given speeds and given maximum available turn rates, and is described by three state equations which are equivalent to the range, bearing, and heading of one aircraft relative to the other. The purpose of the study is to determine those relative geometries from which either aircraft can be guaranteed a win, regardless of the maneuver strategies of the other. Termination is specified by the tail-chase geometry, at which time the roles of pursuer and evader are known. The roles are found in general, together with the associated optimal turn maneuvers, by solution of the differential game of kind. For the numerical parameters chosen, neither aircraft can win from the majority of possible initial conditions if the other turns optimally in certain critical geometries.

Merz, A. W.↗
NASA NTRS2007

Evolutionary Optimization of a Geometrically Refined Truss

Structural optimization is a field of research that has experienced noteworthy growth for many years. Researchers in this area have developed optimization tools to successfully design and model structures, typically minimizing mass while maintaining certain deflection and stress constraints. Numerous optimization studies have been performed to minimize mass, deflection, and stress on a benchmark cantilever truss problem. Predominantly traditional optimization theory is applied to this problem. The cross-sectional area of each member is optimized to minimize the aforementioned objectives. This Technical Publication (TP) presents a structural optimization technique that has been previously applied to compliant mechanism design. This technique demonstrates a method that combines topology optimization, geometric refinement, finite element analysis, and two forms of evolutionary computation: genetic algorithms and differential evolution to successfully optimize a benchmark structural optimization problem. A nontraditional solution to the benchmark problem is presented in this TP, specifically a geometrically refined topological solution. The design process begins with an alternate control mesh formulation, multilevel geometric smoothing operation, and an elastostatic structural analysis. The design process is wrapped in an evolutionary computing optimization toolset.

Hull, P. V.↗