CYBER-PHYSICAL INTEGRATED RESTORATION METHOD AND SYSTEM FOR DISTRIBUTION SYSTEMS BASED ON EMERGENCY MOBILE COMMUNICATIONS

Abstract

A cyber-physical integrated restoration method and system for distribution systems based on emergency mobile communications are provided. After extreme natural disasters which cause serious damage to distribution systems, damages of distribution systems are evaluated through system feedback data. When ground communication base stations are unavailable due to the damages, the method can make full use of existing wireless emergency communication resources to provide emergency communication services, and quickly restore the power supply through distribution automation functions with supports of the backup battery of automatic terminal devices, so as to effectively improve the resilience of distribution systems.

Claims

1. A cooperative cyber-physical distribution system restoration method based on emergency mobile communications, comprising: S1, obtaining data of damaged and faulted lines of a distribution system, and determining locations of line switches and locations of working sites for mobile communication vehicles; S2, modeling an optimal path for the mobile communication vehicles based on the locations of the working sites for the mobile communication vehicles obtained by S1, and obtaining a routing model of the mobile communication vehicles; wherein the routing model of the mobile communication vehicles comprises: moving path constraints and moving time constraints of the mobile communication vehicles, and each of the mobile communication vehicles is represented by a communication agent (CA); S3, modeling repair crews dispatch to repair fault components based on the data obtained by S1, and obtaining a dispatch model of the repair crews; wherein the dispatch model of the repair crews comprises: travel path constraints and travel time constraints of the repair crews, and the repair crews are represented by a repair agent (RA); S4, modeling a distribution system load restoration based on a topology of the distribution system and the locations of the line switches obtained by S1, introducing a concept of an electric agent (EA) and establishing a relationship between a path optimization problem of the electric agent and a distribution system restoration problem through routing tables and arrival time vectors, and obtaining a restoration model of the distribution system; wherein the restoration model of the distribution system comprises: electrical path constraints and electrical time constraints of the distribution system, and an energy flow path of the distribution system is represented by the electric agent (EA); S5, determining dependency relationships among repair crew scheduling, mobile communication vehicle scheduling and distribution system sequence restoration, based on the moving path constraints in S2, the moving time constraints in S2, the travel path constraints in S3, the travel time constraints in S3, the electrical path constraints in S4 and the electrical time constraints in S4; wherein the dependency relationships comprise: interdependence constraints between the repair crew scheduling and the distribution system sequence restoration, and interdependence constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration; S6, considering components and system operation constraints for the distribution system, regarding minimizing a total weighted unserved energy, a total repair time and a use time cost of the mobile communication vehicles as a goal, building a comprehensive optimization model of coordination between distribution system restoration and emergency mobile communication based on a variable time step method, according to the moving path constraints in S2, the moving time constraints in S2, the travel path constraints in S3, the travel time constraints in S3, the electrical path constraints in S4, the electrical time constraints in S4, the interdependence constraints between the repair crew scheduling and the distribution system sequence restoration in S5, and the interdependence constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration in S5; and solving the comprehensive optimization model to obtain results of cooperative cyber-physical distribution system restoration; and S7, restoring communication paths and loads of the distribution system after disasters based on the results.

2. The method according to claim 1, wherein in S2, the moving path constraints in the routing model of the mobile communication vehicles are as follows:
x.sub.ii.sup.C=1, ∀i∈D.sup.C;
x.sub.ii.sup.C=0, ∀i∈W.sup.C;
x.sub.ij.sup.C=0, ∀i∈D.sup.C∪W.sup.C, j∈D.sup.C, i≠j;
x.sub.ij.sup.C+x.sub.ji.sup.C≤1, ∀i,j∈D.sup.C∪W.sup.C;
Σ.sub.j=1,j≠i.sup.n.sup.CAx.sub.ij.sup.C≤n.sub.cap,i.sup.C, ∀i∈D.sup.C;
Σ.sub.j=1.sup.n.sup.CAx.sub.ij.sup.C≤Σ.sub.h=1.sup.n.sup.CAx.sub.hi.sup.C≤1, ∀i∈W.sup.C; where x.sub.ii.sup.C, x.sub.ij.sup.C, x.sub.ji.sup.C and x.sub.hi.sup.C respectively represent elements in a routing table of the mobile communication vehicles, n.sup.CA represents the number of the working sites for the mobile communication vehicles, n.sub.cap,i.sup.C represents the number of the mobile communication vehicles owned by the working site i, D.sup.C represents a gathering center of the mobile communication vehicles, which is a starting point, and W.sup.C represents a set of the working sites for the mobile communication vehicles.

3. The method according to claim 1, wherein in S2, the moving time constraints in the routing model of the mobile communication vehicles are as follows: $t_i^{\mathrm{Ca}}=t_i^{\mathrm{Cd}}=T_{\mathrm{ii}}^C,\forall i\in D^C;$ $t_i^{\mathrm{Ca}}\le t_i^{\mathrm{Cd}}\le T^{\mathrm{MAX}},\forall i\in W^C;$ $\begin{array}{c}{t}_j^{\mathrm{Ca}}\ge t_i^{\mathrm{Cd}}+T_{\mathrm{ij}}^C-\left(1-x_{\mathrm{ij}}^C\right)M\\ t_j^{\mathrm{Ca}}\le t_i^{\mathrm{Cd}}+T_{\mathrm{ij}}^C+\left(1-x_{\mathrm{ij}}^C\right)M\end{array}\},\forall i\in D^C.Math.W^C,j\in W^C;$ $\begin{array}{c}{t}_j^{\mathrm{Ca}}\ge T^{\mathrm{MAX}}-M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{CA}}}{x}_{\mathrm{ij}}^C\\ t_j^{\mathrm{Ca}}\le T^{\mathrm{MAX}}+M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{CA}}}{x}_{\mathrm{ij}}^C\end{array}\},\forall i\in W^C;$ $t_j^{\mathrm{Cd}}\le t_i^{\mathrm{Ca}}+T_j^{\mathrm{Cmin}}-\left(1-{.Math.}_{i=1,i\ne j}^{n^{\mathrm{CA}}}{x}_{\mathrm{ij}}^C\right)M,\forall j\in W^C;$ where t.sub.i.sup.Ca and t.sub.i.sup.Cd respectively represent time for the communication agent to arrive the working site i and leave the working site i, T.sub.ii.sup.C represents start time of a path for the mobile communication vehicles, T.sup.MAX represents a maximum moving time limit for the mobile communication vehicles, T.sub.ij.sup.C represents time for the mobile communication vehicle to move from the working sites i to j, x.sub.ij.sup.C represents an element in a routing table of the mobile communication vehicles, M represents a constant, T.sub.j.sup.Cmin represents minimum time for the mobile communication vehicle to stay at the working site j, D.sup.C represents a gathering center of the mobile communication vehicles, W.sup.C represents a set of the working sites for the mobile communication vehicles, t.sub.j.sup.Ca and t.sub.j.sup.Cd respectively represent time for the communication agent to arrive the working site j and leave the working site j, and n.sup.CA represents the number of the working sites for the mobile communication vehicles.

4. The method according to claim 1, wherein in S3, the travel path constraints in the dispatch model of the repair crews are as follows:
x.sub.ii.sup.R=1, ∀i∈D.sup.R;
x.sub.ii.sup.R=0, ∀i∈W.sup.R;
x.sub.ij.sup.R=0, ∀i∈D.sup.R∪W.sup.R, j∈D.sup.R, i≠j;
x.sub.ij.sup.R+x.sub.ji.sup.R≤1, ∀i,j∈D.sup.R∪W.sup.R;
Σ.sub.j=1,j≠i.sup.n.sup.RAx.sub.ij.sup.R≤n.sub.cap,i.sup.R, ∀i∈D.sup.R;
Σ.sub.j=1.sup.n.sup.RAx.sub.ij.sup.R≤Σ.sub.h=1.sup.n.sup.RAx.sub.hi.sup.R≤1, ∀i∈W.sup.R; where x.sub.ii.sup.R, x.sub.ij.sup.R, x.sub.ji.sup.R and X.sub.hi.sup.R respectively represent elements in a repair routing table, n.sub.cap,i.sup.R represents the number of the repair crews owned by a depot i, D.sup.R represents a set of depots, W.sup.R represents a repair site set, and n.sup.RA represents the number of fault points and depots.

