skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.


Title: Voltage Collapse Stabilization in Star DC Networks
Voltage collapse is a type of blackout-inducing dynamic instability that occurs when the power demand exceeds the maximum power that can be transferred through the network. The traditional (preventive) approach to avoid voltage collapse is based on ensuring that the network never reaches its maximum capacity. However, such an approach leads to inefficiencies as it prevents operators to fully utilize the network resources and does not account for unprescribed events. To overcome this limitation, this paper seeks to initiate the study of voltage collapse stabilization. More precisely, for a DC star network, we formulate the problem of voltage stability as a dynamic problem where each load seeks to achieve a constant power consumption by updating its conductance as the voltage changes. We show that such a system can be interpreted as a game, where each player (load) seeks to myopically maximize their utility using a gradient-based response. Using this framework, we show that voltage collapse is the unique Nash Equilibrium of the induced game and is caused by the lack of cooperation between loads. Finally, we propose a Voltage Collapse Stabilizer (VCS) controller that uses (flexible) loads that are willing to cooperate and provides a fair allocation of the curtailed demand. Our solution stabilizes voltage collapse even in the presence of non-cooperative loads. Numerical simulations validate several features of our controllers.  more » « less
Award ID(s):
1711188 1736448 1752362 1544771
NSF-PAR ID:
10106065
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
American Control Conference
Page Range / eLocation ID:
1957 to 1964
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We present a feasibility analysis of the controlled delivery power grid (CDG) that uses aggregated power request by users to reduce communications overhead. The CDG, as an approach to the power grid, uses a data network to communicate requests and grants of power in the distribution of electrical power. These requests and grants allow the energy supplier know the power demand in advance and to designate the loads and the time when power is supplied to them. Each load is assigned a power-network address that is used for communication of requests and grants with the energy supplier. With addressed loads, power is only delivered to selected loads. However, issuing a request for power before delivery takes place requires knowing the demand of power the load consumes during the operation interval. However, it is a general concern that having issuing requests in a time-slot basis may risk request losses and therefore, generate intermittent supply. Therefore, we propose request aggregation to minimize the number of requests issued. We show by simulation that the CDG with request aggregation attains high performance, in terms of satisfaction ratio and waiting time for power supply. 
    more » « less
  2. We present experiments with combined reactive and resistive loads on a testbed based on the Controlled-Delivery power Grid (CDG) concept. The CDG is a novel data-based paradigm for distribution of energy in smart cities and smart buildings. This approach to the power grid distributes controlled amounts of power of loads following a request-grant protocol performed through a parallel data network. This network is used as a data plane that notifies the energy supplier about requests and inform loads of the amount of granted power. The energy supplier decides the load, amount, and the time power is granted. Each load is associated with a network address, which is used at the time when power is requested and granted. In this way, power is only delivered to selected loads. Knowing the amount of power being supplied in the CDG requires knowing the precise amount of power demand before this is requested. While the concept works well for an array of resistive loads, it is unclear how to apply it to reactive loads, such as motors, whose power consumption varies over time. Therefore, in this paper, we implement a testbed with multiple loads, two light bulbs as resistive loads and an electrical motor as a reactive load. We then propose to use power profiles for the adoption of the request-grant protocol in the CDG concept. We adopt the use of power profiles to leverage the generation of power requests and evaluate the efficiency of the request-grant protocol on the amount of supplied power. In addition, the deviation of delivered power in the data and power planes is evaluated and results show that the digitized power profile of the reactive loads enables the issuing of power requests for such loads with high accuracy. 
    more » « less
  3. With the increase of uncertain and intermittent renewable energy supply on the grid, the power system has become more vulnerable to instability. In this paper, we develop a demand response strategy to improve power system small-signal stability. We pose the problem as an optimization problem wherein the total demand-responsive load is held constant at each time instance but shifted between different buses to improve small-signal stability, which is measured by small-signal stability metrics that are functions of subsets of the system’s eigenvalues, such as the smallest damping ratio. To solve the problem, we use iterative linear programming and generalized eigenvalue sensitivities. We demonstrate the approach via a case study that uses the IEEE 14-bus system. Our results show that shifting the load between buses, can improve a small-signal stability margin. We explore the use of models of different fidelity and find that it is important to include models of the automatic voltage regulators and power system stabilizers. In addition, we show that load shifting can achieve similar improvements to generation shifting and better improvement than simply tuning power system stabilizers. 
    more » « less
  4. This paper focuses on optimizing resource allocation amongst a set of tenants, network slices, supporting dynamic customer loads over a set of distributed resources, e.g., base stations. The aim is to reap the benefits of statistical multiplexing resulting from flexible sharing of ‘pooled’ resources, while enabling tenants to differentiate and protect their performance from one another’s load fluctuations. To that end we consider a setting where resources are grouped into Virtual Resource Pools (VRPs) wherein resource allocation is jointly and dynam- ically managed. Specifically for each VRP we adopt a Share- Constrained Proportionally Fair (SCPF) allocation scheme where each tenant is allocated a fixed share (budget). This budget is to be distributed equally amongst its active customers which in turn are granted fractions of their associated VRP resources in proportion to customer shares. For a VRP with a single resource, this translates to the well known Generalized Processor Sharing (GPS) policy. For VRPs with multiple resources SCPF provides a flexible means to achieve load elastic allocations across tenants sharing the pool. Given tenants’ per resource shares and expected loads, this paper formulates the problem of determining optimal VRP partitions which maximize the overall expected shared weighted utility while ensuring protection guarantees. For a high load/capacity setting we exhibit this network utility function explicitly, quantifying the benefits and penalties of any VRP partition, in terms of network slices’ ability to achieve performance differentiation, load balancing, and statistical multiplexing. Although the problem is shown to be NP-Hard, a simple greedy heuristic is shown to be effective. Analysis and simulations confirm that the selection of optimal VRP partitions provide a practical avenue towards improving network utility in network slicing scenarios with dynamic loads. 
    more » « less
  5. We have all heard that there is growing need to secure resources to obtain supply-demand balance in a power grid facing increasing volatility from renewable sources of energy. There are mandates for utility scale battery systems in regions all over the world, and there is a growing science of “demand dispatch” to obtain virtual energy storage from flexible electric loads such as water heaters, air conditioning, and pumps for irrigation. The question addressed in this tutorial is how to manage a large number of assets for balancing the grid. The focus is on variants of the economic dispatch problem, which may be regarded as the “feed-forward” component in an overall control architecture. 1) The resource allocation problem is identical to a finite horizon optimal control problem with degenerate cost—so called “cheap control”. This implies a form of state space collapse, whose form is identified: the marginal cost for each load class evolves in a two-dimensional subspace, spanned by a scalar co-state process and its derivative. 2) The implication to distributed control is remarkable. Once the co-state process is synthesized, this common signal may be broadcast to each asset for optimal control. However, the optimal solution is extremely fragile, in a sense made clear through results from numerical studies. 3) Several remedies are proposed to address fragility. One is described through “robust training” in a particular Q-learning architecture (one approach to reinforcement learning). In numerical studies it is found that specialized training leads to more robust control solutions. 
    more » « less