Search NASA⌕ Search

SEARCH · Search NASA

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 307 records · Page 17

SciDAC Institute: Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) (Final Report)

Throughout the project we focused on six research areas. In accordance with the specific goals, we developed novel models to solve some of these. Some of the problems required scalable distributed memory algorithms, where as some required sequential solutions. Although several graduate students and collaborators were actively involved in all of these activities, only one PhD student was directly supported by the grant. Below is a brief overview of the research carried out in each of these areas.

97 MATHEMATICS AND COMPUTING↗

Interregional Transmission Operational Coordination (IRTOC)

This report presents a modeling and evaluation framework developed through the Inter-Regional Transmission Operational Coordination (IRTOC) project to study market-to-market (M2M) congestion management across day-ahead and real-time markets. The framework extends the Sienna platform through Sienna Decomposition, a multi-stage evaluation architecture that enables flexible representation of multiple regions and systematic assessment of alternative market coordination designs. Additional modeling capabilities include reserve deliverability constraints, High-Voltage Direct Current (HVDC) optimization for Alternating Current (AC) congestion management, and several real-time distributed coordination algorithms. Case studies using the RTS-GMLC test system and a large-scale Eastern Interconnection model demonstrate that the framework can evaluate alternative coordination structures and quantify their economic and operational impacts. The proposed framework provides a scalable platform for analyzing inter-regional coordination strategies in large-scale electricity markets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Distributed Data-Driven Power Iteration for Strongly Connected Networks

Here, this paper presents data-driven power iteration to distributively estimate the dominant eigenvalues of an unknown linear time-invariant system. The proposed strategy only requires a single trajectory data or measurements. Furthermore, in order to perform the distributed estimation, the communication network topology can be chosen to be any strongly connected directed graphs. The proposed data-driven power iteration is demonstrated using several numerical examples and is then applied to estimate the generalized algebraic connectivity of cooperative systems and to control the epidemic spreading.

Gusrialdi, Azwirman↗

Grid-tied PV battery systems.

Grid tied PV energy smoothing was implemented by using a valve regulated lead-acid (VRLA) battery as a temporary energy storage device to both charge and discharge as required to smooth the inverter energy output from the PV array. Inverter output was controlled by the average solar irradiance over the previous 1h time interval. On a clear day the solar irradiance power curve is offset by about 1h, while on a variable cloudy day the inverter output power curve will be smoothed based on the average solar irradiance. Test results demonstrate that this smoothing algorithm works very well. Battery state of charge was more difficult to manage because of the variable system inefficiencies. Testing continued for 30-days and established consistent operational performance for extended periods of time under a wide variety of resource conditions. Both battery technologies from Exide (Absolyte) and East Penn (ALABC Advanced) proved to cycle well at a Partial state of charge over the time interval tested.

25 ENERGY STORAGE↗

A fast and memory-sparing probabilistic selection algorithm for the GPU

A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.

99 GENERAL AND MISCELLANEOUS↗

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗

SU-E-T-427: Feasibility Study for Evaluation of IMRT Dose Distribution Using Geant4-Based Automated Algorithms

Purpose: For intensity-modulated radiation therapy (IMRT) treatment planning validation using Monte Carlo (MC) simulations, a precise and automated procedure is necessary to evaluate the patient dose distribution. The aim of this study is to develop an automated algorithm for IMRT simulations using DICOM files and to evaluate the patient dose based on 4D simulation using the Geant4 MC toolkit. Methods: The head of a clinical linac (Varian Clinac 2300 IX) was modeled in Geant4 along with particular components such as the flattening filter and the multi-leaf collimator (MLC). Patient information and the position of the MLC were imported from the DICOM-RT interface. For each position of the MLC, a step- and-shoot technique was adopted. PDDs and lateral profiles were simulated in a water phantom (50×50×40 cm{sup 3}) and compared to measurement data. We used a lung phantom and MC-dose calculations were compared to the clinical treatment planning used at the Seoul National University Hospital. Results: In order to reproduce the measurement data, we tuned three free parameters: mean and standard deviation of the primary electron beam energy and the beam spot size. These parameters for 6 MV were found to be 5.6 MeV, 0.2378 MeV and 1 mm FWHM respectively. The average dose difference between measurements and simulations was less than 2% for PDDs and radial profiles. The lung phantom study showed fairly good agreement between MC and planning dose despite some unavoidable statistical fluctuation. Conclusion: The current feasibility study using the lung phantom shows the potential for IMRT dose validation using 4D MC simulations using Geant4 tool kits. This research was supported by Korea Institute of Nuclear safety and Development of Measurement Standards for Medical Radiation funded by Korea research Institute of Standards and Science. (KRISS-2015-15011032)

