Proactive Sequential Phase Swapping Scheduling for Power Distribution Systems with a Finite Horizon

20260031626 ยท 2026-01-29

Assignee

Inventors

Cpc classification

International classification

Abstract

A phase swapping system is provided for swapping phases in a power distribution system. The system includes an interface circuitry configured to receive, from sensors arranged at buses in the power distribution system, real-time states at current time step, wherein each of the real-time states are associated with a complex power flowing from an upstream bus to a downstream bus, one or more processors and a non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by the one or more processors, cause the phase swapping system to perform steps of determining a multi-step phase swapping action by using the real-time states and a trained optimal policy generating phase swapping commands based on the multi-step phase swapping action, and transmitting, via the interface circuitry, the phase swapping commands to phase swapping devices arranged at around the sensors, wherein the phase swapping devices are configured to perform the multi-step phase swapping action based on the phase swapping commands.

Claims

1. A phase swapping system for swapping phases in a power distribution system, comprising: an interface circuitry configured to receive, from sensors arranged at buses in the power distribution system, real-time states at current time step of a scheduling horizon, wherein each of the real-time states are associated with a complex power flowing from an upstream bus to a downstream bus; and one or more processors and a non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by the one or more processors, cause the phase swapping system to perform steps of: determining a multi-step phase swapping action by using the real-time states and a trained optimal policy; generating phase swapping commands based on the multi-step phase swapping action; and transmitting, via the interface circuitry, the phase swapping commands to phase swapping devices arranged at around the sensors, wherein the phase swapping devices are configured to perform the multi-step phase swapping action based on the phase swapping commands.

2. The phase swapping system of claim 1, wherein the optimal policy is pretrained offline for the scheduling horizon by using a state-action training set, wherein the state-action training set is generated for determining the multi-step phase swapping action for a training scenario using a multi-step mixed-integer non-linear programming (MINLP), wherein the training scenario is represented by using generation, load profiles for all buses and per-unit cost profiles with respect to the power distribution system.

3. The phase swapping system of claim 1, wherein the trained optimal policy is used to determine a guided set for phase swapping action corresponding to the generation, load and per-unit cost profiles for the scheduling horizon, wherein the guided set for phase swapping action defining time steps, total number of switching, and corresponding locations required for phase swapping.

4. The phase swapping system of claim 1, wherein the multi-step phase swapping action is generated by sequentially determining phase swapping action for each single time step that required phase swapping determined by the optimal policy; wherein single-step phase swapping action is obtained by solving a single-step phase swapping optimization model that formulated by minimizing weighted sum of multiple operational cost functions subject to constraints of radial load flow, substation voltage settings, phase swapping feasibility and a guided set of phase swapping action for the time step.

5. The phase swapping system of claim 4, wherein a multi-step phase swapping optimization model is used for generating single-step phase swapping action for each of multiple consecutive time steps that required phase swapping determined by the optimal policy.

6. The phase swapping system of claim 1, wherein the trained optimal policy is approximated with a deep neural network or random forest model, wherein inputs of the deep neural network or random forest model comprise profiles of power injections resulting from generations and loads with respect to wye-connected and delta-connected phases and locations, and profiles of per unit cost of the distribution system; wherein outputs of the deep neural network or random forest model include total number of phase swapping for each time step, and statuses for phase swapping for each wye-connected and delta-connected loads and generations.

7. The phase swapping system of claim 6, wherein the inputs for each time step include at least total net active and reactive power injections for all fixed-connection buses for each wye-connected phase, and each delta-connected phase pair, active and reactive power injections for each swappable-connection bus for each wye-connected location, and each delta-connected location, and per unit purchase costs for active and reactive powers.

8. The phase swapping system of claim 2, wherein the multi-step phase swapping action is determined by minimizing a cost function, wherein the cost function is expressed as a weighted sum of multiple cost components including a production cost for substation power purchase and generation and load curtailments, a penalty cost for branch current limit and bus voltage limit violations, a penalty cost for active power, reactive power, current and voltage imbalances, and a cost for phase swapping operations for all time steps within a scheduling horizon, while satisfied at least constraints of radial load flow for all time steps within the horizon.

9. The phase swapping system of claim 1, wherein each generation and load is wye-connected or delta-connected, wherein each wye-connected generation and load have three wye-connected locations and each location may assign to a wye-connected phase, wherein each delta-connected generation and load have three delta-connected locations and each location may assign to a delta-connected phase-pair.

10. The phase swapping system of claim 9, wherein delta-connected generation and load is converted to equivalent wye-connected generation and load through a delta-to-wye coversion matrix defined by assuming balanced three phases.

11. The phase swapping system of claim 8, wherein radial load flow model is used to represent operational constraints of the power distribution system by using a generic branch model; wherein the generic branch is a line segment, a voltage regulator, or a transformer; wherein the load flow for each branch is represented using a set of equations related to branch voltage drop, bus current balance or bus power balance, and power flows relating to bus voltages and branch currents or branch powers.

12. The phase swapping system of claim 11, wherein the generic branch is represented using a regulated model; where the regulated model connects a regulation component with a series branch, wherein the regulation component is modeled using a voltage amplifying matrix and a current amplifying matrix, and the series branch is modeled using a series impedance matrix and two shunt admittance matrices at its terminal buses.

13. The phase swapping system of claim 11, wherein squared branch currents and squared branch currents are used to represent branch voltage drop, bus power balance and relating expanded power flows with squared currents and squared voltages based on the regulated model; wherein a squared current is defined as a vector of phase currents times a conjugate transpose of the vector of phase current, wherein a squared voltage is defined as a vector of phase voltage times a conjugate transpose of the vector of phase voltages; wherein a expanded power flow is defined as a vector of bus phase voltages times a vector of branch phase currents.

14. The phase swapping system of claim 11, wherein branch currents and bus voltages are used to represent branch voltage drop, bus current balance and relating power flows with branch currents and bus voltages based on the regulated model.

15. The phase swapping system of claim 1, wherein phase swapping action is represented by using a matrix for assigning each wye-connected location to a phase for each wye-connected load and generation, and a matrix for assigning each delta-connected location to a phase-pair for each delta-connected generation and load.

16. The phase swapping system of claim 1, wherein phase swapping command for a wye-connected generation or load is described by a series of connected phases at previous and current time steps, wherein phase swapping command for a delta-connected generation or load is described by a series of phase-pairs at previous and current time steps.

17. A non-transitory computer-readable medium storing a phase swapping program including instructions that, when executed by a processor, causes a phase swapping system connected to a power distribution system through an interface circuitry, to: receive, from sensors arranged at buses in the power distribution system, real-time states at current time step of a scheduling horizon, wherein each of the real-time states are associated with a complex power flowing from an upstream bus to a downstream bus; determine a multi-step phase swapping action by using the real-time states and a trained optimal policy; generate phase swapping commands based on the multi-step phase swapping action; and transmit, via the interface circuitry, the phase swapping commands to phase swapping devices arranged at around the sensors, wherein the phase swapping devices are configured to perform the multi-step phase swapping action based on the phase swapping commands.

18. The non-transitory computer-readable medium of claim 17, wherein the optimal policy is pretrained offline for the scheduling horizon by using a state-action training set, wherein the state-action training set is generated for determining the multi-step phase swapping action for a training scenario using a multi-step mixed-integer non-linear programming (MINLP), wherein the training scenario is represented by using generation, load profiles for all buses and per-unit cost profiles with respect to the power distribution system.

19. The non-transitory computer-readable medium of claim 17, wherein the trained optimal policy is used to determine a guided set for phase swapping action corresponding to the generation, load and per-unit cost profiles for the scheduling horizon, wherein the guided set for phase swapping action defining time steps, total number of switching, and corresponding locations required for phase swapping.

20. The non-transitory computer-readable medium of claim 17, wherein the multi-step phase swapping action is generated by sequentially determining phase swapping action for each single time step that required phase swapping determined by the optimal policy; wherein single-step phase swapping action is obtained by solving a single-step phase swapping optimization model that formulated by minimizing weighted sum of multiple operational cost functions subject to constraints of radial load flow, substation voltage settings, phase swapping feasibility and a guided set of phase swapping action for the time step.

Description

BRIEF DESCRIPTION OF DRAWINGS

[0018] The present disclosure is further described in the detailed description which follows, in reference to the noted plurality of drawings by way of non-limiting examples of exemplary embodiments of the present disclosure, in which like reference numerals represent similar parts throughout the several views of the drawings. The drawings shown are not necessarily to scale, with emphasis instead generally being placed upon illustrating the principles of the presently disclosed embodiments.

[0019] FIG. 1 shows a schematic of a method for proactive sequential phase swapping in power distribution systems over a finite scheduling horizon.

[0020] FIG. 2A depicts an IEEE 13-node test feeder represented as a one-line diagram.

[0021] FIG. 2B illustrates an unbalanced three-phase power distribution system represented by a full-phase diagram.

[0022] FIG. 2C depicts a modified IEEE 13 node test feeder with phase swapping devices (i.e. phase swapper) represented by a full-phase diagram.

[0023] FIG. 3 is a schematic for modeling a generic branch (i,j)custom-character using the regulated model.

[0024] FIG. 4 shows a set of normalized profiles for load demands, solar generation, wind generation, and power purchase prices.

[0025] FIG. 5A lists the comparison of summarized phase swapping schedules determined using different phase swapping strategies.

[0026] FIG. 5B lists the detailed phase connection changes in the phase swapping schedule, determined using a sequential single-step phase swapping optimization strategy.

[0027] FIG. 5C lists the detailed phase connection changes in the phase swapping schedule, determined using either a simultaneous multi-step phase swapping optimization strategy or a proactive sequential single-step phase swapping optimization strategy.

[0028] FIG. 6A depicts total operational cost variations over time within the finite scheduling horizon using no phase swapping strategy.

[0029] FIG. 6B depicts total operational cost variations over time within the finite scheduling horizon using the sequential single-step phase swapping strategy.

[0030] FIG. 6C depicts total operational cost variations over time within the finite scheduling horizon using the simultaneous multi-step phase swapping strategy.

[0031] FIG. 7A depicts substation by-phase active power variations over time within the finite scheduling horizon using no phase swapping strategy.

[0032] FIG. 7B depicts substation by-phase active power variations over time within the finite scheduling horizon using the sequential single-step phase swapping strategy.

[0033] FIG. 7C depicts substation by-phase active power variations over time within the finite scheduling horizon using the simultaneous multi-step phase swapping strategy.

