Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed 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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

State-Based Implicit Coordination and Applications

In air traffic management, pairwise coordination is the ability to achieve separation requirements when conflicting aircraft simultaneously maneuver to solve a conflict. Resolution algorithms are implicitly coordinated if they provide coordinated resolution maneuvers to conflicting aircraft when only surveillance data, e.g., position and velocity vectors, is periodically broadcast by the aircraft. This paper proposes an abstract framework for reasoning about state-based implicit coordination. The framework consists of a formalized mathematical development that enables and simplifies the design and verification of implicitly coordinated state-based resolution algorithms. The use of the framework is illustrated with several examples of algorithms and formal proofs of their coordination properties. The work presented here supports the safety case for a distributed self-separation air traffic management concept where different aircraft may use different conflict resolution algorithms and be assured that separation will be maintained.

Narkawicz, Anthony J.↗
NASA NTRS2021

Applications of Dynamic Land Surface Information for Passive Microwave Precipitation Retrieval

Accurate, physically based precipitation retrieval over global land surfaces is an important goal of the NASA/JAXA Global Precipitation Measurement Mission (GPM). This is a difficult problem for the passive microwave constellation, as the signal over radiometrically warm land surfaces in the microwave frequencies means that the measurements used are indirect and typically require inferring some type of relationship between an observed scattering signal and precipitation at the surface. GPM, with collocated radiometer and dual-frequency radar, is an excellent tool for tackling this problem and improving global retrievals. In the years following the launch of the GPM Core Observatory satellite, physically based passive microwave retrieval of precipitation over land continues to be challenging. Validation efforts suggest that the operational GPM passive microwave algorithm, the Goddard profiling algorithm (GPROF), tends to overestimate precipitation at the low (<5 mm h−1) end of the distribution over land. In this work, retrieval sensitivities to dynamic surface conditions are explored through enhancement of the algorithm with dynamic, retrieved information from a GPM-derived optimal estimation scheme. The retrieved parameters describing surface and background characteristics replace current static or ancillary GPROF information including emissivity, water vapor, and snow cover. Results show that adding this information decreases probability of false detection by 50% and, most importantly, the enhancements with retrieved parameters move the retrieval away from dependence on ancillary datasets and lead to improved physical consistency.

Sarah Ringerud↗
DOE OSTI2024

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗
DOE OSTI2022

Safety-assured, real-time neural active fault management for resilient microgrids integration

Federated-learning-based active fault management (AFM) is devised to achieve real-time safety assurance for microgrids and the main grid during faults. AFM was originally formulated as a distributed optimization problem. Here, federated learning is used to train each microgrid's network with training data achieved from distributed optimization. The main contribution of this work is to replace the optimization-based AFM control algorithm with a learning-based AFM control algorithm. The replacement transfers computation from online to offline. With this replacement, the control algorithm can meet real-time requirements for a system with dozens of microgrids. By contrast, distributed-optimization-based fault management can output reference values fast enough for a system with several microgrids. More microgrids, however, lead to more computation time with optimization-based method. Distributed-optimization-based fault management would fail real-time requirements for a system with dozens of microgrids. Controller hardware-in-the-loop real-time simulations demonstrate that learning-based AFM can output reference values within 10 ms irrespective of the number of microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1994

Dynamic Load Balancing for Computational Plasticity on Parallel Computers

The simulation of the computational plasticity on a complex structure remains a formidable computational task, especially when a highly nonlinear, complex material model was used. It appears that the computational requirements for a such problem can only be satisfied by massively parallel architectures. In order to effectively harness the tremendous computational power provided by such architectures, it is imperative to investigate and to study the algorithmic and implementation issues pertaining to dynamic load balancing for computational plasticity on a highly parallel, distributed-memory, multiple-instruction, multiple-data computers. This paper will measure the effectiveness of the algorithms developed in handling the dynamic load balancing.

Pramono, Eddy↗
NASA NTRS2019

Quantum Technologies for UAS (QTech)