60 APPLIED LIFE SCIENCES↗

Visibility-enhanced model-free deep reinforcement learning algorithm for voltage control in realistic distribution systems using smart inverters

Increasing integration of distributed solar photovoltaic (PV) into distribution networks could result in adverse effects on grid operation. Traditional model-based control algorithms require accurate model information that is difficult to acquire and thus are challenging to implement in practice. Here, this paper proposes a surrogate model-enabled grid visibility scheme to empower deep reinforcement learning (DRL) approach for distribution network voltage regulation using PV inverters with minimal system knowledge. In contrast to existing DRL methods, this paper presents and corroborates the adverse impact of missing load information on DRL performance and, based on this finding, proposes a surrogate model methodology to impute load information utilizing observable data. Additionally, a multi-fidelity neural network is utilized to construct the DRL training environment, chosen for its efficient data utilization and enhanced robustness to data uncertainty. The feasibility and effectiveness of the proposed algorithm are assessed by considering DRL testing across varying degrees of observable load information and diverse training environments on a realistic power system.

14 SOLAR ENERGY↗

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗

Task allocation in geo-distributed cyber-physical systems - 256

This paper studies the task allocation algorithm for a distributed test facility (DTF), which aims to assemble geo-distributed cyber (software) and physical (hardware in the loop) components into a prototype cyber-physical system (CPS). This allows low cost testing on an early conceptual prototype (ECP) of the ultimate CPS (UCPS) to be developed. The DTF provides an instrumentation interface for carrying out reliability experiments remotely such as fault propagation analysis and in-situ testing of hardware and software components in a simulated environment. Unfortunately, the geo-distribution introduces an overhead that is not inherent to the UCPS, i.e. a significant time delay in communication that threatens the stability of the ECP and is not an appropriate representation of the behavior of the UCPS. This can be mitigated by implementing a task allocation algorithm to find a suitable configuration and assign the software components to appropriate computational locations, dynamically. This would allow the ECP to operate more efficiently with less probability of being unstable due to the delays introduced by geo-distribution. The task allocation algorithm proposed in this work uses a Monte Carlo approach along with Dynamic Programming to identify the optimal network configuration to keep the time delays to a minimum. (authors)

97 MATHEMATICS AND COMPUTING↗

SU-F-SPS-05: Experimental Validation of Peripheral Dose Distribution of Electron Beams for Eclipse Electron Monte Carlo Algorithm

