Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 829 records · Page 46

Integration of Mirror Design with Suspension System Using NASA's New Mirror Modeling Software

Advances in mirror fabrication are making very large space based telescopes possible. In many applications, only monolithic mirrors can meet the performance requirements. The existing and near-term planned heavy launch vehicles place a premium on lowest possible mass, and then available payload shroud sizes limit near term designs to 4 meter class mirrors. Practical 8 meter class and beyond designs could encourage planners to include larger shrouds, if it can be proven that such mirrors can be manufactured. These two factors, lower mass and larger mirrors, present the classic optimization problem. There is a practical upper limit to how large of a mirror can be supported by a purely kinematic mount system handling both operational and launch loads. This paper shows how the suspension system and mirror blank need to be designed simultaneously. We will also explore the concepts of auxiliary support systems which act only during launch and disengage on orbit. We will define required characteristics of these systems and show how they can substantially reduce the mirror mass.

Arnold, William R., Sr.↗

Integration of Mirror Design with Suspension System using NASA's New Mirror Modeling Software

Advances in mirror fabrication are making very large space based telescopes possible. In many applications, only monolithic mirrors can meet the performance requirements. The existing and near-term planned heavy launch vehicles place a premium on lowest possible mass, and then available payload shroud sizes limit near term designs to 4 meter class mirrors. Practical 8 meter class and beyond designs could encourage planners to include larger shrouds, if it can be proven that such mirrors can be manufactured. These two factors, lower mass and larger mirrors, present the classic optimization problem. There is a practical upper limit to how large of a mirror can be supported by a purely kinematic mount system handling both operational and launch loads. This paper shows how the suspension system and mirror blank need to be designed simultaneously. We will also explore the concepts of auxiliary support systems which act only during launch and disengage on orbit. We will define required characteristics of these systems and show how they can substantially reduce the mirror mass.

Arnold,William R., Sr.↗

Optimal Topology of Aircraft Rib and Spar Structures under Aeroelastic Loads

Several topology optimization problems are conducted within the ribs and spars of a wing box. It is desired to locate the best position of lightening holes, truss/cross-bracing, etc. A variety of aeroelastic metrics are isolated for each of these problems: elastic wing compliance under trim loads and taxi loads, stress distribution, and crushing loads. Aileron effectiveness under a constant roll rate is considered, as are dynamic metrics: natural vibration frequency and flutter. This approach helps uncover the relationship between topology and aeroelasticity in subsonic transport wings, and can therefore aid in understanding the complex aircraft design process which must eventually consider all these metrics and load cases simultaneously.

Stanford, Bret K.↗

The Use of Software Agents for Autonomous Control of a DC Space Power System

In order to enable manned deep-space missions, the spacecraft must be controlled autonomously using on-board algorithms. A control architecture is proposed to enable this autonomous operation for an spacecraft electric power system and then implemented using a highly distributed network of software agents. These agents collaborate and compete with each other in order to implement each of the control functions. A subset of this control architecture is tested against a steadystate power system simulation and found to be able to solve a constrained optimization problem with competing objectives using only local information.

autonomous control↗

MADS Users' Guide

MADS (Minimization Assistant for Dynamical Systems) is a trajectory optimization code in which a user-specified performance measure is directly minimized, subject to constraints placed on a low-order discretization of user-supplied plant ordinary differential equations. This document describes the mathematical formulation of the set of trajectory optimization problems for which MADS is suitable, and describes the user interface. Usage examples are provided.

Moerder, Daniel D.↗

Trim and Structural Optimization of Subsonic Transport Wings Using Nonconventional Aeroelastic Tailoring

Several minimum-mass aeroelastic optimization problems are solved to evaluate the effectiveness of a variety of novel tailoring schemes for subsonic transport wings. Aeroelastic strength and panel buckling constraints are imposed across a variety of trimmed maneuver loads. Tailoring with metallic thickness variations, functionally graded materials, composite laminates, tow steering, and distributed trailing edge control effectors are all found to provide reductions in structural wing mass with varying degrees of success. The question as to whether this wing mass reduction will offset the increased manufacturing cost is left unresolved for each case.

