Search NASA⌕ Search

SEARCH · Search NASA

Results for “Grid search”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Optimizing event selection with the random grid search

In this paper, the random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

A Robotic High-Throughput Grid-Search Platform for Mapping Phase Behavior in Triblock Copolymer–Homopolymer Blends

We present a high-throughput experimental investigation of the phase behavior in triblock copolymers (PS-b-PB-b-PS and PS-b-PI-b-PS) and polystyrene (PS) homopolymer blends as a function of homopolymer molecular weight (MW) and blend ratio. Using a robotic thin-film processing platform (NOVA) integrated with Grazing Incidence Small-Angle X-ray Scattering (GISAXS) and Atomic Force Microscopy (AFM), we systematically mapped the order–disorder transition (ODT) boundaries and domain spacing evolution across a broad MW range (4.0–101.3 kDa) with varying homopolymer loadings (10% to 90%). The results reveal three distinct regimes: low-MW homopolymers, corresponding to the wet-brush regime produced only gradual domain swelling before disordering at high blend ratios (weight fraction); medium-MW homopolymers, corresponding to thedry-brush regime induced significant domain spacing increase up to 80% followed by earlier disordering, while high-MW homopolymers led to macrophase separation with minimal changes in domain spacing. Additionally, coarse-grained molecular dynamics simulations confirmed our experimental finding that in the low-MW region, the PS homopolymer uniformly distributed in the PS domain. These findings demonstrate that homopolymer molecular weight critically governs both the extent of domain swelling and the onset of disorder in triblock copolymer systems. This high-throughput platform enables the rapid mapping of composition–morphology relationships and can be integrated with AI/ML tools for designing next-generation nanostructured polymers.

36 MATERIALS SCIENCE↗
NASA NTRS2013

Methods and Results of a Search for Gravitational Waves Associated with Gamma-Ray Bursts Using the GEO 600, LIGO, and Virgo Detectors

In this paper we report on a search for short-duration gravitational wave bursts in the frequency range 64 Hz-1792 Hz associated with gamma-ray bursts (GRBs), using data from GEO600 and one of the LIGO or Virgo detectors. We introduce the method of a linear search grid to analyze GRB events with large sky localization uncertainties such as the localizations provided by the Fermi Gamma-ray Burst Monitor (GBM). Coherent searches for gravitational waves (GWs) can be computationally intensive when the GRB sky position is not well-localized, due to the corrections required for the difference in arrival time between detectors. Using a linear search grid we are able to reduce the computational cost of the analysis by a factor of O(10) for GBM events. Furthermore, we demonstrate that our analysis pipeline can improve upon the sky localization of GRBs detected by the GBM, if a high-frequency GW signal is observed in coincidence. We use the linear search grid method in a search for GWs associated with 129 GRBs observed satellite-based gamma-ray experiments between 2006 and 2011. The GRBs in our sample had not been previously analyzed for GW counterparts. A fraction of our GRB events are analyzed using data from GEO600 while the detector was using squeezed-light states to improve its sensitivity; this is the first search for GWs using data from a squeezed-light interferometric observatory. We find no evidence for GW signals, either with any individual GRB in this sample or with the population as a whole. For each GRB we place lower bounds on the distance to the progenitor, assuming a fixed GW emission energy of 10(exp -2)Stellar Mass sq c, with a median exclusion distance of 0.8 Mpc for emission at 500 Hz and 0.3 Mpc at 1 kHz. The reduced computational cost associated with a linear search grid will enable rapid searches for GWs associated with Fermi GBM events in the Advanced detector era.

methods↗
NASA NTRS1988

Fast interpolation schemes for moving grids

Search algorithms are developed for efficiently locating interpolation points to facilitate transfer of data in moving grid and related problems. Applications in the construction of adaptive grids and in the solution of problems on composite grids are included.

Mastin, C. Wayne↗
NASA NTRS2017

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass- Or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood-allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗
NASA NTRS2017

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass-or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood---allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗
NASA NTRS2019

Reinforcement Learning Applied to Cognitive Space Communications

The future of space exploration depends on robust, reliable communication systems. As the number of such communication systems increase, automation is fast becoming a requirement to achieve this goal. A reinforcement learning solution can be employed as a possible automation method for such systems. The goal of this study is to build a reinforcement learning algorithm which optimizes data throughput of a single actor. A training environment was created to simulate a link within the NASA Space Communication and Navigation (SCaN) infrastructure, using state of the art simulation tools developed by the SCaN Center for Engineering, Networks, Integration, and Communications (SCENIC) laboratory at NASA Glenn Research Center to obtain the closest possible representation of the real operating environment. Reinforcement learning was then used to train an agent inside this environment to maximize data throughput. The simulation environment contained a single actor in low earth orbit capable of communicating with twenty-five ground stations that compose the Near-Earth Network (NEN). Initial experiments showed promising training results, so additional complexity was added by augmenting simulation data with link fading profiles obtained from real communication events with the International Space Station. A grid search was performed to find the optimal hyperparameters and model architecture for the agent. Using the results of the grid search, an agent was trained on the augmented training data. Testing shows that the agent performs well inside the training environment and can be used as a foundation for future studies with added complexity and eventually tested in the real space environment.

