Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational 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 1,729 records · Page 96

Implementation of Topology Optimization Using OpenMDAO

Topology optimization is one of the widely known branches among the structural optimization, and it distinguishes itself by a large design domain and versatility. It can determine the optimal design out of an infinite number of configurations, thereby drawing interest from both industry and academia with regards to its applicability to additive manufacturing. However, its implementation is often a daunting task for engineers in practice. One of the issues is the programming effort required whenever the implementation requires any changes, ranging from subtle tweaks to drastic changes in the problem definition, and the derivative computation must be correspondingly updated after any change. The implementation, therefore, is not only time-consuming but also repetitive and susceptible to human-induced errors. In this regard, topology optimization implementations stand to benefit from reusability, ease of restructuring, and modularity. In this work, we propose OpenMDAO, a computational framework for multidisciplinary design optimization (MDO), as a generic platform for topology optimization. Two widely used topology optimization techniquesâ€"density-based and level-setâ€"are implemented as a demonstration. These techniques are implemented in a decomposed manner, with the aid of the modular architecture of OpenMDAO as well as state-of-the-art numerical methods. Variations on the density-based topology optimization approach are shown to demonstrate the modularity and automation for derivative computation that OpenMDAO provides.

Chung, Hayoung↗

The Apollo Lunar Roving Vehicle.

After listing the basic requirements such as operational demands and lunar environmental conditions, characteristic design data of the roving vehicle are given with special attention to the four wheel drive and its control system, the steering system, and the navigational instrumentation. The overall system is optimized in view of total mass, range, mobility, load carrying capability, safety, highest reliability through redundancy, and last but not least, cost and development time. Optimization of the drive and power system has first been evaluated by mathematical models and computational simulation of the vehicle hardware, the wheel/soil interaction, and the lunar terrain profile. The next step to refine optimization and evaluation of the drive, steering, and power system including man/machine interaction has been carried out by the use of a six-degree-of-freedom simulator subjecting the astronauts in their space suits to simulated vehicle motions while driving over a simulated terrain, observable on a cathode ray tube display.

Haeussermann, W.↗

Discretized energy minimization in a wave guide with point sources

An anti-noise problem on a finite time interval is solved by minimization of a quadratic functional on the Hilbert space of square integrable controls. To this end, the one-dimensional wave equation with point sources and pointwise reflecting boundary conditions is decomposed into a system for the two propagating components of waves. Wellposedness of this system is proved for a class of data that includes piecewise linear initial conditions and piecewise constant forcing functions. It is shown that for such data the optimal piecewise constant control is the solution of a sparse linear system. Methods for its computational treatment are presented as well as examples of their applicability. The convergence of discrete approximations to the general optimization problem is demonstrated by finite element methods.

Propst, G.↗

Shuttle cryogenic supply system. Optimization study. Volume 5 B-1: Programmers manual for math models

A computer program for rapid parametric evaluation of various types of cryogenics spacecraft systems is presented. The mathematical techniques of the program provide the capability for in-depth analysis combined with rapid problem solution for the production of a large quantity of soundly based trade-study data. The program requires a large data bank capable of providing characteristics performance data for a wide variety of component assemblies used in cryogenic systems. The program data requirements are divided into: (1) the semipermanent data tables and source data for performance characteristics and (2) the variable input data which contains input parameters which may be perturbated for parametric system studies.

Source record↗

A numerical algorithm for optimal feedback gains in high dimensional LQR problems

A hybrid method for computing the feedback gains in linear quadratic regulator problems is proposed. The method, which combines the use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated so as to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantage of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed and numerical evidence of the efficacy of our ideas presented.

Banks, H. T.↗

RIACS/USRA

The Research Institute for Advanced Computer Science (RIACS) was established by the Universities Space Research Association (USRA) at the NASA Ames Research Center (ARC) on 6 June 1983. RIACS is privately operated by USRA, a consortium of universities with research programs in the aerospace sciences, under contract with NASA. The primary mission of RIACS is to provide research and expertise in computer science and scientific computing to support the scientific missions of NASA ARC. The research carried out at RIACS must change its emphasis from year to year in response to NASA ARC's changing needs and technological opportunities. A flexible scientific staff is provided through a university faculty visitor program, a post doctoral program, and a student visitor program. Not only does this provide appropriate expertise but it also introduces scientists outside of NASA to NASA problems. A small group of core RIACS staff provides continuity and interacts with an ARC technical monitor and scientific advisory group to determine the RIACS mission. RIACS activities are reviewed and monitored by a USRA advisory council and ARC technical monitor. Research at RIACS is currently being done in the following areas: Parallel Computing, Advanced Methods for Scientific Computing, High Performance Networks and Technology, and Learning Systems. Parallel compiler techniques, adaptive numerical methods for flows in complicated geometries, and optimization were identified as important problems to investigate for ARC's involvement in the Computational Grand Challenges of the next decade.

Oliger, Joseph↗

Flexible Approximation Model Approach for Bi-Level Integrated System Synthesis

