Search NASA⌕ Search

SEARCH · Search NASA

Results for “decentralized algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Optimal Decentralized Protocol for Electric Vehicle Charging

We propose a decentralized algorithm to optimally schedule electric vehicle (EV) charging. The algorithm exploits the elasticity of electric vehicle loads to fill the valleys in electric load profiles. We first formulate the EV charging scheduling problem as an optimal control problem, whose objective is to impose a generalized notion of valley-filling, and study properties of optimal charging profiles. We then give a decentralized algorithm to iteratively solve the optimal control problem. In each iteration, EVs update their charging profiles according to the control signal broadcast by the utility company, and the utility company alters the control signal to guide their updates. The algorithm converges to optimal charging profiles (that are as "flat" as they can possibly be) irrespective of the specifications (e.g., maximum charging rate and deadline) of EVs, even if EVs do not necessarily update their charging profiles in every iteration, and use potentially outdated control signal when they update. Moreover, the algorithm only requires each EV solving its local problem, hence its implementation requires low computation capability. We also extend the algorithm to track a given load profile and to real-time implementation.

Gan, LW↗

Power Minimization techniques for Networked Data Centers.

Our objective is to develop a mathematical model to optimize energy consumption at multiple levels in networked data centers, and develop abstract algorithms to optimize not only individual servers, but also coordinate the energy consumption of clusters of servers within a data center and across geographically distributed data centers to minimize the overall energy cost and consumption of brown energy of an enterprise. In this project, we have formulated a variety of optimization models, some stochastic others deterministic, and have obtained a variety of qualitative results on the structural properties, robustness, and scalability of the optimal policies. We have also systematically derived from these models decentralized algorithms to optimize energy efficiency, analyzed their optimality and stability properties. Finally, we have conducted preliminary numerical simulations to illustrate the behavior of these algorithms. We draw the following conclusion. First, there is a substantial opportunity to minimize both the amount and the cost of electricity consumption in a network of datacenters, by exploiting the fact that traffic load, electricity cost, and availability of renewable generation fluctuate over time and across geographical locations. Judiciously matching these stochastic processes can optimize the tradeoff between brown energy consumption, electricity cost, and response time. Second, given the stochastic nature of these three processes, real-time dynamic feedback should form the core of any optimization strategy. The key is to develop decentralized algorithms that can be implemented at different parts of the network as simple, local algorithms that coordinate through asynchronous message passing.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DISTRI: Distributed Multi-Facility HPC Simulator (DISTRI) v2.1

DISTRI is an advanced network simulator designed for multi-facility computational infrastructures with agentic behavior. It simulates HPC facilities where computational resources act as autonomous agents, making intelligent decisions about job scheduling, load balancing, and resource allocation. The simulator focuses on developing and testing decentralized algorithms that promote resilience and efficiency in multi-facility environments. Key Features: - Agentic Resource Behavior: Processors and DTNs act as autonomous agents with decision-making capabilities - Pheromone-Based Load Balancing: Decentralized load balancing inspired by ant colony optimization - Dual Topology Support: Mesh (normal operations) and Dumbell (network testing) topologies - Comprehensive TCP Simulation: Realistic TCP implementations with multiple congestion control algorithms - Failure Resilience Testing: Processor failure simulation with automatic job reassignment - Extensive Visualization: Detailed performance analysis and metrics collection - Research-Ready: Designed for algorithm development and benchmarking

