SEARCH · Engineering Papers
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.
Technology originally developed to optimize designs of composite-material aerospace structural components used to develop method for optimizing designs of orthopedic implants. Development effort focused on designing knee implants, long-term goal to develop method for optimizing designs of orthopedic implants in general.
A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.
Purpose: To develop an efficient method to implement random set-up errors and organ motion in robust optimization for proton therapy treatment planning. Methods: The plans were created with an in-house robust optimizer, coupled with a super-fast Monte Carlo (MC) engine (less than 1 minute for final dose). MC simulates random errors by shifting randomly the starting point of each particle, according to their probability distribution. Such strategy assumes a sufficient number of treatment fractions. Two strategies are presented: 1) Full robust optimization with beamlets that already include the effect of random errors and 2) Mixed robust optimization, where the nominal beamlets are involved but a correction term C modifies the prescription. Starting from C=0, the method alternates optimization of the spot weights with the nominal beamlets and updates of C, with C=Drandom-Dnominal and where Drandom results from a regular MC computation (without pre-computed beamlets) that simulates random errors. Updates of C can be triggered as often as necessary by running the MC engine with the last corrected values for the spot weights as input. The method was applied to lung and prostate cases. For both patients the range error was set to 3%, systematic setup error to 5mm and standard deviation for random errors to 5 mm. Comparison between full robust optimization and the mixed strategy (with 3 updates of C) is presented. Results: Target coverage was far below the clinical constraints (D{sub 95} > 95% of the prescribed dose) for plans where random errors were not simulated, especially for lung case. However, by using the proposed strategies the plans achieved a target coverage above clinical constraints. Conclusion: Full robust optimization gives better results than the mixed strategy, but the latter can be useful in cases where a MC engine is not available or too computationally intensive for beamlets calculation.
Atmospheric and near planet trajectory optimization by steepest descent method
A method to optimize the location, temperature, and heat dissipation rate of each cooled shield inside an insulation layer was developed. The method is based on the minimization of the entropy production rate which is proportional to the heat leak across the insulation. It is shown that the maximum number of shields to be used in most practical applications is three. However, cooled shields are useful only at low values of the overall, cold wall to hot wall absolute temperature ratio. The performance of the insulation system is relatively insensitive to deviations from the optimum values of the temperature and location of the cooling shields. Design curves for rapid estimates of the locations and temperatures of cooling shields in various types of insulations, and an equation for calculating the cooling loads for the shields are presented.
The nonlinear dynamics of a system with periodic structure can be analyzed using a square matrix. In this paper, we show that because the special property of the square matrix constructed for nonlinear dynamics, we can reduce the dimension of the matrix from the original large number for high order calculation to low dimension in the first step of the analysis. Then a stable Jordan decomposition is obtained with much lower dimension. The transformation to Jordan form provides an excellent action-angle approximation to the solution of the nonlinear dynamics, in good agreement with trajectories and tune obtained from tracking. And more importantly, the deviation from constancy of the new action-angle variable provides a measure of the stability of the phase space trajectories and their tunes. Thus the square matrix provides a novel method to optimize the nonlinear dynamic system. The method is illustrated by many examples of comparison between theory and numerical simulation. Finally, in particular, we show that the square matrix method can be used for optimization to reduce the nonlinearity of a system.
The Newton Modified Barrier Method (NMBM) is applied to structural optimization problems with large a number of design variables and constraints. This nonlinear mathematical programming algorithm was based on the Modified Barrier Function (MBF) theory and the Newton method for unconstrained optimization. The distinctive feature of the NMBM method is the rate of convergence that is due to the fact that the design remains in the Newton area after each Lagrange multiplier update. This convergence characteristic is illustrated by application to structural problems with a varying number of design variables and constraints. The results are compared with those obtained by optimality criteria (OC) methods and by the ASTROS program.
The optimized structure of α′′-Fe 16 N 2 with the three different Fe sites marked distinctly.
A method for use in the design of a complex engineering system by decomposing the problem into a set of smaller subproblems is presented. Coupling of the subproblems is preserved by means of the sensitivity derivatives of the subproblem solution to the inputs received from the system. The method allows for the division of work among many people and computers.
We present an improved trust region filter (TRF) method for optimization of combined glass box/black box systems. Glass box systems refer to models that are easily expressed in an algebraic modeling language, providing cheap and accurate derivative information. By contrast, black box systems may be computationally expensive and derivatives are unavailable. The TRF method, as first introduced in our previous work (Eason and Biegler, AIChE J . 2016; 62:3124–3136), is able to handle hybrid systems containing both glass and black box components, which can frequently arise in chemical engineering, for example, when a multiphase reactor model is included in a flow sheet optimization problem. We discuss several recent modifications in the algorithm such as the sampling region, which maintains the algorithm's global convergence properties without requiring the trust region to shrink to zero in the limit. To benchmark the development of this optimization method, a test set of problems is generated based on modified problems from the CUTEr and COPS sets. The modified algorithm demonstrates improved performance using the test problem set. Finally, the algorithm is implemented within the Pyomo environment and demonstrated on a rigorous process optimization case study for carbon capture. © 2018 American Institute of Chemical Engineers AIChE J , 64: 3934–3943, 2018
A method for generating numerical pilot opinion ratings using the optimal pilot model is introduced. The method is contained in a rating hypothesis which states that the numerical rating which a human pilot assigns to a specific vehicle and task can be directly related to the numerical value of the index of performance resulting from the optimal pilot modeling procedure as applied to that vehicle and task. The hypothesis is tested using the data from four piloted simulations. The results indicate that the hypothesis is reasonable, but that the predictive capability of the method is a strong function of the accuracy of the pilot model itself. This accuracy is, in turn, dependent upon the parameters which define the optimal modeling problem. A procedure for specifying the parameters for the optimal pilot model in the absence of experimental data is suggested.
We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.
Computation of optimal interplanetary low thrust trajectories, orbital transfer problems by means of generalized Newton-Raphson method
Abstract We describe an algorithm based on a logarithmic barrier function, Newton’s method and linear conjugate gradients that seeks an approximate minimizer of a smooth function over the non-negative orthant. We develop a bound on the complexity of the approach, stated in terms of the required accuracy and the cost of a single gradient evaluation of the objective function and/or a matrix-vector multiplication involving the Hessian of the objective. The approach can be implemented without explicit calculation or storage of the Hessian.
The sixth order Combined Compact Differencing (CCD) scheme of Chu and Fan is optimized, resulting in exceptional performance. Results indicate that the best of these optimized schemes can accurately propagate linear simple harmonic waves with fewer than three points per wavelength, while using a three point differencing stencil. Stable and accurate boundary treatments for these schemes are given, and the performance of these schemes is assessed using a benchmark problem.
The paper presents the theoretical bases and implementation techniques of sensitivity analyses for efficient structural optimization of large structures, based on finite element static and dynamic analysis methods. The sensitivity analyses have been implemented in conjunction with two methods for optimization, namely, the Mathematical Programming and Optimality Criteria methods. The paper discusses the implementation of the sensitivity analysis method into our in-house software package, AutoDesign.
The paper deals with a method of optimizing harmonically or dynamically excited structures which removes the frequency constraint (that specifies that the structure's first natural frequency of vibration must be greater than the excitation frequency), replaces the displacement constraint by an inequality constraint on the allowable stress and applies finite element approximations to the continuous one-dimensional structures. When the problem is posed in this manner, the feasible design space is disconnected or 'disjoint'. An attempt is made to explain this disjointness by studying the optimal design of a thin-walled cantilevered rod subjected to steady, simple harmonic torsional excitation. The finite element method is applied to the optimization of a harmonically excited structure with an arbitrary number of design variables, with the disjointness of the design space, a complicating factor.
This paper presents a method for optimizing the layout of floating wind farms that accounts for realistic seabed variations and the consequent adjustments to the mooring systems required for different turbine positions. The mooring lines of floating wind farms create large spatial constraints that are depth-dependent, since mooring designs must adapt to variations in seabed conditions over the array area. We develop a layout optimization methodology that addresses this, adjusting mooring system designs based on the local seabed characteristics as the layout changes and using steady-state models for the wake effects and mooring lines. The approach includes design algorithms that adjust the anchor positions and line length to achieve the desired mooring line profile for different water depths, and a layout optimization framework that implements spatial constraints between the turbines, mooring lines, and lease area boundaries. Demonstrating the method on several cases shows the effect of the seabed and spatial-constraint factors, as well as their interactions, on the optimal array layout. This demonstration paves the way for scaling up the method, using more powerful optimization algorithms to handle larger farm sizes and situations with more intensely varied seabed conditions.