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 271 records · Page 15

Gradient-Based Multi-Area Distribution System State Estimation

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Solving a system of linear equations: From centralized to distributed methods

For a wide range of control engineering applications, the problem of solving a system of linear equations is often encountered and has been well studied. Traditionally, this problem has been mainly solved in a centralized manner. However, for applications related to large-scale complex networked systems, centralized algorithms are often subjected to some practical issues due to limited computational power and communication bandwidth. As a promising and viable alternative, distributed algorithms can effectively address the issues associated with centralized algorithms by solving the problem efficiently in a multi-agent setting that accords with the distributed nature of networked systems. Distributed algorithms decompose the entire problem into many sub-problems that are solved by individual agents in a cooperative manner. In this survey paper, we provide a detailed overview of the state of the art relevant to distributed algorithms for solving a system of linear equations. We will first review basic distributed algorithms including both discrete-time and continuous-time algorithms. Then we will discuss the extended algorithms to achieve communication efficiency. Furthermore, we will also introduce distributed algorithms to obtain the minimum-norm solution for a system of linear equations with multiple solutions, as well as the least-squares solutions when there is no solution. Finally, the relationship of distributed algorithms for solving a system of linear equations to the existing distributed optimization algorithms is discussed.

Wang, Peng↗

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

97 MATHEMATICS AND COMPUTING↗

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗

NASA Tech Briefs, August 2012

Topics covered include: Mars Science Laboratory Drill; Ultra-Compact Motor Controller; A Reversible Thermally Driven Pump for Use in a Sub-Kelvin Magnetic Refrigerator; Shape Memory Composite Hybrid Hinge; Binding Causes of Printed Wiring Assemblies with Card-Loks; Coring Sample Acquisition Tool; Joining and Assembly of Bulk Metallic Glass Composites Through Capacitive Discharge; 670-GHz Schottky Diode-Based Subharmonic Mixer with CPW Circuits and 70-GHz IF; Self-Nulling Lock-in Detection Electronics for Capacitance Probe Electrometer; Discontinuous Mode Power Supply; Optimal Dynamic Sub-Threshold Technique for Extreme Low Power Consumption for VLSI; Hardware for Accelerating N-Modular Redundant Systems for High-Reliability Computing; Blocking Filters with Enhanced Throughput for X-Ray Microcalorimetry; High-Thermal-Conductivity Fabrics; Imidazolium-Based Polymeric Materials as Alkaline Anion-Exchange Fuel Cell Membranes; Electrospun Nanofiber Coating of Fiber Materials: A Composite Toughening Approach; Experimental Modeling of Sterilization Effects for Atmospheric Entry Heating on Microorganisms; Saliva Preservative for Diagnostic Purposes; Hands-Free Transcranial Color Doppler Probe; Aerosol and Surface Parameter Retrievals for a Multi-Angle, Multiband Spectrometer LogScope; TraceContract; AIRS Maps from Space Processing Software; POSTMAN: Point of Sail Tacking for Maritime Autonomous Navigation; Space Operations Learning Center; OVERSMART Reporting Tool for Flow Computations Over Large Grid Systems; Large Eddy Simulation (LES) of Particle-Laden Temporal Mixing Layers; Projection of Stabilized Aerial Imagery Onto Digital Elevation Maps for Geo-Rectified and Jitter-Free Viewing; Iterative Transform Phase Diversity: An Image-Based Object and Wavefront Recovery; 3D Drop Size Distribution Extrapolation Algorithm Using a Single Disdrometer; Social Networking Adapted for Distributed Scientific Collaboration; General Methodology for Designing Spacecraft Trajectories; Hemispherical Field-of-View Above-Water Surface Imager for Submarines; and Quantum-Well Infrared Photodetector (QWIP) Focal Plane Assembly.

Source record↗

Distributed Control Strategy to Achieve Synchronized Operation of an Islanded MG

