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 1,657 records · Page 92
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Distribution Feeder-Scale Fast Frequency Response via Optimal Coordination of Net-load Resources Part I: Solution Design

This work is the first of a two-part series that develops and experimentally demonstrates a first-of-its-kind hierarchical control solution for optimally dispatching thousands of deferrable loads and distributed energy resources (DERs) across a distribution feeder to provide fast frequency response (FFR) within 500 ms to the bulk power system. This approach rapidly coordinates resources online after a frequency event occurs, allowing fast-changing, behind-the-meter (BTM) resources to be incorporated and aggregate FFR power set points to be achieved more quickly and accurately than existing approaches. We also present a solution for determining the optimal amount of headroom to operate solar inverters with to minimize opportunity cost while ensuring the FFR response viability of a building with the inverter and deferrable loads. In Part I, we develop practical algorithms for fast, cost-based optimal dispatch at multiple aggregation scales (single building, multiple buildings, and full distribution feeder), establish their optimality, and demonstrate via simulation that they are faster than state-of-the-art, coordinated frequency response approaches. In Part II, the entire platform is implemented and experimentally verified using a unique power hardware-in-the-loop demonstration, including more than 100 powered loads and DERs connected to a real-world distribution network model and over 10,000 net-load resources dispatched.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Efficient learning of t -doped stabilizer states with single-copy measurements

One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms for states generated from Clifford circuits with at most log ⁡ ( n ) non-Clifford gates. However, these algorithms necessitate multi-copy measurements, posing implementation challenges in the near term due to the requisite quantum memory. On the contrary, using solely single-qubit measurements in the computational basis is insufficient in learning even the output distribution of a Clifford circuit with one additional T gate under reasonable post-quantum cryptographic assumptions. In this work, we introduce an efficient quantum algorithm that employs only nonadaptive single-copy measurement to learn states produced by Clifford circuits with a maximum of O ( log ⁡ n ) non-Clifford gates, filling a gap between the previous positive and negative results.

Physics↗
NASA NTRS1993

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗
NASA NTRS2024

On the Role of Friction and Particle Size Distribution in Granular Packings

Packing of particles in a disordered arrangement has tremendous significance in both condensed matter physics and engineering applications. The last three decades have seen remarkable progress in our understanding of the physics of granular packings that has been largely facilitated by a rapid growth in the power of modern computers. Although granular packings are ubiquitous in diverse natural settings, from clogging of powders in hoppers to the crowding of living cells, a significant motivation for modeling granular packings has emerged from a proposal that the transition from a fluid-like state to a solid-like state of a granular material upon increasing volume fraction, called jamming, is intimately related to the origins of glass transition in thermal systems. As such, a majority of modeling efforts have focused on the jamming behavior of an idealized granular material: frictionless, monodisperse sphere. While such studies have illuminated the rich physics of jamming, granular materials in nature and engineering practice are rarely frictionless or monodisperse. The analogous research on the packing of these ‘real-world’ granular materials is still not fully developed. Besides requiring the exploration of a huge parameter space, three key computational considerations have inhibited their modeling: (i) traditional computational methods are not adept at simulating mechanically-stable packings of frictional particles near the jamming transition; (ii) standard algorithms of contact detection in discrete element methods are impractical to simulate granular packings with a wide distribution of particle sizes; (iii) a lack of well-established contact mechanics models of friction that can accurately reproduce experimental data. This chapter will review the latest computational advances to simulate the jamming of size-dispersed frictional particles, and describe the rich microstructural diversity that emerges in their packings.

granular↗
NASA NTRS1985

Surface texture characterization by angular distributions of scattered light

Work at the National Bureau of Standards to develop an on-line optical measurement device and attendant algorithms for automated optical scattering measurements of machined metal surfaces are described. The surfaces could be milled, ground or lapped, and the system is intended to categorize the resulting surface characteristics. The optical device consists of a He-Ne laser which is shone on a surface. The scattered light is captured by a semicircular array of 87 detector elements rotated over the scanned area. The light signals are processed through a digital voltmeter and then an A/D converter. The signals are then stored for later comparisons with optical scattering data obtained by optical instruments used with stylus instruments for characterizing surface topographies. A theoretical model has been defined which relates light scattering and the characteristics of the surface roughness. Initial experimental results with a sinusoidal surface have indicated that although the system can follow the trend of the roughness, the roughness amplitude is as yet uncertainly defined and the computations require excessive time.

Gilsinn, D. E.↗
NASA NTRS1991

Vibration sensing in flexible structures using a distributed-effect modal domain optical fiber sensor