Harness the power of quantum technologies to assure the availability of UAS communications against disruptions. Make use of quantum computing (e.g. quantum optimization) and quantum communication (e.g. quantum key distribution) to address the availability cybersecurity challenge. Our approach is three-fold: (1) Utilize quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) Utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents, (3) Utilize quantum key distribution (QKD) to execute secure key sharing in high data rate optical communication and/or anti-jamming protocols for secure RF communication.

Quantum Computing↗
NASA NTRS2001

Applicability of the single equivalent point dipole model to represent a spatially distributed bio-electrical source

Although the single equivalent point dipole model has been used to represent well-localised bio-electrical sources, in realistic situations the source is distributed. Consequently, position estimates of point dipoles determined by inverse algorithms suffer from systematic error due to the non-exact applicability of the inverse model. In realistic situations, this systematic error cannot be avoided, a limitation that is independent of the complexity of the torso model used. This study quantitatively investigates the intrinsic limitations in the assignment of a location to the equivalent dipole due to distributed electrical source. To simulate arrhythmic activity in the heart, a model of a wave of depolarisation spreading from a focal source over the surface of a spherical shell is used. The activity is represented by a sequence of concentric belt sources (obtained by slicing the shell with a sequence of parallel plane pairs), with constant dipole moment per unit length (circumferentially) directed parallel to the propagation direction. The distributed source is represented by N dipoles at equal arc lengths along the belt. The sum of the dipole potentials is calculated at predefined electrode locations. The inverse problem involves finding a single equivalent point dipole that best reproduces the electrode potentials due to the distributed source. The inverse problem is implemented by minimising the chi2 per degree of freedom. It is found that the trajectory traced by the equivalent dipole is sensitive to the location of the spherical shell relative to the fixed electrodes. It is shown that this trajectory does not coincide with the sequence of geometrical centres of the consecutive belt sources. For distributed sources within a bounded spherical medium, displaced from the sphere's centre by 40% of the sphere's radius, it is found that the error in the equivalent dipole location varies from 3 to 20% for sources with size between 5 and 50% of the sphere's radius. Finally, a method is devised to obtain the size of the distributed source during the cardiac cycle.

NASA Discipline Cardiopulmonary↗
DOE OSTI2021

Rare Events via Cross-Entropy Population Monte Carlo

Rare events are events that happen with very low frequency. Estimating rare event probabilities using Monte Carlo techniques is computationally expensive, often to the point of intractability, and special methods are required. Importance sampling (IS) is a well known technique that uses a proposal distribution in place of a target distribution to lower the variance of the estimator. Key to the success of IS methods is the choice of a proposal distribution, or the parameters governing the distribution. Adaptive importance sampling improves the parameters of a family or population of proposal distributions iteratively through trials. We present a novel cross-entropy population Monte Carlo algorithm, which adapts the parameters of proposals through the cross-entropy method. The proposed method stands apart from previous work in that we are not optimizing a mixture distribution. Instead, we leverage deterministic mixture weights and optimize the distributions individually through a reinterpretation of the typical derivation of the cross-entropy method. Demonstrations on rare event examples show that the algorithm can outperform existing resampling based population Monte Carlo methods, especially for higher-dimensional problems. Finally, we also demonstrate efficacy on a conjunction analysis problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Computing water flow through complex landscapes – Part 3: Fill–Spill–Merge: flow routing in depression hierarchies

Abstract. Depressions – inwardly draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting the Fill–Spill–Merge algorithm that utilizes our depression hierarchy data structure to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm and results from two sample study areas. In these case studies, the algorithm runs 90–2600 times faster (with a reduction in compute time of 2000–63 000 times) than the commonly used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code with 97 % test coverage is available on GitHub and Zenodo.

58 GEOSCIENCES↗
NASA NTRS1992

Robustness of Spann-Wilson segmentation on SAR imagery