To seamlessly transition a microgrid (MG) from islanded to grid-connected mode, it is necessary to synchronize the magnitude, frequency, and phase of the MG voltage to the voltage of the main grid. In this paper, we present a distributed control strategy to achieve synchronized operation of an islanded MG supported by multiple controllable distributed generators (DGs). The proposed method utilizes pinning-based consensus algorithm to ensure explicit coordination between magnitude, frequency and phase angle regulation, while ensuring proportional power sharing. System frequency is regulated by all the DGs in proportion to their capacity, while a selected DG eliminates the phase and magnitude regulation errors. Controller design criteria is based on small-signal stability analysis. Here, the proposed control strategy is implemented in hardware controllers and its effectiveness is demonstrated using a real-time hardware-in-the-loop MG testbed.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation-flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are proposed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms rely on a local information exchange network, relaxing the assumptions on existing algorithms. Distributed space systems rely on a signal transmission network among multiple spacecraft for their operation. Control and coordination among multiple spacecraft in a formation is facilitated via a network of relative sensing and interspacecraft communications. Guidance, navigation, and control rely on the sensing network. This network becomes more complex the more spacecraft are added, or as mission requirements become more complex. The observability of a formation state was observed by a set of local observations from a particular node in the formation. Formation observability can be parameterized in terms of the matrices appearing in the formation dynamics and observation matrices. An agreement protocol was used as a mechanism for observing formation states from local measurements. An agreement protocol is essentially an unforced dynamic system whose trajectory is governed by the interconnection geometry and initial condition of each node, with a goal of reaching a common value of interest. The observability of the interconnected system depends on the geometry of the network, as well as the position of the observer relative to the topology. For the first time, critical GN&C (guidance, navigation, and control estimation) subsystems are synthesized by bringing the contribution of the spacecraft information-exchange network to the forefront of algorithmic analysis and design. The result is a formation estimation algorithm that is modular and robust to variations in the topology and link properties of the underlying formation network.

Fathpour, Nanaz↗

A Monte Carlo Rectangle Packing Algorithm for Identifying Likely Spatial Distributions of Final Closure Cap Subsidence in the E-Area Low-Level Waste Facility

A Monte Carlo rectangle packing algorithm, summarized in Figure ES-1, has been developed to provide insights into the likely spatial distribution of subsided areas or holes in the final closure cap for the E-Area Low-Level Waste Facility (ELLWF) resulting from the placement of non-crushable waste containers within slit and engineered trench disposal units. Using historical records provided by Solid Waste Management as an indicator of future waste streams, a probability distribution of unique waste containers was constructed, and Monte Carlo sampling was used to sequentially select waste containers for placement in a rectangular region bounded by the disposal unit footprint. Within this Monte Carlo approach, the probability of any container type being selected is weighted by the fractional abundance relative to all other container types. For each Monte Carlo realization, the frequency of non-crushable waste containers appearing at each location on a spatially discretized mesh is updated. After many realizations, the location(s) with the highest frequencies of non-crushable waste containers are regarded as the most likely locations to experience subsidence (i.e., for a hole to form). Utilizing this approach has enabled the down-selection of a computationally intractable set of subsidence hole combinations to be explored in three-dimensional finite element groundwater flow and contaminant transport models. Such an approach can be applied to a number of different packaging problems.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

An Optimization Framework for Dynamic, Distributed Real-Time Systems

Abstract. This paper presents a model that is useful for developing resource allocation algorithms for distributed real-time systems .that operate in dynamic environments. Interesting aspects of the model include dynamic environments, utility and service levels, which provide a means for graceful degradation in resource-constrained situations and support optimization of the allocation of resources. The paper also provides an allocation algorithm that illustrates how to use the model for producing feasible, optimal resource allocations.

Eckert, Klaus↗

Distributed Load Shedding Application Architecture and Bi-Level Predictive Estimator Algorithm

Increasing penetrations of distributed renewables are decreasing the effectiveness of traditional decentralized under-frequency load shedding (UFLS) schemes. As more distribution circuits begin to back-feed the transmission system, operation of traditional UFLS may exacerbate frequency instability. This paper presents the conceptual framework for a data-rich environment to coordinate UFLS across multiple distribution providers based on the laminar coordination framework in order to ensure optimal adaptive setting of UFLS relays. Communication and control are enabled through a distributed implementation of the IEC 61968-1 Common Information Model message bus structure. In addition to the proposed architecture, a novel adaptive UFLS scheme informed by a bi-level state estimator to create optimal relay setpoints is introduced. Initial simulation results are presented for the IEEE 14-bus test system on scenarios leading to mis-operation of traditional UFLS.

Anderson, Alexander A.↗

Effect of the embolization material in the dose calculation for stereotactic radiosurgery of arteriovenous malformations

It is reported in the literature that the material used in an embolization of an arteriovenous malformation (AVM) can attenuate the radiation beams used in stereotactic radiosurgery (SRS) up to 10% to 15%. The purpose of this work is to assess the dosimetric impact of this attenuating material in the SRS treatment of embolized AVMs, using Monte Carlo simulations assuming clinical conditions. A commercial Monte Carlo dose calculation engine was used to recalculate the dose distribution of 20 AVMs previously planned with a pencil beam dose calculation algorithm. Dose distributions were compared using the following metrics: average, minimal and maximum dose of AVM, and 2D gamma index. The effect in the obliteration rate was investigated using radiobiological models. It was found that the dosimetric impact of the embolization material is less than 1.0 Gy in the prescription dose to the AVM for the 20 cases studied. The impact in the obliteration rate is less than 4.0%. There is reported evidence in the literature that embolized AVMs treated with SRS have low obliteration rates. This work shows that there are dosimetric implications that should be considered in the final treatment decisions for embolized AVMs.