[0034] FIG. 8A depicts substation by-phase reactive power variations over time within the finite scheduling horizon using no phase swapping strategy.

[0035] FIG. 8B depicts substation by-phase reactive power variations over time within the finite scheduling horizon using the sequential single-step phase swapping strategy.

[0036] FIG. 8C depicts substation by-phase reactive power variations over time within the finite scheduling horizon using the simultaneous multi-step phase swapping strategy.

[0037] FIG. 9 shows a schematic of a system for proactive sequential phase swapping in power distribution systems over a finite scheduling horizon.

[0038] While the above-identified drawings set forth presently disclosed embodiments, other embodiments are also contemplated, as noted in the discussion. This disclosure presents illustrative embodiments by way of representation and not limitation. Numerous other modifications and embodiments can be devised by those skilled in the art which fall within the scope and spirit of the principles of the presently disclosed embodiments.

DETAILED DESCRIPTION

[0039] In the following description, for purposes of explanation, numerous specific details are set forth to provide a thorough understanding of the present disclosure. It will be apparent, however, to one skilled in the art that the present disclosure may be practiced without these specific details. In other instances, apparatuses and methods are shown in block diagram form only to avoid obscuring the present disclosure.

[0040] As used in this specification and claims, the terms for example, for instance, and such as, and the verbs comprising, having, including, and their other verb forms, when used in conjunction with a listing of one or more components or other items, are each to be construed as open ended, meaning that the listing is not to be considered as excluding other, additional components or items. The term based on means at least partially based on. Further, it is to be understood that the phraseology and terminology employed herein are for the purpose of the description and should not be regarded as limiting. Any heading utilized within this description is for convenience only and has no legal or limiting effect.

[0041] The goal of phase swapping scheduling over a given time horizon is to determine phase swapping schemes for each time step within the time horizon to minimize associated operational costs while maintaining system stable and secure operation. This is a multi-step optimization problem. Generally, two different solution strategies can be applied.

[0042] The first strategy involves solving the phase swapping problem sequentially, step by step, where each time step is addressed separately to adjust phase connections for swappable loads and generations according to the previous step values. This approach can quickly obtain solutions, but they are usually locally optimal.

[0043] The second strategy involves solving the multi-step problem as a whole, with all time steps addressed simultaneously. This approach can achieve globally optimal solutions for the entire time horizon but suffers from a heavy computational burden, particularly for large-scale systems.

[0044] To address this, a novel proactive approach is disclosed in this invention. It uses imitative learning (i.e. imitation learning) of multi-period phase swapping optimization to identify the time steps with phase swapping needs and the relevant loads and generations for phase swapping based on predicted load, generation and per-unit cost profiles. Then, an optimal phase swapping scheme is solved only for the necessary time steps with determined sets of loads and generations for phase swapping. By doing so, phase swapping scheduling with better optimality can be determined with reasonably limited computational efforts.

[0045] FIG. 1 is a schematic for the method of proactive sequential phase swapping of power distribution systems over a finite scheduling horizon.

[0046] As shown in FIG. 1, the phase swapping scheduling for a finite planning horizon T includes two stages, the first stage 110 is offline training stage to model the relationship between phase swapping actions, and load, generation and per unit profile states based on imitation learning, and the second stage 120 is online scheduling stage to generate full decisions on phase connection changes and related generation schedule according to real-time load, generation and per unit cost forecasts. The imitation learning mimics a mixed-integer non-linear programming (MINLP) solver of the multi-step phase swapping optimization problem, and the policy demonstrated by the MINLP expert is approximated with a deep neural network or an ensemble random forest model.

[0047] The off-line training stage 110 includes step 130 for defining training scenarios using load, generation and per-unit cost profiles S, step 140 for generating state-action training set D by solving multi-step phase swapping using MINLP, and step 150 for determining optimal phase swapping policy : state.fwdarw.action, that is deciding is phase swapping to be taken and where phase swapping to be taken based on corresponding load, generation and per-unit cost profiles. In this invention, the state for each time step includes the total un-swappable active and reactive power injections for each wye-connected phase and delta-connected phase pair within the system, the active and reactive power injections at each wye-connected location, or delta-connected location for each swappable load/generation, and the action at each time step defines if a phase swapping is needed at the specific time step, how many total phase swaps required, and which swappable load or generation needs phase swapping.

[0048] The online phase swapping scheduling stage 120 includes step 160 for receiving system state s(t), using load, generation and per-unit cost forecasts, step 170 for determining guided action for phase swapping (t)=(s(t)) for each time t, step 180 for determining detailed phase connection changes for each swappable load/generation and substation power purchase decisions at time t, and step 190 for outputting phase swapping scheme for time t. Guided action for phase swapping provides guidance on whether phase swapping is needed at time t, how many swaps are required, and which loads and generations require swapping.

[0049] In this section, we will first propose a generic branch model using the regulated model to represent commonly used branches in power distribution systems, including line segments, voltage regulators, and transformers. Next, we will derive branch-flow-based load flow models for radial distribution systems, either in terms of squared voltages and currents or explicitly using bus voltages and branch currents. Following this, we will present two mixed-integer nonlinear programming models using different load flow formulations to generate training samples for mimicking optimal phase swapping schemes over the finite planning horizon. Finally, we will describe the proactive phase swapping approach, which applies imitation learning to tackle the multi-step phase swapping problem, achieving a good compromise between solution optimality and computational burden.

Unbalanced Three-Phase Power Distribution System

[0050] FIG. 2A shows an exemplary three-phase power distribution system 200, i.e., the IEEE 13-node test feeder, represented using a one-line diagram. As illustrated, the typical power distribution system 200 adopts a radial configuration. Power originates from the main grid (or transmission system) 210, travels through a substation bus (or feeder head) 215, and is delivered to customer loads connected to buses 225 through line segments. The system may incorporate voltage regulation devices like the voltage regulator 235 and transformer 275. It is inherently unbalanced and may consist of three-phase components (e.g., line 246), two-phase components (e.g., line 247), or single-phase components (e.g., line 248).

[0051] FIG. 2B illustrates an unbalanced three-phase power distribution system 200 represented using a full-phase diagram. The power fed from the main grid 210 is measured by sensors 211 at the feeder head 220. Based on grounding conditions, this system can be divided into two portions. The left portion, bounded by the feeder head 220 and the left side of transformer 275, is an ungrounded three-phase three-wire system. In this section, buses 230 are not grounded, and each line segment contains only phase wires. The right portion, starting from the right side of transformer 275 and extending downstream, is a grounded three-phase four-wire system. Here, each line contains a neutral wire in addition to phase wires, and each bus 270 is connected with both phase and neutral wires. Transformer 275 is grounded by connecting one of its terminals to the earth 280. Multiple groundings are commonly adopted for operational and safety needs in power distribution systems. The system includes both delta-connected loads 240, 250, and 260, and wye-connected loads 280, 290, and 295. Wye-connected loads are connected between a phase and the neutral for each phase load component, while delta-connected loads are connected between two phases of the three phases for each phase-pair load component.

[0052] FIG. 2C depicts a modified IEEE 13-node test feeder with phase swapping devices, represented by a full-phase diagram, ignoring neutral connections. This system is modified from the feeder depicted in FIG. 2A by replacing all transformers, voltage regulators, and single or double-phase line segments with three-phase line segments, and adding a solar generator at bus 684 and a wind generator at bus 680. Some loads and generations are phase swappable, while others are not.

[0053] For a phase-swappable load 299, its phase swapping is implemented through an automatic load phase swapping device, phase swapper 298. The load 299 is a single-phase wye-connected load, and its phase can switch among phase A, phase B, and phase C. It currently resides at phase B (solid line represents the initial position, and the dashed line represents candidate positions). Similarly, for a phase-swappable generation 289, its phase can be switched through a generator phase swapping device, phase swapper 288. In this example, the generator 289 is a single-phase delta-connected wind generator. It can be relocated among phase pairs CA, AB, or BC, with its initial position on phase pair CA.

[0054] For a three-phase radial distribution network, we use custom-character={0,1, . . . , n} denoting the set of buses, in which 0 is the index the substation (or point of common coupling to transmission system), and custom-character.sup.+=custom-character.sup.\{0}. We also use custom-character denoting the set of branches connecting between a pair of buses. (i,j) represents a branch connecting an ordered pair of buses (i,j), where bus i lies between bus 0 and bus j. We use (i, j)custom-character and i.fwdarw.j interchangeably.

[0055] For ease of exposition and notation simplicity, we assume that all the buses icustom-character and branches (i,j)custom-character have three phases: a, b, c; and define .sub.: ={a, b, c} and .sub.D: ={ab, bc, ca}. For icustom-character and .sub.,

[00001] let V i

denote the complex voltage on phase of bus i, and define

[00002] V i := [ V i a V i b V i c ] T .

For i.fwdarw.j and .sub., let

[00003] I ij and S ij

denote the current and power flow on the phase of branch from bus i to bus j, and define

[00004] I ij := [ I ij a I ij b I ij c ] T , and S ij := [ S ij a S ij b S ij c ] T .

If any phase is missing, the corresponding voltage, current, or power flow components will be set as zero. Loads and generations at any bus can also be differentiated by their locations, and we can define custom-character.sub.: ={a, b, c} and custom-character.sub.D: ={ab, bc, ca} to represent the location sets for wye-connected and delta-connected loads or generations at a bus with full phases.

[0056] Without loss of generality, let every bus icustom-character have three wye-connected generations and loads (one on each phase, with grounded neutral at three wye-connected locations) and three delta-connected generations and loads (one across each pair of phases, ungrounded at three delta-connected locations). Let

[00005] s G , Y i := [ s G , Y i a s G , Y i b s G , Y i c ] T and s L , Y i := [ s L , Y i a s L , Y i b s L , Y i c ] T

denote the complex power productions and consumptions of wye-connected generations and loads at bus i. Let

[00006] s G , D i := [ s G , D i ab s G , D i bc s G , D i ca ] T and s L , D i := [ s L , D i ab s L , D i bc s L , D i ca ] T

denote the power productions and consumptions of delta-connected generations and loads at bus i, respectively. If a particular phase of a particular type of connection does not exist at bus i, then the corresponding element of S.sub.G,Y.sub.i, S.sub.L,Y.sub.i or S.sub.G,D.sub.i, S.sub.L,D.sub.i are set as 0. In practice, S.sub.G,Y.sub.i, S.sub.L,Y.sub.i or S.sub.G,D.sub.i, S.sub.L,D.sub.i represent the power productions and consumptions observed on the primary windings of the wye and delta-connected service transformers at bus i. Their secondary windings, which connect to loads and distributed energy resources, are ignored from our model. The delta-connected complex power injections at bus i, (S.sub.G,D.sub.iS.sub.L,D.sub.i) will be converted into wye-connected ones, A.sub.S.sub.D.fwdarw.Y(S.sub.G,D.sub.iS.sub.L,D.sub.i) by using a delta-to-wye conversion matrix A.sub.S.sub.D.fwdarw.Ycustom-character.sup.33. The delta-to-wye conversion matrix is determined by assuming voltages are balanced at bus i, that is:

[00007] V i a V i b V i b V i c V i c V i a e j 2 / 3 ,

and set as:

[00008] A S D .fwdarw. Y = [ 1 2 - j 3 6 0 1 2 + j 3 6 1 2 + j 3 6 1 2 - j 3 6 0 0 1 2 + j 3 6 1 2 - j 3 6 ] .

[0057] Any delta-connected generation and load is converted to equivalent wye-connected generation and load through this delta-to-wye coversion matrix defined by assuming balanced three phases.

[0058] There are three typical branches in the power distribution system, including a line segment, a voltage regulator, and a transformer that can be modeled through a generic branch model, as shown in FIG. 3.

[0059] FIG. 3 is a schematic for a generic branch (i,j)custom-character modeled using a regulated model. It can be expressed as a regulator 310, modeled using voltage and current conversion matrices, connected with a series branch 320 modeled using series impedance 330 and shunt admittances 340 and 350. The regulator is connected between bus i and an intermediate bus i, and the series branch is connected between the intermediate bus i and bus j. In the figure, y.sub.Cjcustom-character.sup.33 360 denotes the shunt admittance, such as capacitor banks at bus j, .sub.Uij, .sub.Dijcustom-character.sup.33 denote the equivalent shunt admittance of branch (i, j) introduced by line segments, voltage regulators, or transformer branch (i,j), and z.sub.ijcustom-character.sup.33 denotes the series impedance of branch (i,j). A.sub.Vi.sub..fwdarw.jcustom-character.sup.33 and A.sub.l.sub.i.fwdarw.jcustom-character.sup.33 denote the voltage and current conversion factor matrices between the primary and secondary sides of the voltage regulator or transformer between bus i and bus j. custom-character, custom-character and N denote the set of real, complex, and nonzero natural numbers, respectively. A.sub.V.sub.i.fwdarw.j and A.sub.l.sub.i.fwdarw.j can be regarded as a voltage amplifying matrix and a current amplifying matrix.

[0060] According to the type of branches, we can be configured associated parameter matrices for the branch accordingly. For a line segment (i,j)custom-character, A.sub.V.sub.i.fwdarw.j and A.sub.l.sub.i.fwdarw.j are identity matrices, z.sub.ij, y.sub.Uij and y.sub.Dij are the series impedance between bus i and bus j and shunt admittances evenly allocated to bus i and bus j, respectively.

[0061] For a voltage regulator branch (i,j)custom-character, A.sub.V.sub.i.fwdarw.j and A.sub.l.sub.i.fwdarw.j are determined based on the voltage regulator primary and secondary winding connections, and tap ratios, and used to convert voltages and currents at primary side (bus i) to ones at the secondary side (bus i). z.sub.ij is the series impedance of regulated line segment (i,j), and y.sub.Uij and y.sub.Dij are the half-shunt admittances for the regulated line segment, y.sub.cj is shunt admittance at bus j.

[0062] For a transformer branch (i, j)custom-character, A.sub.V.sub.i.fwdarw.j and A.sub.l.sub.i.fwdarw.j are determined based on the transformer primary and secondary winding connections, and tap ratios. z.sub.ij and y.sub.Uij and y.sub.Dij represent the equivalent series impedance and shunt admittances of the transformer determined according to its impedance and admittance, winding connections and tap ratios.

Radial Load Flow Formulations with Generic Branch Model

[0063] For notational simplicity, we assume that all the buses and lines have three phases. To deal with missing phases on certain buses and lines, we fill zeros at the corresponding locations of current/power/voltage vectors and impedance/admittance matrices.

[0064] The following notations are used to formulate the load flow model. Define j={square root over (1)}. For a complex number c, Re (c) and Im(c) denote its real and imaginary parts, respectively. For ncustom-character, let custom-character.sup.nn denote the space of all n-by-n Hermitian matrices. For any scalar, vector, or matrix A, let A.sup.T, A*,and A.sup.H denote its transpose, element-wise conjugate, and conjugate transpose, respectively. Further, given an n-by n matrix A, diag(A) denotes the column vector composed of its diagonal entries.

[0065] Considered most of power distribution systems installing with voltage regulation devices, such as voltage regulars and transformers, it is important for modeling this kind of devices in load flows to maintain load flow solution with sufficient accuracy, in particular, for phase imbalance problems. Unfortunately, most of conventional branch flow based load flow models ignore such kind of devices in load flow calculations. To this end, this invention extends conventional branch flow based load flow models with capability for modelling voltage regulation devices using the generic branch model as represented by FIG. 3.

[0066] For a branch (i,j)custom-character modeled using regulated model as shown in FIG. 3, bus i and bus j are the sending and receiving buses of (i,j)custom-character, and bus j and bus k are the sending and receiving buses of (j, k)custom-character. Through the regulators, the currents injected into the branch from bus i, I.sub.ij and voltages at bus i, V.sub.i can be regulated into related ones at intermediate bus i,

[00009] I ij and V i , where I ij = A I i .fwdarw. j I ij , V i = A V i .fwdarw. j V i .

Load Flow Formulation-I: Using Squared Voltages and Currents

[0067] For branch (i, j)custom-character, three sets of variables are used to represent network states, including expanded branch flows,

[00010] S ij = V i I ij H 3 3

representing power flowing from bus i toward bus j, squared currents,

[00011] I ij = I ij I ij H 3 3

representing squared current passing through branch from bus i toward bus j, and squared voltages,

[00012] V i = V i V i H 3 3

representing squared voltages at bus i. The actual power flowing from i toward bus j can be calculated as S.sub.ij=diag({tilde over (S)}.sub.ij).

[0068] Using expanded power flows and squared voltages and currents, the power flow on branch (i, j) can be formulated as follows:

[00013] ( 1 ) .Math. i : i .fwdarw. j diag ( A V i .fwdarw. j S ij A I i .fwdarw. j H - A V i .fwdarw. j V i A V i .fwdarw. j H y Uij H - V j y Dij H + z ij y Uij A V i .fwdarw. j S ij A I i .fwdarw. j H - z ij y Uij A V i .fwdarw. j V i A V i .fwdarw. j H y Uij H + z ij A I i .fwdarw. j S ij H A V i .fwdarw. j H y Uij H - z ij A I i .fwdarw. j I ij H A I i .fwdarw. j H ) - diag ( V j y Cj H ) + s j = .Math. k : j .fwdarw. k diag ( S jk ) s j = s G , Y j - s L , Y j + A S D .fwdarw. Y s G , D j - A S D .fwdarw. Y s L , D j ( 2 ) ( 3 ) A V i .fwdarw. j V i A V i .fwdarw. j H - V j = A V i .fwdarw. j S ij A I i .fwdarw. j H z ij H - A V i .fwdarw. j V i A V i .fwdarw. j H y Uij H z ij H + z ij A I i .fwdarw. j S ij H A V i .fwdarw. j H - z ij A I i .fwdarw. j I ij A I i .fwdarw. j H z ij H + z ij A I i .fwdarw. j S ij H A V i .fwdarw. j H y Uij H z ij H - z ij y Uij A V i .fwdarw. j V i A V i .fwdarw. j H + z ij y Uij A V i .fwdarw. j S ij A I i .fwdarw. j H z ij H - z ij y Uij A V i .fwdarw. j V i A V i .fwdarw. j H y Uij H z ij H [ V i S ij S ij H I ij ] = 0 ( 4 )

[0069] Equation (1) enforces the complex power balance at bus j. The left-hand side (LHS) of (1) consists of the complex power leaving bus i towards bus j subtracted complex power flowing along shunt elements at bus i and bus j, power losses on the branch from bus i to bus j, and added complex power injected at bus j, while the right-hand side (RHS) of (1) represents the complex power sent to downstream buses.

[0070] Equation (2) enforces the complex power injected at bus j, S.sub.1 consists of wye-connected complex power generations and loads S.sub.G,Y.sub.j, s.sub.L,Y.sub.j, and complex power generations and loads converted from delta-connected generations and loads, S.sub.G,D.sub.j, s.sub.L,D.sub.j.

[0071] Equation (3) describes the squared voltage drop along the branch from bus i to bus j. It accounts for the voltage at bus i, the voltage drops due to the power flow and the branch series impedance.

[0072] Equation (4) calculates the magnitude of the square current in the branch based on the expanded power flow and the square voltage at the sending end of the branch.

[0073] The equations (1)-(4) can be separated into the real and reactive components to be solved.

[0074] When taking the above-described as operational constraints in phase swapping optimization problems. (1)(3) are convex linear constraints. The equation (4) is a nonconvex because of the quadratic equations. The semidefinite relation is used to obtain a convex surrogate of (4). (4) is relaxed with a positive semidefinite constraint (5) for a branch (i, j)custom-character:

[00014] [ V i S ij S ij H I ij ] 0 ( 5 )

Load Flow Formulation-II: Using Explicit Bus Voltages and Branch Currents

[0075] For a large-scale power distribution system, the branch flow-based model expressed in terms of squared voltages and currents has a considerably larger number of decision variables, which leads to a computational burden when modeled as constraints for phase swapping optimization. To overcome this challenge, a branch flow-based load flow model in terms of explicit bus voltages and branch currents is proposed here. For any branch i.fwdarw.j, three equations are used to describe its power flow allocation. The first equation is a voltage drop equation:

[00015] A V i .fwdarw. j V i - V j = z ij ( A I i .fwdarw. j I ij - y Uij A V i .fwdarw. j V i ) ( 6 )

where V.sub.i and V.sub.j are the complex voltages at sending bus and receiving bus of branch i.fwdarw.j, A.sub.V.sub.i.fwdarw.j is the ideal voltage conversion factor matrices to amplify voltage at sending bus, and A.sub.I.sub.ji j is the ideal current conversion factor matrix to amplify current injected from sending bus into the branch i.fwdarw.j. z.sub.ij, and y.sub.Uij are an equivalent series impedance matrix for branch i.fwdarw.j, and equivalent shunt admittance matrix at bus i.

[0076] The second equation is a current balance equation for any bus j:

[00016] .Math. i : i .fwdarw. j ( A I i .fwdarw. j l ij - y Uij A V i .fwdarw. j V i - y Dij V j ) - y Cj V j + I j = .Math. k : j .fwdarw. k I j k ( 7 )

where bus j has connected with an upstream branch i.fwdarw.j and a set of downstream branches j.fwdarw.k, I.sub.ij and I.sub.jk are the complex currents flowing from bus i to bus j, and from bus j to bus k, and I is the complex injection current at bus j. y.sub.Dij is the equivalent shunt admittance matrix of branch i.fwdarw.j at bus j, y.sub.cj is the admittance matrix at bus j.

[0077] The third equation is a bus power injection equation defined as:

[00017] diag ( V j I j H ) = s G , Y j - s L , Y j + A S D .fwdarw. Y s G , D j - A S D .fwdarw. Y s L , D j ( 8 )

where

[00018] I j H

is the conjugate transpose of complex injected current at bus j, S.sub.G,Y.sub.j and S.sub.L,Y.sub.j are the wye-connected complex power generations and load demands at bus j, S.sub.G,D.sub.j and S.sub.L,D.sub.j are the delta-connected complex power generations and load demands at bus j, A.sub.S.sub.D.fwdarw.Y is a complex power conversion matrix to convert powers from delta-connection to wye-connection.
(6) and (7) are linear equations, but (8) is a nonlinear equation.

[0078] Similarly, the equations (6)-(8) can also be separated into the real and reactive components to be solved.

Optimal Phase Swapping Over a Finite Horizon T

[0079] In distribution networks, the diverse and predominantly ad-hoc allocation of single-phase renewable energy and electric vehicle charging installations leads to increased phase imbalances. These imbalances have the potential to negatively impact and introduce inefficiencies into the power distribution system. The subsequent rise in operational expenditures and the potential degradation of the network infrastructure underline the need for the development and implementation of optimized scheduling strategies. Phase swapping optimization becomes crucial to enhance the reliability and operational efficiency of distribution networks, ultimately lowering the operational costs.

[0080] The goal of phase swapping is to make the feeder well-balanced with minimal number of phase swapping and minimum operation cost increase for a given load, generation and per-unit cost profile over a scheduling cycle/horizon. Assumed each cycle has T time intervals, and the length of each interval is t. For example, a daily phasing swapping scheme includes 24 time steps, and each interval lasts 1.0 hours.

[0081] The optimal phase swapping aims to minimize a weighted sum of costs related to four objectives. The set of weight coefficients (.sup.SUB, .sup.OVR, .sup.IMB, .sup.SWAP) is selected based on the operational context and regulatory requirements, indicating the relative importance and economic implications of each cost component in achieving an optimal balance between production costs, system security, power quality, and device operations within the network constraints.

[0082] We assume any bus j can have three phases, and actual phase availability is defined using a vector of binary parameters,

[00019] A BUS , j ( t ) , Y .

j can have three-phase wye-connected and delta-connected loads and generations allocated at three distinct wye-connected locations, and three distinct delta-connected locations.

[00020] s L , Y j l Y ( t ) and s G , Y j l Y ( t )

are used to represent the forecasted load demands and generation productions at wye-connected location l.sub. of bus j, respectively.

[00021] s L , D j l D ( t ) and s G , D j l D ( t )

are used to represent the forecasted load demands and generation productions at delta-connected location l.sub.D of bus j, respectively.

[00022] A LOC , Y j l Y and A LOC , D j l D

are vectors of binary parameters representing the availability of wye-connected location l.sub., and the delta-connected location l.sub.D of bus j. The actual phase connections for a bus jare determined based on location to phase assignment matrices and corresponding availabilities of locations. The matrix for assigning wye-connected locations to phases at bus j and time step t is expressed as

[00023] { B Y j l Y .fwdarw. Y ( t ) , Y Y , l Y Y } ,

and the matrix for assigning delta-connected locations to phase pairs at bus j and time step t is expressed as

[00024] { B D j l D .fwdarw. D ( t ) , D D , l D D } .

Phase Swapping Formulation-I: Using Squared Voltage and Current Based Load Flow Formulation

[0083] The optimal problem for determining phase swapping actions over the given horizon can be formulated to minimize the cumulative cost over the scheduling horizon of T time steps while satisfying operational requirements for each time step t.

[00025] Minimize .Math. t = 1 T J SQ ( t ) ( 9 )

[0084] The cost function for each time step t, J.sup.SQ (t) is defined as a weighted sum of multiple cost components, including substation production (i.e., power purchase and generation and load curtailment) costs

[00026] C tot SUB ( t ) ,

penalty costs for branch current and bus voltage limit violations

[00027] C tot OVR , SQ ( t ) ,

penalty cost for load (power and current) and voltage imbalance

[00028] C tot IMB , SQ ( t ) ,

and costs for phase swapping

[00029] C tot SWAP ( t )

for the time interval:

[00030] J SQ ( t ) = SUB C tot SUB ( t ) + OVR C tot OVR , SQ ( t ) + IMB C tot IMB , SQ ( t ) + SWAP C tot SWAP ( t ) ( 10 )

[00031] C tot OVR , SQ ( t ) and C tot IMB , SQ ( t )

are expressed in term of squared voltage and currents.

[0085] The cost function JSQ (t) includes the following components:

[00032] ( 11 ) C tot SUB ( t ) = .Math. Y ( C P SUB ( t ) Re ( s 0 ( t ) ) + C Q SUB ( t ) Im ( s 0 ( t ) ) ) + .Math. j + C SG CURT ( t ) ( .Math. l Y Y B CURT , Y j l Y .Math. "\[LeftBracketingBar]" s G , Y j l Y ( t ) .Math. "\[RightBracketingBar]" A LOC , Y j l Y + .Math. l D D B CURT , Y j l Y .Math. "\[LeftBracketingBar]" s G , D j l D ( t ) .Math. "\[RightBracketingBar]" A LOC , D j l D ) + .Math. j + C SL CURT ( t ) ( .Math. l Y Y B CURT , Y j l Y .Math. "\[LeftBracketingBar]" s L , Y j l Y ( t ) .Math. "\[RightBracketingBar]" A LOC , Y j l Y + .Math. l D D B CURT , D j l D .Math. "\[LeftBracketingBar]" s L , l D ( t ) .Math. "\[RightBracketingBar]" A LOC , D j l D ) C tot OVR , SQ ( t ) = .Math. i .fwdarw. j .Math. Y C OVR ( t ) .Math. "\[LeftBracketingBar]" l max , ij ( t ) .Math. "\[RightBracketingBar]" + .Math. i + .Math. Y ( C V ~ max OVR ( t ) .Math. "\[LeftBracketingBar]" V ~ max , i ( t ) .Math. "\[RightBracketingBar]" + C V ~ min OVR ( t ) .Math. "\[LeftBracketingBar]" V ~ min , i ( t ) .Math. "\[RightBracketingBar]" ) ( 12 ) C tot IMB , SQ ( t ) = .Math. Y ( C P IMB ( t ) Re ( IMB s ( t ) ) + C Q IMB ( t ) Im ( IMB s ( t ) ) + C IMB ( t ) IMB ( t ) + C V ~ IMB ( t ) IMB V ~ ( t ) ) ( 13 ) C tot SWAP ( t ) = C SWAP ( t ) n sw ap ( t ) ( 14 )

[0086] .sup.SUB is a weight factor for total production costs including substation active and reactive power purchase costs, renewable generation curtailment costs, and load demand curtailment costs.

[00033] C SG SUB ( t ) and C Q SUB ( t )

are the per unit active and reactive power purchase costs at the substation for the duration of time step t. It is assumed that phases are equally priced.

[00034] s 0 ( t )