The performances of the Spann-Wilson algorithm on simulated synthetic aperture radar (SAR) images with varying degrees of speckle (one to four looks and varying amounts of white noise) is described. One hundred forty-eight test images are considered, of which the algorithm segmented most without any adjustment to the algorithm's parameters. The effect of speckle on fractal boundaries is studied. The effect of varying multiplicative and additive noise distributions for a fixed set of segmentation parameters is examined. The modified Spann-Wilson algorithm on four-look imagery is evaluated.

Daida, Jason M.↗
DOE OSTI2024

Fiber optic computing using distributed feedback

Abstract The widespread adoption of machine learning and other matrix intensive computing algorithms has renewed interest in analog optical computing, which has the potential to perform large-scale matrix multiplications with superior energy scaling and lower latency than digital electronics. However, most optical techniques rely on spatial multiplexing, requiring a large number of modulators and detectors, and are typically restricted to performing a single kernel convolution operation per layer. Here, we introduce a fiber-optic computing architecture based on temporal multiplexing and distributed feedback that performs multiple convolutions on the input data in a single layer. Using Rayleigh backscattering in standard single mode fiber, we show that this technique can efficiently apply a series of random nonlinear projections to the input data, facilitating a variety of computing tasks. The approach enables efficient energy scaling with orders of magnitude lower power consumption than GPUs, while maintaining low latency and high data-throughput.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

Accelerated panel methods using the fast multipole method

Panel methods are commonly used in computational fluid dynamics for the solution of potential flow problems. The methods are a numerical technique based on the surface distribution of singularity elements. The solution is the process of finding the strength of the singularity elements distributed over the body's surface. This process involves the solution of the matrix problem Pq = p' for a set of unknowns q. The Fast Multipole Method is used to directly compute q without using matrix solvers. The algorithm works in O(N) time for N points, a great improvement over standard matrix solvers. In panel methods, the surface of a body is divided into a series of quadrilateral panels. The methods involve the computation of the influence of all other panels on each individual panel. The influence is based on the surface distribution, though this can be approximated by the area for distant panels. An alternative approximation, though with arbitrary accuracy, is to develop a multipole expansion about the center of the panel to describe the effect of a given panel on distant points in space. The expansion is based on the moments of the panel, thus allow the use of various surface distributions without changing the basic algorithm, just the computation of the various moments. The expansions are then manipulated in a tree walk to develop Taylor series expansions about a point in space which describe the effect of all distant panels on any point within a volume of convergence. The effect of near panels then needs to be computed directly, but the effect of all distant panels can be computed by simply evaluating the resulting expansion. The Fast Multipole Method has been applied to panel methods for the solution of source and doublet distributions. A major feature of the algorithm is that the algorithm does not change to derive the potential and velocity for sources and doublets. The same expansions can be used for both sources and doublets. Since the velocity is related to the potential, and the doublet potential is related to the z-component of the source velocity, all values can be derived from the same expansion by taking a series of partial derivatives. This requires more expansion terms to be kept since terms are lost in the process of taking partial derivatives. Thus to maintain accuracy for the doublet computation, more terms are required than if just evaluating for sources. The resulting Fast Multipole code should then parallelize better than classical panel methods due to the locality of data dependencies found in the Fast Multipole Method. Theoretically the parallelized code should execute in O(log N) time with O(N) processors, though this is not practical. Ongoing work includes implementing the parallel accelerated panel method, including methods to improve the load balancing of the problem by taking advantage of the known geometry of panels, and to encorporate sensitivity analysis into the algorithm.

Leathrum, James F., Jr.↗
NASA NTRS1979

Approaches to adaptive digital control focusing on the second order modal descriptions of large, flexible spacecraft dynamics

The widespread modal analysis of flexible spacecraft and recognition of the poor a priori parameterization possible of the modal descriptions of individual structures have prompted the consideration of adaptive modal control strategies for distributed parameter systems. The current major approaches to computationally efficient adaptive digital control useful in these endeavors are explained in an original, lucid manner using modal second order structure dynamics for algorithm explication. Difficulties in extending these lumped-parameter techniques to distributed-parameter system expansion control are cited.

Johnson, C. R., Jr.↗
NASA NTRS2002

