Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “global 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 253 records · Page 14

Minimum Landing Error Powered-Descent Guidance for Planetary Missions

An algorithm improves the accuracy with which a lander can be delivered to the surface of Mars. The main idea behind this innovation is the use of a lossless convexification, which converts an otherwise non-convex constraint related to thruster throttling to a convex constraint, enabling convex optimization to be used. The convexification leads directly to an algorithm that guarantees finding the global optimum of the original nonconvex optimization problem with a deterministic upper bound on the number of iterations required for convergence. In this innovation, previous work in powered-descent guidance using convex optimization is extended to handle the case where the lander must get as close as possible to the target given the available fuel, but is not required to arrive exactly at the target. The new algorithm calculates the minimum-fuel trajectory to the target, if one exists, and calculates the trajectory that minimizes the distance to the target if no solution to the target exists. This approach poses the problem as two Second-Order Cone Programs, which can be solved to global optimality with deterministic bounds on the number of iterations required.

Blackmore, Lars↗

A general Bayesian algorithm for the autonomous alignment of beamlines

Autonomous methods to align beamlines can decrease the amount of time spent on diagnostics, and also uncover better global optima leading to better beam quality. The alignment of these beamlines is a high-dimensional expensive-to-sample optimization problem involving the simultaneous treatment of many optical elements with correlated and nonlinear dynamics. Bayesian optimization is a strategy of efficient global optimization that has proved successful in similar regimes in a wide variety of beamline alignment applications, though it has typically been implemented for particular beamlines and optimization tasks. In this paper, we present a basic formulation of Bayesian inference and Gaussian process models as they relate to multi-objective Bayesian optimization, as well as the practical challenges presented by beamline alignment. We show that the same general implementation of Bayesian optimization with special consideration for beamline alignment can quickly learn the dynamics of particular beamlines in an online fashion through hyperparameter fitting with no prior information. We present the implementation of a concise software framework for beamline alignment and test it on four different optimization problems for experiments on X-ray beamlines at the National Synchrotron Light Source II and the Advanced Light Source, and an electron beam at the Accelerator Test Facility, along with benchmarking on a simulated digital twin. We discuss new applications of the framework, and the potential for a unified approach to beamline alignment at synchrotron facilities.

47 OTHER INSTRUMENTATION↗

Application of Simulated Annealing and Related Algorithms to TWTA Design