5. The method according to claim 1, wherein in S3, the travel time constraints in the dispatch model of the repair crews are as follows: $t_i^R=T_{\mathrm{ii}}^R,\forall i\in D^R;$ $\begin{array}{c}{t}_j^R\ge t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}+T_i^{\mathrm{MS}}-\left(1-x_{\mathrm{ij}}^R\right)M\\ t_j^R\le t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}+T_i^{\mathrm{MS}}+\left(1-x_{\mathrm{ij}}^R\right)M\end{array}\},\forall i\in \mathrm{SW}.Math.\mathrm{FR},\forall j\in W^R,i\ne j;$ $\begin{array}{c}{t}_j^R\ge t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}-\left(1-x_{\mathrm{ij}}^R\right)M\\ t_j^R\le t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}+\left(1-x_{\mathrm{ij}}^R\right)M\end{array}\},\forall i\in \mathrm{FR}\backslash \mathrm{SW},\forall j\in W^R,i\ne j;$ $\begin{array}{c}{t}_j^R\ge T^{\mathrm{MAX}}-M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{RA}}}{x}_{\mathrm{ij}}^R\\ t_j^R\le T^{\mathrm{MAX}}+M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{RA}}}{x}_{\mathrm{ij}}^R\end{array}\},\forall j\in W^R;$ $f_{r^e\left(f\right)}^R\ge t_f^R+T_f^{\mathrm{RP}},\forall f\in \mathrm{FR}\backslash \mathrm{SW};$ $f_i^R=T_{\mathrm{ii}}^R,\forall f\in \mathrm{FR}\backslash \mathrm{SW},i\ne r^e\left(f\right);$ where t.sub.i.sup.R, t.sub.j.sup.R and t.sub.f.sup.R respectively represent time for the repair crews to arrive the fault components i, j and f, T.sub.ii.sup.R represents start time for the repair crews from a depot, T.sub.ij.sup.R represents time for the repair crews to move from the fault components i to j, x.sub.ij.sup.R represents an element in a repair routing table, T.sub.i.sup.RP represents time for the repair crews to repair the fault component i, T.sub.i.sup.MS represents time for the repair crews to manually operate a fault line switch, M represents a constant, T.sup.MAX represents a maximum travel time limit for the repair crews, n.sup.RA represents a sum of the number of fault points and depots, T.sub.f.sup.RP represents time for the repair crews to repair the fault component f, f.sub.r.sub.e.sub.(f).sup.R represents repair completion time of a node cell with faulted lines inside of it, f.sub.i.sup.R represents completion time for the fault components in a node cell i to be repaired, D.sup.R represents a set of depots, W.sup.R represents a repair site set for the repair crews, FR represents a set of the fault components, r.sup.e(f) is an index conversion of the fault component i from the repair agent to the electric agent, which represents the node cell in which the fault component f is inside, and SW represents a set of the line switches.

6. The method according to claim 1, wherein in S4, the electrical path constraints in the restoration model of the distribution system are as follows:
x.sub.ii.sup.E=1, ∀i∈g.sup.E;
x.sub.ii.sup.E=0, ∀i∈C.sup.E\g.sup.E;
x.sub.ij.sup.E=0, ∀i∈C.sup.E, j∈g.sup.E, i≠j;
x.sub.ij.sup.E=x.sub.ji.sup.E=0, ∀(i,j).Math.SW;
x.sub.ij.sup.E+x.sub.ji.sup.E≤1, ∀(i,j)∈SW;
Σ.sub.h=1.sup.n.sup.EAx.sub.hi.sup.E≤1, ∀i∈C.sup.E;
Σ.sub.j=1.sup.n.sup.EAx.sub.ij.sup.E≤n.sup.EAΣ.sub.h=1.sup.n.sup.EAx.sub.hi.sup.E, ∀i∈C.sup.E; where x.sub.ii.sup.E, x.sub.ij.sup.E and x.sub.ji.sup.E respectively represent elements in an electrical routing table, n.sup.EA represents the number of node cells of the distribution system, C.sup.E represents a set of node cells, g.sup.E represents a set of node cells in which a black start generator or a substation is inside, SW represents a set of the line switches, and x.sub.hi.sup.E represents an energy flow path from the node cells h to i.

7. The method according to claim 1, wherein in S4, the electrical time constraints in the restoration model of the distribution system are as follows: $t_i^E=T_{\mathrm{ii}}^E,\forall i\in {ℊ}^E;$ $\begin{array}{c}{t}_j^E\ge T^{\mathrm{MAX}}-M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{EA}}}{x}_{\mathrm{ij}}^E\\ t_j^E\le T^{\mathrm{MAX}}+M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{EA}}}{x}_{\mathrm{ij}}^E\end{array}\},\forall i\in C^E\backslash {ℊ}^E;$ where t.sub.i.sup.E represents time for a node cell i to be energized, T.sub.ii.sup.E represents starting time for a source node to be energized, t.sub.j.sup.E represents time for a node cell j to be energized, T.sup.MAX represents a maximum travel time limit for the repair crews, x.sub.ij.sup.E represents a binary variable to indicate if branch (i,j) is energized, when x.sub.ij.sup.E=1, it represents a path i to j is energized from the node cells i to j, M represents a constant, C.sup.E represents a set of node cells of the distribution system, g.sup.E represents a set of node cells in which a black start generator or a substation is inside, n.sup.EA represents the number of the node cells of the distribution system.