Purpose: In this study, the two available calculation algorithms of the Varian Eclipse treatment planning system(TPS), the electron Monte Carlo(eMC) and General Gaussian Pencil Beam(GGPB) algorithms were used to compare measured and calculated peripheral dose distribution of electron beams. Methods: Peripheral dose measurements were carried out for 6, 9, 12, 15, 18 and 22 MeV electron beams of Varian Triology machine using parallel plate ionization chamber and EBT3 films in the slab phantom. Measurements were performed for 6×6, 10×10 and 25×25cm{sup 2} cone sizes at dmax of each energy up to 20cm beyond the field edges. Using the same film batch, the net OD to dose calibration curve was obtained for each energy. Films were scanned 48 hours after irradiation using an Epson 1000XL flatbed scanner. Dose distribution measured using parallel plate ionization chamber and EBT3 film and calculated by eMC and GGPB algorithms were compared. The measured and calculated data were then compared to find which algorithm calculates peripheral dose distribution more accurately. Results: The agreement between measurement and eMC was better than GGPB. The TPS underestimated the out of field doses. The difference between measured and calculated doses increase with the cone size. The largest deviation between calculated and parallel plate ionization chamber measured dose is less than 4.93% for eMC, but it can increase up to 7.51% for GGPB. For film measurement, the minimum gamma analysis passing rates between measured and calculated dose distributions were 98.2% and 92.7% for eMC and GGPB respectively for all field sizes and energies. Conclusion: Our results show that the Monte Carlo algorithm for electron planning in Eclipse is more accurate than previous algorithms for peripheral dose distributions. It must be emphasized that the use of GGPB for planning large field treatments with 6 MeV could lead to inaccuracies of clinical significance.

60 APPLIED LIFE SCIENCES↗

Multiarea Distribution System State Estimation via Distributed Tensor Completion

Here, this paper proposes a model-free distribution system state estimation method based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A three-way tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A distributed closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. The convergence properties of the distributed algorithm and the sufficient conditions on the number of samples for each smaller network that guarantee the identifiability of the factors of the state tensor are presented. To demonstrate the efficacy of the proposed algorithm and to check the identifiability conditions, numerical simulations are carried out using the IEEE 123-bus system and a large-scale real utility feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Energy Resources Coordination over Time-varying Directed Communication Networks

In this paper, we consider an optimal coordination problem for distributed energy resources (DERs) including distributed generators and energy storage devices. We first propose an algorithm based on the push-sum and gradient method to optimally coordinate storage devices and distributed generators in a distributed manner. In the proposed algorithm, each DER only maintains a set of variables and updates them through information exchange with a few neighboring DERs over a time-varying directed communication network. We show that the proposed distributed algorithm with appropriately chosen step-sizes solve the optimal DER coordination problem if the time-varying directed communication network is uniformly jointly strongly connected, which is a mild condition on the connectivity of communication topologies. The proposed distributed algorithm is illustrated and validated by numerical simulations.

Yang, Tao↗

SU-E-T-397: Evaluation of Planned Dose Distributions by Monte Carlo (0.5%) and Ray Tracing Algorithm for the Spinal Tumors with CyberKnife

Purpose: To analyze and evaluate dose distribution between Ray Tracing (RT) and Monte Carlo (MC) algorithms of 0.5% uncertainty on a critical structure of spinal cord and gross target volume and planning target volume. Methods: Twenty four spinal tumor patients were treated with stereotactic body radiotherapy (SBRT) by CyberKnife in 2013 and 2014. The MC algorithm with 0.5% of uncertainty is used to recalculate the dose distribution for the treatment plan of the patients using the same beams, beam directions, and monitor units (MUs). Results: The prescription doses are uniformly larger for MC plans than RT except one case. Up to a factor of 1.19 for 0.25cc threshold volume and 1.14 for 1.2cc threshold volume of dose differences are observed for the spinal cord. Conclusion: The MC recalculated dose distributions are larger than the original MC calculations for the spinal tumor cases. Based on the accuracy of the MC calculations, more radiation dose might be delivered to the tumor targets and spinal cords with the increase prescription dose.

60 APPLIED LIFE SCIENCES↗

A hybrid architecture for volt-var control in active distribution grids