Simulated Annealing (SA) is a stochastic optimization algorithm used to search for global minima in complex design surfaces where exhaustive searches are not computationally feasible. The algorithm is derived by simulating the annealing process, whereby a solid is heated to a liquid state and then cooled slowly to reach thermodynamic equilibrium at each temperature. The idea is that atoms in the solid continually bond and re-bond at various quantum energy levels, and with sufficient cooling time they will rearrange at the minimum energy state to form a perfect crystal. The distribution of energy levels is given by the Boltzmann distribution: as temperature drops, the probability of the presence of high-energy bonds decreases. In searching for an optimal design, local minima and discontinuities are often present in a design surface. SA presents a distinct advantage over other optimization algorithms in its ability to escape from these local minima. Just as high-energy atomic configurations are visited in the actual annealing process in order to eventually reach the minimum energy state, in SA highly non-optimal configurations are visited in order to find otherwise inaccessible global minima. The SA algorithm produces a Markov chain of points in the design space at each temperature, with a monotonically decreasing temperature. A random point is started upon, and the objective function is evaluated at that point. A stochastic perturbation is then made to the parameters of the point to arrive at a proposed new point in the design space, at which the objection function is evaluated as well. If the change in objective function values (Delta)E is negative, the proposed new point is accepted. If (Delta)E is positive, the proposed new point is accepted according to the Metropolis criterion: rho((Delta)f) = exp((-Delta)E/T), where T is the temperature for the current Markov chain. The process then repeats for the remainder of the Markov chain, after which the temperature is decremented and the process repeats. Eventually (and hopefully), a near-globally optimal solution is attained as T approaches zero. Several exciting variants of SA have recently emerged, including Discrete-State Simulated Annealing (DSSA) and Simulated Tempering (ST). The DSSA algorithm takes the thermodynamic analogy one step further by categorizing objective function evaluations into discrete states. In doing so, many of the case-specific problems associated with fine-tuning the SA algorithm can be avoided; for example, theoretical approximations for the initial and final temperature can be derived independently of the case. In this manner, DSSA provides a scheme that is more robust with respect to widely differing design surfaces. ST differs from SA in that the temperature T becomes an additional random variable in the optimization. The system is also kept in equilibrium as the temperature changes, as opposed to the system being driven out of equilibrium as temperature changes in SA. ST is designed to overcome obstacles in design surfaces where numerous local minima are separated by high barriers. These algorithms are incorporated into the optimal design of the traveling-wave tube amplifier (TWTA). The area under scrutiny is the collector, in which it would be ideal to use negative potential to decelerate the spent electron beam to zero kinetic energy just as it reaches the collector surface. In reality this is not plausible due to a number of physical limitations, including repulsion and differing levels of kinetic energy among individual electrons. Instead, the collector is designed with multiple stages depressed below ground potential. The design of this multiple-stage collector is the optimization problem of interest. One remaining problem in SA and DSSA is the difficulty in determining when equilibrium has been reached so that the current Markov chain can be terminated. It has been suggested in recent literature that simulating the thermodynamic properties opecific heat, entropy, and internal energy from the Boltzmann distribution can provide good indicators of having reached equilibrium at a certain temperature. These properties are tested for their efficacy and implemented in SA and DSSA code with respect to TWTA collector optimization.

Radke, Eric M.↗

An Optimization study on a hybrid computer

The maximum principle is applied to minimum-time optimal-control problems, and an optimization algorithm is presented which can be implemented on a hybrid computer. The state and adjoint equations are set up on ASTRAC 2, a high-speed analog computer capable of 1000 differential equation solutions per second. The optimization algorithm is implemented on a PDP-9, an 18-bit, digital computer. The optimization scheme has global and local search phases and uses a vector optimization criterion. Second and third-order bang-bang control systems are studied as examples.

Gonzalez, R. S.↗

Structural optimization of rotor blades with integrated dynamics and aerodynamics

The problem of structural optimization of helicopter rotor blades with integrated dynamic and aerodynamic design considerations is addressed. Results of recent optimization work on rotor blades for minimum weight with constraints on multiple coupled natural flap-lag frequencies, blade autorotational inertia and centrifugal stress has been reviewed. A strategy has been defined for the ongoing activities in the integrated dynamic/aerodynamic optimization of rotor blades. As a first step, the integrated dynamic/airload optimization problem has been formulated. To calculate system sensitivity derivatives necessary for the optimization recently developed, Global Sensitivity Equations (GSE) are being investigated. A need for multiple objective functions for the integrated optimization problem has been demonstrated and various techniques for solving the multiple objective function optimization are being investigated. The method called the Global Criteria Approach has been applied to a test problem with the blade in vacuum and the blade weight and the centrifugal stress as the multiple objectives. The results indicate that the method is quite effective in solving optimization problems with conflicting objective functions.

Chattopadhyay, Aditi↗

Structural optimization of rotor blades with integrated dynamics and aerodynamics

The problem of structural optimization of helicopter rotor blades with integrated dynamic and aerodynamic design considerations is addressed. Results of recent optimization work on rotor blades for minimum weight with constraints on multiple coupled natural flap-lag frequencies, blade autorotational inertia and centrifugal stress has been reviewed. A strategy has been defined for the ongoing activities in the integrated dynamic/aerodynamic optimization of rotor blades. As a first step, the integrated dynamic/airload optimization problem has been formulated. To calculate system sensitivity derivatives necessary for the optimization recently developed, Global Sensitivity Equations (GSE) are being investigated. A need for multiple objective functions for the integrated optimization problem has been demonstrated and various techniques for solving the multiple objective function optimization are being investigated. The method called the Global Criteria Approach has been applied to a test problem with the blade in vacuum and the blade weight and the centrifugal stress as the multiple objectives. The results indicate that the method is quite effective in solving optimization problems with conflicting objective functions.