8. The method according to claim 1, wherein in S5, the interdependent constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration are as follows:
x.sub.ij.sup.E=d.sub.ij.sup.AO+d.sub.ij.sup.MO, ∀(i,j)∈SW;
d.sub.ij.sup.AO≤Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C k∈W.sub.(i,j)′.sup.C;
t.sub.j.sup.E≥t.sub.k.sup.Ca−(2−d.sub.ij.sup.AO−Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C)M, ∀k∈W.sub.(i,j)′.sup.C;
t.sub.j.sup.E≤t.sub.k.sup.Cd−(2−d.sub.ij.sup.AO−Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C)M, ∀k∈W.sub.(i,j)′.sup.C;
t.sub.k.sup.Cd≥max(t.sub.i.sup.E,f.sub.j.sup.R)+T.sub.(i,j).sup.AS−(2−d.sub.ij.sup.AO−Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C)M, ∀k∈W.sub.(i,j)′.sup.C;
t.sub.j.sup.E≥max(t.sub.i.sup.E,f.sub.j.sup.R)+T.sub.(i,j).sup.AS−(1−d.sub.ij.sup.AO)M;
max(t.sub.j.sup.E,f.sub.j.sup.R)≤RT.sub.(i,j)′+(1−d.sub.ij.sup.AO)M; where x.sub.ij.sup.E represents a binary variable to indicate if branch (i,j) is energized, d.sub.ij.sup.AO and d.sub.ij.sup.MO are binary variables indicating if switch (i,j) is automatically/manually operated from i to j, d.sub.ji.sup.AO is a binary variable, x.sub.hk.sup.C represents an element in a routing table, n.sup.CA represents the number of the working sites for the mobile communication vehicles, t.sub.j.sup.E represents time for a node cell j to be energized, t.sub.k.sup.Ca and t.sub.k.sup.Cd respectively represent time for the communication agent to arrive the working site k and leave the working site k, M represents a constant, t.sub.i.sup.E represents time for a node cell i to be energized, f.sub.j.sup.R represents time for the fault components in the node cell j to be repaired, T.sub.(i,j).sup.AS represents operation time of an automatic switch, RT.sub.(i,j)′ represents a residual time of a backup battery of a feeder terminal unit (FTU) on a line (i,j), SW represents a set of the line switches, W.sub.(i,j)′.sup.C represents a line set of a FTU corresponding to the working site, and f.sub.i.sup.R represents time for the fault components in the node cell i to be repaired; wherein the interdependent constraints between the repair crew scheduling and the distribution system sequence restoration are as follows: $d_{\mathrm{ij}}^{\mathrm{MO}}+d_{\mathrm{ji}}^{\mathrm{MO}}={.Math.}_{h=1,h\ne k}^{n^{\mathrm{RA}}}{x}_{\mathrm{hk}}^R,\forall \left(i,j\right)\in \mathrm{SW},k=e^r\left(i,j\right);$ $\begin{array}{c}{d}_{\mathrm{ij}}^{{\mathrm{MO}}_e}+d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\ge 1-\left(1-d_{\mathrm{ij}}^{\mathrm{MO}}\right)M\\ d_{\mathrm{ij}}^{{\mathrm{MO}}_e}+d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\le 1+\left(1-d_{\mathrm{ij}}^{\mathrm{MO}}\right)M\end{array}\},\forall \left(1,j\right)\in \mathrm{SW};$ $\frac{t_{e^r\left(i,j\right)}^R-t_i^E}{M}\le d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\le \frac{t_{e^r\left(i,j\right)}^R-t_i^E}{M}+1,\forall \left(i,j\right)\in \mathrm{SW};$ $\begin{array}{c}{t}_j^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}-\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\\ t_j^E\le t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}+\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\end{array}\},\forall \left(i,j\right)\in \frac{\mathrm{SW}}{F};$ $\begin{array}{c}{t}_j^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}+T_{\left(i,j\right)}^{\mathrm{RP}}-\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\\ t_j^E\le t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}+T_{\left(i,j\right)}^{\mathrm{RP}}+\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\end{array}\},\forall \left(i,j\right)\in \mathrm{SW}.Math.F;$ $\frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}\le d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\le \frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}+1,\forall \left(i,j\right)\in \mathrm{SW}\backslash F;$ $\frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}\le d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\le \frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}+1,\forall \left(i,j\right)\in \mathrm{SW}.Math.F;$ $\begin{array}{c}{t}_j^E\ge t_i^E-\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\right)M\\ t_j^E\le t_i^E+\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\right)M\end{array}\},\forall \left(i,j\right)\in \mathrm{SW};$ $\begin{array}{c}{t}_i^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}\\ t_j^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}\end{array}\},\forall \left(i,j\right)\in \mathrm{SW}.Math.F;$ $t_i^E\ge f_i^R,\forall i\in C^E;$ where d.sub.ij.sup.MO.sup.e and d.sub.ij.sup.MO.sup.de respectively represent the repair crews manually operating the line switch with electricity and without electricity; x.sub.hk.sup.R represents the element in a repair routing table, n.sup.RA represents a sum of the number of fault points and depots, d.sub.ji.sup.MO is a binary variable indicating if the switch (i,j) is manually operated, e.sup.r (i,j) represents an index conversion of the line switch (i,j) from the electric agent to the repair agent, t.sub.e.sub.r.sub.(i,j).sup.R represents time for the repair crews to arrive the fault point, t.sub.i.sup.E represents time for the node cell i to be energized, T.sub.(i,j).sup.MS represents operation time of a manual switch, T.sub.(i,j).sup.RP represents time for the repair crews to repair a faulted line (i,j), F represents a set of faulted line, and C.sup.E represents a set of node cells in the distribution system.

9. The method according to claim 1, wherein in S6, an objective function of the comprehensive optimization model is as follows:
minObj=β.sup.EObj.sup.E+β.sup.RObj.sup.R+β.sup.CObj.sup.C;
Obj.sup.E=Σ.sub.c∈C.sub.Ew.sub.c.sup.Et.sub.c.sup.EΣ.sub.l∈L.sub.cΣ.sub.Ø∈ΦP.sub.l,Ø.sup.L;
Obj.sup.R=w.sub.1.sup.RΣ.sub.i=1.sup.n.sup.RAΣ.sub.j=1,j≠i.sup.n.sup.RAx.sub.ij.sup.RT.sub.ij.sup.R+w.sub.2.sup.RΣ.sub.i=1.sup.n.sup.EAf.sub.i.sup.R;
Obj.sup.C=w.sub.1.sup.CΣ.sub.i=1.sup.n.sup.CAΣ.sub.j=1,j≠i.sup.n.sup.CAx.sub.ij.sup.CT.sub.ij.sup.C+w.sub.2.sup.CΣ.sub.i∈W.sub.C(t.sub.i.sup.Cd−t.sub.i.sup.Ca); where Obj.sup.E, Obj.sup.R and Obj.sup.C are three sub objective functions, which respectively represent the total weighted unserved energy, the total repair time, the use time cost of the mobile communication vehicles, β.sup.E, β.sup.R and β.sup.C are coefficients in front of the three sub objective functions respectively, w.sub.c.sup.E represents a weight value of a node cell c, t.sub.c.sup.E represents time for the node cell c to be energized, P.sub.l,Ø.sup.L represents a load at a node cell l, L.sub.c represents a set of loads in the node cell c, Φ={a, b, c} represents power three-phase, w.sub.1.sup.R and w.sub.2.sup.R respectively represent a weight of the total travel time of all RAs and total repair completion time of all the node cells, n.sup.RA represents the number of fault points and depots, x.sub.ij.sup.R represents an element in the repair routing table, T.sub.ij.sup.R represents time for the repair crews to move between the two fault components, n.sup.EA represents the number of node cells of the distribution system, f.sub.i.sup.R represents time for the fault components in the node cell i to be repaired, w.sub.1.sup.C and w.sub.2.sup.C respectively represent the weight of the total travel time of all CAs and the total duration of stay of CAs at all the working sites, n.sup.CA represents the number of the working sites of the mobile communication vehicles, x.sub.ij.sup.C represents an element in a routing table for the mobile communication vehicles, T.sub.ij.sup.C represents time for the mobile communication vehicles to move from the working sites i to j, W.sup.C represents a set of the working sites for the mobile communication vehicles, and t.sub.i.sup.Ca and t.sub.i.sup.Cd respectively represent time for the communication agent to arrive the working site i and leave the working site i.

10. A cooperative cyber-physical distribution system restoration system based on emergency mobile communications, comprising: a processor and a memory; wherein the memory is stored with at least one instruction, and the processor is configured to, when the at least one instruction is loaded and executed by the processor, implement the method according to claim 1.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0050] FIG. 1 is a deployment diagram of mobile emergency communication vehicles based on a 123-node feeder system.

[0051] FIG. 2 is a schematic diagram of the distribution system restoration without considering the mobile emergency communication.

[0052] FIG. 3 is a schematic diagram of the cooperative cyber-physical distribution system restoration considering the mobile emergency communication.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0053] The technical solutions in the embodiments of the disclosure will be clearly and completely described below in combination with the drawings in the embodiments of the disclosure. Apparently, the described embodiments are some of the embodiments of the disclosure, not all of them. Based on the embodiments in the disclosure, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of the disclosure.

[0054] In the description of the disclosure, it should be understood that the terms “include” and “contain” indicate the existence of the described features, whole, steps, operations, elements and/or components, but do not exclude the existence or addition of one or more other features, whole, steps, operations, elements, components and/or sets thereof.

[0055] It should also be understood that the terms used in the description of the disclosure are only for the purpose of describing specific embodiments and are not intended to limit the disclosure. As used in the description of the disclosure and the appended claims, “a”, “one” and “this” in the singular form are intended to include the plural form unless the context clearly indicates other circumstances.

[0056] It should also be further understood that the term “and/or” used in the description of the disclosure and the appended claims refers to any combination of one or more of the items listed in the associated list and all possible combinations, and includes these combinations.