Schubert, Carson D.↗
DOE OSTI2024

Optimization and Multimachine Learning Algorithms to Predict Nanometal Surface Area Transfer Parameters for Gold and Silver Nanoparticles

Interactions between gold metallic nanoparticles and molecular dyes have been well described by the nanometal surface energy transfer (NSET) mechanism. However, the expansion and testing of this model for nanoparticles of different metal composition is needed to develop a greater variety of nanosensors for medical and commercial applications. In this study, the NSET formula was slightly modified in the size-dependent dampening constant and skin depth terms to allow for modeling of different metals as well as testing the quenching effects created by variously sized gold, silver, copper, and platinum nanoparticles. Overall, the metal nanoparticles followed more closely the NSET prediction than for Förster resonance energy transfer, though scattering effects began to occur at 20 nm in the nanoparticle diameter. To further improve the NSET theoretical equation, an attempt was made to set a best-fit line of the NSET theoretical equation curve onto the Au and Ag data points. An exhaustive grid search optimizer was applied in the ranges for two variables, 0.1≤C≤2.0 and 0≤α≤4, representing the metal dampening constant and the orientation of donor to the metal surface, respectively. Three different grid searches, starting from coarse (entire range) to finer (narrower range), resulted in more than one million total calculations with values C=2.0 and α=0.0736. The results improved the calculation, but further analysis needed to be conducted in order to find any additional missing physics. With that motivation, two artificial intelligence/machine learning (AI/ML) algorithms, multilayer perception and least absolute shrinkage and selection operator regression, gave a correlation coefficient, R2, greater than 0.97, indicating that the small dataset was not overfitting and was method-independent. This analysis indicates that an investigation is warranted to focus on deeper physics informed machine learning for the NSET equations.

Demers, Steven M. E. (ORCID:0000000192213246)↗
NASA NTRS2014

Design of the VISITOR Tool: A Versatile ImpulSive Interplanetary Trajectory OptimizeR

The design of trajectories for interplanetary missions represents one of the most complex and important problems to solve during conceptual space mission design. To facilitate conceptual mission sizing activities, it is essential to obtain sufficiently accurate trajectories in a fast and repeatable manner. To this end, the VISITOR tool was developed. This tool modularly augments a patched conic MGA-1DSM model with a mass model, launch window analysis, and the ability to simulate more realistic arrival and departure operations. This was implemented in MATLAB, exploiting the built-in optimization tools and vector analysis routines. The chosen optimization strategy uses a grid search and pattern search, an iterative variable grid method. A genetic algorithm can be selectively used to improve search space pruning, at the cost of losing the repeatability of the results and increased computation time. The tool was validated against seven flown missions: the average total mission (Delta)V offset from the nominal trajectory was 9.1%, which was reduced to 7.3% when using the genetic algorithm at the cost of an increase in computation time by a factor 5.7. It was found that VISITOR was well-suited for the conceptual design of interplanetary trajectories, while also facilitating future improvements due to its modular structure.

Corpaccioli, Luca↗
NASA NTRS2021

Deriving Deformable Mirror Performance Requirements in Simulation with Experimental Verification

Coronagraph instruments rely on predictable and stable deformable mirror (DM) surface displacement to achieve the contrast required to detect Earth-sized exoplanets orbiting nearby Solar-type stars. Anomalous DM behavior, such as unstable or pinned actuators, can limit contrast in coronagraphs. Simulating how these undesired behaviors affect the performance of a high contrast imaging architecture is important for developing requirements on their associated hardware. Simulating a vortex coronagraph (VC) with two deformable mirrors, this study quantifies how the number of pinned actuators affect the performance of Focal Plane Wavefront Sensing and Control algorithms using both Grid Search Electric Field Conjugation (EFC) and Planned EFC, which uses Beta-Bumping. The simulation also quantifies how various types of voltage noise such as zero-mean Gaussian noise, zero-mean periodic noise, and drift can affect the contrast of a VC during an observation run. A tolerance of a change in the Mean Normalized Intensity of ${1\times10^{-11}}$ is allocated to both types of error. If Planned EFC is used, only 1 pinned actuator on both DMs can be tolerated. If only pure Grid Search EFC is used the DMs cannot have any pinned actuators. For the case of zero-mean Gaussian noise and zero-mean periodic noise, one can tolerate a noise standard deviation of no more than ${\sigma = 0.45 \text{ mV}}$. For drift, we can only tolerate ${\sigma = 0.30 \text{ mV}}$ or less. These results show that the DM electronics and the DM themselves need to be nearly defect free to avoid having more than 1 pinned actuator. The electronics need to be tested for different types of noise statistics and that both the average and standard deviation of the noise should be measured.

Dean L. Palmer↗
DOE OSTI2019

Evolving Larger Convolutional Layer Kernel Sizes for a Settlement Detection Deep-Learner on Summit