A Method to Retrieve Rainfall Rate Over Land from TRMM Microwave Imager Observations

Over tropical land regions, rain rate maxima in mesoscale convective systems revealed by the Precipitation Radar (PR) flown on the Tropical Rainfall Measuring Mission (TRMM) satellite are found to correspond to thunderstorms, i.e., Cbs. These Cbs are reflected as minima in the 85 GHz brightness temperature, T85, observed by the TRMM Microwave Imager (TMI) radiometer. Because the magnitude of TMI observations do not discriminate satisfactorily convective and stratiform rain, we developed here a different TMI discrimination method. In this method, two types of Cbs, strong and weak, are inferred from the Laplacian of T85 at minima. Then, to retrieve rain rate, where T85 is less than 270 K, a weak (background) rain rate is deduced using T85 observations. Furthermore, over a circular area of 10 km radius centered at the location of each T85 minimum, an additional Cb component of rain rate is added to the background rain rate. This Cb component of rain rate is estimated with the help of (T19-T37) and T85 observations. Initially, our algorithm is calibrated with the PR rain rate measurements from 20 MCS rain events. After calibration, this method is applied to TMI data taken from several tropical land regions. With the help of the PR observations, we show that the spatial distribution and intensity of rain rate over land estimated from our algorithm are better than those given by the current TMI-Version-5 Algorithm. For this reason, our algorithm may be used to improve the current state of rain retrievals on land.

Prabhakara, C.↗
NASA NTRS2022

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↗
NASA NTRS2022

Assessing the Sampleability of Bennu’s Surface for the OSIRIS-REx Asteroid Sample Return Mission

NASA’s first asteroid sample return mission, OSIRIS-REx, collected a sample from the surface of near-Earth asteroid Bennu in October 2020 and will deliver it to Earth in September 2023. Selecting a sample collection site on Bennu’s surface was challenging due to the surprising lack of large ponded deposits of regolith particles exclusively fine enough (≤ 2 cm diameter) to be ingested by the spacecraft’s Touch-and-Go Sample Acquisition Mechanism (TAGSAM). Here we describe the Sampleability Map of Bennu, which was constructed to aid in the selection of candidate sampling sites and to estimate the probability of collecting sufficient sample. “Sampleability” is a numeric score that expresses the compatibility of a given area’s surface properties with the sampling mechanism. The algorithm that determines sampleability is a best fit functional form to an extensive suite of laboratory testing outcomes tracking the TAGSAM performance as a function of four observable properties of the target asteroid. The algorithm and testing were designed to measure and subsequently predict TAGSAM collection amounts as a function of the minimum particle size, maximum particle size, particle size frequency distribution, and the tilt of the TAGSAM head off the surface. The sampleability algorithm operated at two general scales, consistent with the resolution and coverage of data collected during the mission. The first scale was global and evaluated nearly the full surface. Due to Bennu’s unexpected boulder coverage and lack of ponded regolith deposits, the global sampleability efforts relied heavily on additional strategies to find and characterize regions of interest based on quantifying and avoiding areas heavily covered by material too large to be collected. The second scale was site-specific and used higher-resolution data to predict collected mass at a given contact location. The rigorous sampleability assessments gave the mission confidence to select the best possible sample collection site and directly enabled successful collection of hundreds of grams of material.

Asteroid exploration↗
NASA NTRS1994

Performance Evaluation of Three Distributed Computing Environments for Scientific Applications

We present performance results for three distributed computing environments using the three simulated CFD applications in the NAS Parallel Benchmark suite. These environments are the DCF cluster, the LACE cluster, and an Intel iPSC/860 machine. The DCF is a prototypic cluster of loosely coupled SGI R3000 machines connected by Ethernet. The LACE cluster is a tightly coupled cluster of 32 IBM RS6000/560 machines connected by Ethernet as well as by either FDDI or an IBM Allnode switch. Results of several parallel algorithms for the three simulated applications are presented and analyzed based on the interplay between the communication requirements of an algorithm and the characteristics of the communication network of a distributed system.

Fatoohi, Rod↗