Search NASA⌕ Search

SEARCH · Search NASA

Results for “range finding 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 19 records

ROM-Based Surrogate Systems Modeling of EBR-II

We report the System Analysis Module (SAM), developed and maintained by Argonne National Laboratory, is designed to provide whole-plant transient safety analysis capabilities for a number of advanced non-light water reactors, including sodium-cooled fast reactor (SFR), lead-cooled fast reactor (LFR), and molten salt reactor (MSR)/fluoride-salt-cooled high-temperature reactor (FHR) designs. SAM is primarily constructed as a systems-level analysis tool, with the potential to incorporate reduced order models from three-dimensional computational fluid dynamics (CFD) simulations to improve characterization of complex, multidimensional physics. It is recognized that the computational expense associated with CFD can be intractable for various engineering analyses, such as uncertainty quantification, inference, and design optimization. This paper explores the reducibility of a SAM model using recent advances in randomized linear algebra techniques, which attempt to find recurring patterns in the various realizations generated by a model after randomly perturbing all its input parameters. The reduction is described in terms of fewer degrees of freedom (DOFs), referred to as the active DOFs, for the model variables such as input model parameters and model responses. The results indicate that there is significant room for additional reduction that may be leveraged for additional computational gains when employing SAM for engineering-intensive analyses that require repeated model executions. Different from physics-based reduction approaches, the proposed approach allows one to estimate upper bounds on the reduction errors, which are rigorously developed in this work. Finally, different methods for surrogate model construction, such as regression and neural network-based training, are employed to correlate the input and output active DOFs, which are related back to the original variables using matrix-based linear transformations.

42 ENGINEERING↗

GPM DPR Retrievals: Algorithm, Evaluation, and Validation

The primary goal of the Dual-frequency Precipitation Radar (DPR) aboard the Global Precipitation Measurement (GPM) core satellite is to infer precipitationrate and raindrop/particle size distributions (DSD/PSD). The focus of this paper is threefold: 1)description of the DPR retrieval algorithm that uses an adjustable relationship between rainrate (R) and the mass-weighted diameter (Dm) or an R-Dm relationship in solving for R and Dmsimultaneously; 2) evaluation of the DPR algorithm based on the physical simulationsthat employ measured DSD/PSD to understand the mechanism and errorcharacteristics of the retrieval method; 3) review of ground validation studies for theDPR product as well as analysis of the strengths and weaknesses of the ground radarand rain gauge/disdrometer validations. Overall, the DPR Version-6 algorithmprovides reasonably accurate estimates of R and Dm in rain. Non-uniformity in therain profile, however, tends to degrade the accuracy of the R and Dm estimates tosome extent as the range-independent assumption of the adjustable parameter () ofthe R-Dm relation is not able to fully account for natural variation of DSD in the verticalprofile. Underestimation of the DPR snow rate is found when compared with theindependent dual-frequency ratio (DFR) technique. This is possibly the result of theconstraint associated with the path integral attenuation (PIA)/differential PIA (dPIA)used in the DPR algorithm to find the best  and range-independent  assumption. Arange-variable  model, proposed in the DPR Version-7 algorithm, is expected toimprove rain and snow retrieval.

Liang Liao↗

Interpreting Primal-Dual Algorithms for Constrained Multiagent Reinforcement Learning

Constrained multiagent reinforcement learning (C-MARL) is gaining importance as MARL algorithms find new applications in real-world systems ranging from energy systems to drone swarms. Most C-MARL algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. In this paper, we study the structural effects of this penalty term on the MARL problem. First, we show that the standard practice of using the constraint function as the penalty leads to a weak notion of safety. However, by making simple modifications to the penalty term, we can enforce meaningful probabilistic (chance and conditional value at risk) constraints. Second, we quantify the effect of the penalty term on the value function, uncovering an improved value estimation procedure. We use these insights to propose a constrained multiagent advantage actor critic (C-MAA2C) algorithm. Simulations in a simple constrained multiagent environment affirm that our reinterpretation of the primal-dual method in terms of probabilistic constraints is effective, and that our proposed value estimate accelerates convergence to a safe joint policy.