is the complex power fed from the substation at phase (and time step t and determined as:

[00035] s 0 ( t ) = .Math. 0 : 0 .fwdarw. i diag ( S 0 i ( t ) ) , Y ( 15 )

[00036] s 0 ( t ) = [ s 0 a ( t ) , s 0 b ( t ) , s 0 c ( t ) ] T .Math. S 0 i ( t )

is the expanded complex power flowing through the substation at bus 0 to downstream bus i.

[00037] C SG CURT ( t ) and C SL CURT ( t )

are the per unit costs for generation and load curtailments for the duration of time step t.

[00038] B CURT , Y j l Y ( t ) and B CURT , D j l D ( t )

are binary variables to represent the cut-off statuses of wye-connected location l.sub. and delta-connection location l.sub.D of bus j and time step t. If a connection is cut off, the connected generation and load at the location will be turn off, and generation and load curtailment costs are incurred. The feasibility of curtailments are constrained by the correspondingly availability of locations:

[00039] B CURT , Y j l Y ( t ) = { 0 , 1 } , B CURT , Y j l Y ( t ) A LOC , Y j l Y , l Y Y , j + ( 16 ) B CURT , D j l D ( t ) = { 0 , 1 } , B CURT , D j l D ( t ) A LOC , D j l D , l D D , j + ( 17 )

.sup.OVR is a weight factor for total penalty costs for operational limit violations including branch current limits, bus maximum and minimum voltage limits.

[00040] C I OVR ( t ) , C V max OVR ( t ) and C V min OVR ( t )

are the per unit penalty costs for squared current limit violation, maximum squared voltage limit violations, and minimum squared voltage limit violations for the duration of time step t.

[00041] I max , ij ( t )

is the amount of squared current limit violation on branch (i, j), defined as:

[00042] diag ( I ij ( t ) ) I max , ij + I max , ij ( t ) , ( i , j ) ( 18 )

where

[00043] I max , ij = [ ( I max , ij a ) 2 , ( I max , ij b ) 2 , ( I max , ij c ) 2 ] T , I max , ij = [ I max , ij a , I max , ij b , I max , ij c ] T , I max , ij .

is the limit of current on phase of branch (i,j).

[00044] V max , i ( t ) , and V min , i

are the amounts of maximum and minimum squared voltage limit violations at phase of bus i and time step t, and determined as:

[00045] V min , i - V min , i ( t ) diag ( V i ( t ) ) V max , i + V max , i ( t ) , i + ( 19 )

where

[00046] V max , i = [ ( V max , i a ) 2 , ( V max , i b ) 2 , ( V max , i c ) 2 ] T , and V min , i = [ ( V min , i a ) 2 , ( V min , i b ) 2 , ( V min , i c ) 2 ] T , V max , i and V min , i

are the upper and lower limits of voltages on phase of bus i,

[00047] V max , i = [ V max , i a , V max , i b , V max , i c ] T , and V min , i = [ V min , i a , V min , i b , V min , i c ] T .

[0087] .sup.IMB is a weight factor for total penalty costs for phase imbalances including substation active and reactive power phase imbalances, substation current phase imbalances, and system maximum voltage phase imbalances. The penalty costs for phase imbalances are not directly related to real-time operation/dispatch, but phase swapping we would like to impose in our objective function implication of a constraint that along each phase, we want the magnitude of power, current or voltage to be as close as possible to a one third of total power, current or voltage.

[00048] C P IMB ( t ) and C Q IMB ( t )

are the per unit costs for active power and reactive power imbalance penalty for the duration of time step t.

[00049] IMB s ( t )

is the complex power imbalance on phase at time step t, and determined as:

[00050] IMB s ( t ) = s 0 ( t ) - 1 3 .Math. Y s 0 ( t ) , Y ( 20 )

[00051] C IMB ( t )

is the per unit cost of squared current imbalance for the duration of time step t, and

[00052] IMB ( t )

is squared current imbalance for phase at time step t defined as:

[00053] I s q , 0 ( t ) = diag ( .Math. 0 : 0 .fwdarw. i I 0 i ( t ) ) , Y ( 21 ) IMB I ~ ( t ) = .Math. I sq , 0 ( t ) .Math. "\[LeftBracketingBar]" - 1 3 .Math. Y .Math. "\[RightBracketingBar]" I sq , 0 ( t ) .Math. , Y ( 22 )

[00054] I s q , 0 ( t ) = [ I sq , 0 a ( t ) , I sq , 0 b ( t ) , I sq , 0 c ( t ) ] T , I sq , 0 ( t )

is the squared current flowing on phase at the substation.

[00055] C V ~ IMB ( t )

is per unit cost of squared voltage at time step t.

[00056] IMB V ~ ( t )

is the system maximum squared voltage imbalance on phase at time step t, and defined as:

[00057] IMB V ~ ( t ) = max j + .Math. "\[LeftBracketingBar]" .Math. "\[LeftBracketingBar]" V j ( t ) .Math. "\[RightBracketingBar]" - 1 .Math. Y A BUS j .Math. Y .Math. "\[LeftBracketingBar]" V j ( t ) .Math. "\[RightBracketingBar]" A BUS j .Math. "\[RightBracketingBar]" , ( 23 ) Y ,

[00058] A BUS j

is a binary parameter representing the phase availability of phase at bus j.

[00059] V j ( t )

is the squared voltage of phase of bus j.

[0088] .sup.SWAP is a weight factor relating to the total costs for phase swapping numbers. Since each phase swapping operation is associated with certain costs on lineman expenses, maintenance expenses, and planned outage duration if phase swapping is implemented manually, or recovered investment cost, and expected outage cost if implemented automatically. We could not afford to swap phases for all number at all the time. The number of phase swapping n.sub.swap (t) for time step t need to be compromised between benefits and costs. The cost per phase swapping at time step t is pre-determined as C.sup.SWAP(t). n.sub.swap (t) is defined as:

[00060] n sw ap ( t ) = .Math. j + n swap , j ( t ) , ( 24 ) n swap , j ( t ) = ( .Math. l Y Y A LOC , Y j l Y - .Math. l Y Y B CURT , Y j l Y ( t ) - .Math. Y Y .Math. l Y Y B Y j l Y .fwdarw. Y ( t ) B Y j l Y .fwdarw. Y ( t - 1 ) ) + ( .Math. l D D A LOC , Y j l D - .Math. l D D B CURT , D j l D ( t ) - .Math. D D .Math. l D D B D j l D .fwdarw. D ( t ) B D j l D .fwdarw. D ( t - 1 ) ) , ( 25 ) j + B Y j l Y .fwdarw. Y ( t ) = { 0 , 1 } , Y Y , l Y Y , j + ( 26 ) B D j l D .fwdarw. D ( t ) = { 0 , 1 } , D D , l D D , j + ( 27 )

[00061] B Y j l Y .fwdarw. Y ( t )

is a binary variable representing status for assigning phase .sub..sub. to location l.sub.custom-character.sub. at bus j at time step t.

[00062] B D j l D .fwdarw. D ( t )

is a binary variable representing status for assigning phase-pair .sub.D.sub.D to location l.sub.Dcustom-character.sub.D at bus j at time step t. Those two sets of variables are used to represent phase swapping actions.

[0089] The technical constraints must be satisfied for each time step t include load flow equations, substation voltage settings, and phase swapping feasibility constraints.

[0090] Considering the impacts of phase swapping actions, the squared voltage and current based load flow equations at time step t are expressed as:

[00063] .Math. i : i .fwdarw. j diag ( A V i .fwdarw. j S ij ( t ) A I i .fwdarw. j H - A V i .fwdarw. j V i ( t ) A V i .fwdarw. j H y Uij H - V j ( t ) y Dij H + z ij y Uij A V i .fwdarw. j S ij ( t ) A I i .fwdarw. j H - z ij y Uij A V i .fwdarw. j V i ( t ) A V i .fwdarw. j H y Uij H + z ij A I i .fwdarw. j S ij H ( t ) A V i .fwdarw. j H y Uij H - z ij A I i .fwdarw. j I ij H ( t ) A I i .fwdarw. j H ) - diag ( V j ( t ) y Cj H ) + s j ( t ) = .Math. k : j .fwdarw. k diag ( S jk ( t ) ) , ( 28 ) j N + s j ( t ) = .Math. l Y Y B Y j l Y .fwdarw. ( t ) ( s G , Y j l Y ( t ) - s L , Y j l Y ( t ) ) + .Math. D D A S D .fwdarw. Y , D .Math. l D D B D j l D .fwdarw. D ( t ) ( s G , D j l D ( t ) - s L , D j l D ( t ) ) , ( 29 ) Y , j + A V i .fwdarw. j V i ( t ) A V i .fwdarw. j H - V j ( t ) = A V i .fwdarw. j S ij ( t ) A I i .fwdarw. j H z ij H - A V i .fwdarw. j V i ( t ) A V i .fwdarw. j H y Uij H z ij H + z ij A I i .fwdarw. j S ij H ( t ) A V i .fwdarw. j H - z ij A I i .fwdarw. j I ij ( t ) A I i .fwdarw. j H z ij H + z ij A I i .fwdarw. j S ij H ( t ) A V i .fwdarw. j H y Uij H z ij H - z ij y Uij A V i .fwdarw. j V i ( t ) A y i .fwdarw. j H + z ij y Uij A V i .fwdarw. j S ij ( t ) A I i .fwdarw. j H z ij H - z ij y Uij A V i .fwdarw. j V i ( t ) A V i .fwdarw. j H y Uij H z ij H , ( 30 ) ( i , j ) E V i ( t ) I ij ( t ) - S ij ( t ) S ij H ( t ) 0 , ( i , j ) ( 31 )

where

[00064] A S D .fwdarw. Y = ( A S D .fwdarw. Y , D ) 3 3 , and A S D .fwdarw. Y , D

is the element of A.sub.S.sub.D.fwdarw.Y coresponing to row and column .sub.D.

[0091] The substation voltage is fixed, and expressed as:

[00065] V 0 ( t ) = V 0 ref ( t ) ( V 0 ref ( t ) ) H ( 32 )

where

[00066] V 0 ref ( t )

is the vector of given substation three-phase voltages at time step t.

[0092] The assignment matrix for wye-connected loads or generations must satisfy that each location is assigned to at most one phase, and each phase is assigned to at most one location:

[00067] B CURT , Y j l Y + .Math. Y Y B Y j l Y .fwdarw. Y ( t ) = A LOC , Y j l Y , l Y Y , j + ( 33 ) .Math. l Y Y B Y j l Y .fwdarw. Y ( t ) 1 , Y Y , j + ( 34 )

[0093] Where parameter

[00068] A LOC , Y j l Y

indicates the availability of load/generation at location l.sub. at bus j.

[0094] Similarly, the assignment matrix for delta-connected loads or generations must satisfy that each location is assigned to at most one phase-pair, and each phase-pair is assigned to at most one location:

[00069] B CURT , D j l D + .Math. D D B D j l D .fwdarw. D ( t ) = A LOC , D j l D , l D D , j + ( 35 ) .Math. l D D B D j l D .fwdarw. D ( t ) 1 , D D , j + ( 36 )

where

[00070] A LOC , D j l D

indicates the availability of load/generation at location l.sub.D at bus j.

[0095] In summary, the optimal phase swapping problem can formulate as a mixed integer nonlinear programming problem (37), according to:

[00071] ( 1 ) Minimize .Math. t = 1 T J SQ ( t ) ( 37 a ) Subject to : constraints expressed as ( 10 ) ( 36 ) , t = 1 , 2 , .Math. , T ( 37 b )

Phase Swapping Formulation-II: Using Explicit Voltage and Current Based Load Flow Formulation

[0096] Similarly, we can also use explicit voltage and current based load flow model to formulate phase swapping optimization over the finite horizon.

[0097] The cost function to be minimized can be expressed as:

[00072] Minimize .Math. t = 1 T J EXP ( t ) ( 38 )

[0098] J.sup.EXP(t) is the cost function for each time step t, and can be expressed based on explicit voltages and currents as:

[00073] J EXP ( t ) = SUB C tot SUB ( t ) + OVR C tot OVR , EXP ( t ) + IMB C tot IMB , EXP ( t ) + SWAP C tot SWAP ( t ) ( 39 )

[0099] This cost function is defined as a weighted sum of four different groups of cost components

[00074] C tot SUB ( t ) , C tot OVR , EXP ( t ) , C tot IMB , EXP ( t ) and C tot SWAP

with a pre-given weight parameter set {.sup.SUB, .sup.OVR, .sup.IMB, .sup.SWAP}.

[0100] The first cost group,

[00075] C tot SUB ( t )

is associated to operational costs for generating powers met demands, including total active and reactive power purchase costs at the substation, and load and generation curtailment costs at all buses. It is defined as:

[00076] ( 40 ) C tot SUB ( t ) = .Math. Y ( C P SUB ( t ) Re ( s 0 ( t ) ) + C Q SUB ( t ) Im ( s 0 ( t ) ) ) + .Math. j + C SG CURT ( t ) ( .Math. l Y Y B CURT , Y j l Y .Math. "\[LeftBracketingBar]" s G , Y j l Y ( t ) .Math. "\[RightBracketingBar]" A L O C , Y j l Y + .Math. l D D B CURT , D j l D .Math. "\[LeftBracketingBar]" s G , D j l D ( t ) .Math. "\[RightBracketingBar]" A LOC , D j l D ) + .Math. j + C SL CURT ( t ) ( .Math. l Y Y B CURT , Y j l Y .Math. "\[LeftBracketingBar]" s L , Y j l Y ( t ) .Math. "\[RightBracketingBar]" A L O C , Y j l Y + .Math. l D D B CURT , D j l D .Math. "\[LeftBracketingBar]" s L , D j l D ( t ) .Math. "\[RightBracketingBar]" A LOC , D j l D )

[0101] The active and reactive power purchase costs are calculated based on complex power fed from the substation for each time step t,

[00077] s 0 ( t ) ,

.sub. and corresponding per-unit cost coefficients for active and reactive power purchase,

[00078] C P G ( t ) and C Q G ( t ) .

[00079] s 0 ( t ) = .Math. 0 : 0 .fwdarw. i V 0 ( t ) ( I 0 i ( t ) ) H , Y ( 41 )

[00080] I 0 i ( t )

is the complex current flowing through the substation at bus 0 to downstream bus i on phase ,

[00081] V 0 ( t )

is the complex voltage at the substation on phase . The load/generation curtailment costs for any bus j are calculated based on per-unit cost coefficients for load/generation curtailments,

[00082] C SL CURT ( t ) / C SG CURT ( t ) .

The full load or generation at location l.sub. or l.sub.D is cut off if corresponding wye or delta connection curtailment status,

[00083] B CURT , Y j l Y or B CURT , D j l D

is determined as 1. The feasibility constraints of load/generation curtailment variables for bus j at time step t are expressed as:

[00084] B CURT , Y j l Y ( t ) = { 0 , 1 } , B CURT , Y j l Y ( t ) A LOC , Y j l Y , l Y Y , j + ( 42 ) B CURT , D j l D ( t ) = { 0 , 1 } , B CURT , D j l D ( t ) A LOC , D j l D , l D D , j + ( 43 )

[0102] The curtailment statuses are limited to the availability statues of connection location l.sub., and l.sub.D,

[00085] A LOC , Y j l Y , A L O C , D j l D .

[0103] The second cost group,

[00086] C tot OVR , EXP ( t )

quantifies the penalizing costs for branch current violating its thermal threshold or bus voltage violating its lower or upper thresholds, and defined as:

[00087] C tot OVR , EXP ( t ) = .Math. i .fwdarw. j .Math. Y C I OVR ( t ) I max , ij ( t ) + .Math. i + .Math. Y ( C V max OVR ( t ) V max , i ( t ) + C V min OVR ( t ) V min , i ( t ) ) ( 44 )

[00088] C I OVR ( t )

is per unit cost for branch current overlimit at time step t,

[00089] I max , ij ( t )

is branch current overlimit (i.e. limit violation) and determined as:

[00090] .Math. "\[LeftBracketingBar]" I I ij .Math. "\[RightBracketingBar]" I _ ij + I max , ij ( t ) , Y , ( i , j ) ( 45 )

where

[00091] .Math. "\[LeftBracketingBar]" I I ij .Math. "\[RightBracketingBar]"

is the absolute value of complex current

[00092] I I ij , I _ ij

is the upper limit of current on phase of branch (i, j).

[00093] C V max OVR ( t ) and C V min OVR ( t )

are per unit voltage upper and lower limit violation cost at time step t, and

[00094] V max , j ( t ) and V min , j ( t )

are the voltage upper and lower limit violations at bus j and determined as:

[00095] V min , j - V min , j ( t ) .Math. "\[LeftBracketingBar]" V j ( t ) .Math. "\[RightBracketingBar]" V max , j + V max , j ( t ) , j + ( 46 )

[0104] V.sub.max,j and V.sub.min,j are the upper and lower limits of voltages on phase of bus j.

[0105] The third cost group,

[00096] C tot IMB , EXP

captures the costs for penalizing load (active and reactive power, current) and voltage deviations from ideal balance.

[00097] C tot IMB , EXP = .Math. Y ( C P IMB ( t ) .Math. "\[LeftBracketingBar]" Re ( IMB s ( t ) ) .Math. "\[RightBracketingBar]" + C Q IMB ( t ) .Math. "\[LeftBracketingBar]" Im ( IMB s ( t ) ) .Math. "\[RightBracketingBar]" + C I IMB ( t ) IMB I ( t ) + C V IMB ( t ) IMB V ( t ) ) t ( 47 )

[00098] C P IMB ( t ) , C Q IMB ( t ) , C I IMB ( t ) and C V IMB ( t )

are cost efficients penalizing active power, reactive power, current deviations at the substation among phases, and maximum voltage phase deviation among all buses.

[00099] IMB s ( t )

is the load imbalance at substation on phase of time step t, and determined as:

[00100] IMB s ( t ) = s 0 ( t ) - 1 3 .Math. Y s 0 ( t ) , Y ( 48 )

[00101] IMB I ( t )

is the maximum current imbalance at the substation for phase ,

[00102] IMB I ( t ) :

[00103] IMB I ( t ) = max i o .Math. "\[LeftBracketingBar]" .Math. "\[LeftBracketingBar]" I 0 i ( t ) .Math. "\[RightBracketingBar]" - 1 3 .Math. Y .Math. "\[LeftBracketingBar]" I 0 i ( t ) .Math. "\[RightBracketingBar]" .Math. "\[RightBracketingBar]" , Y ( 49 )

[0106] custom-character

is the bus set of downstream buses of the substation.

[00104] IMB V ( t )

is the maximum voltage imbalance on phase over all buses downstream to the substation:

[00105] IMB V ( t ) = max j + .Math. "\[LeftBracketingBar]" .Math. "\[LeftBracketingBar]" V j ( t ) .Math. "\[RightBracketingBar]" - 1 .Math. Y A BUS j .Math. Y .Math. "\[LeftBracketingBar]" V j ( t ) .Math. "\[RightBracketingBar]" A BUS j .Math. "\[RightBracketingBar]" , Y ( 50 )

where each bus may have three phases,

[00106] A BUS j

represent the availability of phase at bus j.

[0107] The fourth cost group,

[00107] C tot SWAP ( t )

is relating to the phase swapping times, and defined as:

[00108] C tot SWAP ( t ) = C SWAP n swap ( t ) ( 51 )

[0108] C.sup.SWAP is the cost per phase swapping, n.sub.swap(t) is the total number of phase swapping at time step t and defined based phase swapping actions for each swappable bus j, n.sub.swap,j (t) using assignment matrices of locations to phases (or phase pairs) as:

[00109] n swap ( t ) = .Math. j + n swap , j ( t ) , ( 52 ) n swap , j ( t ) = ( .Math. l Y Y A L O C , Y j l Y - .Math. l Y Y B CURT , Y j l Y - .Math. Y Y .Math. l Y Y B Y j l Y .fwdarw. Y ( t ) B Y j l Y .fwdarw. Y ( t - 1 ) ) + ( .Math. l D D A LOC , D j l D - .Math. l D D B CURT , D j l D - .Math. D D .Math. l D D B D j l D .fwdarw. D ( t ) B D j l D .fwdarw. D ( t - 1 ) ) , j + ( 53 ) B Y j l Y .fwdarw. Y ( t ) = { 0 , 1 } , j + , Y Y l Y Y ( 54 ) B D j l D .fwdarw. D ( t ) = { 0 , 1 } , j + , D D , l D D ( 55 )

[0109] The optimal phase swapping scheme for all time steps within the scheduling horizon is determined by minimizing the cumulative cost function (38) while satisfying a set of technical requirements, including load flow equations explicitly expressed using bus voltage and branch current, substation voltage settings, and swapping feasibility constraints.

[0110] Taken into account of phase swapping, the branch flow based load flow model can be expressed using bus voltage and branch currents as:

[00110] A V i .fwdarw. j V i ( t ) - V j ( t ) = z i j ( A I i .fwdarw. j I i j ( t ) - y U i j A V i .fwdarw. j V i ( t ) ) , ( 56 ) .Math. i : i .fwdarw. j ( A I i .fwdarw. j I i j ( t ) - y Uij A V i .fwdarw. j V i ( t ) - y Dij V j ( t ) ) - y Cj V j ( t ) + I j ( t ) = .Math. k : j .fwdarw. k I j k ( t ) , ( i , j ) ( 57 ) V j ( t ) ( I j ( t ) ) * = .Math. l Y Y B Y j l Y .fwdarw. ( t ) ( s G , Y j l Y ( t ) - s L , Y j l Y ( t ) ) + .Math. D D A S D .fwdarw. Y , D .Math. l D D B D j l D .fwdarw. D ( t ) ( s G , D j l D ( t ) - s L , D j l D ( t ) ) , Y , j + ( 58 )

[0111] The substation voltage is fixed:

[00111] V 0 ( t ) = V 0 ref ( t ) , ( 59 )

[0112] Where

[00112] V 0 ref ( t )

is given substation three-phase voltages at time step t.

[0113] To maintain the feasibility of the assignment matrix for wye-connected and delta-connected loads or generations, it is required that the assignment matrix for wye-connected loads or generations must satisfy that each available location is only assigned to one phase, and each phase is assigned no more than 1 of available location, and the assignment matrix for delta-connected loads or generations must satisfy that each available location is only assigned to one phase pair, and each phase pair is assigned no more than 1 of available location:

[00113] A CURT , Y j l Y + .Math. Y Y B Y j l Y .fwdarw. Y ( t ) = A L O C , Y j l Y , l Y Y , j + ( 60 ) .Math. l Y Y B Y j l Y .fwdarw. Y ( t ) 1 , Y Y , i + ( 61 ) A CURT , D j l D + .Math. D D B D j l D .fwdarw. D ( t ) = A LOC , D j l D , l D D , j + ( 62 ) .Math. l D D B D j l D .fwdarw. D ( t ) 1 , D D , i + ( 63 )

[0114] To summarize the above-described branch currents and bus voltages based formulation, a multi-step phase swapping optimization can be formulated as an mixed integer nonlinear programming problem (64), according to:

[00114] ( 1 ) Minimize .Math. t = 1 T J EXP ( t ) ( 64 a ) Subject to : constraints expresssed as ( 38 ) ~ ( 63 ) , t = 1 , 2 , .Math. , T ( 64 b )

[0115] As shown either in formulation-I or formulation-II, the phase swapping scheduling over a fine horizon is a mixed-integer nonlinear programming problem. We can determine an optimal scheme for phase swapping for each time step based on the solution of the formulated problem. The solution for n.sub.swap(t) provides the total number of phase connection changes for the horizon, and n.sub.swap,l(t) gives the number of phase swapping at bus j at time step t. If n.sub.swap (t)>0, a phase swapping is required for time step t, otherwise no phase swapping is needed. The detailed connection changes for any bus jcustom-character.sup.+ for time step t are given by the instance differences of phase-location-assignment matrices,

[00115] { B Y j l Y .fwdarw. Y ( t ) , Y Y , l Y Y }

and

[00116] { B D j l D .fwdarw. D ( t ) , D D , l D D }

between two consecutive steps t and (t1). Besides, the generation or load curtailment statuses for any bus jcustom-character.sup.+ can be provided by

[00117] B CURT , Y j l Y ( t ) and B CURT , D j l D ( t ) .

By solving the problem, for each time step t, we can get a set of actions for the step with long-term lookahead consideration for upcoming steps, d(t), including the total phase swapping number for each time step, loads/generations required phase swapping for each time step, and loads/generations needing curtailment for each time step.

[0116] For practical power distribution systems, this is a larger-scale mixed integer nonlinear programming (MINLP) problem. Ideally, the problem is solved as a whole, and phase-swapping decisions for all time steps are obtained simultaneously through a one-time solution. However, due to the substantial computational burden, this solution strategy may not be feasible for real-time scheduling of phase swapping. An alternative approach commonly used is solving the single-step phase swapping problem for each step within the horizon sequentially. While sacrificing some optimality significance, this method allows for obtaining a tractable solution step by step. It is hard to find a good compromise between solution optimality and computation speed using either one of these two approaches. To addresses the challenge of phase swap scheduling for larger systems, we proposed a proactive strategy to schedule phase swapping over a finite scheduling horizon. To enable this strategy, we proposed a data-driven scheduler of sequential phase-swapping based on the decisions of mixed integer nonlinear programming (MINLP) optimization. The scheduler via learned regression imitates the MINLP expert which would decide when and where the phase swapping should happen.

Imitation Learning Based Proactive Sequential Phase Swapping Over a Finite Horizon

[0117] In this invention, the optimal multi-step phase swapping problem is cast as a Markov Decision Process (MDP). Once formulated as MDP, we argue that this sequential decision-making problem can be further simplified and implemented as the regression problem. Through this reformulation, a hybrid predictive model can be implemented to guide phase-swapping decisions. The phase swap scheduling is done by learning from the original decision of the mixed integer nonlinear programming solution and imitating the decision by a regressor. This hybrid approach uses the strengths of both traditional optimization models and regression to achieve time-efficient and robust schedule. For reducing the complexity of regression, this invention limits the decisions on the time steps required phase swapping, and the locations required phase swapping for required time steps, and detailed phase swapping actions will be determined by solving a single-step phase swapping optimization for each identified time step having a need for phase swapping and limiting phase swapping at each required time step only at determined strategical locations with consideration of time step interdependency and long-term cost savings.

[0118] Given the complex dynamics of power distribution networks, the problem of optimizing phase swapping can be formulated as an MDP. The MDP framework, allows us to systematically define the problem through states, actions, transition probabilities, and a reward function, under a discrete time horizon indexed by t{0,1, . . . , T}. The state of the system, S at any time t encompasses the current condition of the power distribution network. Specifically, the state includes the current load and generation on all buses and per unit cost (such as active power purchase price, reactive power purchase price, renewable generation curtailment price, and load curtailment price) profiles for the system. Actions, A are decisions made at each timestep to navigate towards optimal network performance, which include load and generation swap decisions for all buses. While transition probabilities in power systems are often governed by deterministic physical laws rather than stochastic processes, the conceptualization within an MDP framework allows for the incorporation of uncertainties and variations in network conditions, demand, and generation. To relate this objective to a reward function for any decision-making or optimization framework that might utilize rewards, such as in reinforcement learning contexts, we define the reward function R as the negative value of (9) or (38), the cost function of the optimizer. Cost function deviations are tied back to the optimization objective by negatively impacting the reward, and motivating solutions that minimize these deviations. The goal is to find a policy : S.fwdarw.A that maximizes the expected cumulative reward over the horizon T, subject to the system dynamics, and operational requirements that ensures system stable and secure operation, such as load flow model to be satisfied.

[0119] Given the optimizer's role in identifying feasible phase swap schedules under fixed observations, the policy guiding these decisions inherently becomes deterministic. This results from the assumption of the predictable nature of load, generation and per-unit cost levels, which, alongside the deterministic principles governing power systems (e.g., Kirchhoff's laws), ensure that the optimizer's solution remains consistent across identical state-action pairs. Consequently, the transition between states in the network is predictable and formalized as:

[00118] s = f ( s , a ) , ( 65 )

where s denotes the future state resulting from action applied to the current state s, with (.Math.) capturing the deterministic equations and constraints of power distribution systems.

[0120] Imitation Learning, applied within the deterministic policy context, simplifies the learning process by directly mimicking the expert policy. We consider finite-horizon MDP with horizon T. State space S is continuous while action space A is discrete and finite. Let a be the initial state distribution, and the transition function that specifies next-state distribution from state s E S under action A be (s, ,.Math.). Policy (s, ) is stationary if it is mapping of states sS to distributions over actions A. The stationary policy is deterministic if each one of its action distributions is concentrated on a single action (s)=, sS. Two key assumptions from the scheduling process of phase swapping that have to be satisfied such that the problem is posed as regression are: [0121] reward function is constrained and finite in each state 0R(s)R.sub.max, SS the apprentice policy .sup.A is deterministic policy that satisfies

[00119] P r ( s , a ) D t E ( t A ( s ) a ) [0122] where .fwdarw.0. The first assumption is true as in the worst-case scenario where phase swapping cannot mitigate phase imbalance the cost will be capped, and as such for other situations, can be only lower. The second assumption is true due to our previous argument on how feasible actions stem deterministic policy for each distinct load, generation and per unit cost levels.