Stanford, Bret K.↗

Level-Set Topology Optimization with Aeroelastic Constraints

Level-set topology optimization is used to design a wing considering skin buckling under static aeroelastic trim loading, as well as dynamic aeroelastic stability (flutter). The level-set function is defined over the entire 3D volume of a transport aircraft wing box. Therefore, the approach is not limited by any predefined structure and can explore novel configurations. The Sequential Linear Programming (SLP) level-set method is used to solve the constrained optimization problems. The proposed method is demonstrated using three problems with mass, linear buckling and flutter objective and/or constraints. A constraint aggregation method is used to handle multiple buckling constraints in the wing skins. A continuous flutter constraint formulation is used to handle difficulties arising from discontinuities in the design space caused by a switching of the critical flutter mode.

Dunning, Peter D.↗

Aeroelastic Tailoring of Transport Wings Including Transonic Flutter Constraints

Several minimum-mass optimization problems are solved to evaluate the effectiveness of a variety of novel tailoring schemes for subsonic transport wings. Aeroelastic stress and panel buckling constraints are imposed across several trimmed static maneuver loads, in addition to a transonic flutter margin constraint, captured with aerodynamic influence coefficient-based tools. Tailoring with metallic thickness variations, functionally graded materials, balanced or unbalanced composite laminates, curvilinear tow steering, and distributed trailing edge control effectors are all found to provide reductions in structural wing mass with varying degrees of success. The question as to whether this wing mass reduction will offset the increased manufacturing cost is left unresolved for each case.

Stanford, Bret K.↗

Multi-Objective Multi-User Scheduling for Space Science Missions

We have developed an architecture called MUSE (Multi-User Scheduling Environment) to enable the integration of multi-objective evolutionary algorithms with existing domain planning and scheduling tools. Our approach is intended to make it possible to re-use existing software, while obtaining the advantages of multi-objective optimization algorithms. This approach enables multiple participants to actively engage in the optimization process, each representing one or more objectives in the optimization problem. As initial applications, we apply our approach to scheduling the James Webb Space Telescope, where three objectives are modeled: minimizing wasted time, minimizing the number of observations that miss their last planning opportunity in a year, and minimizing the (vector) build up of angular momentum that would necessitate the use of mission critical propellant to dump the momentum. As a second application area, we model aspects of the Cassini science planning process, including the trade-off between collecting data (subject to onboard recorder capacity) and transmitting saved data to Earth. A third mission application is that of scheduling the Cluster 4-spacecraft constellation plasma experiment. In this paper we describe our overall architecture and our adaptations for these different application domains. We also describe our plans for applying this approach to other science mission planning and scheduling problems in the future.

science planning↗

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.↗

A New Architecture for Extending the Capabilities of the Copernicus Trajectory Optimization Program

This paper describes a new plugin architecture developed for the Copernicus spacecraft trajectory optimization program. Details of the software architecture design and development are described, as well as examples of how the capability can be used to extend the tool in order to expand the type of trajectory optimization problems that can be solved. The inclusion of plugins is a significant update to Copernicus, allowing user-created algorithms to be incorporated into the tool for the first time. The initial version of the new capability was released to the Copernicus user community with version 4.1 in March 2015, and additional refinements and improvements were included in the recent 4.2 release. It is proving quite useful, enabling Copernicus to solve problems that it was not able to solve before.

Williams, Jacob↗

Scaling Relation for Occulter Manufacturing Errors

For directly imaging exoplanets, NASA is considering space mission designs that use an external occulter as the principal starlight suppression system. These occulter designs range in diameter from 16 to 40 meters and separation distance from 8,000 to 60,000 kilometers for telescopes with primary diameters of 0.5 to 4 meters. Occulter shapes are solutions to an optimization problem which seeks to maximize suppression in the shadow subject to constraints such as size, separation, and wavelengths. These designs are based on scalar diffraction theory and must be verified experimentally to demonstrate predicted on-orbit performance. Due to the large sizes and separations involved the experiment must be scaled to lab size. We are currently expanding the existing experimental test-bed at Princeton to enable scaling of occulters operating at flight Fresnel sizes. Here we examine the effect on suppression performance of edge defects and their scaling to test-bed size.