[0057] Various structural diagrams according to the disclosed embodiments of the disclosure are shown in the accompanying drawings. These figures are not drawn to scale, in which some details are enlarged for the purpose of clear expression, and some details may be omitted. The shapes of various areas and layers shown in the figure and the relative size and position relationship between them are only exemplary. In practice, there may be deviations due to manufacturing tolerances or technical limitations, and those skilled in the art can additionally design areas/layers with different shapes, sizes and relative positions according to actual needs.

[0058] The disclosure provides a cooperative cyber-physical distribution system restoration method based on emergency mobile communications, which first evaluates the system damage degree and obtains the data of damaged and faulted lines. On this basis, mobile emergency communication vehicles are used to improve the situational awareness of the distribution system, so that the distribution automation function can be restored, and the quick closing operation of remote switches can work after extreme disasters. Emergency communication vehicles are represented by “communication agent”, and a scheduling model of emergency communication resources is established through a routing table model; then, the emergency repair job of fault components in the distribution system is modeled, and repair crews are represented by “repair agent (RA)”, and the post disaster emergency repair scheduling model is built through the repair routing table; the energy flow path of the distribution system is represented by virtual “electric agent (EA)”, and the path optimization problem of the electric agent is modeled by the routing table and the arrival time vector; finally, the arrival time of agents is used to constrain the interdependence between the self-healing restoration of the communication network and the distribution system load restoration. Using the variable time step load restoration model, considering system operation constraints and the components restored by the distribution system, the comprehensive optimization model of coordination between the distribution system restoration and the mobile emergency communication based on the variable time step method can be established.

[0059] The disclosure provides a cooperative cyber-physical distribution system restoration method based on emergency mobile communications, including steps S1 to S6.

[0060] S1, evaluating the damage of the distribution system, obtaining the data of damaged and faulted lines, and clarifying (i.e., determining) locations of working sites for mobile emergency communication vehicles.

[0061] S2, building a routing model of mobile emergency communication vehicles, considering a routing table and a time vector model, and a superscript “C” is used to represent the communication agent (CA), that is, the mobile emergency communication vehicle.

[0062] Independent constraints in the routing table are shown as formula (1) to formula (6):

x.sub.ii.sup.C=1, ∀i∈D.sup.C  (1);

x.sub.ii.sup.C=0, ∀i∈W.sup.C  (2);

x.sub.ij.sup.C=0, ∀i∈D.sup.C∪W.sup.C, j∈D.sup.C, i≠j  (3);

x.sub.ij.sup.C+x.sub.ji.sup.C≤1, ∀i,j∈D.sup.C∪W.sup.C  (4);

Σ.sub.j=1,j≠i.sup.n.sup.CAx.sub.ij.sup.C≤n.sub.cap,i.sup.C, ∀i∈D.sup.C  (5);

Σ.sub.j=1.sup.n.sup.CAx.sub.ij.sup.C≤Σ.sub.h=1.sup.n.sup.CAx.sub.hi.sup.C≤1, ∀i∈W.sup.C  (6).

[0063] Where x.sub.ii.sup.C represents the element in the routing table of the mobile emergency communication vehicles, x.sub.ij.sup.C represents the element in the routing table of the mobile emergency communication vehicles, which is a binary variable, if the mobile emergency communication vehicle moves from i to j, x.sub.ij.sup.C=1, n.sup.CA represents the number of candidate deployment sites for mobile emergency communication vehicles (also referred to as the number of working sites for mobile emergency communication vehicles), n.sub.cap,i.sup.C represents the number of mobile communication vehicles owned by the working site i, D.sup.C represents a gathering center of mobile communication vehicles, and W.sup.C represents a set of working sites for mobile communication vehicles. Formulas (1) to (3) indicate that mobile communication vehicles should start from the gathering center of mobile communication vehicles but will not return to the gathering center of mobile communication vehicles, formula (4) indicates that the mobile communication vehicle will not repeat the same path, formula (5) indicates that the number of mobile communication vehicles dispatched by the gathering center of mobile communication vehicles is limited, and formula (6) indicates that one communication working site can only be accessed by one mobile communication vehicle at most.

[0064] Independent constraints of moving time vectors are shown as formula (7) to formula (11):

[00005]$\begin{array}{cc}{t}_i^{\mathrm{Ca}}=t_i^{\mathrm{Cd}}=T_{\mathrm{ii}}^C,\forall i\in D^C;& \left(7\right)\end{array}$$\begin{array}{cc}{t}_i^{\mathrm{Ca}}\le t_i^{\mathrm{Cd}}\le T^{\mathrm{MAX}},\forall i\in W^C;& \left(8\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^{\mathrm{Ca}}\ge t_i^{\mathrm{Cd}}+T_{\mathrm{ij}}^C-\left(1-x_{\mathrm{ij}}^C\right)M\\ t_j^{\mathrm{Ca}}\le t_i^{\mathrm{Cd}}+T_{\mathrm{ij}}^C+\left(1-x_{\mathrm{ij}}^C\right)M\end{array}\},\forall i\in D^C.Math.W^C,j\in W^C;& \left(9\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^{\mathrm{Ca}}\ge T^{\mathrm{MAX}}-M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{CA}}}{x}_{\mathrm{ij}}^C\\ t_j^{\mathrm{Ca}}\le T^{\mathrm{MAX}}+M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{CA}}}{x}_{\mathrm{ij}}^C\end{array}\},\forall i\in W^C;& \left(10\right)\end{array}$$\begin{array}{cc}{t}_j^{\mathrm{Cd}}\le t_j^{\mathrm{Ca}}+T_j^{\mathrm{Cmin}}-\left(1-{.Math.}_{i=1,i\ne j}^{n^{\mathrm{CA}}}{x}_{\mathrm{ij}}^C\right)M,\forall j\in W^C.& \left(11\right)\end{array}$

[0065] Where t.sub.i.sup.Ca and t.sub.i.sup.Cd respectively represent the time for the communication agent to arrive the working site i and to leave the working site i, T.sub.ii.sup.C represents the start time for a path of mobile communication vehicles, T.sup.MAX represents a maximum moving time limit for mobile communication vehicles, T.sub.ij.sup.C represents the time for the mobile communication vehicle to move from the working sites i to j, M represents a constant, T.sub.j.sup.Cmin represents a minimum time for the mobile communication vehicle to stay at the working site j. Formula (7) indicates that mobile communication vehicles start from the gathering center, formula (8) indicates that the time for mobile communication vehicles to leave working sites should be greater than the arrival time and not exceed the maximum time limit, formula (9) indicates a relationship between the time for the mobile communication vehicle to arrive at the working site j and leave the previous working site i, and formula (10) limits that the visited time of the working site j should not exceed a certain value, and formula (11) represents a time relationship between leaving the working site j and arriving the working site j for the mobile communication vehicle.

[0066] S3, considering a routing table of repair crews and a time vector model of repair crews, a dispatch model of repair crews is built, and a superscript “R” is used to represent the repair agent.

[0067] Independent constraints in the repair routing table (i.e., independent repair routing table constraints, or travel path constraints) of repair crews are shown as formula (12) to formula (17):

x.sub.ii.sup.R=1, ∀i∈D.sup.R  (12);

x.sub.ii.sup.R=0, ∀i∈W.sup.R  (13);

x.sub.ij.sup.R=0, ∀i∈D.sup.R∪W.sup.R, j∈D.sup.R, i≠j  (14);

x.sub.ij.sup.R+x.sub.ji.sup.R≤1, ∀i,j∈D.sup.R∪W.sup.R  (15);

Σ.sub.j=1,j≠i.sup.n.sup.RAx.sub.ij.sup.R≤n.sub.cap,i.sup.R, ∀i∈D.sup.R  (16);

Σ.sub.j=1.sup.n.sup.RAx.sub.ij.sup.R≤Σ.sub.h=1.sup.n.sup.RAx.sub.hi.sup.R≤1, ∀i∈W.sup.R  (17).

[0068] Where x.sub.ij.sup.R and x.sub.ii.sup.R respectively represent elements in the repair routing table of repair crews, and the meanings of the formula (12) to (17) are the same as that of the constraints of the routing table of mobile communication vehicles in S2.

