SEARCH · Search NASA
Results for “distributed optimization”
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.
Optimal Distribution System Voltage Regulation using State Estimation and DER Grid-Support Functions
Increasing solar energy penetrations may create challenges for distribution system operations because production variability can lead to large voltage deviations or protection system miscoordination. Instituting advanced management systems on distribution systems is one promising method for combating these challenges by intelligently controlling distribution assets to regulate voltage and ensure protection safety margins. While it is generally not the case today, greater deployment of power system sensors and interoperable distributed energy resources (DER)e.g., photovoltaic (PV) inverters, energy storage systems (ESS), electric vehicles (EVs)will enable situational awareness, control, and optimization of distribution systems. In this work, a control system was created which measures power system parameters to estimate the status of a feeder, forecasts the distribution state over a short-term horizon, and issues optimal set point commands to distribution-connected equipment to regulate voltage and protect the system. This two-year project integrated multiple research innovations into a management system designed to safely allow PV penetrations of 50% or greater. The integrated software was demonstrated through extensive real-time (RT) and power hardware-in-the-loop studies and a field demonstration on a live power system with a 684 kVA PV system.
Distributed Optimization
We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.
DistOPF: Advanced Solutions for Distribution Optimal Power Flow Analysis - DistOPF v0.2 Documentation
To achieve an affordable and reliable energy system, research on power distribution system is often focused on integration of distributed generators, energy storage solution, EV charging, smart meters, and other advanced assets that may benefit from or require more advanced control and optimization techniques. Despite this focus on advanced distribution system topics, early researchers and grid scientists often start from scratch when developing optimization programs for power distribution systems. This report introduces DistOPF, a Python package that consolidates years of research into a versatile and modular tool. DistOPF provides researchers with essential capabilities to solve distribution system Optimal Power Flow (OPF) problems using standard network models. Additionally, it offers a platform to benchmark both new and existing algorithms against established test systems.
Distributed optimization for multi-commodity urban traffic control
A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.
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.
Assessing uncertainty in the timing of energy use during cost-optimal distributed energy technology selection and sizing
This paper empirically derives uncertainty ranges in cost-optimal solar PV and storage sizing by comparing results from the REopt Lite optimization platform from metered data and a set of simulated Department of Energy Commercial Reference Building (CRB) profiles at 65 sites. We find load profile shape alone does not explain a site’s optimal configurations (i.e., PV, Storage, PV and Storage, No System). Still, load profile shape does introduce uncertainty to optimal PV and storage capacities. Across all cases where PV is part of an optimal configuration, we find the average ratio of power capacities derived from metered loads to capacities derived from CRB profiles to be 0.97 (and as high as 1463), where 1 would be a perfect match in system size. For storage, the ratio is 1.6 (and as high as 42). We also assess how, in the absence of complete metered data, a CRB profile can be selected that would be expected to yield the most similar solar PV and storage capacities. From those metrics that can be available from billing data (i.e., peak demand, monthly load totals), we find that uncertainty is most reduced by selecting the CRB’s with an annual peak occurring at the most similar time, or those with the lowest average root mean square error (RMSE) among monthly peak loads. This research can help improve the implementation and interpretation of results derived from simulated load profiles and is an important next step in advancing smart grid solutions.
Extended convex hull-based distributed optimal energy flow of integrated electricity-gas systems
Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy between different agencies. This paper proposes an extended convex hull based method to address optimal energy flow problems for the integrated electricity and gas systems in a distributed manner. First, a multi-block electricity-gas system model is constructed by dividing the whole system into N blocks considering both physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with the extended convex hull-based constraints. The Jacobi-Proximal alternating direction method of multipliers algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified model is checked, and a sufficient condition is developed. If the sufficient condition is satisfied, the optimal solution for the original nonconvex problem can be recovered from that for the convexified problem. Simulation results demonstrate that the proposed method is tractable and effective in obtaining feasible optimal solutions for multi-block optimal energy flow problems.
Computation-Efficient Algorithm for Distributed Feedback Optimization of Distribution Grids
Feedback-based optimization algorithms use real-time measurements to update the optimal control for the underlying system which may not be fully identified. Recently, we have developed a distributed feedback-based algorithm [1] that avoids the requirement of fast communication between central computing and local actuator/sensor agents. This paper extends the work by greatly reducing the number of copies of variables involved in the distributed feedback-based algorithm, which results in faster convergence and lower communication requirement. The main idea is to leverage the specific structural properties of the admittance matrix for distribution systems with tree network topology. We also show the effectiveness of the proposed algorithm in simulations.
Comparison of joint space versus task force load distribution optimization for a multiarm manipulator system
It is often proposed that the redundancy in choosing a force distribution for multiple arms grasping a single object should be handled by minimizing a quadratic performance index. The performance index may be formulated in terms of joint torques or in terms of the Cartesian space force/torque applied to the body by the grippers. The former seeks to minimize power consumption while the latter minimizes body stresses. Because the cost functions are related to each other by a joint angle dependent transformation on the weight matrix, it might be argued that either method tends to reduce power consumption, but clearly the joint space minimization is optimal. A comparison of these two options is presented with consideration given to computational cost and power consumption. Simulation results using a two arm robot system are presented to show the savings realized by employing the joint space optimization. These savings are offset by additional complexity, computation time and in some cases processor power consumption.
DaYu: Optimizing Distributed Scientific Workflows by Decoding Dataflow Semantics and Dynamics
The combination of ever-growing scientific datasets and distributed workflow complexity creates I/O performance bottlenecks due to data volume, velocity, and variety. Although the increasing use of descriptive data formats (e.g., HDF5, netCDF) helps organize these datasets, it also creates obscure bottlenecks due to the need to translate high level operations into file addresses and then into low-level I/O operations. To address this challenge, we introduce DaYu, a method and toolset for analyzing (a) semantic relationships between logical datasets and file addresses, (b) how dataset operations translate into I/O, and (c) the combination across entire workflows. DaYu's analysis and visualization enables identification of critical bottlenecks and reasoning about remediation. We describe our methodology and propose optimization guidelines. Evaluation on scientific workflows demonstrates up to 3.7x performance improvements in I/O time for obscure bottlenecks. The time and storage overhead for DaYu's time-ordered data is typically under 0.2% of runtime and 0.25% of data volume, respectively.
Distributed optimal power flow and the multi-agent system for the realization in cyber-physical system
Not Available
A Proximal Atomic Coordination Algorithm for Distributed Optimization
Not provided.
A Distributed-Optimization-Based Architecture for Management of Interconnected Energy Hubs
Not provided.
Least-cost Optimal Distribution Grid Expansion (LODGE) v1
LODGE finds the least-cost portfolio of traditional distribution system upgrades to integrate new loads and behind-the-meter DERs in combination with advanced non-wire alternative (NWA) planning solutions, such as utility-owned storage and distributed PV. Working with a set of least-cost solutions per feeder/substation allows us to benchmark and compare techno-economic performance of different traditional and NWA planning solutions. An important aspect of the LODGE model is that it includes power flow operation constraints. This means that the least-cost planning solutions delivered by LODGE are technically feasible. Available projects in LODGE portfolio include: 1) feeder reconductoring; 2) transformers upgrades; 3) non-wire alternatives, such as strategic siting and sizing of storage and distributed PV; 4) voltage regulators.
Optimizing Distributed Energy Storage Sizing in Puerto Rico: Leveraging Increased Distributed Generation for Enhanced Resilience
Distributed solar photovoltaic (PV) and battery energy storage systems (BESS) adoption has increased rapidly in Puerto Rico since Hurricane Maria in 2017 as customers seek local resilient energy solutions. To investigate how to best leverage these many distributed PV and BESS systems, in this paper, we introduce a modeling framework that can be used by entities planning resilience investments to provide insights about the sizing and operational needs to achieve desired resilience benefits.
Optimizing Distributed Training on Frontier for Large Language Models
Large language models (LLMs) have demonstrated remarkable success as foundational models, benefiting various downstream applications through fine-tuning. Loss scaling studies have demonstrated the superior performance of larger LLMs compared to their smaller counterparts. Nevertheless, training LLMs with billions of parameters poses significant challenges and requires considerable computational resources. For example, training a one trillion parameter GPT-style model on 20 trillion tokens requires a staggering 120 million exaflops. This research explores efficient distributed training strategies to extract this computation from Frontier, the world's first exascale supercomputer. We enable and investigate various model and data parallel training techniques, such as tensor parallelism, pipeline parallelism, and sharded data parallelism, to facilitate training a trillion-parameter model on Frontier. We empirically assess these techniques and their associated parameters to determine their impact on memory footprint, communication latency, and GPU's computational efficiency. We analyze the complex interplay among these techniques and find a strategy to combine them to achieve high throughput through hyperparameter tuning. We have identified efficient strategies for training large LLMs of varying sizes through empirical analysis and hyperparameter tuning. For 22 Billion, 175 Billion, and 1 Trillion parameters, we achieved GPU throughputs of 38.38%, 36.14%, and 31.96%, respectively. For the training of the 175 Billion parameter model and the 1 Trillion parameter model, we achieved 100% weak scaling efficiency on 1024 and 3072 Mi250X GPUs, respectively. We also achieved strong scaling efficiencies of 89% and 87% for these two models. We trained these models only tens of iterations instead of training till completion.