Search NASA⌕ Search

SEARCH · Search NASA

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 163 records · Page 9

On computing the global time-optimal motions of robotic manipulators in the presence of obstacles

A method for computing the time-optimal motions of robotic manipulators is presented that considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacles. The optimization problem is reduced to a search for the time-optimal path in the n-dimensional position space. A small set of near-optimal paths is first efficiently selected from a grid, using a branch and bound search and a series of lower bound estimates on the traveling time along a given path. These paths are further optimized with a local path optimization to yield the global optimal solution. Obstacles are considered by eliminating the collision points from the tessellated space and by adding a penalty function to the motion time in the local optimization. The computational efficiency of the method stems from the reduced dimensionality of the searched spaced and from combining the grid search with a local optimization. The method is demonstrated in several examples for two- and six-degree-of-freedom manipulators with obstacles.

Shiller, Zvi↗

EZFF: Python library for multi-objective parameterization and uncertainty quantification of interatomic forcefields for molecular dynamics

Parameterization of interatomic forcefields is a necessary first step in performing molecular dynamics simulations. This is a non-trivial global optimization problem involving quantification of multiple empirical variables against one or more properties. We present EZFF, a lightweight Python library for parameterization of several types of interatomic forcefields implemented in several molecular dynamics engines against multiple objectives using genetic-algorithm-based global optimization methods. The EZFF scheme provides unique functionality such as the parameterization of hybrid forcefields composed of multiple forcefield interactions as well as built-in quantification of uncertainty in forcefield parameters and can be easily extended to other forcefield functional forms as well as MD engines.

97 MATHEMATICS AND COMPUTING↗

Design of structure/control systems with transient response constraints exhibiting relative minima

Structural optimization problems involving dynamic behavior constraints often exhibit nonconvex design spaces. The direct application of a global optimization algorithm requires a large number of function evaluations which in term require a large number of dynamic structural analyses. This work presents a strategy aimed at finding the global optimum for problems with transient dynamic behavior constraints based on approximation concepts. The method consists of generating and solving a sequence of approximate problems using a global optimizer. The approximations are explicit and capture the inherent nonconvexity of the exact functions. A simple example problem is presented.

Sepulveda, A. E.↗

Shape Optimization of Supersonic Turbines Using Response Surface and Neural Network Methods

Turbine performance directly affects engine specific impulse, thrust-to-weight ratio, and cost in a rocket propulsion system. A global optimization framework combining the radial basis neural network (RBNN) and the polynomial-based response surface method (RSM) is constructed for shape optimization of a supersonic turbine. Based on the optimized preliminary design, shape optimization is performed for the first vane and blade of a 2-stage supersonic turbine, involving O(10) design variables. The design of experiment approach is adopted to reduce the data size needed by the optimization task. It is demonstrated that a major merit of the global optimization approach is that it enables one to adaptively revise the design space to perform multiple optimization cycles. This benefit is realized when an optimal design approaches the boundary of a pre-defined design space. Furthermore, by inspecting the influence of each design variable, one can also gain insight into the existence of multiple design choices and select the optimum design based on other factors such as stress and materials considerations.

Papila, Nilay↗

A mathematical basis for the design and design optimization of adaptive trusses in precision control

A mathematical basis for the optimal design of adaptive trusses to be used in supporting precision equipment is provided. The general theory of adaptive structures is introduced, and the global optimization problem of placing a limited number, q, of actuators, so as to maximally achieve precision control and provide prestress, is stated. Two serialized optimization problems, namely, optimal actuator placement for prestress and optimal actuator placement for precision control, are addressed. In the case of prestressing, the computation of a 'desired' prestress is discussed, the interaction between actuators and redundants in conveying the prestress is shown in its mathematical form, and a methodology for arriving at the optimal placement of actuators and additional redundants is discussed. With regard to precision control, an optimal placement scheme (for q actuators) for maximum 'authority' over the precision points is suggested. The results of the two serialized optimization problems are combined to give a suboptimal solution to the global optimization problem. A method for improving this suboptimal actuator placement scheme by iteration is presented.

Das, S. K.↗

Accuracy Assessment of Response Surface Approximations for Supersonic Turbine Design