Chattopadhyay, Aditi↗

Integrated aerodynamic/dynamic optimization of helicopter rotor blades

An integrated aerodynamic/dynamic optimization procedure is used to minimize blade weight and 4 per rev vertical hub shear for a rotor blade in forward flight. The coupling of aerodynamics and dynamics is accomplished through the inclusion of airloads which vary with the design variables during the optimization process. Both single and multiple objective functions are used in the optimization formulation. The Global Criteria Approach is used to formulate the multiple objective optimization and results are compared with those obtained by using single objective function formulations. Constraints are imposed on natural frequencies, autorotational inertia, and centrifugal stress. The program CAMRAD is used for the blade aerodynamic and dynamic analyses, and the program CONMIN is used for the optimization. Since the spanwise and the azimuthal variations of loading are responsible for most rotor vibration and noise, the vertical airload distributions on the blade, before and after optimization, are compared. The total power required by the rotor to produce the same amount of thrust for a given area is also calculated before and after optimization. Results indicate that integrated optimization can significantly reduce the blade weight, the hub shear and the amplitude of the vertical airload distributions on the blade and the total power required by the rotor.

Chattopadhyay, Aditi↗

Optimizing Orbit-Instrument Configuration for Global Precipitation Mission (GPM) Satellite Fleet

Following the scientific success of the Tropical Rainfall Measuring Mission (TRMM) spearheaded by a group of NASA and NASDA scientists, their external scientific collaborators, and additional investigators within the European Union's TRMM Research Program (EUROTRMM), there has been substantial progress towards the development of a new internationally organized, global scale, and satellite-based precipitation measuring mission. The highlights of this newly developing mission are a greatly expanded scope of measuring capability and a more diversified set of science objectives. The mission is called the Global Precipitation Mission (GPM). Notionally, GPM will be a constellation-type mission involving a fleet of nine satellites. In this fleet, one member is referred to as the "core" spacecraft flown in an approximately 70 degree inclined non-sun-synchronous orbit, somewhat similar to TRMM in that it carries both a multi-channel polarized passive microwave radiometer (PMW) and a radar system, but in this case it will be a dual frequency Ku-Ka band radar system enabling explicit measurements of microphysical DSD properties. The remainder of fleet members are eight orbit-synchronized, sun-synchronous "constellation" spacecraft each carrying some type of multi-channel PMW radiometer, enabling no worse than 3-hour diurnal sampling over the entire globe. In this configuration the "core" spacecraft serves as a high quality reference platform for training and calibrating the PMW rain retrieval algorithms used with the "constellation" radiometers. Within NASA, GPM has advanced to the pre-formulation phase which has enabled the initiation of a set of science and technology studies which will help lead to the final mission design some time in the 2003 period. This presentation first provides an overview of the notional GPM program and mission design, including its organizational and programmatic concepts, scientific agenda, expected instrument package, and basic flight architecture. Following this introduction, we focus specifically on the last topic, that being an analysis which leads to an optimal flight architecture dictated in part by science requirements but constrained by allowable orbital mechanics, instrument scan patterns, and antenna aperture properties. Because the optimal architecture involves an interplay between orbit mechanics and instrument specifications, it is important to recognize that in attempting to serve various scientific themes, the final optimal architecture will represent a compromise concerning dynamic range, spatial resolution, sampling interval, pointing, beam coincidence, and measurement uncertainty. Moreover, cost becomes a major factor in seeking the optimal architecture through the pathways of antenna and instrument scan designs, as well as propulsion requirements associated with the orbit heights of various "constellation" members. Although the results presented at the IGARSS-2001 meeting will likely not be the fully refined flight architecture specifications, they are expected to be nearly complete.

Smith, Eric A.↗

Singularity in structural optimization