Bez, Jean Luca [Lawrence Berkeley National Laborat↗

Decentralized Low-Rank State Estimation for Power Distribution Systems

This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.

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

On the Traffic Impacts of Optimally Controlled Connected and Automated Vehicles

The implementation of connected and automated vehicle (CAV) technologies enables a novel computational framework for real-time control actions aimed at optimizing energy consumption and associated benefits. Several research efforts reported in the literature to date have proposed decentralized control algorithms to coordinate CAVs in various traffic scenarios, e.g., highway on-ramps, intersections, and roundabouts. However, the impact of optimally coordinating CAVs on the performance of a transportation network has not been thoroughly analyzed yet. In this paper, we apply a decentralized optimal control framework in a transportation network and compare its performance to a baseline scenario consisting of human-driven vehicles. We show that introducing of CAVs yields radically improved roadway capacity and network performance.

Zhao, Liuhui↗

Agent-Supervisor Coordination for Decentralized Event-Triggered Optimization

This letter proposes decentralized resource-aware coordination schemes for solving network optimization problems defined by objective functions that combine locally evaluable costs with network-wide coupling components. These methods are well suited for a group of supervised agents trying to solve an optimization problem under mild coordination requirements. Each agent has information on its local cost and coordinates with the network supervisor for information about the coupling term of the cost. The proposed approach is feedback-based and asynchronous by design, guarantees anytime feasibility, and ensures the asymptotic convergence of the network state to the desired optimizer. Numerical simulations on a power system example illustrate our results.

decentralized algorithms↗

Genetic algorithm for demand response: a stackelberg game approach

Demand response (DR) has gained a significant recent interest due to its potential for mitigating many power system problems. Game theory is a very effective tool to be utilized in DR management. In this paper, the DR between a distribution system operator (DSO) and load aggregators (LAs) is designed as a Stackelberg game, where the DSO acts as the leader and LAs are regarded as the followers. Due to the limitations of the centralized solution approaches, a genetic algorithm-based decentralized approach is proposed. To demonstrate the proposed approach, a case study concerning a day-ahead optimization for a real-time pricing market with a single DSO and three LAs is designed and optimized. The proposed approach is able to shift the demand peaks and prove that it has a great potential to be used for the Stackelberg game between a DSO and multiple LAs to fully exploit the potential of DR.

Amasyali, Kadir↗

Distributed Coordination of Networked Microgrids for Voltage Support in Bulk Power Grids

The increasing deployment of distributed energy resources (DERs) and microgrids (MGs) in power distribution systems has enabled the adjustment of reactive power consumption as seen at the substation, which can be used to provide voltage support for the bulk power system (BPS). Leveraging this new capability will provide greater resiliency to the power system as a whole. Here, the goal of this paper is to develop and compare three different algorithms, namely distributed optimal power flow, distributed consensus algorithm, and fully decentralized collaborative autonomy for unbalanced distribution systems for microgrid coordination. These algorithms use networked MGs to support the BPS voltage when a contingency at the bulk grid results in abnormally low voltages, which may be a precursor to voltage collapse. Our comparative analysis includes both qualitative and quantitative assessments of the three algorithms and a discussion of the trade-offs between the decentralized and distributed methods in normal and disrupted conditions. Each algorithm was evaluated on the modified IEEE 13-bus system and a real power distribution system at Chattanooga, Tennessee, that encompasses more than 4500 buses. Each algorithms excels differently and may be suited for different scenarios depending on the condition, operations, and priorities of the power and communication systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Development of a Hardware-in-The-Loop Testbed for a Decentralized, Data-Driven Electric Vehicle Charging Control Algorithm

This study presents the design of an electric vehicle (EV)-grid integration (EVGI) hardware test-bed to implement smart EV charging algorithms. Here, the proposed test-bed also allows to create different grid events via flexible integration of other power hardware (e.g., controllable loads and battery energy storage systems) and test their impacts on EV charging. The design uses a real-time digital simulator to realize a complex distribution grid model with primary and secondary networks. A grid simulator physically realizes the selected nodes of the simulated grid to power an actual EV, forming a hardware-in-the-loop (HIL) test setup. The EV-grid integration is demonstrated based on the custom hardware and software implementation of the J1772 charging protocol using dSPACE MicroLabBox, operating as a custom EV Supply Equipment (EVSE). The HIL test-bed features a novel testing platform for accurate implementation and analysis of scalable charging algorithms. To this end, a data-driven, decentralized, model-free charging controller based on the Additive Increase and Multiplicative Decrease (AIMD) algorithm is presented and validated on an EV using the HIL test-bed. We tested the proposed algorithm under various case studies, and presented a comparison study with an existing droop-based, decentralized charging solution. The results showed that the EV successfully performed charging commands generated by the EVSE and regulated its charging power to effectively reduce the system loading caused by high EV penetration.

33 ADVANCED PROPULSION SYSTEMS↗

Smart Building Start (SBS) (CRADA 480)

The idea of Smart Building Start (SBS) is to manage the on/off scheduling of HVAC equipment in buildings in an optimal way in order to achieve comfort conditions at the designated times with the minimal use of energy. This concept is also known as Optimal Start and it has typically been used in buildings to start up equipment based on predictions made for a representative (or average) zone in a building. This means that zones that could have waited longer to receive conditioned air are activated too early leading to unnecessary energy loss. The approach proposed in this project is to develop and implement a distributed version of optimal start that will consider the individual requirements of all treated zones. The developed control strategy will enable smart start of the central plant as well as further localized control over each individual zone by means of setpoint adjustment so that zones are not conditioned too early thereby reducing energy use compared to the current state of the art. This project is a collaboration between PNNL and Verdicity with the goal being to bring the research concept of SBS to commercialization. The SBS algorithm(s) will be implemented and hosted on the PNNL-developed open-platform VOLTTRON which will accelerate bringing the research to practice. It is anticipated that this project will lead to new IP surrounding the algorithm and its decentralized deployment. The project will also further demonstrate the success of VOLTRON as a flexible platform for implementation of innovative algorithms for improving energy efficiency in buildings. Previous studies on smart building start carried out by PNNL have indicated potential energy savings on the order of 10-15% for multi-zone buildings compared to conventional strategies. Verdicity currently has a number of customers who can benefit from the use of this technology. PNNL will work with Verdicity to identify any key gaps in the integrated software and jointly work to enhance and customize it for Verdicity and to integrate it with their existing products for use at their customers’ sites. The proposed work will help previously funded Federal research and development technology investments find their way into a viable commercial market.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Decentralized modular hybrid supervisory control for the formation of unmanned helicopters

Abstract Formation control of Unmanned Aerial Vehicles (UAVs) requires them to tightly cooperate to reach and keep the formation, while avoiding collision. This paper proposes a novel decentralized hybrid supervisory control approach for the formation control of multiple UAVs. This is achieved by developing a symbolic motion planning technique to polarly partition the motion space resulting in a finite state discrete event model for the motion dynamics of each UAV. Then, a modular discrete supervisor is designed for different components of the formation mission including reaching the formation, keeping the formation, and collision avoidance. Further, for the collision avoidance mechanism, a novel top‐down decomposition‐based approach is developed to design local supervisors decentralizedly. It is formally proved that with the proposed top‐down decomposition‐based approach, the (locally) supervised UAVs, as a whole, can cooperatively satisfy the desired (global) collision avoidance specification. The proposed decentralized supervisory control algorithm is also verified through a hardware‐in‐the‐loop simulator for the formation control of unmanned helicopters.

Karimoddini, Ali↗

Deep Multi-Agent Reinforcement Learning for Real-World Signalized Traffic Corridor Control

Signalized traffic control problem has been addressed recently with deep Reinforcement Learning (RL) approaches involving diverse state, action, and reward structures. While significant progress has been noted in the literature, open challenges still remain in the areas of adaptive signal phase timing, coordination in a multi-intersection corridor setting, and consideration of real-world traffic conditions. In the context of deep RL-based problem framing, extensions are needed that enable adaptive signal phase timings in an intersection agent's action space, computationally efficient information sharing among neighboring signalized intersection agents along a corridor, and experimentation in realistic simulation environments. In this paper, we develop a deep Advantage Actor Critic (A2C) multi-agent RL (MARL) approach capturing the research extensions above and apply it within a real-world calibrated Aimsun Next traffic corridor simulation model based on traffic data from the City of Coral Gables, Florida. For a multi-intersection corridor control setting, our numerical simulation experiments with a decentralized A2C MARL algorithm applied at different time periods led to a total average corridor travel delay reduction (expressed in seconds/mile averaged over vehicles) from 4.9% to 19.9% compared to state-of-the-art actuated control.

Shuvo, Salman S. [BATTELLE (PACIFIC NW LAB)]↗

Decentralized Signal Processing and Distributed Control of Collaborative Autonomous Networks (17-ERD-101 LDRD Final Report)

Intelligent autonomous sensor networks, often comprised of large numbers of sensors, must be capable of jointly exploiting data collected at each agent in the network, and using that data to optimize their future actions towards multiple mission objectives. Centralized signal processing and optimization solutions process all data and determine all future actions at a single agent, and the resulting information and commands are disseminated back to the network. The communications bandwidth this requires and the single point of failure the central agent represents often make these solutions untenable for national security applications. In this project, several fundamental algorithms for solving both the decentralized signal processing and network optimization were developed, as well as simulation software to validate the results of these algorithms at scale. Specifically, novel algorithms for Bayesian decentralized estimation and decentralized detection and optimization based on the alternating direction method of multipliers (ADMM) were developed for autonomous sensor networks and published in the literature. The first large scale simulation of autonomous sensor networks (1000 agents) was conducted on this project, validating the performance of the developed algorithms. These algorithms and simulation tools are critical components of any decentralized autonomous network and have current and future national security applications, including distributed sensor networks for detection, estimation, and tracking problems, and large decentralized cyber-physical infrastructure such as the power grid.

42 ENGINEERING↗

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗

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↗

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

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for 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 hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