There is a growing trend to employ CFD tools to supply the necessary information for design optimization of fluid dynamics components/systems. Such results are prone to uncertainties due to reasons including discretization. errors, incomplete convergence of computational procedures, and errors associated with physical models such as turbulence closures. Based on this type of information, gradient-based optimization algorithms often suffer from the noisy calculations, which can seriously compromise the outcome. Similar problems arise from the experimental measurements. Global optimization techniques, such as those based on the response surface (RS) concept are becoming popular in part because they can overcome some of these barriers. However, there are also fundamental issues related to such global optimization technique such as RS. For example, in high dimensional design spaces, typically only a small number of function evaluations are available due to computational and experimental costs. On the other hand, complex features of the design variables do not allow one to model the global characteristics of the design space with simple quadratic polynomials. Consequently a main challenge is to reduce the size of the region where we fit the RS, or make it more accurate in the regions where the optimum is likely to reside. Response Surface techniques using either polynomials or and Neural Network (NN) methods offer designers alternatives to conduct design optimization. The RS technique employs statistical and numerical techniques to establish the relationship between design variables and objective/constraint functions, typically using polynomials. In this study, we aim at addressing issues related to the following questions: (1) How to identify outliers associated with a given RS representation and improve the RS model via appropriate treatments? (2) How to focus on selected design data so that RS can give better performance in regions critical to design optimization? (3) How to combine NN and polynomial techniques for improving the accuracy of the RS model?

Papila, Nilay↗

Distributed Rules-Based Deconfliction of ADMS Applications - Part 2: Conceptual Implementation

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. The first document previously defined the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem was decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. It was recommended that selection of the optimal number of decompositions of the deconfliction problem be made based on a tradeoff analysis between computational speed and global optimality. This second document defines an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Distributed Rules-Based Deconfliction of ADMS Applications: Part 1: Requirements & Decomposition

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. This first document introduces the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem is decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. Selection of the optimal number of decompositions of the deconfliction problem should be made based on a tradeoff analysis between computational speed and global optimality. This second document will define an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Understanding the Impact of Unobservable Variables on the Performance of Predictive Models: The Need for Feature Space Partitioning and Fusion

When developing predictive models over a dataset, the model is globally optimized across the entire feature space to learn a decision boundary. However, when unobservable variables—which cannot be measured or estimated—interact with the observable variables, this can negatively impact the optimization applied to the decision boundary since the data samples introduced by unobservable variables may have little to no association with the applied global optimization. This, consequently, penalizes the entire decision boundary and model performance. This paper examines some of the detrimental effects of unobservable variables, particularly their role in creating new modes in the distribution of observable variables and reducing the separability of class distributions. Such challenges result in skewed or warped decision boundaries and decreased accuracy of model predictions, particularly for interpretable models like logistic regression and decision trees. Through two illustrative case examples, we highlight the need to address the challenges imposed by unobservable variables. We propose a strategy to mitigate these challenges by creating local regions within the feature space through partitioning. This enables the optimization of local models within the regions to overcome the impact of unobservability in different feature space localities. Research into a more sophisticated partitioning strategy and where the partition should be relative to the sample of interest is left as future work. Through the analysis of the impact of unobservability and the development of a partitioning method, we demonstrate the clear need for a partitioning strategy that integrates knowledge from multiple local models to estimate risk factors using information fusion. Thus, we establish the foundation and motivation for using partitioning and information fusion to overcome the effects of unobservability in predictive models. Formal fusion methods, such as Dempster-Shafer theory, can better leverage the information from local regions to improve the performance of interpretable predictive models in the presence of unobservable variables.

Time Series Data↗

Exploring Structural Diversity and Fluxionality of Pt n ( n = 10–13) Clusters from First-Principles

Subnanometer transition-metal clusters have been shown to possess catalytic activity that is size-dependent. It has been suggested that the fluxionality of these small clusters may be closely related to their catalytic activity. Here we use basin-hopping global optimization with density functional theory (DFT) to study the energy landscape of Ptn (n = 10–13) clusters. We analyze a large set of local minima obtained from the DFT-based global optimization. We find that Pt10 is unique with respect to the other studied sizes in its structural landscape, which shows a single, distinct structural motif corresponding to a tetrahedral global minimum. In contrast, Pt11–13 all display characteristics of high fluxionality with the presence of multiple significantly differing structural features in the low-energy region, as characterized by coordination number, interatomic distances, and shape. These observations demonstrate the structural diversity and fluxionality of the subnanometer Pt clusters that will have important implications for catalysis.

