On the impact of different voltage unbalance metrics in distribution system optimization
Not Available
Girigoudar, Kshitij↗
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.
Distributed Bayesian optimization of deep reinforcement learning algorithms
Not Available
97 MATHEMATICS AND COMPUTING↗
Scalable AI-assisted workflow management for detector design optimization using distributed computing
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
Distribution Grid Optimal Power Flow (D-OPF): Modeling, Analysis, and Benchmarking
Not provided.
Engineering↗
Distributed Asynchronous Optimization Methods in Skywing
Explore the source record for details and available documents.
Mathematics and Computing↗
Real time feedback-based optimization of distributed energy resources
An example device includes a processor configured to receive a plurality of voltage values corresponding to voltage nodes in a first portion of a power system and determine, for each voltage node, a respective value of first and second voltage-constraint coefficients. The processor is also configured to receive a power value corresponding to a connection point of the first portion of the power system with a second portion of the power system and determine for the connection point, a respective value of first and second power-constraint coefficients. The processor is also configured to cause at least one energy resource connected to the first portion of the power system to modify an output power of the at least one energy resource based on the value of the first and second voltage-constraint coefficients for each voltage node and the value of the first and second power-constraint coefficients.
24 POWER TRANSMISSION AND DISTRIBUTION↗
An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems
Explore the source record for details and available documents.
Mathematics and Computing↗
Real time feedback-based optimization of distributed energy resources
An example device includes a processor configured to receive a plurality of voltage values representing respective voltage magnitudes at voltage nodes in a first portion of a power system and determine, for each voltage node, a respective value of first and second voltage-constraint coefficients. The processor is also configured to receive a power value corresponding to a connection point of the first portion of the power system with a second portion of the power system and determine for the connection point, a respective value of first and second power-constraint coefficients. The processor is also configured to cause at least one energy resource connected to the first portion of the power system to modify an output power of the at least one energy resource based on the value of the first and second voltage-constraint coefficients for each voltage node and the value of the first and second power-constraint coefficients.
Dall'Anese, Emiliano↗
Real time feedback-based optimization of distributed energy resources
An example device includes a processor configured to receive a plurality of voltage values representing respective voltage magnitudes at voltage nodes in a first portion of a power system and determine, for each voltage node, a respective value of first and second voltage-constraint coefficients. The processor is also configured to receive a power value corresponding to a connection point of the first portion of the power system with a second portion of the power system and determine for the connection point, a respective value of first and second power-constraint coefficients. The processor is also configured to cause at least one energy resource connected to the first portion of the power system to modify an output power of the at least one energy resource based on the value of the first and second voltage-constraint coefficients for each voltage node and the value of the first and second power-constraint coefficients.
Dall'Anese, Emiliano↗
Adaptive, Distributed Control of Constrained Multi-Agent Systems
Product Distribution (PO) theory was recently developed as a broad framework for analyzing and optimizing distributed systems. Here we demonstrate its use for adaptive distributed control of Multi-Agent Systems (MASS), i.e., for distributed stochastic optimization using MAS s. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (Probability dist&&on on the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. One common way to find that equilibrium is to have each agent run a Reinforcement Learning (E) algorithm. PD theory reveals this to be a particular type of search algorithm for minimizing the Lagrangian. Typically that algorithm i s quite inefficient. A more principled alternative is to use a variant of Newton's method to minimize the Lagrangian. Here we compare this alternative to RL-based search in three sets of computer experiments. These are the N Queen s problem and bin-packing problem from the optimization literature, and the Bar problem from the distributed RL literature. Our results confirm that the PD-theory-based approach outperforms the RL-based scheme in all three domains.
Bieniawski, Stefan↗
Applications of the theory of optimal control of distributed-parameter systems to structural optimization
An extension of classical methods of optimal control theory for systems described by ordinary differential equations to distributed-parameter systems described by partial differential equations is presented. An application is given involving the minimum-mass design of a simply-supported shear plate with a fixed fundamental frequency of vibration. An optimal plate thickness distribution in analytical form is found. The case of a minimum-mass design of an elastic sandwich plate whose fundamental frequency of free vibration is fixed. Under the most general conditions, the optimization problem reduces to the solution of two simultaneous partial differential equations involving the optimal thickness distribution and the modal displacement. One equation is the uniform energy distribution expression which was found by Ashley and McIntosh for the optimal design of one-dimensional structures with frequency constraints, and by Prager and Taylor for various design criteria in one and two dimensions. The second equation requires dynamic equilibrium at the preassigned vibration frequency.
Armand, J. P.↗
Cooperative fault management for resilient integration of renewable energy
Cooperative fault management (CFM) is designed herein to control different types of renewable energy resources cooperatively during electrical faults. This paper studies systems with a high penetration of photovoltaic (PV) energy and wind energy. First, CFM leverages power converters of PV farms to boost the ride-through capability of nearby doubly-fed induction generators (DFIGs). By controlling PV farms’ output voltages to change smoothly during both fault initiation and fault clearance, the widely used crowbar in DFIGs is less likely to be activated. Crowbar activation adversely makes DFIGs lose controllability and absorb reactive power. The second contribution is the development of a software-defined CFM controller and a controller in-the-loop demonstration of the real-time performance of this optimization-based CFM. CFM capitalizes on distributed optimization formulation to enable flexibility, plug-and-play, and privacy-preserving. Computation time, however, is a major concern for optimization-based dynamics control. Here, real-time controller-in-the-loop simulation results show optimization-based CFM can output reference values around 60 ms and is quick enough for dynamic control.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation
The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Distribution Grid Impacts of Community Solar [Slides]
Community solar (CS) projects often face uncertain interconnection costs and fees associated with distribution grid infrastructure upgrades required to connect the project. These costs can determine the economic viability of a CS project, but they are difficult to assess. Cost uncertainty can discourage new projects and prevent communities from accessing the benefits of community solar projects. At the same time, CS deployment strategies hold potential to defer or avoid some distribution costs due to new loads. To mitigate CS interconnection costs, it is important to find least-cost combinations of distribution system infrastructure solutions (transformer upgrades, reconductoring, voltage regulators, storage), and to understand how location of CS projects within a feeder impact distribution grid upgrade costs. This study aims to quantify CS impacts on the distribution grid and provide policy and regulatory insights and CS deployment strategies to address them. It is the first analysis that has systematically studied the technical impacts of community solar projects on a wide range of distribution feeders using state-of-the-art optimization and power flow tools. The analysis employs Berkeley Lab’s novel Least-cost Optimal Distribution Grid Expansion (LODGE) model, a deterministic version of the REPAIR model, that optimally upgrades hundreds or even thousands of distribution circuits or feeders. This is the first application of the LODGE model. LODGE finds the least-cost portfolio of traditional distribution system upgrades to integrate CS in combination with alternative solutions, such as utility-owned storage and downsizing CS capacity. Working with a set of least-cost solutions per feeder allows us to benchmark, compare and find techno-economic trends in CS interconnection.
14 SOLAR ENERGY↗
Equity-driven Planning of Distributed Solar PV using Optimal Transport
Typically, distribution system planning processes do not explicitly incorporate energy equity considerations, such as identifying consumers most affected by energy costs and determining how investments in the distribution system can address existing energy burden imbalances. This paper proposes a novel optimal transport (OT)-based method to improve the energy burden distribution of consumers. The approach involves the strategic siting and sizing of solar PV in order to assist customers with high energy burden and improve the overall energy burden distribution of the community. The desired energy burden distribution is defined using the equal distribution equivalent (EDE) concept. The OT-based method is then used to estimate the distributed solar PV capacity to be installed at various locations and the tariffs to be adjusted, all while improving the energy burden distribution and providing valuable insights into distributed generation (DG) planning. The results on IEEE 37 bus test system demonstrate how DG planning, considering EDE and OT, can help reduce the energy burden of low-income consumers. Additionally, the approach also reveals optimal tariff adjustments needed to ensure revenue neutrality for distribution utilities.
Optimal transport, equal distribution equivalent, ↗
Scalable flexibility control of distributed loads in a power grid
The technology described herein is generally directed towards a distributed optimization technology for the control of aggregation of distributed flexibility resource nodes that operates iteratively until a commanded power profile is produced by aggregated loads. The technology uses a distributed iterative solution in which each node solves a local optimization problem with local constraints and states, while using a global Lagrange multiplier that is based upon information from each other node. The global Lagrange multiplier is determined at an aggregation level using load-specific information that is obtained in a condensed form (e.g., a scalar) from each node at each iteration. The global Lagrange multiplier is broadcasted to the nodes for each new iteration. The technology provides an iterative, distributed solution to the network optimization problem of power tracking of aggregated loads.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
Efficient and choreographed quality-of- service management in dense 6G verticals with high-speed mobility requirements
Future 6G networks are envisioned to support very heterogeneous and extreme applications (known as verticals). Some examples are further-enhanced mobile broadband communications, where bitrates could go above one terabit per second, or extremely reliable and low-latency communications, whose end-to-end delay must be below one hundred microseconds. To achieve that ultra-high Quality-of-Service, 6G networks are commonly provided with redundant resources and intelligent management mechanisms to ensure that all devices get the expected performance. But this approach is not feasible or scalable for all verticals. Specifically, in 6G scenarios, mobile devices are expected to have speeds greater than 500 kilometers per hour, and device density will exceed ten million devices per square kilometer. In those verticals, resources cannot be redundant as, because of such a huge number of devices, Quality-of-Service requirements are pushing the effective performance of technologies at physical level. And, on the other hand, high-speed mobility prevents intelligent mechanisms to be useful, as devices move around and evolve faster than the usual convergence time of those intelligent solutions. New technologies are needed to fill this unexplored gap. Therefore, in this paper we propose a choreographed Quality-of-Service management solution, where 6G base stations predict the evolution of verticals at real-time, and run a lightweight distributed optimization algorithm in advance, so they can manage the resource consumption and ensure all devices get the required Quality-of-Service. Prediction mechanism includes mobility models (Markov, Bayesian, etc.) and models for time-variant communication channels. Besides, a traffic prediction solution is also considered to explore the achieved Quality-of-Service in advance. The optimization algorithm calculates an efficient resource distribution according to the predicted future vertical situation, so devices achieve the expected Quality-of-Service according to the proposed traffic models. An experimental validation based on simulation tools is also provided. Results show that the proposed approach reduces up to 12% of the network resource consumption for a given Quality-of-Service.
42 ENGINEERING↗