The conditions under which global and local singularities may arise in structural optimization are examined. Examples of these singularities are presented, and a framework is given within which the singularities can be recognized. It is shown, in particular, that singularities can be identified through the analysis of stress-displacement relations together with compatibility conditions or the displacement-stress relations derived by the integrated force method of structural analysis. Methods of eliminating the effects of singularities are suggested and illustrated numerically.

Patnaik, S. N.↗

SANE: strategic autonomous non-smooth exploration for multiple optima discovery in multi-modal and non-differentiable black-box functions

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and multimodal parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, material structure image spaces, and molecular embedding spaces. Often these systems are black-boxes and time-consuming to evaluate, which resulted in strong interest towards active learning methods such as Bayesian optimization (BO). However, these systems are often noisy which make the black box function severely multi-modal and non-differentiable, where a vanilla BO can get overly focused near a single or faux optimum, deviating from the broader goal of scientific discovery. To address these limitations, here we developed Strategic Autonomous Non-Smooth Exploration (SANE) to facilitate an intelligent Bayesian optimized navigation with a proposed cost-driven probabilistic acquisition function to find multiple global and local optimal regions, avoiding the tendency to becoming trapped in a single optimum. To distinguish between a true and false optimal region due to noisy experimental measurements, a human (domain) knowledge driven dynamic surrogate gate is integrated with SANE. We implemented the gate-SANE into pre-acquired piezoresponse spectroscopy data of a ferroelectric combinatorial library with high noise levels in specific regions, and piezoresponse force microscopy (PFM) hyperspectral data. SANE demonstrated better performance than classical BO to facilitate the exploration of multiple optimal regions and thereby prioritized learning with higher coverage of scientific values in autonomous experiments. Our work showcases the potential application of this method to real-world experiments, where such combined strategic and human intervening approaches can be critical to unlocking new discoveries in autonomous research.