[0069] Independent constraints for traveling time of repair crews are shown as formula (18) to formula (23):

[00006]$\begin{array}{cc}{t}_i^R=T_{\mathrm{ii}}^R,\forall i\in D^R;& \left(18\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^R\ge t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}+T_i^{\mathrm{MS}}-\left(1-x_{\mathrm{ij}}^R\right)M\\ t_j^R\le t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}+T_i^{\mathrm{MS}}+\left(1-x_{\mathrm{ij}}^R\right)M\end{array}\},\forall i\in \mathrm{SW}.Math.\mathrm{FR},\forall j\in W^R,i\ne j;& \left(19\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^R\ge t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}-\left(1-x_{\mathrm{ij}}^R\right)M\\ t_j^R\le t_i^R+T_{\mathrm{ij}}^R+T_i^{\mathrm{RP}}+\left(1-x_{\mathrm{ij}}^R\right)M\end{array}\},\forall i\in \mathrm{FR}\backslash \mathrm{SW},\forall j\in W^R,i\ne j;& \left(20\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^R\ge T^{\mathrm{MAX}}-M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{RA}}}{x}_{\mathrm{ij}}^R\\ t_j^R\le T^{\mathrm{MAX}}+M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{RA}}}{x}_{\mathrm{ij}}^R\end{array}\},\forall j\in W^R;& \left(21\right)\end{array}$$\begin{array}{cc}{f}_{r^e\left(f\right)}^R\ge t_f^R+T_f^{\mathrm{RP}},\forall f\in \mathrm{FR}\backslash \mathrm{SW};& \left(22\right)\end{array}$$\begin{array}{cc}{f}_i^R=T_{\mathrm{ii}}^R,\forall f\in \mathrm{FR}\backslash \mathrm{SW},i\ne r^e\left(f\right).& \left(23\right)\end{array}$

[0070] Where t.sub.i.sup.R represents the time for repair crews to arrive a fault point i (also referred to as fault component i), T.sub.ij.sup.R represents the time for repair crews to move between two fault components, x.sub.ij.sup.R represents the element in the repair routing table of repair crews, which is a binary variable, when repair crews move from i to j, x.sub.ij.sup.R=1, T.sub.i.sup.RP represents the time for repair crews to repair the fault component i, T.sub.i.sup.MS represents the time for repair crews to manually operate the faulted line switch, n.sup.RA represents the sum of the number of fault points and working sites, f.sub.i.sup.R represents the time for fault components in the node cell i to be repaired, D.sup.R represents a set of working sites, W.sup.R represents a set of repair sites for repair crews, FR represents a set of fault components, and r.sup.e(f) represents an index conversion of the fault component i from RA to EA. Formula (18) defines the starting time when repair crews start moving, and formulas (19) and (20) respectively define the time from a repair site to the faulted line with switch and without switch. Formula (21) defines the time range of component emergency repair, formula (22) indicates that the repair time of the node cell where the fault is located, which refers to the maximum value of all the fault repair completion time in the node cell, and formula (23) indicates that the repair time of the node cell without the fault component, which is set as the starting time.

[0071] S4, considering an electrical routing table of the distribution system and a time vector model of the distribution system, a restoration model of the distribution system is built, and a superscript “E” is used to represent the electric agent, that is, the repair crews.

[0072] Independent constraints of the electrical routing table are shown as formula (24) to formula (30):

x.sub.ii.sup.E=1, ∀i∈g.sup.E  (24);

x.sub.ii.sup.E=0, ∀i∈C.sup.E\g.sup.E  (25);

x.sub.ij.sup.E=0, ∀i∈C.sup.E, j∈g.sup.E, i≠j  (26);

x.sub.ij.sup.E=x.sub.ji.sup.E=0, ∀(i,j).Math.SW  (27);

x.sub.ij.sup.E+x.sub.ji.sup.E≤1, ∀(i,j)∈SW  (28);

Σ.sub.h=1.sup.n.sup.EAx.sub.hi.sup.E≤1, ∀i∈C.sup.E  (29);

Σ.sub.j=1.sup.n.sup.EAx.sub.ij.sup.E≤n.sup.EAΣ.sub.h=1.sup.n.sup.EAx.sub.hi.sup.E, ∀i∈C.sup.E  (30).

[0073] Where x.sub.ij.sup.E and x.sub.ji.sup.E respectively represents elements in the electrical routing table, which are binary variables, if there is electrical path between node cells i and j, x.sub.ij.sup.E=1, n.sup.EA represents a number of node cells of the distribution system, C.sup.E represents a set of node cells, g.sup.E represents a set of node cells with black start generator or substation, and SW represents a set of switches (also referred to as a set of line switches). Formulas (24) to (26) indicate that the energy flow path should start from the “source node cell” with the black start generator or the substation, formula (27) indicates that the energy flow path between two nodes without switch connection does not exist, formula (28) indicates that the electric agent cannot move more than once along the same path, formula (29) indicates that the distribution system operates in the radial topology, and formula (30) indicates that the energy flow path leaving a node cell can split into multiple paths to meet requirements of tree topology.

[0074] Independent time constraints of the distribution system are shown as formula (31) and formula (32):

[00007]$\begin{array}{cc}{t}_i^E=T_{\mathrm{ii}}^E,\forall i\in {ℊ}^E;& \left(31\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^E\ge T^{\mathrm{MAX}}-M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{EA}}}{x}_{\mathrm{ij}}^E\\ t_j^E\le T^{\mathrm{MAX}}+M{.Math.}_{i=1,i\ne j}^{n^{\mathrm{EA}}}{x}_{\mathrm{ij}}^E\end{array}\},\forall i\in C^E\backslash {ℊ}^E.& \left(32\right)\end{array}$

[0075] Where t.sub.i.sup.E represents the time for the node cell i to be energized, T.sub.ii.sup.E represents the starting time for a source node to be energized. Formula (31) indicates that the source node is energized from the beginning, and formula (32) defines a restoration time range of the distribution system.

[0076] S5, determining dependency relationships among repair crew scheduling, mobile communication vehicle scheduling and distribution system sequence restoration, according to the routing table constraints and the arrival time constraints built by the communication agent, the repair agent and the electric agent. It should be noted that repair crews can operate a manual switch on the line immediately after repairing this faulted line, and can operate other healthy manual switches.

[0077] Interdependent constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration are shown as formula (33) to formula (39):

x.sub.ij.sup.E=d.sub.ij.sup.AO+d.sub.ij.sup.MO, ∀(i,j)∈SW  (33);

d.sub.ij.sup.AO≤Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C k∈W.sub.(i,j)′.sup.C  (34);

t.sub.j.sup.E≥t.sub.k.sup.Ca−(2−d.sub.ij.sup.AO−Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C)M, ∀k∈W.sub.(i,j)′.sup.C  (35);

t.sub.j.sup.E≤t.sub.k.sup.Cd−(2−d.sub.ij.sup.AO−Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C)M, ∀k∈W.sub.(i,j)′.sup.C  (36);

t.sub.k.sup.Cd≥max(t.sub.i.sup.E,f.sub.j.sup.R)+T.sub.(i,j).sup.AS−(2−d.sub.ij.sup.AO−Σ.sub.h=1,h≠k.sup.CAx.sub.hk.sup.C)M, ∀k∈W.sub.(i,j)′.sup.C  (37);

t.sub.j.sup.E≥max(t.sub.i.sup.E,f.sub.j.sup.R)+T.sub.(i,j).sup.AS−(1−d.sub.ij.sup.AO)M  (38);

max(t.sub.j.sup.E,f.sub.j.sup.R)≤RT.sub.(i,j)′+(1−d.sub.ij.sup.AO)M  (39).