Modern active distribution grids are characterized by the increasing penetration of distributed energy resources (DERs). The proper coordination and scheduling of a large numbers of these small-scale and spatially distributed DERs is necessary, and warrants the use of novel distributed approaches. In this paper, we propose a hybrid volt-var control architecture for the distribution grid, which leverages existing centralized and local approaches to planning, decision making, and control, and augments it with distributed optimization and distributed control for DER management. First, we propose a convex model to describe the power physics of distribution grids of meshed topology and unbalanced structure, based on current injection and McCormick Envelopes. Second, we employ the distributed proximal atomic coordination (PAC) algorithm to coordinate DERs to provide voltage support. We implement volt-var optimization by optimally coordinating DERs including PV smart inverters and demand response. We present results using the IEEE-34 bus network, using real data from a distribution feeder in Hawaii, to model load and PV generation. Different levels of DER penetration and objective functions are simulated. Finally, our results show the need for the coordination of DERs to improve voltage profiles, even in networks with existing voltage control devices. Further, we show the need for flexible reactive power capabilities to achieve desired grid performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Scalable/Secure Cooperative Algorithms and Framework for Extremely-high Penetration Solar Integration (SolarExPert) (Final Technical Report)

This SolarExPert project has developed a Sustainable Grid Platform (SGP) with scalable architecture of distributed control and optimization. The SGP consists of the following major functions: 1) an advanced grid architecture with hierarchical and distributed communication and control, combined with the OpenFMB standard and implemented on the Multi-Agent OpenDSS (MA-OpenDSS) platform; 2) an online distributed stochastic optimal power flow; 3) an online distributed system state estimation algorithm; 4) the distributed Volt/VAR optimization and frequency control algorithms; 5) the distributed distribution system restoration strategy. The developed SGP together with advanced functions are tested in 1 million (1M)-node distribution system on the MA-OpenDSS platform. Furthermore, the models and algorithms are tested in 100,000-node system HiL simulation, and also in P-HiL implementation with 100 physical devices. The developed functions haven been validated and tested on the selected actual distribution feeder with the data collected from the field of Maui Meadows in Hawaii. The distributed PV hosting capacities with cooperative Volt/VAR and Volt/VAR/Watt control are estimated and compared to provide recommendations for customers and the utility company.

14 SOLAR ENERGY↗

Distributed Optimal Power Management for Battery Energy Storage Systems: A Novel Accelerated Tracking ADMM Approach

Optimal power management (OPM) is critical for large-scale battery energy storage systems. Today’s methods often require formidable computational effort due to the design based on centralized numerical optimization. Thus, this paper investigates computationally distributed OPM where the agents based on the cells communicate over a network to cooperatively solve the OPM problem. We propose an accelerated tracking alternating direction method of multipliers (ADMM) algorithm to solve the distributed OPM. The proposed algorithm embeds dynamic average consensus and Nesterov’s acceleration technique in the ADMM algorithm. Not only is the proposed algorithm fully distributed without a need for fusion or aggregating nodes, but it also accelerates convergence. The paper formulates the OPM in a model predictive control framework where it seeks to regulate the charging/discharging power of each battery cell to minimize the total power losses and promote balanced use of the constituent cells while complying with the safety constraints. The paper provides ample simulation results to demonstrate the effectiveness and advantages of the proposed distributed OPM in terms of computation and convergence.

Farakhor, Amir↗

A Load Switching Group based Feeder-level Microgrid Energy Management Algorithm for Service Restoration in Power Distribution System

This paper presents a load switching group based energy management system (LSG-EMS) for operating microgrids on a distribution feeder powered by one or multiple grid-forming distributed energy resources. Loads on a distribution feeder are divided into load switching groups that can be remotely switched on and off. The LSG-EMS algorithm, formulated as a mixed-integer linear programming (MILP) problem, has an objective function of maximizing the served loads while minimizing the total number of switching actions. A new set of topology constraints are developed for allowing multiple microgrids to be formed on the feeder and selecting the optimal supply path. Customer comfort is accounted for by maximizing the supply duration in the customer preferred service period and enforcing a minimum service duration. The proposed method is demonstrated on a modified IEEE 33-bus system using actual customer data. Simulation results show that the LSG-EMS successfully coordinates multiple grid-forming sources by selecting an optimal supply topology that maximizes the supply period of both the critical and noncritical loads while minimizing customer service interruptions in the service restoration process.

Hu, Rongxing↗