REAL TIME VOLTAGE REGULATION THROUGH GATHER AND BROADCAST TECHNIQUES
20170214244 ยท 2017-07-27
Inventors
- Emiliano Dall'Anese (Arvada, CO)
- Andrea Simonetto (Louvain-la-Neuve, BE)
- Sairaj Dhople (Minneapolis, MN)
Cpc classification
Y04S10/14
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H02J3/06
ELECTRICITY
Y02E10/56
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02E40/30
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02E40/70
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H02J2300/20
ELECTRICITY
Y04S10/12
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y04S20/222
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02E60/00
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y04S10/123
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y04S10/00
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H02J3/32
ELECTRICITY
Y02B70/30
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02B70/3225
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02E10/76
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y04S10/22
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H02J13/00016
ELECTRICITY
Y04S20/221
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H02J2300/40
ELECTRICITY
Y04S40/124
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
International classification
H02J3/38
ELECTRICITY
Abstract
An example device includes a processor configured to receive a plurality of voltage measurements corresponding to nodes in a distribution network, and determine, for each respective node: a value of a first coefficient, based on a previous value of the first coefficient, a minimum voltage value for the node, and a voltage measurement that corresponds to the node, and a value of a second coefficient based on a previous value of the second coefficient, a maximum voltage value for the node, and the voltage measurement. The processor of the example device is also configured to cause an inverter-interfaced energy resource connected to the distribution network to modify its output power based on the value of the first coefficient for each node and the value of the second coefficient for each node.
Claims
1. A device comprising: at least one processor configured to: receive a plurality of voltage measurements, wherein voltage measurements in the plurality of voltage measurements correspond to respective nodes in a plurality of nodes of a distribution network; determine, for each respective node in the plurality of nodes: a respective value of a first voltage-constraint coefficient, based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and a respective voltage measurement in the plurality of voltage measurements that corresponds to the respective node; and a respective value of a second voltage-constraint coefficient based on a respective previous value of the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement; and cause at least one inverter-interfaced energy resource in a plurality of inverter-interfaced energy resources that are connected to the distribution network to modify an output power of the at least one inverter-interfaced energy resource based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
2. The device of claim 1, wherein the at least one processor is configured to cause the at least one inverter-interfaced energy resource to modify the output power by outputting, to the at least one inverter-interfaced energy resource, the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
3. The device of claim 1, wherein: the at least one processor is configured to determine the respective value of the first voltage-constraint coefficient by: determining, based on the respective previous value of the first voltage-constraint coefficient, the respective minimum voltage value for the respective node, and the respective voltage measurement, a respective first coefficient offset value; scaling the respective first coefficient offset value by a step size to determine a respective scaled first coefficient offset value; responsive to determining that a respective first sum of the respective previous value of the first voltage-constraint coefficient and the respective scaled first coefficient offset value is greater than zero, setting the respective value of the first voltage-constraint coefficient to be the respective first sum; and responsive to determining that the respective first sum is less than or equal to zero, setting the respective value of the first voltage-constraint coefficient to be zero, and the at least one processor is configured to determine the respective value of the second voltage-constraint coefficient by: determining, based on the respective previous value of the second voltage-constraint coefficient, the respective maximum voltage value for the respective node, and the respective voltage measurement, a respective second coefficient offset value; scaling the respective second coefficient offset value by the step size to determine a respective scaled second coefficient offset value; responsive to determining that a respective second sum of the respective previous value of the second voltage-constraint coefficient and the respective scaled second coefficient offset value is greater than zero, setting the respective value of the second voltage-constraint coefficient to be the respective second sum; and responsive to determining that the respective second sum is less than or equal to zero, setting the respective value of the second voltage-constraint coefficient to be zero.
4. The device of claim 3, wherein: the at least one processor is configured to determine the respective first coefficient offset value by: determining a respective first difference value that represents a difference between the respective minimum voltage value and the respective voltage measurement; and determining, as the respective first coefficient offset value, a difference between the respective first difference value and a version of the respective previous value of the first voltage-constraint coefficient that is scaled by a utility-defined parameter, and the at least one processor is configured to determine the respective second coefficient offset value by: determining a respective second difference value that represents a difference between the respective voltage measurement and the respective maximum voltage value; and determining, as the respective second coefficient offset value, a difference between the respective third difference value and a version of the respective previous value of the second voltage-constraint coefficient that is scaled by the utility-defined parameter.
5. The device of claim 1, wherein: the at least one processor is configured to determine the respective value of the first voltage-constraint coefficient by calculating pro{.sub.n.sup.k+(V.sup.min
.sub.n.sup.k.sub.n.sup.k)}, wherein: .sub.n.sup.k represents the respective previous value of the first voltage-constraint coefficient, V.sup.min represents the respective minimum voltage value for the respective node,
.sub.n.sup.k represents the respective voltage measurement, represents a step size, and represents a predetermined parameter indicating an importance of previous voltage-constraint coefficient values, and the at least one processor is configured to determine the respective value of the second voltage-constraint coefficient by calculating pro
{.sub.n.sup.k+(
.sub.n.sup.kV.sup.max.sub.n.sup.k)}, wherein: .sub.n.sup.k represents the respective previous value of the second voltage-constraint coefficient, and V.sup.max represents the respective maximum voltage value for the respective node.
6. The device of claim 1, wherein the at least one processor is configured to cause the at least one inverter-interfaced energy resource to modify the output power by: determining, for the at least one inverter-interfaced energy resource, a respective power setpoint value, based on the respective value of the first voltage-constraint coefficient for each respective node, the respective value of the second voltage-constraint coefficient for each respective node, and a respective previous power setpoint value, and causing the at least one inverter-interfaced energy resource to modify the output power based on the respective power setpoint.
7. The device of claim 6, wherein the device comprises a power distribution network management system.
8. The device of claim 6, wherein the device comprises a respective power inverter communicatively coupled to the at least one inverter-interfaced energy resource.
9. A system comprising: a plurality of voltage measurement devices, each configured to: determine a respective voltage measurement that corresponds to a respective node in a plurality of nodes of a distribution network; and output the respective voltage measurement; a distribution network management system configured to: receive, from each of the plurality of voltage measurement devices, the respective voltage measurement; determine, for each respective node in the plurality of nodes: a respective value of a first voltage-constraint coefficient, based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and the respective voltage measurement; and a respective value of a second voltage-constraint coefficient based on a respective previous value of the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement; and output the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node; and a plurality of inverter-interfaced energy resource management devices corresponding to a plurality of inverter-interfaced energy resources that are connected to the distribution network, each inverter-interfaced energy resource management device being configured to: receive the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node; determine, based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node, a respective power setpoint value; and modify a respective output power of a respective inverter-interfaced energy resource from the plurality of inverter-interfaced energy resources, based on the respective power setpoint value.
10. The system of claim 9, wherein at least one of the plurality of inverter-interfaced energy resource management devices comprises a power inverter that couples a respective energy resource to the distribution network.
11. The system of claim 9, wherein at least one of the plurality of inverter-interfaced energy resource management devices comprises a computing device communicatively coupled to a power inverter that couples a respective energy resource to the distribution network.
12. The system of claim 9, wherein: at least one of the plurality of inverter-interfaced energy resource management devices is further configured to: determine an updated value of the respective voltage measurement that corresponds to a resource node, the resource node comprising the respective node at which the respective inverter-interfaced energy resource is connected to the distribution network; determine, based on the respective value of the first voltage-constraint coefficient for the resource node, the respective minimum voltage value for the resource node, and the updated value of the respective voltage measurement, an updated value of the first voltage-constraint coefficient for the resource node; determine, based on the respective value of the second voltage-constraint coefficient for the resource node, the respective maximum voltage value for the resource node, and the updated value of the respective voltage measurement, an updated value of the second voltage-constraint coefficient for the resource node; determine, based on the updated value of the first voltage-constraint coefficient for the resource node, the updated value of the second voltage-constraint coefficient for the resource node, the respective value of the first voltage-constraint coefficient for each respective node other than the resource node, and the respective value of the second voltage-constraint coefficient for each respective node other than the research node, an updated power setpoint value; and modify the respective output power of the respective inverter-interfaced energy resource based on the updated power setpoint value.
13. The system of claim 12, wherein: the plurality of inverter-interfaced energy resource management devices are configured to determine the respective power setpoint value based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node at a first frequency; and the at least one of the plurality of inverter-interfaced energy resource management devices is configured to determine the updated value of the respective voltage measurement that corresponds to the resource node at a second frequency that is smaller than the first frequency.
14. The system of claim 12, wherein the at least one of the plurality of inverter-interfaced energy resource management devices is configured to determine the updated value of the respective voltage measurement that corresponds to the resource node in response to determining that an updated respective value of the first voltage-constraint coefficient for each respective node and an updated respective value of the second voltage-constraint coefficient for each respective node have not been received within a threshold amount of time.
15. The system of claim 9, wherein determining the respective power setpoint value is further based on at least one respective performance metric determined by a respective administrator of the respective inverter-interfaced energy resource.
16. The system of claim 15, wherein the at least one respective performance metric comprises at least one of: a cost for ancillary service provisioning or feed-in tariffs.
17. The system of claim 9, wherein at least one of the plurality of inverter-interfaced energy resource management devices comprises one of the plurality of voltage measurement devices.
18. A method comprising: receiving, by a distribution network management system comprising at least one processor, a plurality of voltage measurements, wherein voltage measurements in the plurality of voltage measurements correspond to respective nodes in a plurality of nodes of a distribution network; determining, by the distribution network management system, for each respective node in the plurality of nodes: a respective value of a first voltage-constraint coefficient, based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and a respective voltage measurement in the plurality of voltage measurements that corresponds to the respective node; and a respective value of a second voltage-constraint coefficient based on a respective previous value of the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement; and causing at least one inverter-interfaced energy resource in a plurality of inverter-interfaced energy resources that are connected to the distribution network to modify an output power of the at least one inverter-interfaced energy resource based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
19. The method of claim 18, wherein causing the at least one inverter-interfaced energy resource to modify the output power comprises outputting, to the at least one inverter-interfaced energy resource, the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
20. The method of claim 18, wherein causing the at least one inverter-interfaced energy resource to modify the output power comprises: determining, for the at least one inverter-interfaced energy resource, a respective power setpoint value, based on the respective value of the first voltage-constraint coefficient for each respective node, the respective value of the second voltage-constraint coefficient for each respective node, and a respective previous power setpoint value; and causing the at least one inverter-interfaced energy resource to modify the output power based on the respective power setpoint.
Description
BRIEF DESCRIPTION OF DRAWINGS
[0008]
[0009]
[0010]
[0011]
[0012]
[0013]
[0014]
[0015]
[0016]
[0017]
[0018]
[0019]
[0020]
DETAILED DESCRIPTION
[0021] The present disclosure provides systems, devices, and methods for real-time (or near-real-time) voltage regulation of energy resources in a power distribution network via gather and broadcast techniques. The techniques described herein may be employed in the domain of operation and control of power distribution network systems having high integration of distributed energy resources (DERs). As one example, the devices of a power distribution network system may leverage the fast feedback abilities offered by power-electronics-interfaced DERs, such as renewable energy sources, to continuously drive the system operation towards AC optimal power flow (OPF) targets.
[0022] Related art works focused on addressing power-quality and reliability concerns related to power-electronics-interfaced DERs operating with business-as-usual practices have looked at the design of Volt/VAr, Volt/Watt, and droop-based control strategies to regulate output powers based on local measurements, so that terminal voltages are within acceptable levels. These strategies, however, may not guarantee system-level optimality, and the stability of a system employing such strategies is questionable. On a different time scale, centralized and distributed OPF-type algorithms have been developed for power distribution systems to compute optimal steady-state inverter setpoints.
[0023] Objectives of the OPF task at the distribution level include minimization of power losses and maximization of economic benefits to utilities and end-users. Typical constraints in the OPF task ensure that voltage magnitudes and currents are within predetermined bounds, and DER setpoints are within given operational and hardware limits. It is well-known that the OPF is nonconvex and NP-hard. Related art centralized approaches may utilize off-the-shelf solvers for nonlinear programs, or may leverage convex relaxation and approximation techniques to obtain convex surrogates. On the other hand, related art distributed solution approaches may leverage the decomposability of the Lagrangian associated with convex reformulations/approximations of the OPF, and utilize iterative primal-dual-type methods to decompose the solution of the OPF task across devices. OPF approaches may be applied to optimize the operation of power transmission networks, but the time required to collect all the problem inputs (e.g., loads across the network and available power-electronics-interfaced DER powers) and solve the OPF task may not be consistent with underlying distribution-systems dynamics.
[0024]
[0025] The systems and devices of the present disclosure bypass traditional hierarchical setups, where local feedback control and network optimization operate at distinct time scales, by employing distributed control techniques that leverage the opportunity for fast feedback offered by power-electronics-interfaced DERs and continuously drive the inverter output powers towards OPF-based targets. These targets capture well-defined performance objectives as well as voltage regulation constraints. The design of the control techniques described herein further develops linear approximations of the AC power-flow equations as described in S. Guggilam et al., Scalable optimization methods for distribution networks with high PV integration, IEEE Transactions on Smart Grid, 2015, submitted (hereinafter Guggilam) as well as the double-smoothing technique described in J. Koshal et al., Multiuser optimization: Distributed algorithms and error analysis, SIAM J. on Optimization, vol. 21, no. 3, pp. 1046-1081, 2011 (hereinafter Koshal) for time-invariant optimization and extended to the time-varying setup in A. Simonetto et al., Double smoothing for time-varying distributed multiuser optimization, IEEE Global Conf. on Signal and Information Processing, December 2014 (hereinafter Simonetto). The relevant content of each of Guggilam, Koshal, and Simonetto is incorporated herein by reference. By virtue of this technical approach, the systems, devices, and methods described herein may include elementary operations implementable, for instance, on low-cost microcontrollers that accompany power-electronics interfaces of gateways and DERs. Further, while pursuing OPF solutions, the techniques described herein may not require knowledge of loads at all the distribution transformers and points of interconnection of the power distribution network. The present disclosure also analytically establishes the convergence and OPF-target tracking capabilities of the described techniques.
[0026] The techniques described herein may considerably broaden related art approaches by focusing on AC OPF setups for power distribution network systems with arbitrary topologies, by using a new real-time online algorithm with embedded voltage measurements, and by establishing convergence and optimality in the case of time-varying loads and ambient conditions. The techniques of the present disclosure offer significant contribution over the state of the art by establishing convergence results for the case of time-varying loads and ambient conditions and enabling low complexity implementations.
[0027]
[0028] System 2 represents a simplified power distribution network system, and may, in some examples, include any number of additional ones of nodes 6 and/or energy resources 8. That is, while shown as having three nodes and three energy resources connected to three respective inverters, system 2 may include more or fewer nodes and/or energy resources in other examples. Additionally,
[0029] In the example of
[0030] Components of system 2 (e.g., nodes 6, distribution network management system 4, and/or inverters 10) may be configured to perform the methods described herein in an iterative fashion that allows system 2 to seek OPF targets in real-time or near-real-time. That is, the techniques described herein may be performed on a relatively fast time scale, thereby allowing more efficient operation while ensuring that physical constraints (e.g., line maximums, device safety standards, etc.) are maintained. For instance, the components of system 2 may perform operations every second, every millisecond, or at some other interval. In some examples, different components may perform operations at different intervals while in other examples, all components of system 2 may generally perform the operations described herein with the same frequency.
[0031] In the example of
[0032] In the example of
[0033] In some examples, distribution network management system 4 may represent a system owned and operated by a utility company. In other examples, distribution network management system 4 may be owned and/or operated by another entity. For instance, distribution network management system 4 may represent an access point of a power network of a business park or corporate campus. As another example, distribution network management system 4 may manage a micro-grid, such as may be employed on a military base, mobile hospital, or other small area in which electrical power may be desirable. In other words, distribution network management system 4 may represent any system configured to manage power distribution via a distribution network.
[0034] Distribution network management system 4 may be a computing device, such as a server computer, a desktop computer, or any other device capable of implementing some or all of the control techniques described herein. In some examples, distribution network management system 4 may represent a cloud computing environment. That is, while shown as a single box in the example of
[0035] Distribution network management system 4 may receive voltage measurements 12 and iteratively determine a set of voltage-constraint coefficient values (coefficient values 14). These coefficients are related to the extent of violation of defined voltage limits and are determined as further described herein. Distribution network management system 4 may determine two voltage-constraint coefficients for each of nodes 6 in the distribution network. Thus, in the simplified example of
[0036] For each of nodes 6, distribution network management system 4 may determine a first voltage-constraint coefficient value based on a previous value of the first voltage-constraint coefficient for the node, a minimum voltage value for the node, and the voltage measurement for the node. Thus, for node 6A, distribution network management system 4 may determine a first voltage-constraint coefficient value based on the previous first voltage-constraint coefficient value for node 6A, a minimum voltage value for node 6A, and voltage measurement 12A. Similarly, for each of nodes 6, distribution network management system 4 may determine a second voltage-constraint coefficient value based on a previous value of the first voltage-constraint coefficient, a maximum voltage value for the node, and the voltage measurement for the node. In some examples, the first and second voltage-constraint coefficient values for each node may be determined additionally or alternatively based on other criteria. Determination of values for the first and second voltage-constraint coefficients is further described with respect to
[0037] Inverters 10, in the example of
[0038] In the example of
[0039] Energy resources 8 may, in various examples, represent any device or system capable of generating electrical power that can be fed into a distribution network. In the example of
[0040] While certain operations are described in the example of
[0041] In some examples, one or more of inverters 10 may not receive coefficient values 14 in one or more iterations. This may be the case when, for instance, the communication network between distribution network management system 4 and one or more of inverters 10 is congested, inoperable, or otherwise constrained. In some such examples, if one of inverters 10 does not receive coefficient values 14, the inverter may generally rely on a previously received iteration of coefficient values 14 in conjunction with updated coefficient values for its node location. That is, if the inverter is able to measure the voltage at its location, the inverter may determine a first voltage-constraint coefficient value and second voltage-constraint coefficient value for its location, and update only these values in the previous iteration of coefficient values 14. Then the inverter may determine its setpoint values as previously described, but using the modified previous iteration of coefficient values 14.
[0042] By iteratively determining power setpoints, performance of power distribution system 2 may be closer to the OPF solution for the network without requiring complex or computationally powerful components. Additionally, by incorporating voltage measurements, the techniques described herein ensure that voltage limits are not violated. Furthermore, the distributed nature of the techniques performed by system 2 may allow for more flexibility should there be communications constraints, as further described herein. In addition, the techniques implemented in system 2 may seek OPF targets while taking into account the objectives of both utility operators and customers.
[0043] The mathematical development of the control techniques described herein is detailed below. Upper-case (lower-case) boldface letters will be used for matrices (column vectors); ().sup.T for transposition; ()* complex-conjugate; and, () .sup.H complex-conjugate transposition; {} and
{} denote the real and imaginary parts of a complex number, respectively; j:={square root over (1)} the imaginary unit; and || denotes the absolute value of a number or the cardinality of a set. For x
, function [x].sub.+ is defined as [x].sub.+:=max{0, x}. Further,
.sub.A(x) denotes the indicator function over the set A
; that is
.sub.A(x)=1 if xA and
.sub.A(x)=0 otherwise. For a given N1 vector x
.sup.N, x.sub.2:={square root over (v.sup.Hv)}; x.sub.1:=.sub.i|[x].sub.i|; and, diag(x) returns a NN matrix with the elements of v in its diagonal. Given a given matrix X
.sup.NM, x.sub.m,n denotes its (m, n)-th entry. .sub.x(x) returns the gradient vector of (x) with respect to x
.sup.N. Finally, I.sub.N denotes the N1 vector with all ones.
[0044] Consider a power distribution network comprising N+1 nodes collected in the set {0},
:={1, . . . , N}, and distribution lines represented by the set of edges :={(m, n)}(
{0})(
{0}). Assume that the temporal domain is discretized as t=k, where k
and >0 is a given interval, chosen to capture the variations on loads and ambient conditions (cf.
and I.sub.n.sup.k
denote the phasors for the line-to-ground voltage and the current injected at node n over the kth timeslot, respectively, and define the N-dimensional complex vectors v.sup.k:=[V.sub.1.sup.k, . . . , V.sub.N.sup.k].sup.T
.sup.N and i.sup.k:=[I.sub.1.sup.k, . . . , I.sub.N.sup.k].sup.T
.sup.N. Node 0 denotes the secondary of the distribution transformer, and it is taken to be the slack bus. Using Ohm's and Kirchhoff s circuit laws, the following linear relationship can be established:
where the system admittance matrix Y.sub.net.sup.k.sup.(N+1)(N+1) is formed based on the network topology and the -equivalent circuit of the distribution lines, and is partitioned in sub-matrices with the following dimensions: Y.sup.k
.sup.NN,
.sup.N1, and y.sub.00.sup.k
. More detailed teachings on distribution line modeling may be found in chapter 6 of W. H. Kersting, Distribution System Modeling and Analysis. 2nd ed., Boca Raton, Fla.: CRC Press, 2007 (hereinafter Kersting), which is incorporated herein by reference. Finally, V.sub.0.sup.k=.sub.0e.sup.j.sup.
at time k.
[0045] Power-electronics-interfaced DERs, such as photovoltaic (PV) systems, wind turbines, battery systems, or other energy resources are assumed to be located at nodes . For future developments, define
:=|
|. Given prevailing ambient conditions, let P.sub.aV,n.sup.k denote the maximum real power generation at node n
at time khereafter referred to as the available real power. For example, for a PV system, the available real power is a function of the incident irradiance, and corresponds to the maximum power point of the PV array. When DERs operate at unity power factor and inject, into the network, the whole available real power, a set of challenges related to power quality and reliability in distribution network systems may emerge for sufficiently high levels of deployed DER capacity. For instance, overvoltages may be experienced during periods when DER generation exceeds the demand, while fast-variations in the output of the DERs tend to propagate transients that lead to wear-out of legacy switchgear. Efforts to ensure reliable operation of existing distribution network systems with increased DER generation are generally focused on the possibility of inverters providing reactive power compensation and/or curtailing real power. Let P.sub.n.sup.k and Q.sub.n.sup.k denote the real and reactive powers at the AC side of inverter n
at time k. The set of possible inverter operating points for PV systems can be specified as:
(P.sub.n.sup.k, Q.sub.n.sup.k).sub.n.sup.k:={(P.sub.n, Q.sub.n): 0P.sub.nP.sub.aV,n.sup.k, (Q.sub.n).sup.2S.sub.n.sup.2(P.sub.n).sup.2}(2)
where S.sub.n is the rated apparent power. Lastly, the additional constraint |Q.sub.n|(tan )P.sub.n can be considered in the definition of .sub.n.sup.k to enforce a minimum power factor of cos . Parameter can be conveniently tuned to account for a variety of control strategies, including reactive power compensation, real power curtailment, and joint real and reactive control. Other examples of DERs that may exist on a power distribution network include small-scale diesel generators, fuel cells, and others. All such DERs can be accommodated in the framework described herein by properly capturing their physical limits in the set
.sub.n.sup.k.
[0046] The techniques described herein may allow DER control that regulates the output powers {P.sub.i.sup.k, Q.sub.i.sup.k at a time scale compatible with distribution network system dynamics, and that operates in a closed-loop fashion as:
[P.sub.i.sup.k,Q.sub.i.sup.k]=.sub.i(P.sub.i.sup.k1,Q.sub.i.sup.k1,y.sup.k),i
(3a)
{dot over (y)}(t)=(y,{P.sub.i.sup.k,Q.sub.i.sup.k})(3b)
y.sup.k=(y(t)),(3c)
where () models the physics of the distribution network systems (e.g., power flows) as well as the dynamics of primary-level inverter control devices, y(t) represents pertinent electrical quantities (e.g., voltages and power flows), and y.sup.k is a measurement of (some entries of) y(t) at time k. In the following, the control function
.sub.i() will be designed in a way that the energy resource power outputs will continuously pursue solutions of an OPF problem.
[0047] A prototypical AC OPF problem, which is utilized to optimize the operation of the distribution feeder at time k, can be formulated as follows:
where V.sup.min and V.sup.max are minimum and maximum, respectively, voltage service limits (e.g., ANSI C.84.1 limits), is a set of nodes strategically selected to enforce voltage regulation throughout the distribution network, .sub.i.sup.k(P.sub.i, Q.sub.i) is a time-varying function specifying performance objectives for the ith energy resource (e.g., cost of/reward for ancillary service provisioning, or feed-in tariffs), and h.sup.k({V.sub.i
captures system-level objectives (e.g., power losses and/or deviations from the nominal voltage profile). It is well-known that (4) is a nonconvex (in fact, NP-hard) nonlinear program. Related art centralized and distributed solution approaches may not be able to solve (OPF.sup.k) and dispatch setpoints fast enough to cope with fast changes in the demand and ambient conditions at the grid edge (see e.g.,
around outdated setpoints (leading to suboptimal operation and potential violations of voltage and security limits). This may be particularly relevant for distributed solution approaches, whereby the power commands are updated at a slow time scale, dictated by the convergence time of the distributed algorithm. In contrast, the objective of (3) is to update the power setpoints at a fast time scale (e.g., in real-time or near-real-time), and in a way that the inverter outputs are continuously regulated to a solution of (OPF.sup.k).
[0048] The techniques described herein provide one example of how to design the control function (3a). Firstly, a linear approximation of the power flow equations is utilized. One example method for obtaining a linear approximation is discussed in Guggilam and is briefly described herein. A similar approach is proposed in S. Dhople et al., Linear approximations to ac power flow in rectangular coordinates, Allerton Conference on Communication, Control, and Computing, in Press, 2015 (hereinafter Dhople), which is incorporated herein by reference. These approximations may be helpful in developing DER control that is low-complexity and fast acting. For notation simplicity in the following portion, the superscript .sup.k indexing the time instant k is dropped from all electrical and network quantities.
[0049] Let s:=[S.sub.1, . . . , S.sub.N].sup.N collect the net power injected at nodes
, where S.sub.i=P.sub.iP.sub.l,i+j(Q.sub.iQ.sub.l,i) for i
, and S.sub.i=P.sub.l,ijQ.sub.l,i for i
\
(cf. (4b)(4c)). Similarly, collect the voltage magnitudes {|V.sub.i|
in :=[|V.sub.1|, . . . , |V.sub.N|].sup.T
.sup.N. The objective is to obtain approximate power-flow relations whereby voltages are linearly related to injected powers s as
vHp+Jq+b(5a)
Rp+Bq+a,(5b)
where p:={s} and q:=
{s}. This way, the voltage constraints (4d) can be approximated as V.sup.min1.sub.NRp+Bq+aV.sup.max1.sub.N, while power-balance is intrinsically satisfied at all nodes; further, relevant electrical quantities of interest appearing in the function h.sup.k({V.sub.i
) in (4a), e.g., power losses, can be expressed as linear functions of p and q. What is more, by using (5a)-(5b), function h.sup.k({V.sub.i})hk can be re-expressed as
h.sub.i.sup.k(P.sub.iQ.sub.i). Following Guggilam and Dhople, the matrices R, B, H, J and the vectors a, b are obtained next.
[0050] To this end, (4b)-(4c) can be re-written in a compact form as
s=diag(v)i*=diag(v)(Y*v*+
and the AC power-flow equation can be linearized around a given voltage profile .sub.+.sup.N the magnitudes of voltages
.sup.N and
.sup.N collect elements {cos(
[0051] By replacing v with
e+e*=s+, (7)
where matrices and are given by :=diag(Y*
[0052] By using (8), it is apparent that =0.sub.NN and =0.sub.N, and therefore the linearized power-flow can be expressed as
diag(
A solution to (9) can be expressed as e=Y.sup.1 diag.sup.(
[0053] where Z.sub.R:={Y.sup.1} and Z.sub.I:=
{Y.sup.}, and setting H=
{e} serves as a first-order approximation to the voltage magnitudes across the power distribution network, and relationship (5a) can be obtained by setting R=
[0054] Computationally affordable DER control pursuing solutions to (4) may be developed beginning with the derivation of a convex surrogate for the target OPF problem by leveraging (5) and (10). Particularly, by using (5b), the voltage magnitude at node n and time k can be approximated as |V.sub.n.sup.k|
[r.sub.n,i.sup.k(P.sub.iP.sub.l,i.sup.k)+b.sub.n,i.sup.k(Q.sub.iQ.sub.l,i.sup.k)]+c.sub.n.sup.k, with c.sub.n.sup.k:=
(r.sub.n,i.sup.kP.sub.l,i.sup.k+b.sub.n,i.sup.kQ.sub.l,i.sup.k). It follows that problem (4) can be approximated as:
where u.sub.i:=[P.sub.i, Q.sup.i].sup.T, function
[0055] The sets .sub.i.sup.k, i
, are convex, closed, and bounded for all k0 (cf. (2)). For future developments, define the set
.sup.k:=
.sub.1.sup.k . . .
. Again, the 2M constraints (11), M:=|
|, are utilized to enforce voltage regulation (cf. (4d) and (5b)). Additional constraints can be considered in (OPF.sup.k) and (P1.sup.k), but this may not affect the design of the energy resource control techniques described herein.
[0056] Regarding (11), the following assumptions may be made.
[0057] Assumption 1. Functions .sub.i.sup.k(u.sub.i) and h.sub.i.sup.k (u.sub.i) are convex and continuously differentiable for each i and k0. Define further the gradient map:
f.sup.k(u):=[.sub.u1.sup.T(
)].sup.T.(13)
Then, it may be assumed that the gradient map .sup.k:.fwdarw.
is Lipschitz continuous with constant L over the compact set
.sup.k for all k0; that is, f.sup.k(u)f.sup.k(u).sub.2Luu.sub.2, u,u
.sup.k.
[0058] Assumption 2 (Slater's condition). For all k0, there exist a set of feasible power injections {.sub.i.sup.k.sup.k such that g.sub.n.sup.k({.sub.i
)<0 and
)<0, for all n
[0059] From the compactness of set .sup.k, and under Assumptions 1 and 2, problem (11) is convex and strong duality holds. Further, there exists an optimizer at each time k0, which will be hereafter denoted as {u.sub.i.sup.opt,k
. For future developments, let g.sup.k(u)
.sup.M and
.sup.M be a vector stacking all the functions g.sub.n.sup.k({u.sub.i
), n
and
), n
, respectively. Then, given that these functions are linear in u, it follows that there exists a constant G such that .sub.ug.sup.k(u).sub.2G and .sub.u
.sup.k for all k0.
[0060] The cost functions { are not required to be strongly convex. In contrast, the convergence properties of some related art distributed control schemes hinge on the strong convexity of the target cost functions. Lastly, in this case, Slater's condition is tantamount to saying that there exists at least one configuration of the inverter output powers so that voltages are strictly within limits V.sup.min and V.sup.max.
[0061] Let .sup.k(u.sup.k, . ) denote the Lagrangian function associated with problem (11), where :=[.sub.1, . . . , .sub.M].sup.T and :=[.sub.1, . . . , .sub.M].sup.T collect the Lagrange multipliers associated with (11b) and (11c), respectively. Further, let u:=[(u.sub.1).sup.T, . . . , (
).sup.T].sup.T for brevity. Upon rearranging terms, the Lagrangian function can be expressed as
where {hacek over (r)}.sub.i.sup.k:=[{r.sub.j,i.sup.k].sup.T and {hacek over (b)}.sub.i.sup.k:=[{b.sub.j,i.sup.k
].sup.T are M1 vectors collecting the entries of R.sup.k and B.sup.k in the ith column and rows corresponding to nodes in
, and c.sup.k:=[{c.sub.j.sup.k
].sup.T. From the compactness of {.sub.i.sup.k
and Slater's condition, it follows that the optimal dual variables live in a compact set. In lieu of
.sup.k(u.sup.k, , ), consider the following regularized Lagrangian function
[0062] where the constant >0 and >0 appearing in the Tikhonov regularization terms are design parameters. Function (15) is strictly convex in the variables u and strictly concave in the dual variables , . The upshot of (15) is that gradient-based approaches can be applied to (15) to find an approximate solution to (P1.sup.k) with improved convergence properties. Further, this may allow for dropping the strong convexity assumption on { and avoiding averaging of primal and dual variables. Accordingly, the following saddle-point problem may be formed:
denoting as {u.sub.i*.sup.,k, *.sup.,k, *.sup.,k the unique primal-dual optimizer of (15) at time k.
[0063] In general, the solutions of (11) and the regularized saddle-point problem (16) are expected to be different; however, the discrepancy between u.sub.i.sup.opt,k and u.sub.i*.sup.,k can be bounded as in Lemma 3.2 of Koshal, whereas bounds of the constraint violation are substantiated in Lemma 3.3 of Koshal. These bounds are proportional to {square root over ()}. Therefore, the smaller , the smaller is the discrepancy between u.sub.i.sup.opt,k and u.sub.i*.sup.,k.
[0064] As a result, the following primal-dual gradient method may be used to solve the time-varying saddle-point problem of (16):
.sub.i.sup.k+1=proj.sub.y.sub..sub.v,.sup.k(u,,)|.sub..sub.
(17a)
{tilde over ()}.sub.n.sup.k+1=pro{
(17b)
.sub.n.sup.k+1=pro{.sub.n.sup.k+(
(17c)
where >0 is the stepsize and proj.sub.y{u} denotes the projection of u onto the convex set ; particularly, pro
{u} =max{0,u}, whereas (17a) depends on the inverter operating region (cf. (2)) and can be computed in closed-form. For the time-invariant case (i.e.,
[0065] Assumption 3. There exists a constant 0 such that u*.sup.,k+1u*.sup.,k.sub.u for all k0.
[0066] Assumption 4. There exist constants .sub.d0 and .sub.and k0.
[0067] It can be shown that the conditions of Assumption 4 translate into bounds for the discrepancy between the optimal dual variables over two consecutive time instants. That is, *.sup.,k+1*.sup.,k.sub. and *.sup.,k+1*.sup.,k.sub. with and given by Prop. 1 of Simonetto. Upon defining z*.sup.,k:=[(u*.sup.,k).sup.T,(y*.sup.,k).sup.T,(*.sup.,k).sup.T].sup.T it also follows that z*.sup.,k+1z*.sup.,k.sub.z for a given .sub.z0. Under Assumptions 1-4, convergence of (17) are investigated in Theorem 1 of Simonetto.
[0068] Similar to some distributed optimization schemes, updating the power setpoints of DERs via (17) leads to a setup where the optimization algorithm is decoupled from the physical system, and the power setpoints are updated in an open-loop fashion. In some examples, a feedback control architecture may be used to enable adaptability to changing operating conditions. For instance, actionable feedback from the distribution network system may be incorporated in (17).
[0069] Let y.sub.n.sup.k denote a measurement of |V.sub.n.sup.k| acquired at time k from node n of the feeder. As a result, the following strategy may be used to update the inverter setpoints of DERs at each time k:
[0070] [S1] Collect voltage measurements {y.sub.n.sup.k.
[0071] [S2] For all n, update dual variables as follows:
.sub.n.sup.k+1=pro{.sub.n.sup.k+(V.sup.miny.sub.n.sup.k.sub.n.sup.k)}(18a)
.sub.n.sup.k+1=pro{.sub.n.sup.k+(y.sub.n.sup.kV.sup.max.sub.n.sup.k)}.(18b)
[0072] [S3] Update power setpoints for each DER i as:
u.sub.i.sup.k+1=proj.sub.y.sub..sub.v,.sup.k(u,,)|.sub.u.sub.
[0073] And go to [S1].
[0074] .sub.i.sup.k. Updates (18a) and (18b) may be computed either at each inverter-interfaced energy resource (e.g., if the voltage measurements are broadcasted to the DERs) or at the utility/aggregator.
[0075] The control techniques implemented in \
. The only information required to implement these control techniques pertains to the line and network models, which are utilized to build the network-related matrices in (5). The convergence properties of these control techniques are analyzed herein.
[0076] Steps (18a)-(18b) are -gradients of the regularized Lagrangian function. That is, V.sup.miny.sub.n.sup.k.sub.n.sup.k.sub..sub..sub.,.sup.k|.sub.u.sub.
.sub.,.sup.k|.sub.u.sub.
[0077] Let e.sub.y.sup.k.sup.M and e.sub..sup.k
.sup.M collect the dual gradient errors V.sup.miny.sub.n.sup.k.sub.n.sup.k.sub.y.sub.
.sub.,.sup.k and y.sub.n.sup.kV.sup.max.sub.n.sup.k.sub..sub.
.sub.,.sup.k, respectively. The following practical assumption can be made.
[0078] Assumption 5. There exists a constant e0 such that max{e.sub.y.sup.k.sub.2, e.sub..sup.k.sub.2}e for all k0.
[0079] Before stating the main convergence result for the energy resource control devices illustrated in
which is utilized to compute the gradients in the error-free iterates (17) as
{tilde over (z)}.sup.k+1=pro{{tilde over (z)}.sup.k.sup.k({tilde over (z)}.sup.k)}.(19)
[0080] Given these definitions, the following holds.
[0081] Lemma 1: The map .sup.k is strongly monotone with constant =min{,} and Lipschitz over .sup.k
.sub.+.sup.M
.sub.+.sup.M with constant L.sub.,={square root over ((L++2G).sup.2+2(G+).sup.2)}.
[0082] The result above is a relaxed version of Lemma 3.4 of Koshal, since it does not require the Lipschitz continuity of the gradient of (11b)(11c). Convergence and tracking properties of the described control techniques (18) are established next.
[0083] Theorem 1: Consider the sequence {z.sup.k}:={u.sup.k, .sup.k, .sup.k} generated by (18). Let Assumptions 1-5 hold. For fixed positive scalars , >0, if the stepsize >0 is chosen such that
():={square root over (12+.sup.2L.sub.,.sup.2)}<1,(20)
That is 0<<2/L.sub.,.sup.2, then the sequence {z.sup.k} converges Q-linearly to z*.sup.,k:={u*.sup.,k, *.sup.,k, *.sup.,k} up to the asymptotic error bound given by:
[0084] Equation (21) quantifies the maximum discrepancy between the iterates {u.sup.k, .sup.k, .sup.k} generated by the described control techniques and the (time-varying) minimizer of problem (16). From Lemma 3.2 of Koshal and by using the triangle inequality, a bound for the difference between u.sup.k and the time-varying solution of (11) can be obtained. The condition (20) imposes the requirements on the stepsize , such that () is strictly less than 1 and thereby enforcing Q-linear convergence. The optimal stepsize selection for convergence is =/L.sub.,.sup.2.
[0085] The error (21) provides trade-offs between smaller 's (leading to a smaller term multiplying the gradient error e, and yet yielding poorer convergence properties, i.e., () close to 1) and bigger 's (leading to the opposite).
[0086] For notational and exposition simplicity, the present disclosure addresses a balanced distribution network. However, the techniques described herein may be applicable to multi-phase unbalanced systems with any topology. In fact, the linearized models of the present disclosure may be readily extended to the multi-phase unbalanced setup, and the control techniques (18) can be implemented using inverters located at any phase and node.
[0087] Of note, Assumption 2 requires the objective function (11a) to be continuously differentiable. However, non-differentiable functions such as |x| and |x|.sub.+:=max{0,x} (with the latter playing an important role when feed-in tariffs are considered) can be readily handled upon introducing auxiliary optimization variables along with appropriate inequality constraints.
[0088] For example, the problem min.sub.x[x].sub.+ s.t. g(x)0 can be reformulated in the following equivalent way: min.sub.x,zz s.t. g(x)0, xz, and z0.
[0089] Some related art OPF approaches may include voltage regulation constraints at all nodes. In accordance with the techniques described herein, the set corresponds to M nodes where voltage measurements can be collected and utilized as actionable feedback in (18). Accordingly, the set
may include: i) nodes
where DERs are located (e.g., existing inverters that accompany renewable energy resources may be equipped with modules that measure the voltage at the point of connection); and, ii) additional nodes of a distribution network where distribution network system operators deploy communications-enabled meters for voltage monitoring.
[0090] The scalars .sub.u, .sub.d and .sub.
[0091] As one example application, a power distribution network with high-penetration of photovoltaic (PV) systems is described. Particularly, it is demonstrable how the disclosed control techniques can reliably prevent overvoltages that are likely to be experienced during periods when PV generation exceeds the demand.
[0092] To this end, consider a modified version of the IEEE 37-node test feeder shown in
[0093] The voltage limits V.sup.max and V.sup.min are set to 1.05 pu and 0.95 pu, respectively. The performance of the proposed scheme is compared against the performance of a local Volt/VAr control, one of the control strategies currently tested on the field by a number of DMS vendors and utility companies. Particularly, a droop control without deadband may be tested, where inverters set Q.sub.n.sup.k=0 when |V.sub.n.sup.k|1 pu and linearly increase the reactive power to Q.sub.n.sup.k={square root over (S.sub.n.sup.2(P.sub.av,n.sup.k).sup.2)} when |V.sub.n.sup.k|1.05 pu. The PV-inverters measure the voltage magnitude and update the reactive setpoint every 0.33 seconds.
[0094] For the control techniques disclosed herein, the parameters are set as =10.sup.3, =10.sup.4, and =0.2. The target optimization objective (11a) is set to c.sub.q(Q.sub.i.sup.k).sup.2+c.sub.p(P.sub.av,i.sup.kP.sub.i.sup.k).sup.2 in an effort to minimize the amount of real power curtailed and the amount of reactive power injected or absorbed. The coefficients are set to c.sub.p=3 and c.sub.q=1. Iteration of the control techniques (18) is performed every 0.33 seconds. Before describing the obtained voltage profiles, it is prudent to stress that from Theorem 1 it is evident that the convergence of the control techniques described herein is not affected by the network size.
[0095]
[0096] c.sub.q(Q.sub.i.sup.k).sup.2+c.sub.p(P.sub.av,i.sup.kP.sub.i.sup.k).sup.2. This is compared against the cost of reactive power provisioning entailed by Volt/VAr control, which is computed as
c.sub.q(Q.sub.i.sup.k).sup.2. The advantages of the control techniques described herein are evident, as they enable voltage regulation with minimal curtailment of real power as well as reactive power support. Notice that the lower the amount of reactive power absorbed by the inverters, the lower are the currents on the distribution lines, with the due benefits for the distribution system operators. It is also worth emphasizing that the cost entailed by Volt/VAr is decreasing during solar-peak hours. As mentioned above, this is because the available reactive power is upper bounded by (S.sub.n.sup.2(P.sub.av,n.sup.k).sup.2).sup.1/2, and this bound decreases with the increasing of P.sub.av,n.sup.k. However, while the cost decreases around 10:00 12:00, the Volt/VAr controllers are not able to ensure voltage regulation.
[0097] Notice that the voltage magnitudes can be forced to flatten on a different value (e.g., 1.045 pu) by simply adjusting V.sup.max. Given the obtained trajectories, it is evident that the control techniques described herein can be utilized to also effect Conservation Voltage Reduction by appropriately setting the values of V.sup.min and V.sup.max in the control loop (cf. (18a) and (18b)). To test the ability of the described control techniques to modify the voltage profile in real time or near-real time, in response to changes in V.sup.min and V.sup.max, consider the case where a distribution network system operator sets the bound V.sup.max to: i) 1.05 pu from 6:00 to 13:00; ii) 1.035 from 13:00 to 14:00; and, iii) 1.02 after 14:00.
[0098] The setpoint update (18c) affords a closed-form solution for a variety of RESs and other controllable devices. For notational simplicity, let .sub.n.sup.k=[{circumflex over (P)}.sub.n.sup.k, {circumflex over (Q)}.sub.n.sup.k].sup.T be the unprojected point, where {circumflex over (P)}.sub.n.sup.k and {circumflex over (Q)}.sub.n.sup.k are the unprojected values for the real and reactive powers, respectively. That is,
.sub.n.sup.k:=u.sub.n.sup.k1.sub.u.sub..sub.,.sup.k1(u,,)|.sub.u.sub.
[0099] Clearly, u.sub.n.sup.k=pro{.sub.n.sup.k}. In the following, expressions for u.sub.n.sup.k are reported for different choices of the set
.sub.n.sup.k1.
[0100] Real power-only control: in this case, the set .sub.n.sup.k1 boils down to
.sub.n.sup.k1={(P.sub.n,Q.sub.n): 0P.sub.nP.sub.av,n.sup.k, Q.sub.n=0}. This set is typical in inverter-interfaced RESs adopting real power curtailment-only strategies, where P.sub.av,n.sup.k1 represents the maximum power point for a RES. It also represents conventional generation unit operating at unity power factor, where P.sub.av,n.sup.k1 is the maximum generation. In this case, (18c) can be simplified as follows:
P.sub.n.sup.k=max{0, min{{circumflex over (P)}.sub.n.sup.k,P.sub.av,n.sup.k1}}(23a)
Q.sub.n.sup.k=0.(23b)
[0101] Reactive power-only control: For RES with reactive power-only control capability, the set of possible operating points is given by .sub.n.sup.k1={(P.sub.n, Q.sub.n):P.sub.n=P.sub.av,n.sup.k1, |Q.sub.n|(S.sub.n.sup.2(P.sub.av,n.sup.k1).sup.2).sup.1/2}. In this case, (18c) boils down to:
P.sub.n.sup.k=P.sub.av,n.sup.k1(24a)
Q.sub.n.sup.k=sign({circumflex over (Q)}.sub.n.sup.k)min{|{circumflex over (Q)}.sub.n.sup.k|,(S.sub.n.sup.2(P.sub.av,n.sup.k1).sup.2).sup.1/2}.(24b)
where sign(x)=1 when x<0 and sign(x)=1 when x>0.
[0102] Joint real and reactive power control: Consider now the more general setting where an inverter can control both real and reactive output powers. Particularly, given the inverter rating S.sub.n and the current available real power P.sub.av,n.sup.k1, consider the set .sub.n.sup.k1={(P.sub.n,Q.sub.n):0P.sub.nP.sub.av,n.sup.k, (Q.sub.n).sup.2S.sub.n.sup.2(P.sub.n).sup.2} in (2).
[0103]
where the regions .sub.n.sup.k1,
.sub.n.sup.k1,
.sub.n.sup.k1,
.sub.n.sup.k1, and .sub.n.sup.k1 can be readily obtained from S.sub.n and P.sub.av,n.sup.k1.
[0104] It is also worth pointing out that closed-form expressions may be found when .sub.n.sup.k1 models the operating regions of, diesel generators, and other suitable energy resources.
[0105] The above section details the synthesis of feedback controller techniques that seek DER setpoints corresponding to AC OPF solutions. Appropriate linear approximations of the AC power flow equations are utilized along with primal-dual methods to develop fast-acting low-complexity control techniques that can be implemented using microcontrollers and/or other processors that accompany interfaces of gateways and energy resource inverters. The tracking capabilities of these control techniques have also been analytically established and numerically corroborated herein.
[0106] In some examples, one or more DERs may be temporarily unable to communicate with a management system for the distribution network. In accordance with the techniques described herein, DERs may be configured to update their setpoints on their own when subjected to such communication constraints. The following portion of the disclosure describes example controller techniques usable under various communications constraints.
[0107] As previously described, various centralized and distributed AC OPF approaches have been developed for distribution network systems to compute optimal steady-state setpoints for DERs, so that power losses and voltage deviations are minimized and economic benefits to utility and end-users are maximized. It is well-known that the AC OPF is a nonconvex (and, in fact, NP-hard) nonlinear program. Some related art approaches may utilize off-the-shelf solvers for nonlinear programs, or, leverage convex relaxation and approximation techniques to obtain convex surrogates. Related art distributed solution methods may tap into the decomposability of the Lagrangian function associated with convex surrogates of the OPF, and utilize iterative primal-dual-type methods to decompose the solution of the OPF task across DERs, utility, and aggregators.
[0108] In the presence of (fast-)changing load, ambient, and network conditions, these related art OPF schemes may offer decision making capabilities that do not match the dynamics of distribution systems. That is, during the time required to collect data from all the nodes of the network (e.g., loads), solve the OPF, and subsequently dispatch setpoints, the underlying load, ambient, and network conditions may have already changed. In such case, the DER output powers may be consistently regulated around outdated setpoints, leading to suboptimal system operation and violation of relevant electrical limits. These issues motivate the development of online OPF strategies that leverage the opportunities for fast-feedback offered by power-electronics -interfaced DERs to ensure adaptability to fast-changing ambient and load conditions, while enabling the near real-time pursuit of solutions of AC OPF problems.
[0109] Related art efforts to solve these issues include continuous-time feedback controllers that seek Karush-Kuhn-Tucker conditions for economic dispatch optimality for bulk systems. A heuristic comprising continuous-time dual ascent and discrete-time reference-signal updates has also been proposed, wherein local stability of the resultant closed-loop system may also be established. More recently, modified automatic generation and frequency control methods that incorporate optimization objectives corresponding to DC OPF problems have been proposed for bulk power systems. Focusing on AC OPF models, related art online solution approaches include e.g., the heuristic based on saddle-point-flow method, the online OPF for distribution systems with a tree topology, and the distributed dual (sub)-gradient scheme developed for (un)balanced distribution systems. Overall, the convergence results in these related art systems hinge on a time scale separation where cost and constraints of the target OPF problem change slowly compared to the controller dynamics.
[0110] In contrast, distributed control techniques that enable DERs to track the solution fast-changing OPF targets, and systems and devices implementing such techniques, have been detailed herein. Stability and tracking capabilities have been analytically characterized in terms of bounds between the DER output powers and the optimal trajectory set forth by the time-varying OPF problem. In some examples, the distributed control techniques of the present disclosure may be broadened by considering more realistic scenarios where communication constraints lead to asynchronous and partial updates of the control signals. In some such examples, the disclosed control techniques may still be based on suitable linear approximations of the AC power-flow equations as well as Lagrangian regularization methods. However, OPF-target tracking capabilities are also provided herein for cases where: i) communication-packet losses lead to asynchronous updates of the control signals; and/or ii) DER setpoints are updated at a fast time scale based on local voltage measurements, and information on state of the remaining part of the network is utilized if and when available, based on communication constraints. These cases may be generally referred to herein as communication constraints. The systems, devices, and methods addressing communication constraints, as described herein, may allow controllers to ensure that OPF constraints are tightly met, while relaxing the requirements on the supporting communication infrastructure.
[0111] For the communication constrained scenario, consider a power distribution network comprising N+1 nodes collected in the set {0},
:={1, . . . , N}, and distribution lines represented by the set of edges :={(m, n)}
{0}
{0}. Assume that the temporal domain is discretized as t=k, where k
and >0 is small enough to capture fast variations on loads and ambient conditions. Let V.sub.n.sup.k
and I.sub.n.sup.k denote the phasors for the line-to-ground voltage and the current injected at node n over the kth instant, respectively, and define the N-dimensional complex vectors v.sup.k:=[V.sub.1.sup.k, . . . , V.sub.N.sup.k].sup.T
.sup.N and i.sup.k:=[I.sub.1.sup.k, . . . , I.sub.N.sup.k].sup.T
.sup.N. Node 0 denotes the distribution transformer, and it is taken to be the slack bus. Using Ohm's and Kirchhoff s circuit laws, it follows that i.sup.k=V.sub.0.sup.k
.sup.NN and
.sup.NN are formed based on the network topology and the -equivalent circuit of the lines (see e.g., Kersting).
[0112] Inverter-interfaced DERs are assumed to be located at nodes ,
:=|
|. The real and reactive powers at the AC side of inverter i
at each time k are denoted as P.sub.i.sup.k and Q.sub.i.sup.k, respectively, and are confined within the DER operating region (P.sub.i.sup.k, Q.sub.i.sup.k)
.sub.i.sup.k. The set
.sub.i.sup.k captures hardware as well as operational constraints, and is assumed to be convex and compact. For example, for PV inverters, this set is given by
.sub.i.sup.k:={(P.sub.i.sup.k,Q.sub.i.sup.k): P.sub.i.sup.minP.sub.i.sup.kP.sub.av,i.sup.k, (Q.sub.i.sup.k).sup.2S.sub.i.sup.2(P.sub.i.sup.k).sup.2}, where P.sub.av,i.sup.k denotes the real power available at time k and S.sub.i is the capacity of the inverter. For future developments, let u.sub.i.sup.k:=[P.sub.i.sup.k, Q.sub.i.sup.k].sup.T collect the real and reactive setpoints for DER i at time k, and define the set
.sup.k:=
.sub.1.sup.k . . .
. Finally, for each node i, let P.sub.l,i.sup.k and Q.sub.l,i.sup.k denote the real and reactive power demand, respectively, at time k.
[0113] To bypass challenges related to nonconvexity and NP-harness of the OPF task, and facilitate the design of low-complexity control implementable on devices such as microcontrollers that accompany power-electronics interfaces of inverters, these sections leverage suitable linear approximations of the AC power-flow equations. To this end, collect the voltage magnitudes {|V.sub.i.sup.k| in the vector .sup.k:=[|V.sub.1.sup.k|, . . . , |V.sub.N.sup.k|].sup.T
.sup.N. Then, given pertinent matrices R.sup.k, B.sup.k, H.sup.k, J.sup.k
.sup.NN and vectors b.sup.k, a.sup.k
.sup.N, one can obtain approximate power-flow relations whereby voltages are linearly related to the injected real and reactive powers as
v.sup.kH.sup.kp.sup.k+J.sup.kq.sup.k+b.sup.k(26a)
.sup.kR.sup.kp.sup.k+B.sup.kq.sup.k+a.sup.k,(26b)
where p.sub.n.sup.k=P.sub.n.sup.kP.sub.l,n.sup.k, q.sub.n.sup.k=Q.sub.n.sup.kQ.sub.l,n.sup.k if n and p.sub.n.sup.k=P.sub.l,n.sup.k, q.sub.n.sup.k=Q.sub.l,n.sup.k n
\
. Matrices R.sup.k, B.sup.k, H.sup.k, J.sup.k
.sup.NN and vectors b.sup.k, a.sup.k
.sup.N can be obtained as described, e.g., in Dhople, and can be time-varying to reflect, for example, changes in the topology and voltage linearization points. Through (26a) and (26b), approximate linear relationships for power losses and power flows as a function of (P.sub.i.sup.k, Q.sub.i.sup.k
can be readily derived.
[0114] Denote as V.sup.min and V.sup.max minimum and maximum, respectively, voltage service limits, and let the cost .sub.n.sup.k(u.sub.n.sup.k) capture possibly time-varying DER-oriented objectives (e.g., cost of/reward for ancillary service provisioning or feed-in tariffs), and/or system-level performance metrics (e.g., power losses and/or deviations from the nominal voltage profile). With these definitions, and based on (26a) and (26b), an approximate rendition of the AC OPF problem can be formulated as:
(P1.sup.k)mi.sub.i.sup.k(u.sub.i)(27a)
Subject to
g.sub.n.sup.k({u.sub.i)0, n
(27b)
)0, n
(27c)
u.sub.i.sub.i.sup.k, i
(27d)
where is a set of nodes strategically selected to enforce voltage regulation throughout the feeder, M:=|
|, and
with c.sub.n.sup.k:=.sub.n.sup.k(r.sub.n,i.sup.kP.sub.l,i.sup.k+b.sub.n,i.sup.kQ.sub.l,i.sup.k). Regarding (27), the following assumptions may be made.
[0115] Assumption 6. Functions .sub.i.sup.k(u.sub.i) are convex and continuously differentiable for each i and k0. Define further the gradient map f.sup.k(u):=[.sub.u.sub.
(
)].sup.T. Then, it may be assumed that the gradient map f.sup.k:
.fwdarw.
is Lipschitz continuous with constant L over
.sup.k for all k0.
[0116] Assumption 7. (Slater's condition). For all k0, there exist a set of feasible power injections {.sub.i.sup.k such that g.sub.n.sup.k({.sub.i
)<0 and
)<0, for all n
.
[0117] From the compactness of set .sup.k, and under Assumptions 6 and 7, problem (27) is convex and strong duality holds. Further, there exists an optimizer {u.sub.i.sup.opt,k
, k0. For future developments, let g.sup.k(u)
.sup.M and
.sup.M be a vector stacking all functions g.sub.n.sup.k({u.sub.i
) and
). Then, given that these functions are linear in u, it follows that there exists a constant G such .sub.ug.sup.k(u).sub.2G and .sub.u
.sup.k for all k0.
[0118] Problem (P1.sup.k) represents a convex approximation of the AC OPF task. Constraints (27b) and (27c) are utilized to enforce voltage regulation, while (27d) models DER hardware constraints. The problem (P1.sup.k) specifies OPF targets that corresponds to a specific time instant k. Accordingly, in the presence of (fast-)changing load, ambient, and network conditions, repeated solutions of (P1.sup.k) for K would ideally produce optimal reference setpoint trajectories for the DER {u.sub.n.sup.opt,k, k
}. However, related art centralized and distributed solution approaches may not be able to collect network data (e.g., loads), solve (P1.sup.k), and subsequently dispatch setpoints within seconds, and may consistently regulate the power-outputs (P.sub.i.sup.k, Q.sub.i.sup.k
around outdated setpoints. In contrast, the control techniques described herein may continuously regulate the DER output powers around points that one would have if (P1.sup.k) could be solved instantaneously.
[0119] Let y.sup.k=({u.sub.i.sup.k
) represent an AC power-flow solution for given DER output powers {u.sub.i.sup.k
, with vector y.sup.k collecting relevant electrical quantities such as voltages and power flows (averaged over one AC cycle). Further, let
.sub.i{,y.sup.k} describe an update rule for the setpoints of DER i. Then, given the following closed loop-system
u.sub.i.sup.k=.sub.i(u.sub.i.sup.k1, y.sup.k), i
(29a)
y.sup.k=({u.sub.i.sup.k,
)(29b)
the goal is to synthesize controllers {.sub.i{,}
so that the DER output powers {u.sub.i.sup.k
are driven to the solution {u.sub.i.sup.opt,k
of the (time-varying) OPF problem (P1.sup.k).
[0120] The synthesis of the controllers addressing communication restraints leverages primal-dual methods applied to regularized Lagrangian functions. To this end, let :=[.sub.1, . . . , .sub.M].sup.T and :=[.sub.1, . . . , .sub.M].sup.T collect the Lagrange multipliers associated with (27b) and (27c), respectively, and consider the following augmented Lagrangian function associated with (P1.sup.k):
where {hacek over (r)}.sub.i.sup.k:=[{r.sub.j,i.sup.k].sup.T and {hacek over (b)}.sub.i.sup.k:=[{b.sub.j,i.sup.k
].sup.T are M1 vectors collecting the entries of R.sup.k and B.sup.k in the ith column and rows corresponding to nodes in
, c.sup.k:=[{c.sub.j.sup.k
].sup.T, and constants >0 and >0 appearing in the Tikhonov regulation terms are design parameters. Function (30) is strictly convex in the primal variables u.sub.k:=[u.sub.1.sup.k, . . .
].sup.T and strictly concave in the dual variables ,. The upshot of (30) is that gradient-based approaches can be applied to (30) to find an approximate solution to (P1.sup.k) with improved convergence properties. Further, it allows one to drop the strict convexity assumption on the cost function {.sub.i.sup.k(u.sub.i)
and to avoid averaging of primal and dual variables. Accordingly, the following saddle-point problem can be formed:
and denote as u*.sup.,k:=[u.sub.1*.sup.,k, . . . , ].sup.T, *.sup.,k, *.sup.,k the unique primal-dual optimizer of (30). In general, the solutions of (27) and the regularized saddle-point problem (31) are expected to be different; however, the discrepancy between u.sub.i.sup.opt,k and u.sub.i*.sup.,k can be bounded as in Lemma 3.2 of Koshal, whereas bounds of the constraint violation are substantiated in Lemma 3.3 of Koshal. These bounds are proportional to {square root over ()}. Therefore, the smaller , the smaller is the discrepancy between u.sub.n.sup.opt,k and u.sub.n*.sup.,k.
[0121] To track the time-varying optimizers z*.sup.,k:=[(u*.sup.,k).sup.T, (*.sup.,k).sup.T, (*.sup.,k).sup.T].sup.T of (31), the following online primal-dual gradient method may be used:
u.sub.i.sup.k+1=proj.sub.y.sub..sub.,.sup.k(u,,)|.sub.u.sub.
.sub.n.sup.k+1=pro{.sub.n.sup.k+(y.sub.n.sup.k({u.sub.i.sup.k
).sub.n.sup.k)}(32b)
.sub.n.sup.k+1=pro{.sub.n.sup.k+(
).sub.n.sup.k)}, (32c)
where >0 is the stepsize, pro{u} denotes the projection of u onto the convex set
, and
.sub.,
.sub.
.sup.+ are compact convex sets that can be chosen as explained in Koshal. Step (32a) is computed for each i
, whereas (32b) and (32c) are performed for each note n
. Convergence of the iterates z.sup.k:=[(u.sup.k).sup.T, (.sup.k).sup.T, (.sup.k).sup.T].sup.T to z*.sup.,k is established in Theorem 1 of Simonneto, and utilizes the following assumptions related to the temporal variability of (31).
[0122] Assumption 8. There exists a constant .sub.u0 such that u*.sup.,k+1u*.sup.,k.sub.u for all k0.
[0123] Assumption 9. There exist constants .sub.d0 and .sub. and k0.
[0124] It can be shown that the conditions of Assumption 9 translate into bounds for the discrepancy between the optimal dual variables over two consecutive time instants. That is, *.sup.,k+1*.sup.,k.sub. and *.sup.,k+1*.sup.,k.sub. with and given by Prop. 1 of Simonetto. Upon defining z*.sup.,k:=[(u*.sup.,k).sup.T), (*.sup.,k).sup.T, (*.sup.,k).sup.T].sup.T it also follows that z*.sup.,k+1z*.sup.,k.sub.z for a given .sub.z>0. Under Assumptions 6-9, convergence of (32) are investigated in Theorem 1 of Simonetto.
[0125] As further described below, the updates (32) may be modified to accommodate actional feedback from the distribution network system. This framework broadens the techniques described herein to address a more realistic scenario where communication constraints lead to asynchronous and/or partial updates of primal/dual variables.
[0126] Of note, i) given that g.sup.k(u) and .sup.k is compact, it follows that there exists a constant G such that .sub.ug.sup.k(u).sub.2G and .sub.u
Then, the following holds.
[0127] Lemma 2: The map .sup.k is strongly monotone with constant =min{,}, and Lipschitz over .sup.k
.sub.
.sub. with constant L.sub.,={square root over ((L++2G).sup.2+2(G+).sup.2)}.
[0128] With regard to the distributed optimization scheme (32): (i) functions {g.sub.n.sup.k(u.sup.k) and {
substantiate the distance of the voltage magnitudes from the limits V.sup.min and V.sub.max, respectively, of given setpoints u.sup.k; (ii) to evaluate g.sub.n.sup.k(u.sup.k),
in order to carry out step (32a).
[0129] To include actionable feedback from the system, the techniques described herein replace the algorithmic quantities {g.sub.n.sup.k(u.sup.k) and {
with actual voltage measurements. To this end, let m.sub.n.sup.k denote a measurement of the voltage magnitude |V.sub.n.sup.k| acquired at time k from node n
. Further, to account for communication errors in collecting the dual variables at each DER, let {tilde over ()}.sub.i.sup.l.sup.
the index of the most recent successful communication. Accordingly, the control techniques addressing communication constraints, as described herein, amount to the following iterative operations:
[0130] [S1] Update power setpoints at each DER ias:
[0131] [S2] Collect voltage measurements {m.sub.n.sup.k, updates dual variables as:
.sub.n.sup.k+1=pro{.sub.n.sup.k(V.sup.minm.sub.n.sup.k.sub.n.sup.k)}(33b)
.sub.n.sup.k+1=pro{.sub.n.sup.k(m.sub.n.sup.kV.sup.max.sub.n.sup.k)}(33c)
for all n, and broadcasts dual variables to DERs.
[0132] [S3] Each DER isets the local copies of the dual variables to {tilde over ()}.sub.i.sup.k=.sup.k, {tilde over ()}.sub.i.sup.k=.sup.k if dual variables are received, and {tilde over ()}.sub.i.sup.k=.sup.k1, {tilde over ()}.sub.i.sup.k=.sup.k1 otherwise.
[0133] Go to [S1].
[0134] Steps [S1]-[S3] are illustrated in \
. The only information necessary for these control techniques pertains to the distribution line and network models, which are utilized to build the matrices in (26). The convergence properties of (33) are analyzed below.
[0135] Let .sub.i.sup.k:=[{hacek over (r)}.sub.i.sup.k, {hacek over (b)}.sub.i.sup.k].sup.T, and notice that .sub.i.sup.k.sub.2X.sub.i for all k0. Further, let e.sub.y.sup.k.sup.M and e.sub..sup.k
.sup.M collect the dual gradient errors V.sup.min
.sub.n.sup.k.sub.n.sup.k.sub..sub.
.sub..sup.k and
.sub.n.sup.kV.sup.max.sub.n.sup.k.sub..sub.
.sub.,.sup.k, respectively, when actual voltage measurements are utilized instead of the true gradient of the regularized Lagrangian with respect to the dual variables. Then, the following practical assumptions may be made.
[0136] Assumption 10. There exist constants e.sub.d0 such that max{k.sub..sup.k.sub.2, e.sub..sup.k.sub.2}e.sub.d for all k0.
[0137] Assumption 11. For DER i, at most M.sub.i<+ consecutive communication packets are lost. That is, max{kl.sub.i(k)}E.sub.i for all k.
[0138] Under these assumptions, it can be shown that the update (38a) involves an inexact gradient step, as substantiated in the following lemma.
[0139] Lemma 3: When E.sub.i>0, one has that
is an inexact gradient of the regularized Lagrangian .sub.,.sup.k(u.sub.i,,) with respect to u.sub.i evaluated at {u.sub.i.sup.k, .sup.k, .sup.k}, i.e.,
with error bounded as:
e.sub.u,i.sup.k.sub.2E.sub.iX.sub.i[K+
[0140] It follows that the overall error in the primal iterate e.sub.u.sup.k:=[(e.sub.u,1.sup.k).sup.T, . . . , ].sup.T is bounded too. Particularly,
[0141] Henceforth, denote as e.sub.u the right-hand side of (35), and notice that e.sub.u>e.sub.d whenever E.sub.i>0 for all i. Convergence and tracking properties of the communication-constrained feedback control techniques (e.g., equations (33)) are established below.
[0142] Theorem 2: Consider the sequence {z.sup.k}:={u.sup.k, .sup.k, .sup.k} generated by (33). Let Assumptions 6-11 hold. For fixed positive scalars , >0, if the stepsize >0 is chosen such that
():={square root over (12+.sup.2L.sub.,.sup.2)}1,(36)
that is 0<<2/L.sub.,.sup.2, then the sequence {z.sup.k} converges Q-linearly to z*.sup.,k:={u*.sup.,k,*.sup.,k,*.sup.,k} up to the asymptotic error bound given by:
where e={square root over (e.sub.u.sup.2+2e.sub.d.sup.2)}.
[0143] Bound (37) can be obtained by following steps similar to Theorem 2 above. In spite of the error in the primal updates, (33) preserves the properties of a strongly monotone operator and leads to a contraction mapping for z.sup.kz*.sup.,k.sub.2 if (36) is satisfied. Equation (37) quantifies the maximum discrepancy between iterates {u.sup.k,.sup.k,.sup.k} generated by the control techniques described herein and the (time-varying) minimizer problem of (31). From Lemma 3.2 of Koshal and by using the triangle inequality, a bound for the difference between u.sup.k and the solution of (27) can be obtained.
[0144] In some examples, a modified version of the described control techniques may be used to address the case where communication constraints introduce significant delays in the computation of steps (33). Particularly, (33) may be complemented by local updates of the DER setpoints based on measurements of voltages at the DER points of connection as described in the following.
[0145] [S1] Update power setpoints at each DER ias:
u.sub.i.sup.k+1=proj.sub.y.sub..sub.,.sup.k(u,,).sub.u.sub.
[0146] [S2] Collect voltage measurements {m.sub.n.sup.k, and update dual variables as:
.sub.n.sup.k+1=pro{.sub.n.sup.k+(V.sup.minm.sub.n.sup.k.sub.n.sup.k)}(38b)
.sub.n.sup.k+1=pro{.sub.n.sup.k+(m.sub.n.sup.kV.sup.max.sub.n.sup.k)}(38c)
for all n.
[0147] [S3] At each DER i, update the local copies of the dual variables as: [0148] If .sup.k and .sup.k are available and are received, set {tilde over ()}.sub.i.sup.k=.sup.k,.sub.i.sup.k=.sup.k; [0149] If .sup.k and .sup.k are not available, measure the voltage magnitude V.sub.i.sup.k at the point of connection and update the ith entry of {tilde over ()}.sub.i.sup.k and {tilde over ()}.sub.i.sup.k as
{
{
[0150] The remaining entries are not updated. That is, {tilde over ()}.sub.i,j.sup.k+1={tilde over ()}.sub.i,j.sup.k and {tilde over ()}.sub.i,j.sup.k+1={tilde over ()}.sub.i,j.sup.k for all j\{i}.
[0151] Go to [S1].
[0152] As shown in and updates the local copies of the dual variables based on {m.sub.n.sup.k
. This scenario leads to an operational setup where at each time k the DER updates the entries of {tilde over ()}.sub.i .sup.k and {tilde over ()}.sub.i.sup.k that correspond to the subset of nodes from which voltage measurements are received.
[0153] The results of Lemma 3 and Theorem 2 can be adapted to [S1]-[S3]. In this case, M.sub.i represents the number of iterations that are necessary for DER i to update all the entries of dual variables (or to receive measurements of all voltages in ).
[0154] Consider a modified version of the IEEE 37-node test feeder shown in
[0155] The example of
[0156] The target optimization objective (27a) is set to .sub.n.sup.k(u.sub.n.sup.k)=c.sub.q(Q.sub.n.sup.k).sup.2+c.sub.p(P.sub.av,n.sup.kP.sub.n.sup.k).sup.2 to minimize the amount of real power curtailed from the PV systems and to minimize the amount of reactive power injected or absorbed. The coefficients may be set to c.sub.p=3 and c.sub.q=1 for all PV systems. It is assumed that the dual ascent operation is performed at the utility/aggregator, which subsequently broadcasts the dual variables to DER systems. The controller parameters are set as =10.sup.3, =10.sup.4, and =0.2. The stepsize was selected experimentally, in this example.
[0157] The following provide two example cases:
[0158] Case 1: Control techniques [S1]-[S3] are implemented, and the primal-dual updates represented in
[0159] Case 2: Communication constrained control techniques [S1]-[S3] are implemented, where the global operations represented in .
[0160] In Case 2, the PV system setpoints are updated at a faster time scale by utilizing local voltage measurements (cf.
[0161]
[0162] c.sub.q(Q.sub.n.sup.k).sup.2+c.sub.p(P.sub.av,n.sup.kP.sub.n.sup.k).sup.2, for all k. This is compared with the cost of reactive power provisioning incurred by Volt/VAr control, which is computed as
c.sub.q(Q.sub.n.sup.k).sup.2, for all k. The advantages of the described control techniques are evident, as they enable voltage regulation at a lower cost. This is likely still useful to obtain an improved voltage profile despite the higher cost of ancillary service provisioning seen in Case 2.
[0163] Proof of Lemma 3: Define .sub.i.sup.k,ki:=.sub.u.sub..sub.,.sup.k(u,,)|.sub.u.sub.
.sub.i.sup.k,ki=.sub.u.sub.
Recall that .sub.i.sup.k.sub.2D.sub.and .sub.i.sup.k.sub.2D.sub., for all k0, and notice that the norm of the vector .sub.i.sup.k=[{hacek over (r)}.sub.i.sup.k, {hacek over (b)}.sub.i.sup.k].sup.T can be bounded as .sub.i.sup.k.sub.2X.sub.i for all k0. Next, notice that .sub.i.sup.k,kM can be written as
where e.sub.u,i.sup.k=.sub.j=1.sup.E.sup.
where m.sup.k in (41a) collects all the voltage measurements m.sup.k:=[m.sub.1.sup.k, . . . , m.sub.M.sup.k].sup.T, and the non-expansive property of the projection operator, along with the fact that .sup.j=pro{.sup.j}, is utilized to derive (41c). Using (41c), it follows that .sub.j=1.sup.M.sup.kj.sup.kj+1.sub.2M.sub.i(
[0164] The techniques described herein provide methods, devices, and systems for gather and broadcast control that seek DER setpoints corresponding to AC OPF solutions. The tracking capabilities of the control techniques described herein may be used in reliable (i.e., unconstrained) systems, as well as in systems working under communication constraints, such as packet loss and partial updates of control signals.
[0165]
[0166] In the example of
[0167] The distribution network nodes, in the example of
[0168] In the example of
[0169] For each node, the distribution network management system may determine, based on the plurality of node voltages, a respective value of a first voltage-constraint coefficient and a respective value of a second voltage-constraint coefficient (106). For instance, distribution network management system 4 may determine, for each of nodes 6 (and possibly other locations), a respective value of the first voltage-constraint coefficient based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and the respective voltage measurement for the node. Distribution network management system 4 may determine a respective value of the second voltage-constraint coefficient based on a respective previous value for the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement. In some examples, distribution network management system 4 may determine the respective values of the first and second voltage-constraint coefficients based additionally or alternatively on other criteria.
[0170] In the example of
[0171] In the example of
[0172] Based on the power setpoint value, the one or more inverter-interfaced energy resource management devices may, in the example of
[0173] The example operations of
[0174] Additionally, while shown in the example of
[0175]
[0176] In the example of
[0177] In the example of
[0178] The inverter-interfaced energy resource management devices, in the example of
[0179] In the example of
[0180] The example operations of
[0181] The techniques of the present disclosure may additionally be described by the following examples.
[0182] Example 1. A device including: at least one processor configured to: receive a plurality of voltage measurements, wherein voltage measurements in the plurality of voltage measurements correspond to respective nodes in a plurality of nodes of a distribution network; determine, for each respective node in the plurality of nodes: a respective value of a first voltage-constraint coefficient, based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and a respective voltage measurement in the plurality of voltage measurements that corresponds to the respective node; and a respective value of a second voltage-constraint coefficient based on a respective previous value of the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement; and cause at least one inverter-interfaced energy resource in a plurality of inverter-interfaced energy resources that are connected to the distribution network to modify an output power of the at least one inverter-interfaced energy resource based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
[0183] Example 2. The device of example 1, wherein the at least one processor is configured to cause the at least one inverter-interfaced energy resource to modify the output power by outputting, to the at least one inverter-interfaced energy resource, the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
[0184] Example 3. The device of example 1, wherein: the at least one processor is configured to determine the respective value of the first voltage-constraint coefficient by: determining, based on the respective previous value of the first voltage-constraint coefficient, the respective minimum voltage value for the respective node, and the respective voltage measurement, a respective first coefficient offset value; scaling the respective first coefficient offset value by a step size to determine a respective scaled first coefficient offset value; responsive to determining that a respective first sum of the respective previous value of the first voltage-constraint coefficient and the respective scaled first coefficient offset value is greater than zero, setting the respective value of the first voltage-constraint coefficient to be the respective first sum; and responsive to determining that the respective first sum is less than or equal to zero, setting the respective value of the first voltage-constraint coefficient to be zero, and the at least one processor is configured to determine the respective value of the second voltage-constraint coefficient by: determining, based on the respective previous value of the second voltage-constraint coefficient, the respective maximum voltage value for the respective node, and the respective voltage measurement, a respective second coefficient offset value; scaling the respective second coefficient offset value by the step size to determine a respective scaled second coefficient offset value; responsive to determining that a respective second sum of the respective previous value of the second voltage-constraint coefficient and the respective scaled second coefficient offset value is greater than zero, setting the respective value of the second voltage-constraint coefficient to be the respective second sum; and responsive to determining that the respective second sum is less than or equal to zero, setting the respective value of the second voltage-constraint coefficient to be zero.
[0185] Example 4. The device of example 3, wherein: the at least one processor is configured to determine the respective first coefficient offset value by: determining a respective first difference value that represents a difference between the respective minimum voltage value and the respective voltage measurement; and determining, as the respective first coefficient offset value, a difference between the respective first difference value and a version of the respective previous value of the first voltage-constraint coefficient that is scaled by a utility-defined parameter, and the at least one processor is configured to determine the respective second coefficient offset value by: determining a respective second difference value that represents a difference between the respective voltage measurement and the respective maximum voltage value; and determining, as the respective second coefficient offset value, a difference between the respective third difference value and a version of the respective previous value of the second voltage-constraint coefficient that is scaled by the utility-defined parameter.
[0186] Example 5. The device of example 1, wherein: the at least one processor is configured to determine the respective value of the first voltage-constraint coefficient by calculating pro{.sub.n.sup.k+(V.sup.min
.sub.n.sup.k.sub.n.sup.k)}, wherein: .sub.n.sup.k represents the respective previous value of the first voltage-constraint coefficient, V.sup.min represents the respective minimum voltage value for the respective node,
.sub.n.sup.krepresents the respective voltage measurement, represents a step size, and represents a predetermined parameter indicating an importance of previous voltage-constraint coefficient values, and the at least one processor is configured to determine the respective value of the second voltage-constraint coefficient by calculating pro
{.sub.n.sup.k+(
.sub.n.sup.kV.sup.max.sub.n.sup.k)}, wherein: .sub.n.sup.k represents the respective previous value of the second voltage-constraint coefficient, and V.sup.max represents the respective maximum voltage value for the respective node.
[0187] Example 6. The device of example 1, wherein the at least one processor is configured to cause the at least one inverter-interfaced energy resource to modify the output power by: determining, for the at least one inverter-interfaced energy resource, a respective power setpoint value, based on the respective value of the first voltage-constraint coefficient for each respective node, the respective value of the second voltage-constraint coefficient for each respective node, and a respective previous power setpoint value, and causing the at least one inverter-interfaced energy resource to modify the output power based on the respective power setpoint.
[0188] Example 7. The device of example 6, wherein the device comprises a power distribution network management system.
[0189] Example 8. The device of example 6, wherein the device comprises a respective power inverter communicatively coupled to the at least one inverter-interfaced energy resource.
[0190] Example 9. A system including: a plurality of voltage measurement devices, each configured to: determine a respective voltage measurement that corresponds to a respective node in a plurality of nodes of a distribution network; and output the respective voltage measurement; a distribution network management system configured to: receive, from each of the plurality of voltage measurement devices, the respective voltage measurement; determine, for each respective node in the plurality of nodes: a respective value of a first voltage-constraint coefficient, based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and the respective voltage measurement; and a respective value of a second voltage-constraint coefficient based on a respective previous value of the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement; and output the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node; and a plurality of inverter-interfaced energy resource management devices corresponding to a plurality of inverter-interfaced energy resources that are connected to the distribution network, each inverter-interfaced energy resource management device being configured to: receive the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node; determine, based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node, a respective power setpoint value; and modify a respective output power of a respective inverter-interfaced energy resource from the plurality of inverter-interfaced energy resources, based on the respective power setpoint value.
[0191] Example 10. The system of example 9, wherein at least one of the plurality of inverter-interfaced energy resource management devices is a power inverter that couples a respective energy resource to the distribution network.
[0192] Example 11. The system of example 9, wherein at least one of the plurality of inverter-interfaced energy resource management devices is a computing device communicatively coupled to a power inverter that couples a respective energy resource to the distribution network.
[0193] Example 12. The system of example 9, wherein: at least one of the plurality of inverter-interfaced energy resource management devices is further configured to: determine an updated value of the respective voltage measurement that corresponds to a resource node, the resource node being the respective node at which the respective inverter-interfaced energy resource is connected to the distribution network; determine, based on the respective value of the first voltage-constraint coefficient for the resource node, the respective minimum voltage value for the resource node, and the updated value of the respective voltage measurement, an updated value of the first voltage-constraint coefficient for the resource node; determine, based on the respective value of the second voltage-constraint coefficient for the resource node, the respective maximum voltage value for the resource node, and the updated value of the respective voltage measurement, an updated value of the second voltage-constraint coefficient for the resource node; determine, based on the updated value of the first voltage-constraint coefficient for the resource node, the updated value of the second voltage-constraint coefficient for the resource node, the respective value of the first voltage-constraint coefficient for each respective node other than the resource node, and the respective value of the second voltage-constraint coefficient for each respective node other than the research node, an updated power setpoint value; and modify the respective output power of the respective inverter-interfaced energy resource based on the updated power setpoint value.
[0194] Example 13. The system of example 12, wherein: the plurality of inverter-interfaced energy resource management devices are configured to determine the respective power setpoint value based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node at a first frequency; and the at least one of the plurality of inverter-interfaced energy resource management devices is configured to determine the updated value of the respective voltage measurement that corresponds to the resource node at a second frequency that is smaller than the first frequency.
[0195] Example 14. The system of example 12, wherein the at least one of the plurality of inverter-interfaced energy resource management devices is configured to determine the updated value of the respective voltage measurement that corresponds to the resource node in response to determining that an updated respective value of the first voltage-constraint coefficient for each respective node and an updated respective value of the second voltage-constraint coefficient for each respective node have not been received within a threshold amount of time.
[0196] Example 15. The system of example 9, wherein determining the respective power setpoint value is further based on at least one respective performance metric determined by a respective administrator of the respective inverter-interfaced energy resource.
[0197] Example 16. The system of example 15, wherein the at least one respective performance metric represents at least one of: a cost for ancillary service provisioning or feed-in tariffs.
[0198] Example 17. The system of example 9, wherein at least one of the plurality of inverter-interfaced energy resource management devices represents one of the plurality of voltage measurement devices.
[0199] Example 18. A method including: receiving, by a distribution network management system including at least one processor, a plurality of voltage measurements, wherein voltage measurements in the plurality of voltage measurements correspond to respective nodes in a plurality of nodes of a distribution network; determining, by the distribution network management system, for each respective node in the plurality of nodes: a respective value of a first voltage-constraint coefficient, based on a respective previous value of the first voltage-constraint coefficient, a respective minimum voltage value for the respective node, and a respective voltage measurement in the plurality of voltage measurements that corresponds to the respective node; and a respective value of a second voltage-constraint coefficient based on a respective previous value of the second voltage-constraint coefficient, a respective maximum voltage value for the respective node, and the respective voltage measurement; and causing at least one inverter-interfaced energy resource in a plurality of inverter-interfaced energy resources that are connected to the distribution network to modify an output power of the at least one inverter-interfaced energy resource based on the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
[0200] Example 19. The method of example 18, wherein causing the at least one inverter-interfaced energy resource to modify the output power includes outputting, to the at least one inverter-interfaced energy resource, the respective value of the first voltage-constraint coefficient for each respective node and the respective value of the second voltage-constraint coefficient for each respective node.
[0201] Example 20. The method of example 18, wherein causing the at least one inverter-interfaced energy resource to modify the output power includes: determining, for the at least one inverter-interfaced energy resource, a respective power setpoint value, based on the respective value of the first voltage-constraint coefficient for each respective node, the respective value of the second voltage-constraint coefficient for each respective node, and a respective previous power setpoint value; and causing the at least one inverter-interfaced energy resource to modify the output power based on the respective power setpoint.
[0202] In one or more examples, the techniques described herein may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over, as one or more instructions or code, a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media, which includes any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media, which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable storage medium.
[0203] By way of example, and not limitation, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but are instead directed to non-transient, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
[0204] Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term processor, as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules. Also, the techniques could be fully implemented in one or more circuits or logic elements.
[0205] The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a hardware unit or provided by a collection of inter-operative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.
[0206] The foregoing disclosure includes various examples set forth merely as illustration. The disclosed examples are not intended to be limiting. Modifications incorporating the spirit and substance of the described examples may occur to persons skilled in the art. These and other examples are within the scope of this disclosure and the following claims.