Modal domain optical fiber sensors have recently been employed in the implementation of system identification algorithms and the closed-loop control of vibrations in flexible structures. The mathematical model of the modal domain optical fiber sensor used in these applications, however, only accounted for the effects of strain in the direction of the fiber's longitudinal axis. In this paper, we extend this model to include the effects of arbitrary stress. Using this sensor model, we characterize the sensor's sensitivity and dynamic range.

Reichard, Karl M.↗
DOE OSTI2020

Optimal Energy Dispatch of Distributed PVs for the Next Generation of Distribution Management Systems

Advanced Distribution Management Systems (ADMS) are being widely adopted by electric utilities for managing and optimizing the operations of their distribution systems. Distributed photovoltaic (DPV) systems with smart inverters can be controlled to adjust active power and reactive power outputs, and they are envisioned to become a part of (centrally or distributed) controllable assets managed by the ADMS for optimizing grid operations. This paper proposes an optimal energy dispatch strategy controlling DPV systems for regulating distribution voltages and achieving conservation voltage reduction. A convex optimization model is proposed with the use of linearized power flow, and the gradient projection algorithm is used to solve the optimal active power and reactive power outputs of smart inverters. The proposed optimal energy dispatch is implemented using an open-source ADMS platform, and simulation results have demonstrated the effectiveness of the proposed approach on improving distribution grid operations.

42 ENGINEERING↗
DOE OSTI2025

End-to-end deep learning pipeline for real-time Bragg peak segmentation: from training to large-scale deployment

X-ray crystallography reconstruction, which transforms discrete X-ray diffraction patterns into three-dimensional molecular structures, relies critically on accurate Bragg peak finding for structure determination. As X-ray free electron laser (XFEL) facilities advance toward MHz data rates (1 million images per second), traditional peak finding algorithms that require manual parameter tuning or exhaustive grid searches across multiple experiments become increasingly impractical. While deep learning approaches offer promising solutions, their deployment in high-throughput environments presents significant challenges in automated dataset labeling, model scalability, edge deployment efficiency, and distributed inference capabilities. We present an end-to-end deep learning pipeline with three key components: (1) a data engine that combines traditional algorithms with our peak matching algorithm to generate high-quality training data at scale, (2) a modular architecture that scales from a few million to hundreds of million parameters, enabling us to train large expert-level models offline while deploying smaller, distilled models at the edge, and (3) a decoupled producer-consumer architecture that separates specialized data source layer from model inference, enabling flexible deployment across diverse computing environments. Using this integrated approach, our pipeline achieves accuracy comparable to traditional methods tuned by human experts while eliminating the need for experiment-specific parameter tuning. Although current throughput requires optimization for MHz facilities, our system's scalable architecture and demonstrated model compression capabilities provide a foundation for future high-throughput XFEL deployments.

Wang, Cong↗
NASA NTRS2008

Hail Size Distribution Mapping

A 3-D weather radar visualization software program was developed and implemented as part of an experimental Launch Pad 39 Hail Monitor System. 3DRadPlot, a radar plotting program, is one of several software modules that form building blocks of the hail data processing and analysis system (the complete software processing system under development). The spatial and temporal mapping algorithms were originally developed through research at the University of Central Florida, funded by NASA s Tropical Rainfall Measurement Mission (TRMM), where the goal was to merge National Weather Service (NWS) Next-Generation Weather Radar (NEXRAD) volume reflectivity data with drop size distribution data acquired from a cluster of raindrop disdrometers. In this current work, we adapted these algorithms to process data from a cluster of hail disdrometers positioned around Launch Pads 39A or 39B, along with the corresponding NWS radar data. Radar data from all NWS NEXRAD sites is archived at the National Climatic Data Center (NCDC). That data can be readily accessed at . 3DRadPlot plots Level III reflectivity data at four scan elevations (this software is available at Open Channel Software, ). By using spatial and temporal interpolation/extrapolation based on hydrometeor fall dynamics, we can merge the hail disdrometer array data coupled with local Weather Surveillance Radar-1988, Doppler (WSR-88D) radial velocity and reflectivity data into a 4-D (3-D space and time) picture of hail size distributions. Hail flux maps can then be generated and used for damage prediction and assessment over specific surfaces corresponding to structures within the disdrometer array volume. Immediately following a hail storm, specific damage areas and degree of damage can be identified for inspection crews.

Source record↗
NASA NTRS2018

Dynamic Adjustment of Simulation Parameters for Efficient Vehicle Prognostics