Bi-Level Integrated System Synthesis (BLISS) is an approach that allows design problems to be naturally decomposed into a set of subsystem optimizations and a single system optimization. In the BLISS approach, approximate mathematical models are used to transfer information from the subsystem optimizations to the system optimization. Accurate approximation models are therefore critical to the success of the BLISS procedure. In this paper, new capabilities that are being developed to generate accurate approximation models for BLISS procedure will be described. The benefits of using flexible approximation models such as Kriging will be demonstrated in terms of convergence characteristics and computational cost. An approach of dealing with cases where subsystem optimization cannot find a feasible design will be investigated by using the new flexible approximation models for the violated local constraints.

Sobieszczanski-Sobieski, Jaroslaw↗

Active flutter control using discrete optimal constrained dynamic compensators

A method for synthesizing digital active flutter suppression controllers using the concept of optimal output feedback is presented. A recently developd convergent algorithm is employed to determine constrained control law parameters that minimize an infinite-time discrete quadratic performance index. Low-order compensator dynamics are included in the control law and the compensator parameters are computed along with the output feedback gain as part of the optimization process. An input noise adjustment procedure is used to improve the stability margins of the digital active flutter controller. Results from investigations into sample rate variation, prefilter pole variation, and effects of varying flight condtions are discussed. The study indicates that a digital control law which accommodates computation delay can stabilize the wing with reasonable rms performance and adequate stability margins.

Broussard, J. R.↗

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

Probabilistic composite analysis

Formal procedures are described which are used to computationally simulate the probabilistic behavior of composite structures. The computational simulation starts with the uncertainties associated with all aspects of a composite structure (constituents, fabrication, assembling, etc.) and encompasses all aspects of composite behavior (micromechanics, macromechanics, combined stress failure, laminate theory, structural response, and tailoring) optimization. Typical cases are included to illustrate the formal procedure for computational simulation. The collective results of the sample cases demonstrate that uncertainties in composite behavior and structural response can be probabilistically quantified.

Chamis, C. C.↗

A Modular Conjugate Heat Transfer Optimization Framework for Thermal Management of Electric Aircraft

Conjugate heat transfer (CHT) analysis and optimization is a powerful method for improving thermal management, as it simultaneously resolves the temperature distribution in both fluid and solid domains. This paper presents a modular, discrete adjoint-based CHT optimization capability integrated within the OpenMDAO/MPhys framework. A unique feature of the proposed framework is its flexibility to extend to multidisciplinary optimization, including aero-structural-thermal applications. The fluid domain is modeled using a finite-volume Computational Fluid Dynamics (CFD) solver, and the solid domain with a conduction heat transfer solver. A mixed Neumann-Dirichlet boundary condition is developed to enable full submersion of the solid geometry within the fluid domain, while ensuring consistent temperature and heat flux coupling at the CHT interface. Gradient-based optimization is performed; the gradients are efficiently computed using the discrete adjoint solvers implemented in DAFoam. To demonstrate the method, this paper considers two cases related to electric aircraft thermal management: a U-bend heat exchanger and an actively cooled battery pack. The U-bend case aims to minimize pressure loss while maximizing heat flux by changing the pipe geometry. The optimized design reduces pressure loss by 52.7% and increases total heat flux by 2.3%. In the battery pack case, a 3-by-3 cell configuration is cooled by ambient airflow, with constant heat generation prescribed in the cells. The battery casing shape serves as the design variable, and the objective function is a weighted sum of pressure loss and pack weight, subject to a maximum temperature constraint. The optimized design achieves a 44.6% reduction in pressure loss and a 1.5% reduction in weight, while satisfying the thermal constraint. To ensure the reliability of the optimized designs, this study validates coarse-mesh, steady-state predictions against fine-mesh unsteady simulations, demonstrating consistency within acceptable errors. This work demonstrates the potential of the developed framework to enable rapid, high-fidelity design of thermal management systems for electric aircraft.

heat transfer↗

Development and Demonstration of an Ada Test Generation System

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

Source record↗

Enabling Parametric Optimal Ascent Trajectory Modeling During Early Phases of Design