61 RADIATION PROTECTION AND DOSIMETRY↗

Equitable Transactive Market Design to Coordinate Networked Microgrids with Mixed Ownership

This paper presents an inter-microgrid peer-topeer (P2P) transactive market mechanism to support the coordination of multiple microgrids in a mixed-ownership environment, while enabling prosumers to actively participate in the market to get their own benefits. An equitable P2P transactive energy market is designed, in which the energy burden to customers within microgrids is fairly distributed by leveraging a peer-to-peer communication network among MG owners and the distribution system operator (DSO). To reach the market settlement, a consensus-based distributed optimization algorithm is introduced to enable each MG owner and the DSO to distributedly determine the cleared price which is compensated by a household-income-based discount factor to encourage the energy-burden equity among customers in networked microgrids service territory. Numerical results on the modified 123 node test feeder including 6 microgrids are used to demonstrate the operation of the introduced equitable transactive energy market.

Vu, Thanh Long↗

The feasibility of using time-dependent photochemical calculations to infer radical species concentrations from solar occultation absorption measurements

In connection with fast chemical reactions, short-lived stratospheric species experience rapid concentration variations at sunset and sunrise. For solar occultation absorption measurements, these rapid concentration variations may introduce significant errors with respect to the inference of atmospheric abundances for some species due to asymmetrical concentration distributions. Most retrieval algorithms assume that concentration distributions are spherically symmetric. The effect of this assumption on the accuracy of inferred concentrations has been studied by Kerr et al. (1977). The present investigation considers the feasibility of using a time-dependent one-dimensional photochemical model to provide detailed information about the asymmetrical distribution for use in the retrieval procedure. As shown by Boughner et al. (1980), diurnal effects can be represented by an inhomogeneity factor. It is found that the NO retrieval improves considerably with the inclusion of a correction factor containing the asymmetrical variations.

Larsen, J. C.↗

Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services

This paper presents the development of ICAROUS-2 (Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services), the second generation of a software architecture that integrates several algorithms as distributed onboard services to enable robust autonomous UAS applications. In particular, the ICAROUS architecture defines a framework to perform detect and avoid, geofencing, path monitoring, path planning, and autonomous decision making to ensure safety and mission progress. Most of the core algorithms implemented in ICAROUS are formally verified using an interactive theorem prover. These algorithms are composed together using a plan execution engine, whose operational semantics is formally specified. A description of the integrated architecture, services currently available, and flight test results highlighting the capability of ICAROUS are presented.

Balachandran, Swee↗

Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services

This paper presents the development of ICAROUS-2 (Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services), the second generation of a software architecture that integrates several algorithms as distributed onboard services to enable robust autonomous UAS applications. In particular, the ICAROUS architecture defines a framework to perform detect and avoid, geofencing, path monitoring, path planning, and autonomous decision making to ensure safety and mission progress. Most of the core algorithms implemented in ICAROUS are formally verified using an interactive theorem prover. These algorithms are composed together using a plan execution engine, whose operational semantics is formally specified. A description of the integrated architecture, services currently available, and flight test results highlighting the capability of ICAROUS are presented.

Balachandran, Swee↗

Cyber Graph Queries for Geographically Distributed Data Centers

We present new algorithms for a distributed model for graph computations motivated by limited information sharing we first discussed. Two or more independent entities have collected large social graphs. They wish to compute the result of running graph algorithms on the entire set of relationships. Because the information is sensitive or economically valuable, they do not wish to simply combine the information in a single location. We consider two models for computing the solution to graph algorithms in this setting: 1) limited-sharing: the two entities can share only a polylogarithmic size subgraph; 2) low-trust: the entities must not reveal any information beyond the query answer, assuming they are all honest but curious. We believe this model captures realistic constraints on cooperating autonomous data centers. We have algorithms in both setting for s - t connectivity in both models. We also give an algorithm in the low-communication model for finding a planted clique. This is an anomaly-detection problem, finding a subgraph that is larger and denser than expected. For both the low- communication algorithms, we exploit structural properties of social networks to prove performance bounds better than what is possible for general graphs. For s - t connectivity, we use known properties. For planted clique, we propose a new property: bounded number of triangles per node. This property is based upon evidence from the social science literature. We found that classic examples of social networks do not have the bounded-triangles property. This is because many social networks contain elements that are non-human, such as accounts for a business, or other automated accounts. We describe some initial attempts to distinguish human nodes from automated nodes in social networks based only on topological properties.

97 MATHEMATICS AND COMPUTING↗