Model-based diagnostics and prognostics rely on state estimation and uncertainty management algorithms to produce useful information for system operators and maintainers. This information enables more informed operational decisions, condition-based maintenance, and overall mission safety assurance. Typically, uncertainty is associated with vehicle state-of-health estimation and prediction results because of modeling errors, internal or external sources of noise, and sensor inaccuracy. Probabilistic uncertainty management methods including Sequential Monte Carlo simulation are commonly used to reason about state-of-health estimates and predictions in the presence of these sources of uncertainty. However, such algorithms can be computationally expensive as they require a very large number of samples to obtain a sufficiently accurate quantification of the end of life probability distribution. As a result, highly mobile autonomous systems that leverage the prognostic results for mission-level replanning are often constrained in their processing capability because of these computationally expensive simulation approaches. Therefore, in this paper, we investigate algorithmic methods for dynamically adjusting simulation time step as well as number of samples to achieve highly efficient prognostic results while maintaining results accuracy. Results obtained from simulated flight experiments of an electric unmanned aerial vehicle are presented to verify the efficacy of such algorithms.

Prognostics↗
NASA NTRS2004

The formation algorithms and simulation testbed

Formation flying for spacecraft is a rapidly developing field that will enable a new era of space science. For one of its missions, the Terrestrial Planet Finder (TPF) project has selected a formation flying interferometer design to detect earth-like planets orbiting distant stars. In order to advance technology needed for the TPF formation flying interferometer, the TPF project has been developing a distributed real-time testbed to demonstrate end-toend operation of formation flying with TPF-like functionality and precision. This is the Formation Algorithms and Simulation Testbed (FAST) . This FAST was conceived to bring out issues in timing, data fusion, inter-spacecraft communication, inter-spacecraft sensing and system-wide formation robustness. In this paper we describe the FAST and show results from a two-spacecraft formation scenario. The two-spacecraft simulation is the first time that precision end-to-end formation flying operation has been demonstrated in a distributed real-time simulation environment.

Benowitz, Edward↗
NASA NTRS1976

Voltage profile program for the Kennedy Space Center electric power distribution system

The Kennedy Space Center voltage profile program computes voltages at all busses greater than 1 Kv in the network under various conditions of load. The computation is based upon power flow principles and utilizes a Newton-Raphson iterative load flow algorithm. Power flow conditions throughout the network are also provided. The computer program is designed for both steady state and transient operation. In the steady state mode, automatic tap changing of primary distribution transformers is incorporated. Under transient conditions, such as motor starts etc., it is assumed that tap changing is not accomplished so that transformer secondary voltage is allowed to sag.

Source record↗
NASA NTRS2019

Lightning Strike Distance Distribution Beyond a Preexisting Lightning Area

The 45th Weather Squadron (45 WS) asked the Applied Meteorology Unit (AMU) to review the 30-year-old, lightning stand-off distances of 5 nautical miles (nmi) for applicability to today's operations. This was based on the realization that previous lightning strike distance studies did not match how 45 WS issues lightning warnings (Roeder, 2008). The previous lightning distance studies were from the point of origin of the lightning or the average starting location that would tend to be in the core of the thunderstorm. However, the 45 WS issues lightning warnings based on the edge of a preexisting lightning area. Before beginning the AMU project, it took several years to develop a method to calculate a distance distribution beyond a preexisting area (Roeder, 2015). The AMU pulled Lightning Detection and Ranging (LDAR) sensor data from 1/1/2013 to 12/31/2013. This dataset consisted of 37 million individual source data points from the LDAR sensors. Only sources within 50 km north, south, east or west of the LDAR grid center were included in the dataset. This limited the use of LDAR data to that with the greatest accuracy of source detection and increased data processing. Points were grouped into flashes based on spatial and temporal criteria. Based on the sensitivity analysis the AMU performed on the flash clustering algorithm, a time value of 0.3 seconds was found to model flashes adequately. Distance parameters were tested from 1,500 to 7,500 meters (m) in 500 m increments. Distance parameters of both 3,000 m and 4,000 m produced results in the plotting tool that were most representative of the physical behavior of lightning. Thus statistics were gathered for the most representative of these spatial and temporal criteria on the flash size and the polygon expansion distance in order to find the correct data distributions. The best fit curves for the LDAR polygon expansion frequency vs. distances for both the 3 kilometer (km) and 4 km distance threshold values were exponential decay functions and had R2 values of > 0.998, indicating good model fits. The equations of the best fit curves were then used to calculate a desired safety radius of 4 nmi for either 3 km or 4 km distance threshold criteria. The AMU analysis concludes the safe reduction of the 5 nmi lightning warning circles to 4 nmi should improve the operational impact by 36% if based on distance from the center of the property area being protected. If based on the edge of the property being protected, then the reduction is 4.5 nmi to 4 nmi and the operational impact is decreased by 21%. For the 6 nmi lightning warning circles, the recommended 4 nmi stand-off distance will result in a safe reduction of operational impact of 31% if based on the center of the area being protected, or 16% if based on the edge of the property.