[0078] Where d.sub.ij.sup.AO and d.sub.ij.sup.MO each are binary variables indicating if the switch (i,j) is automatically/manually operated from i to j; T.sub.(i,j.sup.AS represents the operation time of an automatic switch, RT.sub.(i,j)′ represents the residual time of the backup battery of a feeder terminal unit (FTU) on the line (i,j), W.sub.(i,j)′.sup.C represents a set of working sites that can cover the feeder terminal unit (FTU) (i,j)′. Formula (33) indicates that healthy automatic switches, they can either be closed remotely by DA or manually by repair crews; formula (34) indicates that the line remote switch can be operated only after the communication function of FTU is restored; formulas (35) to (36) indicate that the remote operation time of the automatic switch (i,j) should be within the time interval [t.sub.k.sup.Ca, t.sub.k.sup.Cd]; formula (37) indicates that the mobile communication vehicle needs to ensure that the line (i,j) is energized before leaving this area; formula (38) indicates that the node cell j can be energized only after the fault is repaired and the line switch is closed; formula (39) indicates that if the FTU is installed at the i end of the line, it should be ensured that the node cell i or the node cell j has been energized before the FTU backup battery is used up.

[0079] Interdependent constraints between the repair crew scheduling and the distribution system sequence restoration are shown as formula (40) to formula (49):

[00008]$\begin{array}{cc}{d}_{\mathrm{ij}}^{\mathrm{MO}}+d_{\mathrm{ji}}^{\mathrm{MO}}={.Math.}_{h=1,h\ne k}^{n^{\mathrm{RA}}}{x}_{\mathrm{hk}}^R,\forall \left(i,j\right)\in \mathrm{SW},k=e^r\left(i,j\right);& \left(40\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{d}_{\mathrm{ij}}^{{\mathrm{MO}}_e}+d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\ge 1-\left(1-d_{\mathrm{ij}}^{\mathrm{MO}}\right)M\\ d_{\mathrm{ij}}^{{\mathrm{MO}}_e}+d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\le 1+\left(1-d_{\mathrm{ij}}^{\mathrm{MO}}\right)M\end{array}\},\forall \left(i,j\right)\in \mathrm{SW};& \left(41\right)\end{array}$$\begin{array}{cc}\frac{t_{e^r\left(i,j\right)}^R-t_i^E}{M}\le d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\le \frac{t_{e^r\left(i,j\right)}^R-t_i^E}{M}+1,\forall \left(i,j\right)\in \mathrm{SW};& \left(42\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}-\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\\ t_j^E\le t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}+\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\end{array}\},\forall \left(i,j\right)\in \mathrm{SW}/F;& \left(43\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}+T_{\left(i,j\right)}^{\mathrm{RP}}-\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\\ t_j^E\le t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}+T_{\left(i,j\right)}^{\mathrm{RP}}+\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_e}\right)M\end{array}\},\forall \left(i,j\right)\in \mathrm{SW}.Math.F;& \left(44\right)\end{array}$$\begin{array}{cc}\frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}\le d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\le \frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}+1,\forall \left(i,j\right)\in \mathrm{SW}\backslash F;& \left(45\right)\end{array}$$\begin{array}{cc}\frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}\le d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\le \frac{t_i^E-\left(t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}+T_{\left(i,j\right)}^{\mathrm{MS}}\right)}{M}+1,\forall \left(i,j\right)\in \mathrm{SW}.Math.F;& \left(46\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_j^E\ge t_i^E-\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\right)M\\ t_j^E\le t_i^E+\left(2-d_{\mathrm{ij}}^{\mathrm{MO}}-d_{\mathrm{ij}}^{{\mathrm{MO}}_{\mathrm{de}}}\right)M\end{array}\},\forall \left(i,j\right)\in \mathrm{SW};& \left(47\right)\end{array}$$\begin{array}{cc}\begin{array}{c}{t}_i^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}\\ t_j^E\ge t_{e^r\left(i,j\right)}^R+T_{\left(i,j\right)}^{\mathrm{RP}}\end{array}\},\forall \left(i,j\right)\in \mathrm{SW}.Math.F;& \left(48\right)\end{array}$$\begin{array}{cc}{t}_i^E\ge f_i^R,\forall i\in C^E.& \left(49\right)\end{array}$

[0080] Where d.sub.ij.sup.MO.sup.e and d.sub.ij.sup.MO.sup.de are binary variables indicating if the switch (i,j) is manually operated from i to j with/without electricity; e.sup.r(i,j) represents an index conversion of the switch (i,j) from EA to RA. Formula (40) indicates that the manual switch (i,j) is operated by repair crews, formula (41) indicates that if switch (i,j) is operated by repair crews, it will be either energized or de-energized during the operation energized, formula (42) indicates that for the energized operation of the switch (i,j) from i to j to energize the node cell j, the node cell i has been energized before the repair crew arrives at it energized; formulas (43) and (44) indicate that the node cell j will be restored immediately after repair crews close switch (i,j) if the switch (i,j) is healthy, or the switch (i,j) will be switched on after it is repaired if the switch (i,j) is damaged; formulas (45) and (46) indicate that when switch (i,j) is de-energized operated from i to j, the node cell i can be energized after the switch (i,j) is repaired and closed; formula (47) indicates that the node cells on two sides of the switch (i,j) will be energized at the same time when it is de-energized operated; formula (48) indicates that the node cell i on the side of the fault line switch should be energized after the line is repaired; and formula (49) indicates that the energized time of the node cell i should be after all fault components inside are repaired.

[0081] S6, considering operation constraints of the distribution system, building a comprehensive optimization model of coordination between the distribution system restoration and mobile emergency communication based on the variable time step method. Mobile communication vehicles are used to improve the situational awareness of the distribution system, maximize the available capacity of distribution automation devices, and achieve the quick closing operation of remote switches after the disasters; thus, loads can be restored within the time when the FTU backup battery is available, and the “golden time” of post disaster load restoration is seized, reducing the loss of power outages. An objective function of the comprehensive optimization model is to maximize the restoration of the distribution system while minimizing the time cost of repair dispatch and mobile communication vehicle deployment. The model considers the space and time vector constraints among mobile communication vehicle deployment, repair dispatch and distribution system load restoration. The optimal path among mobile communication vehicles, the repair crew dispatch and the load restoration can be obtained from model solution results.

[0082] The basic starting point is to reduce the number of time steps of the actual optimization problem and achieve the goal of reducing the computational complexity in the time dimension by selecting only the time steps corresponding to the operation behavior that affects the restoration results of the distribution system and ignoring the rest of the “redundant” time steps.

[0083] The energization status of node cells and switches are linked to the routing table of EA through the formula (50) to formula (52):

