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 505 records · Page 28

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo's third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

B Parazin↗

Multi-Robot Assembly Scheduling for the Lunar Crater Radio Telescope on the Far-Side of the Moon

The Lunar Crater Radio Telescope (LCRT) is a pro- posed ultra-long-wavelength radio telescope to be constructed on the far side of the moon. The proposed telescope will be constructed by deploying a 1km wire mesh in a 3-5km crater using a team of wall-climbing DuAxel robots. In this work, we consider the problem of generating minimum-time assembly sequences for LCRT, using realistic models of travel speed and lighting. Specifically, we pose the assembly sequencing problem as a mixed-integer linear program (MILP), which we solve to global optimality using commercial solvers. We present methods for modeling time-varying travel and assembly times, based on variable lighting conditions (including crater shadowing), and show how such time-varying parameters can be incorporated into the MILP. Finally, we present numerical studies of our method, showing how makespan varies with the number of assembly robots.

Schwager, Mac↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗

Phase-matched generation of coherent soft and hard X-rays using IR lasers

Phase-matched high-order harmonic generation of soft and hard X-rays is accomplished using infrared driving lasers in a high-pressure non-linear medium. The pressure of the non-linear medium is increased to multi-atmospheres and a mid-IR (or higher) laser device provides the driving pulse. Based on this scaling, also a general method for global optimization of the flux of phase-matched high-order harmonic generation at a desired wavelength is designed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Slope Extensions to ASL Library

Extensions to the AMPL/solver interface library (http://netlib.sandia.gov/ampl/solvers) to compute bounds on algebraic expressions, plus a test program. use in uncertainty quantification and global optimization algorithms. This software is not primarily for military applications.

Gay, David↗

Multiphysics analysis of liquid metal annular linear induction pumps: A project overview

Liquid metal-cooled fission reactors are both moderated and cooled by a liquid metal solution. These reactors are typically very compact and they can be used in regular electric power production, for naval and space propulsion systems or in fission surface power systems for planetary exploration. The coupling between the electromagnetics and thermo-fluid mechanical phenomena observed in liquid metal thermo-magnetic systems for nuclear and space applications gives rise to complex engineering magnetohydrodynamics and numerical problems. It is known that electromagnetic pumps have a number of advantages over rotating mechanisms: absence of moving parts, low noise and vibration level, simplicity of flow rate regulation, easy maintenance and so on. However, while developing annular linear induction pumps, we are faced with a significant problem of magnetohydrodynamic instability arising in the device. The complex flow behavior in this type of devices includes a time-varying Lorentz force and pressure pulsation due to the time-varying electromagnetic fields and the induced convective currents that originates from the liquid metal flow, leading to instability problems along the device geometry. The determinations of the geometry and electrical configuration of liquid metal thermo-magnetic devices give rise to a complex inverse magnetohydrodynamic field problem were techniques for global optimization should be used, magnetohydrodynamics instabilities understood –or quantified- and multiphysics models developed and analyzed. Lastly, we present a project overview as well as a few computational models developed to study liquid metal annular linear induction pumps using first principles and the a few results of our multi-physics analysis.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Generating an implicit voronoi mesh to decompose a domain of arbitrarily many dimensions

Described herein are technologies pertaining to generating a Voronoi mesh for an enclosed domain of arbitrarily many dimensions. An implicit Voronoi mesh is received that comprises locations of seeds in the domain. Neighbors of a seed are identified by extending a segment from the seed to the boundary of the domain and performing successive hyperplane trimming of the segment to identify a point on the facet of the Voronoi cell of the seed. A vertex of the cell can be identified by successively extending and trimming one or more additional spokes to identify points on a facet of the cell that are constrained to lie in a (d−n) space, where d is a number of dimensions of the domain and n is a number of iterations. A numerical simulation is performed based on the Voronoi mesh to generate simulation results in applications including surrogate modeling, global optimization, calibration, dimension reduction.

97 MATHEMATICS AND COMPUTING↗

Tailored computational approaches to interrogate heavy element chemistry and structure in condensed phase

In this chapter we are presenting a brief review of the challenges encountered in the study of 4f and 5f block elements in the condensed phase. Their recovery, use in molten salt reactors and other interesting applications necessitate the use of molecular dynamics and large-scale models that take into account both the electronic structure and relativistic corrections. Sampling the multitude of electronic and atomic configurational states is at the heart of reliable predictions of structure, reactivity, dynamics and transport of heavy metals in complex environments. We present three examples that combine lanthanide elements with large scale models: i) our recent developments of a versatile adaptive learning method that enables global optimization in high dimensional spaces, ii) results of computed pKa values of lanthanide aqua complexes, and iii) structure and computed EXAFS of heavy elements in molten salts. The latter two employ our recently-optimized lanthanide pseudo-potentials and companion basis sets for condensed phase ab initio molecular dynamics.

Nguyen, Manh Thuong↗

Contextual Active Online Model Selection with Expert Advice

How can we collect the most useful labels to learn a model selection policy, when presented with arbitrary heterogeneous data streams? In this paper, we formulate this task as a contextual active model selection problem, where at each round the learner receives an unlabeled data point along with a context. The goal is to output the best model for any given context without obtaining an excessive amount of labels. In particular, we focus on the task of selecting pre-trained classifiers, and propose a contextual active model selection algorithm (CAMS), which relies on a novel uncertainty sampling query criterion defined on a given policy class for adaptive model selection. In comparison to prior art, our algorithm does not assume a globally optimal model. We provide rigorous theoretical analysis for the regret and query complexity under both adversarial and stochastic settings. Our experiments on several benchmark classification datasets demonstrate the algorithm’s effectiveness in terms of both regret and query complexity. Notably, to achieve the same accuracy, CAMS incurs less than 10% of the label cost when compared to the best online model selection baselines on CIFAR10.

