Search NASA⌕ Search

SEARCH · Search NASA

Results for “Search algorithm”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Designing Agent Utilities for Coordinated, Scalable and Robust Multi-Agent Systems

Coordinating the behavior of a large number of agents to achieve a system level goal poses unique design challenges. In particular, problems of scaling (number of agents in the thousands to tens of thousands), observability (agents have limited sensing capabilities), and robustness (the agents are unreliable) make it impossible to simply apply methods developed for small multi-agent systems composed of reliable agents. To address these problems, we present an approach based on deriving agent goals that are aligned with the overall system goal, and can be computed using information readily available to the agents. Then, each agent uses a simple reinforcement learning algorithm to pursue its own goals. Because of the way in which those goals are derived, there is no need to use difficult to scale external mechanisms to force collaboration or coordination among the agents, or to ensure that agents actively attempt to appropriate the tasks of agents that suffered failures. To present these results in a concrete setting, we focus on the problem of finding the sub-set of a set of imperfect devices that results in the best aggregate device. This is a large distributed agent coordination problem where each agent (e.g., device) needs to determine whether to be part of the aggregate device. Our results show that the approach proposed in this work provides improvements of over an order of magnitude over both traditional search methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents failed midway through the simulation) the system's performance degrades gracefully and still outperforms a failure-free and centralized search algorithm. The results also show that the gains increase as the size of the system (e.g., number of agents) increases. This latter result is particularly encouraging and suggests that this method is ideally suited for domains where the number of agents is currently in the thousands and will reach tens or hundreds of thousands in the near future.

Tumer, Kagan↗
NASA NTRS1999

Remote Sensing of Rain

The first problem addressed concerns passive-microwave rain retrievals. Most current approaches start by building off-line a cloud-model-derived database. Given data, the retrieval algorithms search the database for the microwave temperatures "closest" to the observed data, then after some fine-tuning (performed in different ways by different implementations) the rain is estimated to be that which corresponds to the selected (and fine-tuned) set of database temperatures. These approaches have three drawbacks: they cannot properly take into account the ambiguities which arise from the fact that several rain scenarios can produce the same observed temperatures; they are quite inefficient since they require manipulating a large database along with often complex "fine-tuning" procedures; and they cannot refine their estimates if additional data is available. This past year we have derived closed formulae relating observed microwave brightness temperatures, T(sub b), and the underlying rain rates, R: average T(sub b) =f (rain) and average rain = g (T(sub b)), along with the corresponding covariance matrices. These results are sufficient to describe the conditional probabilities p(R/T(sub b)) and p(T(sub b)/R) to second order. Progress has also been made towards deriving a robust description of the rain drop size distribution (DSD). The widespread approach consisting in parameterizing the DSD as a gamma-distribution in terms of the drop diameter D suffers from the facts that, in reality, the DSD is not a smooth function of D and that the largely arbitrary Gamma model imposes unintended behavior, which has implications on any quantities derived from the DSD model. We have therefore developed a non-parametric yet practical description of the DSD, which is particularly well-suited for use in remote-sensing applications. The diagram on the left shows a comparison between an actual DSD sample and the truncated non-parametric representation. One figure shows the relation between radar reflectivity and rain rate derived using this representation. Validation of the Tropical Rainfall Measuring Mission (TRMM) radar-radiometer combined R and DSD algorithm is underway. This algorithm was designed to make optimal use of the instantaneous reflectivity profiles measured by the TRMM radar and the microwave brightness temperatures measured by the TRMM passive radiometer. So far, it appears to be the most reliable TRMM rain algorithm.

Haddad, Ziad S.↗
DOE OSTI2025

Automated workflow for non-empirical Wannier-localized optimal tuning of range-separated hybrid functionals