Fung, Victor↗

Visualizing and improving the robustness of phase retrieval algorithms

Coherent x-ray diffractive imaging is a novel imaging technique that utilizes phase retrieval and nonlinear optimization methods to image matter at nanometer scales. We explore how the convergence properties of a popular phase retrieval algorithm, Fienup's HIO, behave by introducing a reduced dimensionality problem allowing us to visualize and quantify convergence to local minima and the globally optimal solution. We then introduce generalizations of HIO that improve upon the original algorithm's ability to converge to the globally optimal solution.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

What is the optimal way to prepare a Bell state using measurement and feedback?

Recent work has shown that the use of quantum feedback can significantly enhance both the speed and success rate of measurement-based remote entanglement generation, but it is generally unknown what feedback protocols are optimal for these tasks. In this work, we consider two common measurements that are capable of projecting into pairwise entangled states, namely half- and full-parity measurements of two qubits, and determine in each case a globally optimal protocol for generation of entanglement. For the half-parity measurement, we rederive a previously described protocol using more general methods and prove that it is globally optimal for several figures of merit, including maximal concurrence or fidelity and minimal time to reach a specified concurrence or fidelity. For the full-parity measurement, we derive a protocol for rapid entanglement generation related to that of (Hill, Ralph, Phys. Rev. A 77, 014305), and then map the dynamics of the concurrence of the state to the Bloch vector length of an effective qubit. This mapping allows us to prove several optimality results for feedback protocols with full-parity measurements. We further show that our full-parity protocol transfers entanglement optimally from one qubit to the other amongst all measurement-based schemes. The methods developed here will be useful for deriving feedback protocols and determining their optimality properties in many other quantum systems subject to measurement and unitary operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TH-A-9A-02: BEST IN PHYSICS (THERAPY) - 4D IMRT Planning Using Highly- Parallelizable Particle Swarm Optimization

Purpose: We present a particle swarm optimization (PSO)-based 4D IMRT planning technique designed for dynamic MLC tracking delivery to lung tumors. The key idea is to utilize the temporal dimension as an additional degree of freedom rather than a constraint in order to achieve improved sparing of organs at risk (OARs). Methods: The target and normal structures were manually contoured on each of the ten phases of a 4DCT scan acquired from a lung SBRT patient who exhibited 1.5cm tumor motion despite the use of abdominal compression. Corresponding ten IMRT plans were generated using the Eclipse treatment planning system. These plans served as initial guess solutions for the PSO algorithm. Fluence weights were optimized over the entire solution space i.e., 10 phases × 12 beams × 166 control points. The size of the solution space motivated our choice of PSO, which is a highly parallelizable stochastic global optimization technique that is well-suited for such large problems. A summed fluence map was created using an in-house B-spline deformable image registration. Each plan was compared with a corresponding, internal target volume (ITV)-based IMRT plan. Results: The PSO 4D IMRT plan yielded comparable PTV coverage and significantly higher dose—sparing for parallel and serial OARs compared to the ITV-based plan. The dose-sparing achieved via PSO-4DIMRT was: lung Dmean = 28%; lung V20 = 90%; spinal cord Dmax = 23%; esophagus Dmax = 31%; heart Dmax = 51%; heart Dmean = 64%. Conclusion: Truly 4D IMRT that uses the temporal dimension as an additional degree of freedom can achieve significant dose sparing of serial and parallel OARs. Given the large solution space, PSO represents an attractive, parallelizable tool to achieve globally optimal solutions for such problems. This work was supported through funding from the National Institutes of Health and Varian Medical Systems. Amit Sawant has research funding from Varian Medical Systems, VisionRT Ltd. and Elekta.

60 APPLIED LIFE SCIENCES↗

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗

Microscopically based energy density functionals for nuclei using the density matrix expansion: Implementation and pre-optimization