Biswas, Arpan [University of Tennessee, Knoxville,↗

Optimal integer resolution for attitude determination using global positioning system signals

In this paper, a new motion-based algorithm for GPS integer ambiguity resolution is derived. The first step of this algorithm converts the reference sightline vectors into body frame vectors. This is accomplished by an optimal vectorized transformation of the phase difference measurements. The result of this transformation leads to the conversion of the integer ambiguities to vectorized biases. This essentially converts the problem to the familiar magnetometer-bias determination problem, for which an optimal and efficient solution exists. Also, the formulation in this paper is re-derived to provide a sequential estimate, so that a suitable stopping condition can be found during the vehicle motion. The advantages of the new algorithm include: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can sequentially estimate the ambiguities during the vehicle motion. The only disadvantage of the new algorithm is that it requires at least three non-coplanar baselines. The performance of the new algorithm is tested on a dynamic hardware simulator.

Crassidis, John L.↗

An alternative formulation of the global sensitivity equations

To optimize the performance of any system, the sensitivity derivatives of the system's output variables with respect to its input variables must be readily available. It is also desirable that these derivatives be inexpensive to calculate as the optimization process requires many evaluations of the output variables and their derivatives. Optimization methods that have been developed for use in automated structural design programs may not be extended for use in integrated multidisciplinary design programs until adequate means of calculating accurate sensitivity derivatives of complex, internally coupled systems have been developed. Until the development of the Global Sensitivity Equations (GSE), the only method of determining the sensitivity derivatives of coupled systems has been by using finite differences. Analytical or semi-analytical derivatives do not exist as there is no analytical solution to the coupled problem. Also, difficulties arise because the finite difference method is expensive as the system has to iterate to a converged solution for each incremental input variable. The method may not be accurate, and the choice of the input variable increment may cause the difference in the output variable to be insignificant compared to computer numerical error if the choice is too small, or the process may not predict the true value of the output variable if the increment is too large. The GSE allow the system's sensitivity derivatives to be calculated as functions of the component subsystem's (local) sensitivity derivatives. These local sensitivity derivatives are calculated from specifically decoupled subsystems, whereas the GSE account for total system coupling. Since the subsystems are decoupled, it may be possible for the local derivatives to be calculated by analytical or semi-analytical methods, which generally reduce cost and improve accuracy. Several academic problems have been solved using GSE and have demonstrated encouraging results.

James, Benjamin B.↗

Coupled Low-thrust Trajectory and System Optimization via Multi-Objective Hybrid Optimal Control

The optimization of low-thrust trajectories is tightly coupled with the spacecraft hardware. Trading trajectory characteristics with system parameters ton identify viable solutions and determine mission sensitivities across discrete hardware configurations is labor intensive. Local independent optimization runs can sample the design space, but a global exploration that resolves the relationships between the system variables across multiple objectives enables a full mapping of the optimal solution space. A multi-objective, hybrid optimal control algorithm is formulated using a multi-objective genetic algorithm as an outer loop systems optimizer around a global trajectory optimizer. The coupled problem is solved simultaneously to generate Pareto-optimal solutions in a single execution. The automated approach is demonstrated on two boulder return missions.

Spacecraft Systems↗

Involute composite design evaluation using global design sensitivity derivatives

An optimization capability for involute structures has been developed. Its key feature is the use of global material geometry variables which are so chosen that all combinations of design variables within a set of lower and upper bounds correspond to manufacturable designs. A further advantage of global variables is that their number does not increase with increasing mesh density. The accuracy of the sensitivity derivatives has been verified both through finite difference tests and through the successful use of the derivatives by an optimizer. The state of the art in composite design today is still marked by point design algorithms linked together using ad hoc methods not directly related to a manufacturing procedure. The global design sensitivity approach presented here for involutes can be applied to filament wound shells and other composite constructions using material form features peculiar to each construction. The present involute optimization technology is being applied to the Space Shuttle SRM nozzle boot ring redesigns by PDA Engineering.

Hart, J. K.↗

Model-Based Thermal System Design Optimization for the James Webb Space Telescope

Spacecraft thermal model validation is normally performed by comparing model predictions with thermal test data and reducing their discrepancies to meet the mission requirements. Based on thermal engineering expertise, the model input parameters are adjusted to tune the model output response to the test data. The end result is not guaranteed to be the best solution in terms of reduced discrepancy and the process requires months to complete. A model-based methodology was developed to perform the validation process in a fully automated fashion and provide mathematical bases to the search for the optimal parameter set that minimizes the discrepancies between model and data. The methodology was successfully applied to several thermal subsystems of the James Webb Space Telescope (JWST). Global or quasiglobal optimal solutions were found and the total execution time of the model validation process was reduced to about two weeks. The model sensitivities to the parameters, which are required to solve the optimization problem, can be calculated automatically before the test begins and provide a library for sensitivity studies. This methodology represents a crucial commodity when testing complex, large-scale systems under time and budget constraints. Here, results for the JWST Core thermal system will be presented in detail.

Cataldo, Giuseppe↗

Time optimal control of a jet engine using a quasi-Hermite interpolation model

This work made preliminary efforts to generate nonlinear numerical models of a two-spooled turbofan jet engine, and subject these models to a known method of generating global, nonlinear, time optimal control laws. The models were derived numerically, directly from empirical data, as a first step in developing an automatic modelling procedure.

Comiskey, J. G.↗

Multidisciplinary optimization in aircraft design using analytic technology models

An approach to multidisciplinary optimization is presented which combines the Global Sensitivity Equation method, parametric optimization, and analytic technology models. The result is a powerful yet simple procedure for identifying key design issues. It can be used both to investigate technology integration issues very early in the design cycle, and to establish the information flow framework between disciplines for use in multidisciplinary optimization projects using much more computational intense representations of each technology. To illustrate the approach, an examination of the optimization of a short takeoff heavy transport aircraft is presented for numerous combinations of performance and technology constraints.

Malone, Brett↗

Efficient Optimization of Low-Thrust Spacecraft Trajectories

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.

Lee, Seungwon↗