[00009]$\begin{array}{cc}{x}_{c_i,t_j}^E=\{\begin{array}{c}0;t_i\ge t_j\\ 1;t_i\le t_j\end{array},\forall c_i\in C^E,\forall t_i,t_j\in P;& \left(50\right)\end{array}$$\begin{array}{cc}{x}_{c_i,t_j}^E={.Math.}_{h=1}^{n^{\mathrm{EA}}}{x}_{\mathrm{hi}}^E,\forall c_i\in C^E;& \left(51\right)\end{array}$$\begin{array}{cc}{x}_{c_i,c_j,t_k}^B=\left(x_{\mathrm{ij}}^E+x_{\mathrm{ji}}^E\right)x_{c_i,t_k}^E{x}_{c_j,t_k}^E,\forall c_i,c_j\in C^E,\left(i,j\right)\in \mathrm{SW}.& \left(52\right)\end{array}$

[0084] Where x.sub.c.sub.i.sub.,t.sub.j.sup.E represents an energization status of a node cell c.sub.i at the time t.sub.j; t.sub.i and t.sub.j are both check points, t.sub.p represents a last check point, x.sub.hi.sup.E represents an energy flow path of the node cells h to i. Formula (50) indicates that the energization status of the node cell at a certain check point depends on whether the node cell is energized before or after the time, formula (51) indicates that whether the node cell c.sub.i is energized at the t.sub.p time depends on whether the node cell is visited by EA; formula (52) indicates whether the switch (i,j) is energized at the t.sub.p time depends on whether the path is visited by EA and whether the node cells at its two ends are energized at the t.sub.p time.

[0085] The objective function of the model is shown as formulas (53) to (56):

minObj=β.sup.EObj.sup.E+β.sup.RObj.sup.R+β.sup.CObj.sup.C  (53);

Obj.sup.E=Σ.sub.c∈C.sub.Ew.sub.c.sup.Et.sub.c.sup.EΣ.sub.l∈L.sub.cΣ.sub.Ø∈ΦP.sub.l,Ø.sup.L  (54);

Obj.sup.R=w.sub.1.sup.RΣ.sub.i=1.sup.n.sup.RAΣ.sub.j=1,j≠i.sup.n.sup.RAx.sub.ij.sup.RT.sub.ij.sup.R+w.sub.2.sup.RΣ.sub.i=1.sup.n.sup.EAf.sub.i.sup.R  (55);

Obj.sup.C=w.sub.1.sup.CΣ.sub.i=1.sup.n.sup.CAΣ.sub.j=1,j≠i.sup.n.sup.CAx.sub.ij.sup.CT.sub.ij.sup.C+w.sub.2.sup.CΣ.sub.i∈W.sub.C(t.sub.i.sup.Cd−t.sub.i.sup.Ca)  (56).

[0086] Where Obj.sup.E, Obj.sup.R and Obj.sup.C are three sub objective functions, which respectively represent the total weighted unserved energy, the total repair time, the deployment and use time of mobile communication vehicles; β.sup.E, β.sup.R and β.sup.C are coefficients in front of the three sub objective functions respectively, we represents a weight value of a node cell, t.sub.c.sup.E represents the time of the node cell c to be energized, P.sub.l,Ø.sup.L represents a load at the node l. In the formula (54), the objective function represents the weighted load restoration. In the formula (55), the objective function represents the repair time. In the formula (56), the objective function represents the deployment and use time of the mobile communication vehicle.

[0087] In another embodiment of the disclosure, a cooperative cyber-physical distribution system restoration system based on mobile emergency communications is provided, which can be used to realize the above cooperative cyber-physical distribution system restoration method based on mobile emergency communications. Specifically, the cooperative cyber-physical distribution system restoration system based on mobile emergency communication includes a data module, a communication agent module, a repair agent module, an electric agent module, a relationship module (i.e., interdependency relationship module) and a restoration module.

[0088] The data module is configured to obtain the data of damaged and faulted lines of the distribution system, and determine locations of line switches and locations of working sites for mobile emergency communication vehicles.

[0089] The communication agent module is configured to model the optimal path for the mobile communication vehicles based on working site locations of mobile communication vehicles obtained by the data module, and obtain moving path constraints and moving time constraints of mobile communication vehicles. The mobile communication vehicle is represented by the communication agent.

[0090] The repair agent module is configured to model repair crews dispatch to repair fault components based on the data of faulted lines obtained by the data module, and obtain travel path constraints and travel time constraints for a dispatch model of repair crews, which are represented by the repair agent.

[0091] The electric agent module is configured to model the distribution system load restoration based on the topology of the distribution system and positions of line switches obtained by the data module, introduce a concept of an electric agent and establish the relationship between a path optimization problem of the electric agent and the distribution system restoration problem through a routing table and arrival time vectors, obtain electrical path constraints and electrical time constraints of the distribution system. The energy flow path of the distribution system is represented by the electric agent.

[0092] The interdependency relationship module is configured to determine dependency relationships among repair crew scheduling, mobile communication vehicle scheduling and distribution system sequence restoration, based on the routing table constraints and the arrival time constraints built by the communication agent, the repair agent and the electric agent.

[0093] The restoration module is configured to consider components and system operation constraints for the distribution system according to the routing table constraints and the arrival time constraints built by the communication agent, the repair agent and the electric agent, interdependence constraints between the repair crew scheduling and the distribution system sequence restoration obtained by the interdependency relationship module, and interdependence constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration obtained by the interdependency relationship module, regard minimizing a total weighted unserved energy, a total repair time and a use time cost of mobile emergency communication vehicles as a goal, build the comprehensive optimization model of coordination between the distribution system restoration and the emergency mobile communication based on the variable time step size method; and solve the comprehensive optimization model to obtain results of the cooperative cyber-physical distribution system restoration.

[0094] In a still another embodiment of the disclosure, a terminal device is provided, the terminal device includes a processor and a memory. The memory is used to store computer programs, the computer programs include program instructions, and the processor is used to execute the program instructions stored in a computer storage medium. The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application specific integrated circuit (ASIC), field-programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., the processer is computing core and control core of the terminal, which is suitable for realizing one or more instructions, specifically suitable for loading and executing one or more instructions to realize the corresponding method flow or corresponding functions. The processor described in the embodiment of the disclosure can be used for the operation of the cooperative cyber-physical distribution system restoration method based on mobile emergency communications, including:

[0095] obtaining the data of damaged and faulted lines of the distribution system, and determining locations of line switches and locations of working sites for mobile emergency communication vehicles; modeling the optimal path for mobile emergency communication vehicles based on the working site locations of mobile communication vehicles, and obtaining moving path constraints and moving time constraints of mobile communication vehicles, the mobile communication vehicle being represented by the communication agent; modeling repair crews dispatch to repair fault components based on the data of faulted lines, obtaining travel path constraints and travel time constraints in the dispatch model of repair crews which are represented by the repair agent; modeling the distribution system load restoration based on the topology of the distribution system and positions of line switches, introducing a concept of an electric agent and establishing the relationship between a path optimization problem of the electric agent and the distribution system restoration problem through routing tables and arrival time vectors, obtaining electrical path constraints and electrical time constraints of the distribution system, and an energy flow path of the distribution system being represented by the electric agent; determining dependency relationships among repair crew scheduling, mobile communication vehicle scheduling and distribution system sequence restoration, based on routing table constraints and arrival time constraints built by the communication agent, the repair agent and the electric agent; and considering components and system operation constraints for the distribution system, regarding minimizing a total weighted unserved energy, a total repair time and a use time cost of mobile emergency communication vehicles as a goal, building the comprehensive optimization model of coordination between the distribution system restoration and the emergency mobile communication based on the variable time step size method, according to the routing table constraints and the arrival time constraints built by the communication agent, the repair agent and the electric agent, interdependence constraints between the repair crew scheduling and the distribution system sequence restoration, and interdependence constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration; and solving the comprehensive optimization model to obtain results of the cooperative cyber-physical distribution system restoration.

[0096] In a still another embodiment of the disclosure, the disclosure further provides a storage medium, specifically a computer-readable storage medium (i.e., memory), which is a memory device in the terminal device for storing programs and data. It can be understood that the computer-readable storage media can include the built-in storage media in the terminal device and, of course, the extended storage media supported by the terminal device. The computer-readable storage medium provides a storage space, which stores the operating system of the terminal. In addition, one or more instructions suitable for being loaded and executed by the processor are also stored in the storage space, which can include one or more computer programs (including program codes). It should be noted that the computer-readable storage medium here can be high-speed random access memory (RAM) or non-volatile memory, such as at least one disk memory.

[0097] The processor can load and execute one or more instructions stored in the computer-readable storage medium to realize the corresponding steps of the cooperative cyber-physical distribution system restoration method based on mobile emergency communications in the above embodiment; one or more instructions in the computer-readable storage medium are loaded by the processor and perform the following steps:

[0098] obtaining the data of damaged and faulted lines of the distribution system, and determining locations of line switches and locations of working sites for mobile emergency communication vehicles; modeling the optimal path for mobile communication vehicles based on working site locations of mobile communication vehicles, and obtaining moving path constraints and moving time constraints of mobile communication vehicles, the mobile communication vehicle being represented by the communication agent; modeling repair crews dispatch to repair fault components based on the data of faulted lines, and obtaining travel path constraints and travel time constraints in the dispatch model of repair crews which are represented by the repair agent; modeling the distribution system load restoration based on the topology of the distribution system and positions of line switches, introducing a concept of an electric agent and establishing the relationship between a path optimization problem of the electric agent and distribution system restoration problem through routing tables and arrival time vectors, obtaining electrical path constraints and electrical time constraints of the distribution system, and an energy flow path of the distribution system being represented by the electric agent; determining dependency relationships among repair crew scheduling, mobile communication vehicle scheduling and distribution system sequence restoration, based on routing table constraints and arrival time constraints built by the communication agent, the repair agent and the electric agent; and considering operation constraints of the distribution system and components restored by the distribution system with objectives of minimizing a total weighted unserved energy, a total repair time and a use time cost of mobile emergency communication vehicles, building the comprehensive optimization model of coordination between the distribution system restoration and the emergency mobile communication based on the variable time step size method, according to the routing table constraints and the arrival time constraints built by the communication agent, the repair agent and the electric agent, interdependence constraints between the repair crew scheduling and the distribution system sequence restoration, and interdependence constraints between the mobile communication vehicle scheduling and the distribution system sequence restoration; and solving the comprehensive optimization model to obtain results of the cooperative cyber-physical distribution system restoration.

[0099] In order to make the purposes, technical solutions and advantages of the embodiments of the disclosure clearer, the technical solutions in the embodiments of the disclosure will be described clearly and completely below in combination with the accompanying drawings in the embodiments of the disclosure. Apparently, the described embodiments are some of the embodiments of the disclosure, not all of them. Generally, components in embodiments of the disclosure described and shown in the accompanying drawings can be arranged and designed through various different configurations. Therefore, the following detailed description of the embodiments of the disclosure provided in the accompanying drawings is not intended to limit the scope of the disclosure claimed, but only represents selected embodiments of the disclosure. Based on the embodiments of the disclosure, all other embodiments obtained by those skilled in the art without creative work belong to the scope of the disclosure.

[0100] Referring to FIG. 1, which shows the schematic diagram of a mobile communication of an on-board base station. In the distribution system, several candidate stations of emergency communication vehicles are set up for the deployment of mobile communication vehicles. Each mobile communication vehicle has a certain coverage radius. A mobile emergency communication vehicle and FTUs within its coverage can form a wireless network and restore the communication function with the control center, thus, FTU can receive the instructions issued by the control center when the backup battery is available.

[0101] In order to verify the effectiveness of the method proposed by the disclosure, the method is tested on IEEE 123-node feeder system. Among them, the main power supply is at node 150, there are four faults in the system, two depots which have 4 emergency repair crews, and 20 number of line switches are distributed in branches of the system. Among them, switches SW95-195, SW450-451, SW300-350, SW250-251 are open during the whole restoration process. Information such as candidate deployment sites of the mobile communication vehicles and the location of FTU can be obtained from FIG. 1. In order to embody the advantages of the disclosure, the following two cases are set.

[0102] Case 1: without considering the coordination of the mobile emergency communication, solving an optimization model of coordination between the emergency repair scheduling and the load restoration, and obtaining the emergency repair scheduling plan and load restoration results.

[0103] Case 2: considering the coordination between mobile emergency communication and repair scheduling, solving the comprehensive optimization model of coordination between the distribution system restoration and the mobile emergency communication, and obtaining the deployment plan, repair scheduling plan and load restoration results of mobile communication vehicles.

[0104] The difference between case 1 and case 2 is that case 2 considers the coordination of mobile emergency communication in the distribution system restoration and the coordination of mobile emergency communication is reflected in constraints, while case 1 does not. Through the comparison of the calculation results of the two cases, the resilience improvement of the advanced emergency communication technology in the distribution system restoration can be obtained.

[0105] The specific implementation steps are as follows:

[0106] For case 1, inputting the original data of the system and solving the following optimization problem:

minObj=β.sup.EObj.sup.E+β.sup.RObj.sup.R

[0107] St. (12)-(32), (40)-(51)

[0108] For case 2: inputting the original data of the system and solving the following optimization problem:

minObj=β.sup.EObj.sup.E+β.sup.RObj.sup.R+β.sup.CObj.sup.C

[0109] St. (1)-(51)

[0110] The distribution system restoration in case 1 and case 2 can be shown in FIG. 2 and FIG. 3. Comparing the two histograms, it can be found that the system restoration speed in case 2 is faster, and the time required for the system to restore to normal state is about 1 hour, which is less than that in case 1. Table 1 compares the result data obtained under the two cases, and the following conclusions can be drawn: when using the restoration method in case 2, {circle around (1)} the total weighted unserved energy unserved energy of the system is smaller; {circle around (2)} because mobile communication vehicles restore some functions of power distribution automation, remote switches can be controlled, and some important loads can be restored before repair crews carry out manual operation, although the operation cost of mobile communication vehicles is increased, it has won valuable post disaster restoration time for the distribution system; {circle around (3)} the travel distance and time of repair crews are reduced, which saves the post disaster repair cost. Furthermore, the comprehensive restoration strategy of coordination between the self-healing restoration of the communication network and the load restoration of the distribution system proposed by the disclosure has the more obvious effect on the distribution system resilience enhancement.

TABLE-US-00001 TABLE 1 Comparison of recovery results between the two cases Time of moving and deployment Total of mobile weighted emergency Comparison unserved Repair communication Restoration result energy/kW time/min vehicles/min time/min Case 1 114000 1020 0 278 Case 2 88400 978 194 209

[0111] To sum up, the disclosure provides the cooperative cyber-physical distribution system restoration method and system based on mobile emergency communications, which has the following characteristics.

[0112] 1. The optimization decision-making technology of using mobile emergency communication vehicles to improve the situational awareness of distribution system under disasters achieves the restoration of the situational awareness of distribution system, under the condition that some network devices are damaged or powered off and unavailable, and ensuring the reliability of information acquisition and instruction transmission after the disasters.

[0113] 2. During distribution system restoration, the cyber-physical characteristics of distribution automation communication system restoration and load restoration operation are considered. With the help of the wireless network composed of emergency communication vehicles, the reliable transmission of information and instructions are guaranteed, so that the automatic terminal devices can quickly restore the load power supply according to the “golden time” provided by the backup battery, effectively enhancing the resilience of distribution system.

[0114] 3. The general routing model is introduced to model different objects in the comprehensive optimization model. The repair crews, mobile emergency communication resources and energy flow paths of the distribution system restoration are represented by “repair agent”, “communication agent” and “electric agent” respectively, which are modeled as path optimization problems through routing table models and arrival time vector models, and the independent constraints of agent movement and the constraints expressing interdependence are established.

[0115] 4. The optimization model of distribution system restoration based on the variable time step method reduces the computational complexity and improves the computational performance compared with restoration model based on the fixed step method.

[0116] Those skilled in the art should understand that the embodiments of the disclosure may provide methods, systems, or computer program products. Therefore, the disclosure may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the disclosure may take the form of computer program products implemented on one or more computer usable storage media (including but not limited to disk memory, compact disc read-only memory (CD-ROM), optical memory, etc.) containing computer usable program codes.

[0117] The disclosure is described with reference to the flowcharts and/or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the disclosure. It should be understood that each process and/or block in the flowcharts and/or block diagrams, and the combination of processes and/or blocks in the flowcharts and/or block diagrams can be realized by computer program instructions. These computer program instructions may be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that instructions executed by the processor of the computer or other programmable data processing device generate a device for realizing the functions specified in one or more processes of the flowcharts and/or one or more blocks of the block diagrams.

[0118] These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific way, so that the instructions stored in the computer-readable memory produce a manufacturing product including an instruction device that implements the functions specified in one or more flows of the flowcharts and/or one or more blocks of the block diagrams.

[0119] These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are performed on the computer or other programmable device to produce computer implemented processing, so that the instructions executed on the computer or other programmable device provide steps for realizing the functions specified in one or more processes of the flowcharts and/or one or more blocks of the block diagrams.

[0120] The above contents are only to explain the technical idea of the disclosure and cannot limit the protection scope of the disclosure. Any changes made on the basis of the technical solutions according to the technical idea proposed by the disclosure fall within the protection scope of the claims of the disclosure.