In a recent series of articles, Gebremariam, Bogner, and Duguet derived a microscopically based nuclear energy density functional by applying the density matrix expansion (DME) to the Hartree-Fock energy obtained from chiral effective field theory two- and three-nucleon interactions. Owing to the structure of the chiral interactions, each coupling in the DME functional is given as the sum of a coupling constant arising from zero-range contact interactions and a coupling function of the density arising from the finite-range pion exchanges. Because the contact contributions have essentially the same structure as those entering empirical Skyrme functionals, a microscopically guided Skyrme phenomenology has been suggested in which the contact terms in the DME functional are released for optimization to finite-density observables to capture short-range correlation energy contributions from beyond Hartree-Fock. The present article is the first attempt to assess the ability of the newly suggested DME functional, which has a much richer set of density dependencies than traditional Skyrme functionals, to generate sensible and stable results for nuclear applications. The results of the first proof-of-principle calculations are given, and numerous practical issues related to the implementation of the new functional in existing Skyrme codes are discussed. Using a restricted singular value decomposition optimization procedure, it is found that the new DME functional gives numerically stable results and exhibits a small but systematic reduction of our test {chi}{sup 2} function compared to standard Skyrme functionals, thus justifying its suitability for future global optimizations and large-scale calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The International Global Network of Geodetic Fiducial Stations

Scientific need and technological opportunity require that we move toward implementing a global network of geodetic fiducial stations which feature co-located SLR, VLBI, GNSS, and DORIS instrumentation. Earth science of the next decade will require more accurate global change measurements of sea level topography, sea level change, polar ice mass balance, hydrological and atmospheric mass flux. and topographic deformation, real time mm scale navigation and precision time transfer on a global scale. These scientific requirements have been translated into a goal of mm scale annual stability for the terrestrial reference frame, earth orientation parameters, as well as the orbit and clock determinations tbr the GNSS systems. To meet these challenges, the four geodetic observing systems must be more tightly integrated in technology, location, and analysis. NASA strongly supports the objectives of the IGGOS initiative vis NASA's National Geodetic Observatory and INDIGO programs. The Global networks of GNSS, SLR. and VLBI observatories are for the most part poorly suited for these new demands. These important geodetic networks have evolved with little planning yet these systems are providing essential measurements to a wide swath of society. New signal structures in the GPS and the developing Galileo GNSS will soon require replacement of the GNSS receivers. The SLR network is poorly distributed globally, requires labor intensive observations and analysis, and for the most part relies upon antiquated technology. The VLBI observatories utilize large radio telescopes in remote regions that are poorly distributed globally. Co-location of these networks is sparse and co-location errors contribute significantly to the observing error spectrum. Increasing use of the S and X band by commercial and other government services will also contribute to increased observational errors. The time is upon us for an international effort to develop an optimized global geodetic fiducial network of twelve or more integrated automated geodetic observatories that will provide in near real time high density mea.surements of Earth orientation, geodetic positioning, and GNSS system monitoring. The strategic goal for the optimized global fiducial network should be efficient autonomous operation, real time data streaming to analysis centers with an integrated near real time analysis capability for all four observing systems. These goals are achievable in the next decade given the dramatic technological improvements in all geodetic systems. For VLBI, the BKG TIGO might be viewed as a preliminary prototype of technology for fundamental stations. Mark 5, PC-VSI. e-VLBI broadband development efforts are laying the groundwork to reduce the aperture of the VLBI antennas and to allow for precision mm level co-location of observing systems. Operating costs and enhanced accuracy would accrue from the elimination of hydrogen maser clocks using double differencing, GNSS time transfer technology, GHz broadband recording, real time analysis, and mm wavelength VLBI observations. A global geodetic fiducial network will not be realizable without international efforts and the support of the four services.

LaBrecque, John↗

Searching for quantum optimal controls under severe constraints

The success of quantum optimal control for both experimental and theoretical objectives is connected to the topology of the corresponding control landscapes, which are free from local traps if three conditions are met: (1) the quantum system is controllable, (2) the Jacobian of the map from the control field to the evolution operator is of full rank, and (3) there are no constraints on the control field. This paper investigates how the violation of assumption (3) affects gradient searches for globally optimal control fields. The satisfaction of assumptions (1) and (2) ensures that the control landscape lacks fundamental traps, but certain control constraints can still prevent successful optimization of the objective. Using optimal control simulations, we show that the most severe field constraints are those that limit essential control resources, such as the number of control variables, the control duration, and the field strength. Proper management of these resources is an issue of great practical importance for optimization in the laboratory. For each resource, we show that constraints exceeding quantifiable limits can introduce artificial traps to the control landscape and prevent gradient searches from reaching a globally optimal solution. These results demonstrate that careful choice of relevant control parameters helps to eliminate artificial traps and facilitate successful optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