[0123] We propose a data-driven offline approach based on imitation learning to mimic a mixed-integer nonlinear programming (MINLP) solver for problem (37), or (64) as shown in FIG. 1. The offline solving MINLP for problem (37), or (64) can generally attain global optimal solutions once all information is available, e.g., with historical data during the training phase. In order to discover the optimal policy for deciding the required time steps and locations for phase swapping according to load, generation and per unit cost profiles to the underlying optimization problem through trial and error, we let a scheduling agent, i.e. scheduler learn from the expert (i.e., an MINLP solver) directly rather than make it learn from scratch. Such kind of learning from demonstrations leads us to the field of imitation learning.

[0124] In the context of phase swapping scheduling, since the optimal decisions (including the phase swap action) can be acquired directly by solving MINLP problem assuming the availability of all information, the MINLP solver is a qualified expert and the optimal solutions of MINLP form perfect demonstrations. We then train an agent to mimic the MINLP solver to map a state to its optimal action. Given a dataset of state-action pairs

[00120] = { ( s i , a i ) } i = 1

extracted from expert demonstrations, a policy that generates a desired action (s) can be learnt to approximate the expert's optimal decision for a given state s. By doing so, the sequential decision-making problem for phase swapping is reduced to a supervised learning problem, or a regression problem in particular: we try to train a function approximator on custom-character as the policy .

[0125] The policy demonstrated by the MINLP expert is approximated as .sup.A using an apprentice regressor, a deep neural network or a random forest model. The approximated policy will guide our proposed proactive phase swapping schedule strategy for determining when and where the phase swapping should take place. The agent is trained on a data set ((x.sub.1, y.sub.1), . . . , (x.sub.T, y.sub.T)) where each labeled example (x.sub.1, y.sub.1) is drawn independently from a distribution D on XY. X is the feature space and Y is the finite set of labels. For the problem of phase swapping, feature space is defined over all possible generation, load and per unit cost profiles of the feeder. That means that the real and reactive powers of each bus and per-unit costs defines X. The set of labels Y represents action space, which in this case is the decision to when and where to perform load or generation phase swapping.

[0126] The Random Forest model is chosen for its robustness, scalability, and ability to handle high-dimensional data effectively. In this context, Random Forest regression is employed to determine phase swapping statuses and locations for each time step within the planning horizon. This is achieved by training multiple decision trees and outputting the mode class based on their collective predictions. During training, random samples of the training data are selected with replacement using bootstrapping. A decision tree is then built for each sample, where at each node, a random subset of features is considered for splitting. Each tree votes for the most popular class, and the class with the highest number of votes is chosen as the predicted class. Finally, the predictions from all the trees are aggregated to produce the final prediction.

[0127] A deep neural network (DNN) is configured with multiple hidden layers between the input and output layers. These hidden layers allow DNNs to learn increasingly complex representations of the input data. In this invention, the DNN consist of an input layer, two hidden layers, and an output layer. Each layer is composed of neurons (nodes) that process and transform the input data. Relu activation functions are applied to the outputs of neurons within each layer to introduce nonlinearity into the model, enabling it to learn complex mappings between inputs and outputs. The DNN is trained using gradient-based optimization techniques such as backpropagation, where the network learns to minimize a predefined loss function by adjusting the weights and biases of the neurons through iterative optimization algorithms like stochastic gradient descent.

[0128] The power injections are used to define the input features for training samples. The power injection for each bus is defined by deducting load at the bus from generation at the bus. We divide the set of buses with non-zero power injections, custom-character.sub.inj into two sub-sets, custom-character.sub.inj-fix and custom-character.sub.inj-swap. custom-character.sub.inj-fix is the set of buses that have power injections but non-swappable phase connections, and custom-character.sub.ini-swap is the set of buses with power injections and swappable phase connections. The features for each time step may contain total net active and reactive power injections for all fixed-connection buses for each wye-connected phase (i.e. A,B,C), and each delta-connected phase pair (i.e. AB,BC,CA), active and reactive power injections for each swappable-connection bus for each wye-connected location (i.e. A,B,C), and each delta-connected location (i.e. AB,BC,CA), and per unit purchase costs for active and reactive powers if all other per-unit costs are fixed. The label outputs for each time step may contain the total number of phase swapping, and binary values representing if phase swapping is required for each bus swappable load and generation.

[0129] Based on the results generated by the apprentice regressor, we can solve single-step phase swapping optimization problems specifically for the required time steps at designated locations. If multiple consecutive time steps require phase swapping, we can merge them into a multi-step phase swapping optimization. This guided sequential phase swapping optimization strategy can efficiently reduce the time needed to mitigate phase imbalances in power distribution systems in real time.