chance constraints↗

Interpreting Primal-Dual Algorithms for Constrained Multiagent Reinforcement Learning: Preprint

We study multiagent reinforcement learning (MARL) with constraints. This setting is gaining importance as MARL algorithms find new applications in real-world systems ranging from power grids to drone swarms. Most constrained MARL (C-MARL) algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. In this paper, we study the structural effects of the primal-dual approach on the constraints and value function. First, we show that using the constraint evaluation as the penalty leads to a weak notion of safety, but by making simple modifications to the penalty function, we can enforce meaningful probabilistic safety constraints. Second, we show that the penalty term changes the value function in a way that is easy to model, and demonstrate the consequences of not doing so. We conclude with simulations in a simple constrained multiagent environment to back up the theoretical results.

data-driven control↗

Principled halftoning based on human vision models

When models of human vision adequately measure the relative quality of candidate halftonings of an image, the problem of halftoning the image becomes equivalent to the search problem of finding a halftone that optimizes the quality metric. Because of the vast number of possible halftones, and the complexity of image quality measures, this principled approach has usually been put aside in favor of fast algorithms that seem to perform well. We find that the principled approach can lead to a range of useful halftoning algorithms, as we trade off speed for quality by varying the complexity of the quality measure and the thoroughness of the search. High quality halftones can be obtained reasonably quickly, for example, by using as a measure the vector length of the error image filtered by a contrast sensitivity function, and, as the search procedure, the sequential adjustment of individual pixels to improve the quality measure. If computational resources permit, simulated annealing can find nearly optimal solutions.

Mulligan, Jeffrey B.↗

Design of a Multi-Monochromatic X-ray Imager (MMI) for Kr K-shell line emission

We report the Multi-Monochromatic X-ray Imager (MMI) is a time-gated spectrometer used in implosion experiments at the OMEGA laser facility. From the data, electron temperature and density spatial distributions can be obtained at different implosion times. Previous MMI designs used Ar K-shell emission (3–6 keV) as a spectroscopic tracer and provided a spectral resolution of around 20 eV. However, Ar K-shell line emission becomes less useful at electron temperatures above 2 keV due to over-ionization. Kr K-shell (12–16 keV) has been shown to be an attractive alternative to diagnose hot implosion cores in recent publications. The purpose of this paper is to show a new point design that allows the MMI to detect this higher photon energy range with suitable spectral resolution. The algorithm used to find the optimal design couples a ray-tracing code and an exhaustive parameter space search. This algorithm may be useful as a tool to find optimal MMI designs for other purposes, i.e., other spectral regions for other spectroscopic tracers. So, the main change between the two designs is the replacement of the multi-layer mirror with a flat Bragg Ge (220) crystal. The final Kr K-shell MMI design has a photon energy range from 12 to 16.1 keV.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Correlation approach to identify coding regions in DNA sequences

Recently, it was observed that noncoding regions of DNA sequences possess long-range power-law correlations, whereas coding regions typically display only short-range correlations. We develop an algorithm based on this finding that enables investigators to perform a statistical analysis on long DNA sequences to locate possible coding regions. The algorithm is particularly successful in predicting the location of lengthy coding regions. For example, for the complete genome of yeast chromosome III (315,344 nucleotides), at least 82% of the predictions correspond to putative coding regions; the algorithm correctly identified all coding regions larger than 3000 nucleotides, 92% of coding regions between 2000 and 3000 nucleotides long, and 79% of coding regions between 1000 and 2000 nucleotides. The predictive ability of this new algorithm supports the claim that there is a fundamental difference in the correlation property between coding and noncoding sequences. This algorithm, which is not species-dependent, can be implemented with other techniques for rapidly and accurately locating relatively long coding regions in genomic sequences.

Non-NASA Center↗

Prototype acoustic positioning system for the Pacific Ocean Neutrino Experiment