Flash clustering algorithm↗
DOE OSTI2023

DeepAstroUDA: semi-supervised universal domain adaptation for cross-survey galaxy morphology classification and anomaly detection

Abstract Artificial intelligence methods show great promise in increasing the quality and speed of work with large astronomical datasets, but the high complexity of these methods leads to the extraction of dataset-specific, non-robust features. Therefore, such methods do not generalize well across multiple datasets. We present a universal domain adaptation method, DeepAstroUDA , as an approach to overcome this challenge. This algorithm performs semi-supervised domain adaptation (DA) and can be applied to datasets with different data distributions and class overlaps. Non-overlapping classes can be present in any of the two datasets (the labeled source domain, or the unlabeled target domain), and the method can even be used in the presence of unknown classes. We apply our method to three examples of galaxy morphology classification tasks of different complexities (three-class and ten-class problems), with anomaly detection: (1) datasets created after different numbers of observing years from a single survey (Legacy Survey of Space and Time mock data of one and ten years of observations); (2) data from different surveys (Sloan Digital Sky Survey (SDSS) and DECaLS); and (3) data from observing fields with different depths within one survey (wide field and Stripe 82 deep field of SDSS). For the first time, we demonstrate the successful use of DA between very discrepant observational datasets. DeepAstroUDA is capable of bridging the gap between two astronomical surveys, increasing classification accuracy in both domains (up to 40 % on the unlabeled data), and making model performance consistent across datasets. Furthermore, our method also performs well as an anomaly detection algorithm and successfully clusters unknown class samples even in the unlabeled target dataset.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Electromagnetic Transient (EMT) Simulation Algorithm for Evaluation of Photovoltaic (PV) Generation Systems

Use of inverter-based resources facilitating renewable energy resources such as photovoltaic (PV) generation is increasing rapidly with decreasing costs and reduced emissions associated. To accommodate such rapid growth of inverter-based resources like PV systems, electromagnetic transient (EMT) simulation models of both PV systems and grids are required to analyze the interaction of PVs in the grid (like the post-event analysis). In addition, the EMT simulation would help with the planning of future power grid with a large number of PVs as well as other inverter-based distributed generation systems. In this paper, the EMT simulation models of PV systems and grids are developed based on the differential algebraic equations (DAEs) representing their EMT dynamics. Furthermore, advanced simulation algorithms including numerical stiffness-based hybrid discretization, DAE clustering and aggregation, multi-order integration, and matrix splitting approaches are applied to accelerate the EMT simulation. The proposed algorithm was applied to 125 PV inverters within 52-bus medium-voltage (MV) distribution grid.

Choi, Jongchan↗
NASA NTRS2001

Retrieving LAI and FPAR from MERIS Data With Advanced Algorithms

The primary motivation of this research activity is to document the feasibility of deriving global fields of LAI (leaf area index) and FPAR (fraction of photosynthetically active radiation absorbed by vegetation) from atmosphere corrected ESA (European Space Agency) MERIS (Medium Resolution Imaging Spectrometer) data, validate and evaluate the MERIS LAI and FPAR products by intercomparison with MODIS (Moderate Resolution Imaging Spectrometer) LAI and FPAR products and with field data collected at the EOS Core sites distributed around the world. Our activities during Year 1 (January through December, 2001) have focused on the modification of the MODIS LAI/FPAR algorithm to facilitate its ability to process MERIS data. We considered a related but wider problem, i.e., fusion of biophysical parameters derived from data acquired by spectroradiometers of different spectral bands and different resolutions.

Myneni, Ranga B.↗
DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids

Increase in the proliferation of distributed energy resources require real-time situational awareness for efficient grid operations. State estimation plays an important role for the real-time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hier-archical spectral clustering-based network partitioning algorithm followed by a decentralized compressive sensing (DCS)-based state estimation. The applicability of the proposed network partitioning algorithm is tested on an IEEE 123-bus network, an IEEE 8,500-node system, and a 6,000+ node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum number of edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6,000+ node distribution network after dividing the network into 18 optimal partitions. Simulation results show that the DCS-based state estimation recovers the system states with high accuracy and low complexity.

alternating direction method of multipliers↗