Here, we introduce an automated workflow for generating non-empirical Wannier-localized optimally-tuned screened range-separated hybrid (WOT-SRSH) functionals. WOT-SRSH functionals have been shown to yield highly accurate fundamental band gaps, band structures, and optical spectra for bulk and 2D semiconductors and insulators. Our workflow automatically and efficiently determines the WOT-SRSH functional parameters for a given crystal structure and composition, approximately enforcing the correct screened long-range Coulomb interaction and an ionization potential ansatz. In contrast to previous manual tuning approaches, our tuning procedure relies on a new search algorithm that only requires a few hybrid functional calculations with minimal user input. We demonstrate our workflow on 23 previously studied semiconductors and insulators, reporting the same high level of accuracy. By automating the tuning process and improving its computational efficiency, the approach outlined here enables applications of the WOT-SRSH functional to compute spectroscopic and optoelectronic properties for a wide range of materials.

Gant, Stephen E. [University of California, Berkel↗
DOE OSTI2024

A Generation-Storage Coordination Dispatch Strategy for Power System Based on Causal Reinforcement Learning

In the backdrop of global energy transformation, power systems integrating high proportions of renewable energy sources are facing unprecedented challenges in operational stability and dispatch efficiency. To address these challenges, this study introduces a generation-storage coordination real-time dispatch strategy based on Causal Power System Dynamic Reinforcement Learning (CPSDRL). Diverging from traditional reinforcement learning approaches, CPSDRL innovatively incorporates causal inference within the state prediction model - the crux of model-based reinforcement learning - thereby establishing the Power Causal Dynamic Model (PCDM). Assisted by the prior knowledge of power systems, the model significantly enhances prediction accuracy and reliability through a two-stage training process. Utilizing PCDM, this study further applies a direct policy search algorithm to optimize the real-time dispatch strategy. Experimental results indicate that the proposed method improves the stability of generation-storage coordination real-time dispatch and exhibits competitive advantages in sample efficiency and computational speed, compared to traditional model-based and model-free reinforcement learning algorithms. This method is expected to enhance the practicality and adaptability of causal reinforcement learning techniques in power system scheduling and control.

causal reinforcement learning↗
DOE OSTI2025

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗
DOE OSTI2025

Alternating and Gaussian Fermionic Isometric Tensor Network States

Isometric tensor networks in two dimensions enable efficient and accurate study of quantum many-body states, yet the effect of the isometric restriction on the represented quantum states is not fully understood. We address this question in two main contributions. First, we introduce an improved variant of isometric tensor network states (isoTNS) in two dimensions, where the isometric arrows on the columns of the network alternate between pointing upward and downward; hence the name alternating isometric tensor network states. Second, we introduce a numerical tool—the isometric Gaussian fermionic TNS (isoGfTNS)—that incorporates isometric constraints into the framework of Gaussian fermionic tensor network states. We demonstrate in numerous ways that alternating isoTNSs represent many-body ground states of two-dimensional quantum systems significantly better than the original isoTNSs. First, we show that the entanglement in an isoTNS is mediated along the isometric arrows and that alternating isoTNSs mediate entanglement more efficiently than conventional isoTNSs. Second, alternating isoTNSs correspond to a deeper, and thus more representative, sequential-circuit construction of depth 𝒪⁢(𝐿𝑥 ⋅𝐿𝑦) compared to the original isoTNSs of depth 𝒪⁢(𝐿𝑥 +𝐿𝑦). Third, using the Gaussian framework and gradient-based energy minimization, we provide numerical evidence of better bond-dimension scaling and variational energy of alternating isoGfTNSs for ground states of various free-fermionic models, including the Fermi surface, the band insulator, and the 𝑝𝑥 +𝑖⁢𝑝𝑦 mean-field superconductor. Finally, benchmarking on the transverse-field Ising model, we demonstrate that an alternating isoTNS provides substantially improved performance and stability relative to the original isoTNS for the ground-state search algorithm in interacting systems.

Wu, Yantao [Chinese Academy of Sciences, Beijing (↗
DOE OSTI2024

RAP: Resource-aware Automated GPU Sharing for Multi-GPU Recommendation Model Training and Input Preprocessing

Ensuring high-quality recommendations for newly onboarded users requires the continuous retraining of Deep Learning Recommendation Models (DLRMs) with freshly generated data. To serve the online DLRM retraining, existing solutions use hundreds of CPU computing nodes designated for input preprocessing, causing significant power consumption that surpasses even the power usage of GPU trainers. To this end, we propose RAP, an end-to-end DLRM training framework that supports Resource-aware Automated GPU sharing for DLRM input Preprocessing and Training. The core idea of RAP is to accurately capture the remaining GPU computing resources during DLRM training for input preprocessing, achieving superior training efficiency without requiring additional resources. Specifically, RAP utilizes a co-running cost model to efficiently assess the costs of various input preprocessing operations, and it implements a resource-aware horizontal fusion technique that adaptively merges smaller kernels according to GPU availability, circumventing any interference with DLRM training. In addition, RAP leverages a heuristic searching algorithm that jointly optimizes both the input preprocessing graph mapping and the co-running schedule to maximize the end-to-end DLRM training throughput. The comprehensive evaluation shows that RAP achieves 78.3× speedup on average over CPU-based DLRM input preprocessing frameworks. In addition, the end-to-end training throughput of RAP is only 2.04% lower than the ideal case, which has no input preprocessing overhead.

Wang, Zheng↗
DOE OSTI2024

Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach

Training an effective deep learning model to learn ocean processes involves careful choices of various hyperparameters. We leverage DeepHyper’s advanced search algorithms for multiobjective optimization, streamlining the development of neural networks tailored for ocean modeling. The focus is on optimizing Fourier neural operators (FNOs), a data-driven model capable of simulating complex ocean behaviors. Selecting the correct model and tuning the hyperparameters are challenging tasks, requiring much effort to ensure model accuracy. DeepHyper allows efficient exploration of hyperparameters associated with data preprocessing, FNO architecture-related hyperparameters, and various model training strategies. We aim to obtain an optimal set of hyperparameters leading to the most performant model. Moreover, on top of the commonly used mean squared error for model training, we propose adopting the negative anomaly correlation coefficient as the additional loss term to improve model performance and investigate the potential trade-off between the two terms. The numerical experiments show that the optimal set of hyperparameters enhanced model performance in single timestepping forecasting and greatly exceeded the baseline configuration in the autoregressive rollout for long-horizon forecasting up to 30 days. Utilizing DeepHyper, we demonstrate an approach to enhance the use of FNO in ocean dynamics forecasting, offering a scalable solution with improved precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Ultra-faint Milky Way Satellites Discovered in Carina, Phoenix, and Telescopium with DELVE Data Release 3

We report the discovery of three Milky Way satellite candidates: Carina IV, Phoenix III, and DELVE 7, in the third data release of the DECam Local Volume Exploration survey (DELVE). The candidate systems were identified by cross-matching results from two independent search algorithms. All three are extremely faint systems composed of old, metal-poor stellar populations (τ ≳ 10 Gyr, [Fe/H] ≲−1.4). Carina IV (M V = −2.8; r 1/2 = 40 pc) and Phoenix III (M V = −1.2; r 1/2 = 19 pc) have half-light radii that are consistent with the known population of dwarf galaxies, while DELVE 7 (M V = 1.2; r 1/2 = 2 pc) is very compact and seems more likely to be a star cluster, though its nature remains ambiguous without spectroscopic follow-up. The Gaia proper motions of stars in Carina IV ($M_{\star} = 2250^{+1180}_{-830} M_⊙$) indicate that it is unlikely to be associated with the LMC, while DECam CaHK photometry confirms that its member stars are metal poor. Phoenix III ($M_{\star} = 520^{+660}_{-290} M_⊙$) is the faintest known satellite in the extreme outer stellar halo (D GC > 100 kpc), while DELVE 7 ($M_{\star} = 60^{+120}_{-40} M_⊙$) is the faintest known satellite with D GC > 20 kpc.

Tan, Chin Yi [Univ. of Chicago, IL (United States)↗
NASA NTRS1974

Gust alleviation for a STOL transport by using elevator, spoilers, and flaps

Control laws were developed to investigate methods of alleviating the response of a STOL transport to gusty air. The transport considered in the study had triple-slotted, externally blown jet flaps and a large T-tail. The control devices used were the elevator, spoilers, and flaps. A hybrid computing system was used to simulate linearized longitudinal dynamics of the aircraft and to implement a conjugate gradient optimal search algorithm. The aircraft was simulated in the low-speed approach condition only. Feedback control matrices were found which minimized the average of a quadratic functional involving passenger compartment accelerations, pitch angle and rate, flight path angle and speed variations. The optimization was performed for artificially designed gust inputs in the form of predetermined rectangular waveforms. Results were obtained for elevator, spoilers, and flaps acting singly and in combination. Additional results were obtained for unit sinusoidal gust inputs by using the gain matrices computed for the artificial test gusts. Various sensor configurations were also investigated.

Lallman, F. J.↗
NASA NTRS1975

The analysis of the pilot's cognitive and decision processes

Articles are presented on pilot performance in zero-visibility precision approach, failure detection by pilots during automatic landing, experiments in pilot decision-making during simulated low visibility approaches, a multinomial maximum likelihood program, and a random search algorithm for laboratory computers. Other topics discussed include detection of system failures in multi-axis tasks and changes in pilot workload during an instrument landing.

Curry, R. E.↗
NASA NTRS1976

A first look at the application of signal extraction techniques to the analysis of body surface potential maps

Partial body surface potential maps from both normal subjects and subjects with independently diagnosed myocardial infarcts are visually compared from superimposed plots. A correlation test is devised to distinguish the two groups, with the reference waveform determined by means of a gradient-search algorithm. The results are encouraging, and suggest further investigation of these techniques as a future diagnostic tool.

Weinstein, S. B.↗
NASA NTRS1975

Table-aided design of the energy-storage reactor in dc-to-dc converters

A new procedure for the selection of magnetic cores for use in energy-storage dc-to-dc power converters which eliminates the need for an automated computer search algorithm and stored data file is presented. The converter configurations included in the procedure are the three commonly encountered single-winding converters for voltage step-up, for current step-up and for voltage step-up/current step-up, and for the two-winding converter for voltage step-up/current step-up. For each converter configuration, three types of controllers are considered - constant-frequency, constant on-time and constant off-time. Using concepts developed from analyses of these converters by considering the transfer of energy by means of an energy-storage inductor or transformer, a special table of parameters calculated from magnetic core data is constructed and leads to a considerably simplified design procedure.

Owen, H. A., Jr.↗
NASA NTRS1978

Preliminary design of composite wings for buckling, strength and displacement constraints

An unstiffened panel buckling constraint for balanced, symmetric laminated composites is included on the global design level in a mathematical programming structural optimization procedure for designing wing structures. Constraints are introduced by penalty functions, and Newton's method based on approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. Constraint approximations used during the optimization process contribute to the computational efficiency of the procedure. A criterion is developed that identifies the appropriate conservative form of the constraint approximations that are used with the optimization procedure. Minimum-mass design results are obtained for a multispar high-aspect-ratio wing subjected to material strength, minimum-gage, displacement, panel buckling and twist constraints. The material systems considered for the examples are all graphite-epoxy, graphite-epoxy with boron-epoxy spar caps, and all aluminum. The composite material designs are shown to have an advantage over the aluminum designs since they can often satisfy additional constraints with only small mass increases.

Starnes, J. H., Jr.↗
NASA NTRS1980

Preliminary design of composite wing-box structures for global damage tolerance

A procedure is presented that incorporates the influence of potential global damage conditions into the design process for minimum-mass wing-box structures. The procedure is based on mathematical-programming optimization techniques. Material-strength, minimum-gage, and panel-buckling constraints are introduced by penalty functions, and Newton's method with approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. A potential global damage condition is represented by a structural model with the damaged components removed. Example minimum-mass designs are obtained that simultaneously satisfy the constraints of the damaged and undamaged configurations of both graphite-epoxy and aluminum wing-box structural models. These examples are designed with and without the influence of potential damage conditions, and results indicate that for equal mass cases the residual strength of a damaged structure is higher when the influence of potential damage is properly included in the design from the outset. Results of these examples also identify the minimum structural mass increase required to increase residual strength levels.

Starnes, J. H., Jr.↗