We present the design and initial performance characterization of the prototype acoustic positioning system intended for the Pacific Ocean Neutrino Experiment. It comprises novel piezo-acoustic receivers with dedicated filtering- and amplification electronics installed in P-ONE instruments and is complemented by a commercial system comprised of cabled and autonomous acoustic pingers for sub-sea installation manufactured by Sonardyne Ltd. We performed an in-depth characterization of the acoustic receiver electronics and their acoustic sensitivity when integrated into P-ONE pressure housings. These show absolute sensitivities of up to -125 dB re V2/μPa2 in a frequency range of 10–40 kHz. We furthermore conducted a positioning measurement campaign in the ocean by deploying three autonomous acoustic pingers on the seafloor, as well as a cabled acoustic interrogator and a P-ONE prototype module deployed from a ship. Using a simple peak-finding detection algorithm, we observe high accuracy in the tracking of relative ranging times at approximately 230–280 μs at distances of up to 1600 m, which is sufficient for positioning detectors in a cubic-kilometer detector and which can be further improved with more involved detection algorithms. The tracking accuracy is further confirmed by independent ranging of the Sonardyne system and closely follows the ship's drift in the wind measured by GPS. The absolute positioning shows the same tracking accuracy with its absolute precision only limited by the large uncertainties of the deployed pinger positions on the seafloor.

Data analysis↗

Efficient Berry phase calculation via adaptive variational quantum computing approach

We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.