Deep-learner hyper-parameters, such as kernel sizes, batch sizes, and learning rates, can significantly influence the quality of trained models. The state of the art for finding optimal hyper-parameters generally uses a brute force, grid search approach, random search, or Bayesian-based optimization among other techniques. We applied an evolutionary algorithm to optimize kernel sizes for a convolutional neural network used to detect settlements in satellite imagery. Usually convolutional layer kernel sizes are small - typically one, three, or five - but we found that the system converged at, or near, kernel sizes of nine for the last convolutional layer, and that this occurred for multiple runs using two different datasets. Moreover, the larger kernel sizes had fewer false positives than the 3x3 kernel sizes found as optimal via a brute force uniform grid search. This suggests that this large kernel size may be leveraging patterns found in larger areal features in the source imagery, and that this may be generalized as possible guidance for similar remote sensing deep-learning tasks.

Coletti, Mark↗
DOE OSTI2026

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗
NASA NTRS2010

In Search of Grid Converged Solutions

Assessing solution error continues to be a formidable task when numerically solving practical flow problems. Currently, grid refinement is the primary method used for error assessment. The minimum grid spacing requirements to achieve design order accuracy for a structured-grid scheme are determined for several simple examples using truncation error evaluations on a sequence of meshes. For certain methods and classes of problems, obtaining design order may not be sufficient to guarantee low error. Furthermore, some schemes can require much finer meshes to obtain design order than would be needed to reduce the error to acceptable levels. Results are then presented from realistic problems that further demonstrate the challenges associated with using grid refinement studies to assess solution accuracy.

Lockard, David P.↗
NASA NTRS2011

Deep Moonquake Focal Mechanisms: Recovery and Implications

A defining characteristic of deep moonquakes is their tendency to occur with tidal periodicity, prompting previous studies to infer that they are related to the buildup and release of tidal stress within the Moon. In studies of tidal forcing, a key constraint is the focal mechanism: the fault parameters describing the type of failure moonquakes represent. The quality of the lunar seismic data and the limited source/receiver geometries of the Apollo seismic network prohibit the determination of deep moonquake fault parameters using first-motion polarities, as is typically done in terrestrial seismology. Without being able to resolve tidal stress onto a known failure plane, we can examine only gross qualities of the tidal stress tensor with respect to moonquake occurrence, so we cannot fully address the role of tidal stress in moonquake generation. We will examine the extent to which shear (S) and compression (P) wave amplitude ratios can constrain moonquake fault geometry by determining whether, for a given cluster, there exists a focal mechanism that can produce a radiation pattern consistent with the amplitudes measured by the Apollo instruments. Amplitudes are read in the ray coordinate frame, directly from seismograms for which the P and S arrivals are clearly identifiable on all long-period channels of the four Apollo stations. We apply an empirical station correction to account for site effects and the differences between P- and S-wave attenuation. Instead of focusing on the best fitting solution only, we formulate the inverse problem using a falsification criterion: all source orientations that do not reproduce the observed SV/P ratios within an error margin derived from the uncertainty of amplitude readings are rejected. All others are accepted as possible solutions. The inversion is carried out using an exhaustive grid search on a regular grid with predefined step size, encompassing all possible combinations of strike, dip and slip. To assess the sensitivity of the inversion for the uncertainty of the lunar interior structure, we carry out repeated inversions with different velocity structures. Our data set consist of a total of 106 events from 25 deep moonquake clusters. The largest contribution of 37 events originates from the most active cluster, A001, while other clusters are represented by 1 to 9 events. Since the definition of a cluster implies that all events share the same source orientation, a comparison of the inversion results of all events from one cluster will reduce ambiguities of the inversion. Once we obtain a suite of fault parameters for a given source, we can attempt to further constrain the focal mechanism with refined analyses of tidal stresses and predictions based on synthetic seismograms.

Knapmeyer, Martin↗
DOE OSTI2021

Training Spiking Neural Networks with Synaptic Plasticity under Integer Representation

Neuromorphic computing is emerging as a promising Beyond Moore computing paradigm that employs event-triggered computation and non-von Neumann hardware. Spike Timing Dependent Plasticity (STDP) is a well-known bio-inspired learning rule that relies on activities of locally connected neurons to adjust the weights of their respective synapses. In this work, we analyze a basic STDP rule and its sensitivity on the different hyperparameters for training spiking neural networks (SNNs) with supervision, customized for a neuromorphic hardware implementation with integer weights. We compare the classification performance on four UCI datasets (iris, wine, breast cancer and digits) that depict varying levels of complexity. We perform a search for optimal set of hyperparameters using both grid search and Bayesian optimization. Through the use of Bayesian optimization, we show the general trends in hyperparameter sensitivity in SNN classification problem. With the best sets of hyperparameters, we achieve accuracies comparable to some of the best performing SNNs on these four datasets. With a highly optimized supervised STDP rule we show that these accuracies can be achieved with just 20 epochs of training.

Kulkarni, Shruti↗