During the early phases of engineering design, the costs committed are high, costs incurred are low, and the design freedom is high. It is well documented that decisions made in these early design phases drive the entire design's life cycle. In a traditional paradigm, key design decisions are made when little is known about the design. As the design matures, design changes become more difficult -- in both cost and schedule -- to enact. Indeed, the current capability-based paradigm that has emerged because of the constrained economic environment calls for the infusion of knowledge acquired during later design phases into earlier design phases, i.e. bring knowledge acquired during preliminary and detailed design into pre-conceptual and conceptual design. An area of critical importance to launch vehicle design is the optimization of its ascent trajectory, as the optimal trajectory will be able to take full advantage of the launch vehicle's capability to deliver a maximum amount of payload into orbit. Hence, the optimal ascent trajectory plays an important role in the vehicle's affordability posture as the need for more economically viable access to space solutions are needed in today's constrained economic environment. The problem of ascent trajectory optimization is not a new one. There are several programs that are widely used in industry that allows trajectory analysts to, based on detailed vehicle and insertion orbit parameters, determine the optimal ascent trajectory. Yet, little information is known about the launch vehicle early in the design phase - information that is required of many different disciplines in order to successfully optimize the ascent trajectory. Thus, the current paradigm of optimizing ascent trajectories involves generating point solutions for every change in a vehicle's design parameters. This is often a very tedious, manual, and time-consuming task for the analysts. Moreover, the trajectory design space is highly non-linear and multi-modal due to the interaction of various constraints. Additionally, when these obstacles are coupled with The Program to Optimize Simulated Trajectories [1] (POST), an industry standard program to optimize ascent trajectories that is difficult to use, it requires expert trajectory analysts to effectively optimize a vehicle's ascent trajectory. As it has been pointed out, the paradigm of trajectory optimization is still a very manual one because using modern computational resources on POST is still a challenging problem. The nuances and difficulties involved in correctly utilizing, and therefore automating, the program presents a large problem. In order to address these issues, the authors will discuss a methodology that has been developed. The methodology is two-fold: first, a set of heuristics will be introduced and discussed that were captured while working with expert analysts to replicate the current state-of-the-art; secondly, leveraging the power of modern computing to evaluate multiple trajectories simultaneously, and therefore, enable the exploration of the trajectory's design space early during the pre-conceptual and conceptual phases of design. When this methodology is coupled with design of experiments in order to train surrogate models, the authors were able to visualize the trajectory design space, enabling parametric optimal ascent trajectory information to be introduced with other pre-conceptual and conceptual design tools. The potential impact of this methodology's success would be a fully automated POST evaluation suite for the purpose of conceptual and preliminary design trade studies. This will enable engineers to characterize the ascent trajectory's sensitivity to design changes in an arbitrary number of dimensions and for finding settings for trajectory specific variables, which result in optimal performance for a "dialed-in" launch vehicle design. The effort described in this paper was developed for the Advanced Concepts Office [2] at NASA Marshall Space Flight Center

Holt, James B.↗

Research and development activities in unified control-structure modeling and design

Results of work sponsored by JPL and other organizations to develop a unified control/structures modeling and design capability for large space structures is presented. Recent analytical results are presented to demonstrate the significant interdependence between structural and control properties. A new design methodology is suggested in which the structure, material properties, dynamic model and control design are all optimized simultaneously. The development of a methodology for global design optimization is recommended as a long term goal. It is suggested that this methodology should be incorporated into computer aided engineering programs, which eventually will be supplemented by an expert system to aid design optimization. Recommendations are also presented for near term research activities at JPL. The key recommendation is to continue the development of integrated dynamic modeling/control design techniques, with special attention given to the development of structural models specially tailored to support design.

Nayak, A. P.↗

Robust Design Under Uncertainty of Hypersonic Inlets

The objective of this work is to optimize scramjet inlet designs under uncertainty at multiple fidelity levels. Optimizations are performed for both deterministic and stochastic conditions. For stochastic conditions, robust design is used to minimize the variance in system performance in addition to optimizing mean system performance. Uncertainty quantification is performed using non-intrusive polynomial chaos. Comparisons are made between low-fidelity analysis and high-fidelity analysis, as well as deterministic optimization and robust optimization. Results indicate that the general design trend of previous inlet optimization techniques is recovered for the external compression portion of an inlet. For the internal compression portion of an inlet, when viscous effects become more significant and boundary layer separation becomes more likely, the optimal trend departs from previous results. Multifidelity uncertainty quantification methods are found to substantially reduce the computation time of robust design while obtaining results that nearly match those of high-fidelity analysis. Robust optimization is found to decrease the standard deviation of throat Mach number by up to 40% compared to deterministic optimization. Changes in the design variables and total turning that lead to robust scramjet inlets are identified and linked back to fundamental physical principles through the theta-beta-Mach function.

Hypersonic↗

Data engineering systems: Computerized modeling and data bank capabilities for engineering analysis

The Data Engineering System (DES) is a computer-based system that organizes technical data and provides automated mechanisms for storage, retrieval, and engineering analysis. The DES combines the benefits of a structured data base system with automated links to large-scale analysis codes. While the DES provides the user with many of the capabilities of a computer-aided design (CAD) system, the systems are actually quite different in several respects. A typical CAD system emphasizes interactive graphics capabilities and organizes data in a manner that optimizes these graphics. On the other hand, the DES is a computer-aided engineering system intended for the engineer who must operationally understand an existing or planned design or who desires to carry out additional technical analysis based on a particular design. The DES emphasizes data retrieval in a form that not only provides the engineer access to search and display the data but also links the data automatically with the computer analysis codes.

Kopp, H.↗

Genetically Engineered Microelectronic Infrared Filters

A genetic algorithm is used for design of infrared filters and in the understanding of the material structure of a resonant tunneling diode. These two components are examples of microdevices and nanodevices that can be numerically simulated using fundamental mathematical and physical models. Because the number of parameters that can be used in the design of one of these devices is large, and because experimental exploration of the design space is unfeasible, reliable software models integrated with global optimization methods are examined The genetic algorithm and engineering design codes have been implemented on massively parallel computers to exploit their high performance. Design results are presented for the infrared filter showing new and optimized device design. Results for nanodevices are presented in a companion paper at this workshop.

Cwik, Tom↗