Mootz, Martin [Ames Laboratory (AMES), Ames, IA (U↗

CMB/kSZ and Compton-y Maps from 2500 deg 2 of SPT-SZ and Planck Survey Data

Abstract We present component-separated maps of the primary cosmic microwave background/kinematic Sunyaev–Zel’dovich (SZ) amplitude and the thermal SZ Compton- y parameter, created using data from the South Pole Telescope (SPT) and the Planck satellite. These maps, which cover the ∼2500 deg 2 of the southern sky imaged by the SPT-SZ survey, represent a significant improvement over previous such products available in this region by virtue of their higher angular resolution ( 1 .′ 25 for our highest-resolution Compton- y maps) and lower noise at small angular scales. In this work we detail the construction of these maps using linear combination techniques, including our method for limiting the correlation of our lowest-noise Compton- y map products with the cosmic infrared background. We perform a range of validation tests on these data products to test our sky modeling and combination algorithms, and we find good performance in all of these tests. Recognizing the potential utility of these data products for a wide range of astrophysical and cosmological analyses, including studies of the gas properties of galaxies, groups, and clusters, we make these products publicly available at http://pole.uchicago.edu/public/data/sptsz_ymap and on the NASA/LAMBDA website.

79 ASTRONOMY AND ASTROPHYSICS↗

High-resolution three-dimensional imaging radar

A three-dimensional imaging radar operating at high frequency e.g., 670 GHz, is disclosed. The active target illumination inherent in radar solves the problem of low signal power and narrow-band detection by using submillimeter heterodyne mixer receivers. A submillimeter imaging radar may use low phase-noise synthesizers and a fast chirper to generate a frequency-modulated continuous-wave (FMCW) waveform. Three-dimensional images are generated through range information derived for each pixel scanned over a target. A peak finding algorithm may be used in processing for each pixel to differentiate material layers of the target. Improved focusing is achieved through a compensation signal sampled from a point source calibration target and applied to received signals from active targets prior to FFT-based range compression to extract and display high-resolution target images. Such an imaging radar has particular application in detecting concealed weapons or contraband.

Cooper, Ken B.↗

Postdisaster Routing of Movable Energy Resources for Enhanced Distribution System Resilience: A Deep Reinforcement Learning-Based Approach

The deployment of movable energy resources (MERs) can be an effective strategy to restore critical loads to enhance power system resilience when no other energy sources are available after the occurrence of an extreme event. Since the optimal locations of MERs following an extreme event are dependent on system operating states (e.g., the loads at each node, on/off status of system branches, and so on), existing analytical and population-based approaches must repeat the entire analysis and calculation when the system operating states change. On the contrary, if deep reinforcement learning (DRL)-based algorithms are sufficiently trained with a wide range of scenarios, they can quickly find optimal or near-optimal locations irrespective of changes in system states. A deep Q-learning-based approach is proposed for optimal MER deployment to enhance power system resilience. MERs can be also utilized to complement other types of resources, if available. The proposed approach operates in two stages after the occurrence of extreme events. In the first stage, the distribution network is represented as a graph, and the network is then reconfigured using tie switches by using Kruskal’s spanning forest search algorithm (KSFSA). To maximize critical load recovery, the optimal or near-optimal locations of MERs are chosen in the second stage. Further, case studies on a 33-node distribution system and a modified IEEE 123-node system demonstrate the effectiveness of the proposed approach for postdisaster routing of MERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Vehicle Detection for RCTA/ANS (Autonomous Navigation System)

Using a stereo camera pair, imagery is acquired and processed through the JPLV stereo processing pipeline. From this stereo data, large 3D blobs are found. These blobs are then described and classified by their shape to determine which are vehicles and which are not. Prior vehicle detection algorithms are either targeted to specific domains, such as following lead cars, or are intensity- based methods that involve learning typical vehicle appearances from a large corpus of training data. In order to detect vehicles, the JPL Vehicle Detection (JVD) algorithm goes through the following steps: 1. Take as input a left disparity image and left rectified image from JPLV stereo. 2. Project the disparity data onto a two-dimensional Cartesian map. 3. Perform some post-processing of the map built in the previous step in order to clean it up. 4. Take the processed map and find peaks. For each peak, grow it out into a map blob. These map blobs represent large, roughly vehicle-sized objects in the scene. 5. Take these map blobs and reject those that do not meet certain criteria. Build descriptors for the ones that remain. Pass these descriptors onto a classifier, which determines if the blob is a vehicle or not. The probability of detection is the probability that if a vehicle is present in the image, is visible, and un-occluded, then it will be detected by the JVD algorithm. In order to estimate this probability, eight sequences were ground-truthed from the RCTA (Robotics Collaborative Technology Alliances) program, totaling over 4,000 frames with 15 unique vehicles. Since these vehicles were observed at varying ranges, one is able to find the probability of detection as a function of range. At the time of this reporting, the JVD algorithm was tuned to perform best at cars seen from the front, rear, or either side, and perform poorly on vehicles seen from oblique angles.

Brennan, Shane↗

Methods and strategies of object localization

An important property of an intelligent robot is to be able to determine the location of an object in 3-D space. A general object localization system structure is proposed, some important issues on localization discussed, and an overview given for current available object localization algorithms and systems. The algorithms reviewed are characterized by their feature extracting and matching strategies; the range finding methods; the types of locatable objects; and the mathematical formulating methods.

Shao, Lejun↗

Discovering equations that govern experimental materials stability under environmental stress using scientific machine learning

Abstract While machine learning (ML) in experimental research has demonstrated impressive predictive capabilities, extracting fungible knowledge representations from experimental data remains an elusive task. In this manuscript, we use ML to infer the underlying differential equation (DE) from experimental data of degrading organic-inorganic methylammonium lead iodide (MAPI) perovskite thin films under environmental stressors (elevated temperature, humidity, and light). Using a sparse regression algorithm, we find that the underlying DE governing MAPI degradation across a broad temperature range of 35 to 85 °C is described minimally by a second-order polynomial. This DE corresponds to the Verhulst logistic function, which describes reaction kinetics analogous to self-propagating reactions. We examine the robustness of our conclusions to experimental variance and Gaussian noise and describe the experimental limits within which this methodology can be applied. Our study highlights the promise and challenges associated with ML-aided scientific discovery by demonstrating its application in experimental chemical and materials systems.

36 MATERIALS SCIENCE↗

The Application of a Genetic Algorithm to the Optimization of a Mesoscale Model for Emergency Response

Besides solving the equations of momentum, heat, and moisture transport on the model grid, mesoscale weather models must account for subgrid-scale processes that affect the resolved model variables. These are simulated with model parameterizations, which often rely on values preset by the user. Such “free” model parameters, along with others set to initialize the model, are often poorly constrained, requiring that a user select each from a range of plausible values. Finding the values to optimize any forecasting tool can be accomplished with a search algorithm, and one such process—the genetic algorithm (GA)—has become especially popular. As applied to modeling, GAs represent a Darwinian process: an ensemble of simulations is run with a different set of parameter values for each member, and the members subsequently judged to be most accurate are selected as “parents” who pass their parameters onto a new generation. At the U.S. Department of Energy’s Savannah River Site in South Carolina, we are applying a GA to the Regional Atmospheric Modeling System (RAMS) mesoscale weather model, which supplies input to a model to simulate the dispersion of an airborne contaminant as part of the site’s emergency response preparations. An ensemble of forecasts is run each day, weather data are used to “score” the individual members of the ensemble, and the parameters from the best members are used for the next day’s forecasts. As meteorological conditions change, the parameters change as well, maintaining a model configuration that is best adapted to atmospheric conditions. Significance Statement We wanted to develop a forecasting system by which a weather model is run over the Savannah River Site each day and repeatedly adjusted according to how well it performed the previous day. To run the model, a series of values (parameters) must be set to control how the model will calculate winds, temperatures, and other desired variables. Each day the model was run several times using different combinations of these parameters and later compared with observed meteorological conditions. Parameters that produced the most accurate forecasts were preferentially reused to create the forecasts for the next day. The process was tested for the summer of 2020 and exhibited lower errors than forecasts produced by the model using default values of the parameters.

54 ENVIRONMENTAL SCIENCES↗

An agent-based blackboard system for multi-objective optimization

In the field of multi-objective optimization, there are a multitude of algorithms from which to choose. Each algorithm has strengths and weaknesses associated with the mechanics for finding the Pareto front. Recently, researchers have begun to examine how multi-agent environments can be used to help solve multi-objective optimization problems. In this work, we propose a multi-objective optimization algorithm based on a multi-agent blackboard system (MABS). The MABS framework allows for multiple agents to read and write pertinent optimization problem data to a central blackboard agent. Agents can stochastically search the design space, use previously discovered solutions to explore local optima, or update and prune the Pareto front. A centralized blackboard framework allows the optimization problem to be solved in a cohesive manner and permits stopping, restarting, or updating the optimization problem. The MABS framework is tested against three alternative optimization algorithms across a suite of engineering design problems and typically outperforms the other algorithms in discovering the Pareto front. A parallelizability study is performed where we find that the MABS is able to evaluate a set number of designs, which require an evaluation time ranging from 0 to 300 seconds, quicker than a traditional optimization algorithm: this fact becomes more apparent the longer it takes to evaluate a design. To provide context for the benefits provided by MABS, a real-world nuclear engineering design problem is examined. MABS is used to examine the placement of experiments in a nuclear reactor, where we are able to evaluate hundreds of configurations for experimental placement while maintaining a strict set of safety constraints.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Adaptive variational quantum eigensolvers for highly excited states

Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization that challenge classical computational methods due to their volume-law entanglement content. In this work, we explore the potential of variational quantum algorithms to approximate such states. We propose an adaptive variational quantum eigensolver (VQE) for excited states (X) that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian H by attempting to minimize the energy variance with respect to H. We benchmark the method by applying it to an Ising spin chain with integrable and nonintegrable regimes, where we calculate various quantities of interest, including the total energy, magnetization density, and entanglement entropy. We also compare the performance of adaptive VQE-X to an adaptive variant of the folded-spectrum method. For both methods, we find a strong dependence of the algorithm's performance on the choice of operator pool used for the adaptive construction of the ansatz. In particular, an operator pool including long-range two-body gates accelerates the convergence of both algorithms in the nonintegrable regime. Here, we also study the scaling of the number of variational parameters with system size, finding that an exponentially large number of parameters may be necessary to approximate individual highly excited states. Nevertheless, we argue that these methods lay a foundation for the use of quantum algorithms to study finite-energy-density properties of many-body systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