Proactive Sequential Phase Swapping Algorithm for a Finite Horizon T

[0130] The detailed algorithm (Algorithm 1) for implementing proactive sequential phase swapping based on data-driven scheduler is shown in Table 1.

[0131] For real-time operation, when we get a full set of generation, load and per-unit cost forecasts for all time steps within an upcoming horizon, we can apply the trained scheduler to decide what kind of actions needed for each time step first, then take corresponding further actions when each time step is coming.

[0132] For a time step without a need for phase swapping, we can simply executive a load flow analysis to obtain required attributes for network performance, such as amount of power purchased from the substation, voltage distribution along the feeder, and current allocations within the feeder. If the system is radial, a backward/forward sweep algorithm can be used.

[0133] The backward-forward sweep algorithm iteratively calculates the complex voltage at each bus and the complex current at each branch in the distribution system. During the backward sweep, it computes the branch currents based on the specified power injections and previous computed bus voltages according to current balance equations. Then, in the forward sweep, it calculates the bus complex voltage based on voltage drop equations and the previously computed branch currents. This process continues until convergence is achieved.

[0134] For a time step with a need for phase swapping, we can executive a single-step phase swapping optimization with additional constraints to represent guided actions determined by the regressor. The additional constraints for time step t can be expressed as:

[00121] n s w a p ( t ) = n s w a p * ( t ) , ( 66 ) n s w a p , j ( t ) > 0 , j i n j - s w a p * ( t ) ( 67 )

[00122] n s w a p * ( t ) and i n j - s w a p * ( t )

are the total phase swapping number, and set of buses having loads or generations having a need for phase swapping that determined by the apprentice regressor for time step t.

[0135] For a time period with consecutive steps required for phase swapping, we can formulate a multiple-step optimization using (68), or (69) to obtain detailed phase swapping decisions for each time step within the period. (68) is formulated by using load flow model with squared currents and voltages, and guided actions expressed by (66) and (67).

[00123] ( 1 ) Minimize .Math. t = T b T e J S Q ( t ) ( 68 a ) Subject to : Constraints ( 10 ) ~ ( 36 ) , t = T b , .Math. , T e ( 68 b ) Constraints ( 66 ) ~ ( 67 ) , t = T b , .Math. , T e ( 68 C )

[0136] T.sub.b and T.sub.e are the beginning time step and the ending time step, respectively. For a single time step, the beginning and ending time steps are set as the same.

[0137] (69) is formulated by using load flow model with explicit currents and voltages, and guided actions expressed by (66) and (67):

[00124] ( 1 ) Minimize .Math. t = T b T e J EXP ( t ) ( 69 a ) Subject to : Constraints ( 38 ) ~ ( 63 ) , t = T b , .Math. , T e ( 69 b ) Constraints ( 66 ) ~ ( 67 ) , t = T b , .Math. , T e ( 69 C )

TABLE-US-00001 TABLE 1 Algorithm 1 Proactive Sequential Phase Swapping with Data-Driven Scheduler L obtain generation, load and per unit profiles for upcoming horizon T t 1 while t T do g.sub.t .sup.A(L(t)), obtain guided phase swapping actions if g.sub.t does not include phase swapping then calculate load flow using backward/forward sweep algorithm else if g.sub.t includes phase swapping then determine phase swapping using single-step optimization with constraints of guided actions end if t t + 1 end while

Numerical Examples

[0138] To demonstrate the effectiveness of the invented approach, we tested various phase swapping strategies on the modified IEEE 13-node feeder. The scheduling horizon includes 24 time steps, each lasting one hour.

[0139] As shown in FIG. 2C, the test feeder has three non-swappable (i.e., connection-fixed) loads, including delta-connected loads at bus 671 and wye-connected loads at buses 634 and 675. It also has seven swappable generations and loads. The swappable generations are located at buses 680 and 684, and these two delta-connected generations are initially connected with phases CA and AB, respectively. The generation at bus 680 is a wind power plant, and the generation at bus 684 is a solar power plant. The single-phase loads connected to bus 611, bus 645, and bus 652 are wye-connected with initial locations at phase C, phase B, and phase A, respectively. The single-phase loads connected to buses 646 and 692 are delta-connected, with initial locations between phases BC and CA, respectively.

[0140] FIG. 4 shows the normalized profiles for load demands, solar generation, wind generation, and active power purchase prices for the test system. The horizontal axis 410 represents the time steps along the scheduling horizon, and the vertical axis 420 represents the corresponding normalized values of the load profile 430, PV generation profile 440, wind generation profile 450, and active power purchase price profile 460.

[0141] Four phase swapping scenarios are implemented and compared: [0142] Scenario I: No phase swapping. [0143] Scenario II: Sequential single-step phase swapping optimization. [0144] Scenario III: Simultaneous multi-step phase swapping optimization. [0145] Scenario IV: Proactive sequential phase swapping optimization.

[0146] FIG. 5A compares test results for various phase swapping scenarios. As shown in the figure, the total cost is highest for the scenario without phase swapping (Scenario I). While more phase swapping actions are required, the cost for the multi-step phase swapping scenario or proactive sequential phase swapping (Scenario III or IV) is lower than that for the sequential single-step phase swapping strategy (Scenario II). The proactive sequential phase swapping strategy (Scenario IV) requires the same number of phase swaps and incurs the same cost but demands less computational effort compared to the simultaneous multi-step phase swapping scenario (Scenario III). This comparison underscores the necessity of phase swapping and the effectiveness of the proposed approach in scheduling phase swapping schemes over a finite horizon.

[0147] FIG. 5B lists the phase swapping schedule determined using a sequential single-step phase swapping optimization strategy, i.e. Scenario II.

[0148] FIG. 5C lists the phase swapping schedule determined using a simultaneous multi-step phase swapping optimization strategy (i.e. Scenario III), or a proactive sequential phase swapping optimization strategy (i.e. Scenario IV). Scenario IV and scenario III have the same phase connection changes, so there are no differences on network performances for those two strategies.

[0149] FIGS. 6A-6C compare cost variations along the scheduling horizon for different phase swapping scenarios.

[0150] FIG. 6A depicts total operational cost variations over time within the finite scheduling horizon using no phase swapping strategy (i.e. Scenario-I).

[0151] FIG. 6B depicts total operational cost variations over time within the finite scheduling horizon using the sequential single-step phase swapping strategy (i.e. Scenario-II).

[0152] FIG. 6C depicts total operational cost variations over time within the finite scheduling horizon using the simultaneous multi-step phase swapping strategy or proactive sequential phase swapping strategy (i.e. Scenario-III or IV).

[0153] FIGS. 7A-7C compare active power variations of the substation along the scheduling horizon for different phase swapping scenarios. The labels sub_p_a, sub_p_b, and sub_p_c represent the active powers on phases a, b, and c of the substation, respectively.

[0154] FIG. 7A depicts substation by-phase active power variations over time within the finite scheduling horizon using the no phase swapping strategy (i.e., Scenario I).

[0155] FIG. 7B depicts substation by-phase active power variations over time within the finite scheduling horizon using the sequential single-step phase swapping strategy (i.e., Scenario II).

[0156] FIG. 7C depicts substation by-phase active power variations over time within the finite scheduling horizon using the simultaneous multi-step phase swapping strategy or the proactive sequential phase swapping strategy (i.e., Scenario III or IV).

[0157] FIGS. 8A-8C compare reactive power variations of the substation along the scheduling horizon for different phase swapping scenarios. The labels sub_q_a, sub_q_b, and sub_q_c represent the reactive powers on phases a, b, and c of the substation, respectively.

[0158] FIG. 8A depicts substation by-phase reactive power variations over time within the finite scheduling horizon using no phase swapping strategy(i.e. Scenario-I).

[0159] FIG. 8B depicts substation by-phase reactive power variations over time within the finite scheduling horizon using the sequential single-step phase swapping strategy (i.e. Scenario-II).

[0160] FIG. 8C depicts substation by-phase reactive power variations over time within the finite scheduling horizon using the simultaneous multi-step phase swapping strategy or guided sequential single-step phase swapping strategy (i.e. Scenario-III or IV).

[0161] Upon examining these figures, it becomes evident that the proposed proactive sequential phase swapping strategy, which utilizes guided sequential single-step phase swapping optimizations, offers not only reduced operational costs but also improved power quality compared to strategies involving no-phase swapping or sequential single-step phase swapping. Moreover, it demands less computational effort than simultaneous multi-step phase swapping optimization.

[0162] FIG. 9 shows a schematic of a system for proactive sequential phase swapping in power distribution systems over a finite scheduling horizon.

[0163] The phase swapping system 900 facilitates phase swapping within a power distribution system 200. It includes interface circuitry 912 designed to receive real-time states at time t from sensors 920 (211 in FIG. 2B) located at buses in the power distribution system. Each real-time state corresponds to the complex power flowing from an upstream bus to a downstream bus, and may include per-unit cost for the distribution system. The system also incorporates one or more processors 913 and a non-transitory computer-readable storage medium 915, referred to interchangeably as memory or storage.

[0164] When the computer-executable instructions stored in the medium 915 are executed by the processors 913, the system performs steps to determine a multi-step phase swapping action using the real-time states and a trained optimal policy. This policy generates phase swapping commands based on the determined action. Subsequently, the processors 913 transmit these phase swapping commands 925 to phase swapping devices 930 located near the sensors 920 via the interface circuitry 912. The phase swapping devices 930 then execute the multi-step phase swapping action based on the received commands 925.

[0165] The above-described embodiments of the present invention can be implemented in any of numerous ways. For example, the embodiments may be implemented using hardware, software or a combination thereof. When implemented in software, the software code can be executed on any suitable processor or collection of processors, whether provided in a single computer or distributed among multiple computers. Such processors may be implemented as integrated circuits, with one or more processors in an integrated circuit component. Though, a processor may be implemented using circuitry in any suitable format.

[0166] Also, the embodiments of the invention may be embodied as a method, of which an example has been provided. The acts performed as part of the method may be ordered in any suitable way. Accordingly, embodiments may be constructed in which acts are performed in an order different than illustrated, which may include performing some acts simultaneously, even though shown as sequential acts in illustrative embodiments.

[0167] Use of ordinal terms such as first, second, in the claims to modify a claim element does not by itself connote any priority, precedence, or order of one claim element over another or the temporal order in which acts of a method are performed, but are used merely as labels to distinguish one claim element having a certain name from another element having a same name (but for use of the ordinal term) to distinguish the claim elements.

[0168] Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications can be made within the spirit and scope of the invention.

[0169] Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.