Liu, Xuefeng↗

Constrained curve fitting for semi-parametric models with radial basis function networks

Common to many analysis pipelines in lattice gauge theory and the broader scientific discipline is the need to fit a semi-parametric model to data. We propose a fit method that utilizes a radial basis function network to approximate the non-parametric component of such models. The approximate parametric model is fit to data using the basin hopping global optimization algorithm. Parameter constraints are enforced through Gaussian priors. The viability of our method is tested by examining its use in a finite-size scaling analysis of the $q$-state Potts model and $p$-state clock model with $q=2,3$ and $p=4,\infty$.

Peterson, Curtis T.↗

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimizing human activity patterns using global sensitivity analysis

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. Here we use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Finally, though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

97 MATHEMATICS AND COMPUTING↗

Global, Multi-Objective Trajectory Optimization With Parametric Spreading

Mission design problems are often characterized by multiple, competing trajectory optimization objectives. Recent multi-objective trajectory optimization formulations enable generation of globally-optimal, Pareto solutions via a multi-objective genetic algorithm. A byproduct of these formulations is that clustering in design space can occur in evolving the population towards the Pareto front. This clustering can be a drawback, however, if parametric evaluations of design variables are desired. This effort addresses clustering by incorporating operators that encourage a uniform spread over specified design variables while maintaining Pareto front representation. The algorithm is demonstrated on a Neptune orbiter mission, and enhanced multidimensional visualization strategies are presented.

trajectory design↗

Orbit design and optimization based on global telecommunication performance metrics

The orbit selection of telecommunications orbiters is one of the critical design processes and should be guided by global telecom performance metrics and mission-specific constraints. In order to aid the orbit selection, we have coupled the Telecom Orbit Analysis and Simulation Tool (TOAST) with genetic optimization algorithms. As a demonstration, we have applied the developed tool to select an optimal orbit for general Mars telecommunications orbiters with the constraint of being a frozen orbit. While a typical optimization goal is to minimize tele-communications down time, several relevant performance metrics are examined: 1) area-weighted average gap time, 2) global maximum of local maximum gap time, 3) global maximum of local minimum gap time. Optimal solutions are found with each of the metrics. Common and different features among the optimal solutions as well as the advantage and disadvantage of each metric are presented. The optimal solutions are compared with several candidate orbits that were considered during the development of Mars Telecommunications Orbiter.

genetic algorithms↗

Single-Mode Projection Filters for Modal Parameter Identification for Flexible Structures

Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. Another numerical simulation of a ten-mode structure is also presented by using a two-dimensional global optimization algorithm to illustrate the feasibility of the new method. The projection filters are practical for parallel processing implementation.

Huang, Jen-Kuang↗

Metabolite discovery through global annotation of untargeted metabolomics data

Liquid chromatography–high-resolution mass spectrometry (LC-MS)-based metabolomics aims to identify and quantify all metabolites, but most LC-MS peaks remain unidentified. Here we present a global network optimization approach, NetID, to annotate untargeted LC-MS metabolomics data. The approach aims to generate, for all experimentally observed ion peaks, annotations that match the measured masses, retention times and (when available) tandem mass spectrometry fragmentation patterns. Peaks are connected based on mass differences reflecting adduction, fragmentation, isotopes, or feasible biochemical transformations. Global optimization generates a single network linking most observed ion peaks, enhances peak assignment accuracy, and produces chemically informative peak–peak relationships, including for peaks lacking tandem mass spectrometry spectra. Applying this approach to yeast and mouse data, we identified five previously unrecognized metabolites (thiamine derivatives and N-glucosyl-taurine). Isotope tracer studies indicate active flux through these metabolites. Furthermore, NetID applies existing metabolomic knowledge and global optimization to substantially improve annotation coverage and accuracy in untargeted metabolomics datasets, facilitating metabolite discovery.

59 BASIC BIOLOGICAL SCIENCES↗

Discovery of two-dimensional binary nanoparticle superlattices using global Monte Carlo optimization

Binary nanoparticle (NP) superlattices exhibit distinct collective plasmonic, magnetic, optical, and electronic properties. Here, we computationally demonstrate how fluid-fluid interfaces could be used to self-assemble binary systems of NPs into 2D superlattices when the NP species exhibit different miscibility with the fluids forming the interface. We develop a basin-hopping Monte Carlo (BHMC) algorithm tailored for interface-trapped structures to rapidly determine the ground-state configuration of NPs, allowing us to explore the repertoire of binary NP architectures formed at the interface. By varying the NP size ratio, interparticle interaction strength, and difference in NP miscibility with the two fluids, we demonstrate the assembly of an array of exquisite 2D periodic architectures, including AB-, AB 2 -, and AB 3 -type monolayer superlattices as well as AB-, AB 2 -, A 3 B 5 -, and A 4 B 6 -type bilayer superlattices. Our results suggest that the interfacial assembly approach could be a versatile platform for fabricating 2D colloidal superlattices with tunable structure and properties.

36 MATERIALS SCIENCE↗