Scalar Diffraction↗

Introduction to Adjoint Models

In this lecture, some fundamentals of adjoint models will be described. This includes a basic derivation of tangent linear and corresponding adjoint models from a parent nonlinear model, the interpretation of adjoint-derived sensitivity fields, a description of methods of automatic differentiation, and the use of adjoint models to solve various optimization problems, including singular vectors. Concluding remarks will attempt to correct common misconceptions about adjoint models and their utilization.

EnKF↗

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

uncertainty↗

Optimization of an Aeroservoelastic Wing with Distributed Multiple Control Surfaces

This paper considers the aeroelastic optimization of a subsonic transport wingbox under a variety of static and dynamic aeroelastic constraints. Three types of design variables are utilized: structural variables (skin thickness, stiffener details), the quasi-steady deflection scheduling of a series of control surfaces distributed along the trailing edge for maneuver load alleviation and trim attainment, and the design details of an LQR controller, which commands oscillatory hinge moments into those same control surfaces. Optimization problems are solved where a closed loop flutter constraint is forced to satisfy the required flight margin, and mass reduction benefits are realized by relaxing the open loop flutter requirements.

Stanford, Bret K.↗

Random Predictor Models for Rigorous Uncertainty Quantification: Part 2

This and a companion paper propose techniques for constructing parametric mathematical models describing key features of the distribution of an output variable given input-output data. By contrast to standard models, which yield a single output value at each value of the input, Random Predictors Models (RPMs) yield a random variable at each value of the input. Optimization-based strategies for calculating RPMs having a polynomial dependency on the input and a linear dependency on the parameters are proposed. These formulations yield RPMs having various levels of fidelity in which the mean, the variance, and the range of the model's parameter, thus of the output, are prescribed. As such they encompass all RPMs conforming to these prescriptions. The RPMs are optimal in the sense that they yield the tightest predictions for which all (or, depending on the formulation, most) of the observations are less than a fixed number of standard deviations from the mean prediction. When the data satisfies mild stochastic assumptions, and the optimization problem(s) used to calculate the RPM is convex (or, when its solution coincides with the solution to an auxiliary convex problem), the model's reliability, which is the probability that a future observation would be within the predicted ranges, is bounded rigorously.

Crespo, Luis G.↗

Random Predictor Models for Rigorous Uncertainty Quantification: Part 1

This and a companion paper propose techniques for constructing parametric mathematical models describing key features of the distribution of an output variable given input-output data. By contrast to standard models, which yield a single output value at each value of the input, Random Predictors Models (RPMs) yield a random variable at each value of the input. Optimization-based strategies for calculating RPMs having a polynomial dependency on the input and a linear dependency on the parameters are proposed. These formulations yield RPMs having various levels of fidelity in which the mean and the variance of the model's parameters, thus of the predicted output, are prescribed. As such they encompass all RPMs conforming to these prescriptions. The RPMs are optimal in the sense that they yield the tightest predictions for which all (or, depending on the formulation, most) of the observations are less than a fixed number of standard deviations from the mean prediction. When the data satisfies mild stochastic assumptions, and the optimization problem(s) used to calculate the RPM is convex (or, when its solution coincides with the solution to an auxiliary convex problem), the model's reliability, which is the probability that a future observation would be within the predicted ranges, can be bounded tightly and rigorously.

Crespo, Luis G.↗

Comparison of Curvilinear Stiffeners and Tow Steered Composites for Aeroelastic Tailoring of Transports

A series of aeroelastic optimization problems are solved on a high aspect ratio wingbox of the Common Research Model, in an effort to minimize structural mass under coupled stress, buckling, and flutter constraints. Two technologies are of particular interest: tow steered composite laminate skins and curvilinear stiffeners. Both methods are found to afford feasible reductions in mass over their non-curvilinear structural counterparts, through both distinct and shared mechanisms for passively controlling aeroelastic performance. Some degree of diminishing returns are seen when curvilinear stiffeners and curvilinear fiber tow paths are used simultaneously.

Stanford, Bret K.↗