METHOD FOR PREDICTING OPERATION STATE OF POWER DISTRIBUTION NETWORK WITH DISTRIBUTED GENERATIONS BASED ON SCENE ANALYSIS

Abstract

A method for predicting the operation state of a power distribution network based on scene analysis is provided, comprising the following steps of step 10) obtaining the network structure and historical operation information of a power distribution system; step 20) extracting representative scene sequence fragments of output of the DGs according to historical output sequences of the DGs; step 30) obtaining a multi-scene prediction result of a future single-time section T.sub.0 through matching the historical similar scenes; step 40) establishing a future multi-time section operation scene tree; and step 50) deeply traversing all scenes in the future multi-time section operation scene tree, performing power distribution network load flow analysis for each scene, calculating the line current out-of-limit risk and the busbar voltage out-of-limit risk of the power distribution network, and obtaining a future operation state variation tendency of the power distribution network with the DGs.

Claims

1. A method for predicting an operation state of a power distribution network with distributed generations (DGs) based on scene analysis, comprising the following steps executed by a processor: step 10) obtaining a network structure and historical operation information of the power distribution system, wherein the historical operation information comprises historical output sequences of the DGs and historical demand information of each load point; step 20) extracting representative scene sequence fragments of output of the DGs according to the historical output sequences of the DGs; step 30) matching real time scene with historical similar scenes by calculating a dynamic time warping distance between real-time output sequence fragments and the representative scene sequence fragments of the DGs, so as to obtain a multi-scene prediction result of a future single-time section T.sub.0; step 40) establishing a future multi-time section operation scene tree according to the multi-scene prediction result of the future single-time section; and step 50) deeply traversing all scenes in the future multi-time section operation scene tree, performing a power distribution network load flow analysis for each scene, calculating a line current out-of-limit risk and a busbar voltage out-of-limit risk of the power distribution network, and obtaining a variation tendency of the line current and busbar voltage out-of-limit risks under continuous time sections, namely a future operation state variation tendency of the power distribution network with the DGs; and adjusting the DGs and devices in the power distribution network based on the future operation state variation tendency of the power distribution network with the DGs.

2. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 1, wherein in the step 10), node numbering is performed by traversing the power distribution network, so as to obtain a type of each node and interconnected positions of the DGs, thereby obtaining the network structure of the power distribution system.

3. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 1, wherein the specific process of the step 20) is as follows: step 201) determining historical output sequence fragments, from which the representative scene sequence fragments need to be extracted, of the DG according to a prediction range of the operation state of the power distribution network, recording a length of the historical output sequence fragments as L, and determining a number M of the needed representative scene sequence fragments; step 202) intercepting time sequence fragments with the length of L, from which the representative scene sequence fragments are to be extracted, from the historical output sequence fragments of the DG, and recording the number of the time sequence fragments as N, so as to form a scene set; step 203) calculating an occurrence probability p(.sub.Ci) of each scene sequence fragment in the scene set according to the following formula: $p\left(c_i\right)=\frac{1}{N}i=1,2,3,\mathrm{...}N$ wherein in the formula, c.sub.i represents a i-th scene sequence fragment in the scene set, and i is a scene sequence fragment number; step 204) for each scene sequence fragment c.sub.i, calculating Kantorovich distances between the scene sequence fragment c.sub.i and other scene sequence fragments according to the following formula, finding out a scene sequence fragment nearest to the scene sequence fragment c.sub.i and marking it in the scene set to form a minimum scene distance matrix KD, and calculating a matrix element KD(i), corresponding to the scene sequence fragment c.sub.i, in the KD according to the following formula: $KD\left(i\right)=\text{min}\left\{{‖c_i-c_j‖}_2,j\in \left[1,2,3,\mathrm{...}N\right],j\ne i\right\},i\in \left[1,2,3,\mathrm{...}N\right]$ wherein c.sub.j represents a j-th scene sequence fragment in the scene set, and j is a scene sequence fragment number; step 205) for each scene sequence fragment c.sub.i, multiplying a minimum scene distance corresponding to the scene sequence fragment c.sub.i by the occurrence probability of the scene sequence fragment c.sub.i so as to obtain a minimum scene probability distance corresponding to the scene sequence fragment c.sub.i, finding out a scene sequence fragment with a smallest minimum probability distance in the scene set as a removed scene sequence fragment c*, and removing the removed scene sequence fragment c* from the scene set, wherein the removed scene sequence fragment c* is as follows: $c*=\text{min}\left\{KD\left(i\right)*p\left(i\right)\left|i\in \right.\left[1,2,3,\mathrm{...}N\right]\right\}$ step 206) finding out a scene sequence fragment c.sup.n nearest to the removed scene sequence fragment c*, and updating a probability p(c.sup.n) of c.sup.n according to the following formula: $p\left(c^n\right)=p\left(c*\right)+p\left(c^n\right)$ step 207) setting a total number N of the scene sequence fragments as N-1, and if the total number N of updated scene sequence fragments is M, ending the step 20), otherwise, returning to the step 204).

4. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 1, wherein the specific process of the step 30) is as follows: step 301) calculating a dynamic time warping distance DTW.sub.k between a real-time output sequence and a k-th representative scene sequence fragment of the DG based on the representative scene sequence fragments of the historical output sequences of the DG extracted in the step 20); and step 302) taking a reciprocal of the dynamic time warping distance and performing a normalization treatment on the reciprocal to obtain a similarity of the real-time output sequence and the k-th representative scene sequence fragment of the DG, taking the similarity as an occurrence probability of a corresponding prediction scene, and calculating a future predicted value F.sub.k of the historical output sequences of the DG through the k-th representative scene sequence fragment and the corresponding dynamic time warping distance DTW.sub.k, wherein M future predicted values form the multi-scene prediction result of the future single-time section T.sub.0.

5. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 1, wherein the specific process of the step 40) is as follows: step 401) incorporating the multi-scene prediction result of the future single-time section T.sub.0 generated in the step 30) into the real-time output sequence of the DG, and obtaining a multi-scene prediction result of a next time section T′=T.sub.0+Δt in a manner the same as that in the step 30), wherein a total number U of the results is M.sup.2 and Δt is a predicted interval; step 402) performing a scene reduction for the multi-scene prediction result of the time section T′, setting a scene sequence number M′ of the time section T′ after reduction, respectively calculating Kantorovich distances among U scene sequences to form a minimum scene distance matrix KD', and calculating a matrix element KD’(s), corresponding to a scene sequence c.sub.s, in the KD’ according to the following formula: $KD\text{'}\left(s\right)=\text{min}\left\{{‖c_s-c_t‖}_2,t\in \left[1,2,3,\mathrm{...}{M}^2\right],t\ne s\right\},s\in \left[1,2,3,\mathrm{...}{M}^2\right]$ wherein c.sub.s and c.sub.t represent a s-th scene sequence and a t-th scene sequence in a real-time output sequence set, comprising a predicted value F of the time section T, of the DG respectively, and s and t are scene sequence numbers; step 403) for each scene sequence c.sub.s, multiplying a minimum scene distance corresponding to the scene sequence c.sub.s by a probability of the scene sequence c.sub.s to obtain a minimum scene probability distance corresponding to the scene sequence c.sub.s, finding out a scene sequence with a smallest minimum probability distance in a scene set as a removed scene sequence c^, and removing the removed scene sequence c^ from the scene set, wherein the removed scene sequence c^ is as follows: $c^=\text{min}\{KD\text{'}(s)*p(s)|s\in [1,2,3,.Math.M^2]\}$ finding out a scene sequence c.sup.m nearest to the removed scene sequence c^, and updating a probability p(c.sup.m) of c.sup.m according to the following formula: $p(c^m)=p(c^)+p(c^m)$ step 404) setting a total number U of the scenes as U-1, and if the total number U of updated scenes is M′, conducting the step 405), otherwise, returning to the step 402); and step 405) if T′=T.sub.0+n*Δt, arranging the prediction results of all the time sections in sequence of time to generate the future multi-time section operation scene tree and ending the step 40), otherwise, setting T=T′, T′=T+Δt, and M=M′, and returning to the step 401), wherein n is a number of time sections needing predicting.

6. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 1, wherein the specific process of the step 50) is as follows: step 501) deeply traversing the scenes in the future multi-time section operation scene tree, namely, regarding a predicted output value of the DG as a negative load under each scene, calculating the power distribution network load flow through forward-back substitution, and obtaining line current and busbar voltage conditions; step 502) based on a load flow calculation result, calculating a line overload value L.sub.oL, a line overload severity S.sub.OL(C/E), a voltage out-of-limit value L.sub.ov and a busbar overvoltage severity S.sub.ov(C/E) under each scene respectively according to the following formulas, so as to obtain a line current out-of-limit risk OLR and a busbar voltage out-of-limit risk OVR of the power distribution network, wherein the line overload value L.sub.oL is as follows: $L_{OL}=L-0.8$ wherein L represents a proportion of current passing through a line to a rated current; the line overload severity is as follows: $S_{OL}(C/E)={\text{e}}^{L_{OL}}-1$ the line current out-of-limit risk OLR is as follows: $OLR={\displaystyle \underset{i=1}{\overset{NL}{.Math.}}{S}_{OL}(C/E)}$ wherein NL is number of lines of a whole network; the voltage out-of-limit value L.sub.ov is as follows: $L_{OV}=\left|1.05-V\right|$ wherein V is per-unit value of node voltage; the busbar overvoltage severity is as follows: $S_{OV}\left(C/E\right)={\text{e}}^{L_{OV}}-1$ the busbar voltage out-of-limit risk OVR is as follows: $OVR={\displaystyle \underset{i=1}{\overset{NP}{.Math.}}{S}_{OV}\left(C/E\right)}$ wherein NP is the number of nodes of the whole network; and step 503) sequentially arranging the calculation results of the step 502) from the time section T.sub.0 to the nn-th time section to obtain the variation tendency of the line current and busbar voltage out-of-limit risks under the continuous time sections, namely the future operation state variation tendency of the power distribution network with the DGs.

7. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 2, wherein the specific process of the step 30) is as follows: step 301) calculating a dynamic time warping distance DTW.sub.k between a real-time output sequence and a k-th representative scene sequence fragment of the DG based on the representative scene sequence fragments of the historical output sequences of the DG extracted in the step 20); and step 302) taking a reciprocal of the dynamic time warping distance and performing a normalization treatment on the reciprocal to obtain a similarity of the real-time output sequence and the k-th representative scene sequence fragment of the DG, taking the similarity as an occurrence probability of a corresponding prediction scene, and calculating a future predicted value F.sub.k of the historical output sequences of the DG through the k-th representative scene sequence fragment and the corresponding dynamic time warping distance DTW.sub.k, wherein M future predicted values form the multi-scene prediction result of the future single-time section T.sub.0.

8. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 3, wherein the specific process of the step 30) is as follows: step 301) calculating a dynamic time warping distance DTW.sub.k between a real-time output sequence and a k-th representative scene sequence fragment of the DG based on the representative scene sequence fragments of the historical output sequences of the DG extracted in the step 20); and step 302) taking a reciprocal of the dynamic time warping distance and performing a normalization treatment on the reciprocal to obtain a similarity of the real-time output sequence and the k-th representative scene sequence fragment of the DG, taking the similarity as an occurrence probability of a corresponding prediction scene, and calculating a future predicted value F.sub.k of the historical output sequences of the DG through the k-th representative scene sequence fragment and the corresponding dynamic time warping distance DTW.sub.k, wherein M future predicted values form the multi-scene prediction result of the future single-time section T.sub.0.

9. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 2, wherein the specific process of the step 40) is as follows: step 401) incorporating the multi-scene prediction result of the future single-time section T.sub.0 generated in the step 30) into the real-time output sequence of the DG, and obtaining a multi-scene prediction result of a next time section T′=T.sub.0+Δt in a manner the same as that in the step 30), wherein a total number U of the results is M.sup.2 and Δt is a predicted interval; step 402) performing a scene reduction for the multi-scene prediction result of the time section T', setting a scene sequence number M' of the time section T' after reduction, respectively calculating Kantorovich distances among U scene sequences to form a minimum scene distance matrix KD', and calculating a matrix element KD’(s), corresponding to a scene sequence c.sub.s, in the KD' according to the following formula: $\begin{array}{l}KD\text{'}\left(s\right)=\\ \min \left\{{‖c_s-c_t‖}_2,t\in \left[1,2,3,\mathrm{...}{M}^2\right],t\ne s\right\},s\in \left[1,2,3,\mathrm{...}{M}^2\right]\end{array}$ wherein c.sub.s and c.sub.t represent a s-th scene sequence and a t-th scene sequence in a real-time output sequence set, comprising a predicted value F of the time section T, of the DG respectively, and s and t are scene sequence numbers; step 403) for each scene sequence c.sub.s, multiplying a minimum scene distance corresponding to the scene sequence c.sub.s by a probability of the scene sequence c.sub.s to obtain a minimum scene probability distance corresponding to the scene sequence c.sub.s, finding out a scene sequence with a smallest minimum probability distance in a scene set as a removed scene sequence c^, and removing the removed scene sequence c^ from the scene set, wherein the removed scene sequence c^ is as follows: $c^=\min \left\{KD\text{'}\left(s\right)*p\left(s\right)\left|s\in \left[1,2,3,\mathrm{...}{M}^2\right]\right.\right\}$ finding out a scene sequence c.sup.m nearest to the removed scene sequence c^, and updating a probability p(c.sup.m) of c.sup.m according to the following formula: $p\left(c^m\right)=p\left(c^{\wedge }\right)+p\left(c^m\right)$ step 404) setting a total number U of the scenes as U-1, and if the total number U of updated scenes is M′, conducting the step 405), otherwise, returning to the step 402); and step 405) if T′=T.sub.0+n*Δt, arranging the prediction results of all the time sections in sequence of time to generate the future multi-time section operation scene tree and ending the step 40), otherwise, setting T=T′, T′=T+Δt, and M=M′, and returning to the step 401), wherein n is a number of time sections needing predicting.

10. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 3, wherein the specific process of the step 40) is as follows: step 401) incorporating the multi-scene prediction result of the future single-time section T.sub.0 generated in the step 30) into the real-time output sequence of the DG, and obtaining a multi-scene prediction result of a next time section T′=T.sub.0+Δt in a manner the same as that in the step 30), wherein a total number U of the results is M.sup.2 and Δt is a predicted interval; step 402) performing a scene reduction for the multi-scene prediction result of the time section T′, setting a scene sequence number M′ of the time section T′ after reduction, respectively calculating Kantorovich distances among U scene sequences to form a minimum scene distance matrix KD', and calculating a matrix element KD’(s), corresponding to a scene sequence c.sub.s, in the KD' according to the following formula: $\begin{array}{l}KD\text{'}\left(s\right)=\\ \text{min}\left\{{‖c_s-c_t‖}_2,t\in \left[1,2,3,.Math.M^2\right],t\ne s\right\},s\in \left[1,2,3,.Math.M^2\right]\end{array}$ wherein c.sub.s and c.sub.t represent a s-th scene sequence and a t-th scene sequence in a real-time output sequence set, comprising a predicted value F of the time section T, of the DG respectively, and s and t are scene sequence numbers; step 403) for each scene sequence c.sub.s, multiplying a minimum scene distance corresponding to the scene sequence c.sub.s by a probability of the scene sequence c.sub.s to obtain a minimum scene probability distance corresponding to the scene sequence c.sub.s, finding out a scene sequence with a smallest minimum probability distance in a scene set as a removed scene sequence c^, and removing the removed scene sequence c^ from the scene set, wherein the removed scene sequence c^ is as follows: $c^{\wedge }=\text{min}\left\{KD\text{'}\left(s\right)\ast p\left(s\right)\left|s\in \left[1,2,3,.Math.M^2\right]\right.\right\}$ finding out a scene sequence c.sup.m nearest to the removed scene sequence c^, and updating a probability p(c.sup.m) of c.sup.m according to the following formula: $p\left(c^m\right)=p\left(c^{\wedge }\right)+p\left(c^m\right)$ step 404) setting a total number U of the scenes as U-1, and if the total number U of updated scenes is M′, conducting the step 405), otherwise, returning to the step 402); and step 405) if T′=T.sub.0+n*Δt, arranging the prediction results of all the time sections in sequence of time to generate the future multi-time section operation scene tree and ending the step 40), otherwise, setting T=T′, T′=T+Δt, and M=M′, and returning to the step 401), wherein n is a number of time sections needing predicting.

11. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 2, wherein the specific process of the step 50) is as follows: step 501) deeply traversing the scenes in the future multi-time section operation scene tree, namely, regarding a predicted output value of the DG as a negative load under each scene, calculating the power distribution network load flow through forward-back substitution, and obtaining line current and busbar voltage conditions; step 502) based on a load flow calculation result, calculating a line overload value L.sub.oL, a line overload severity S.sub.OL(C/E), a voltage out-of-limit value L.sub.ov and a busbar overvoltage severity S.sub.ov(C/E) under each scene respectively according to the following formulas, so as to obtain a line current out-of-limit risk OLR and a busbar voltage out-of-limit risk OVR of the power distribution network, wherein the line overload value L.sub.oL is as follows: $L_{OL}=L-0.8$ wherein L represents a proportion of current passing through a line to a rated current; the line overload severity is as follows: $S_{OL}\left(C/E\right)={\text{e}}^{L_{OL}}-1$ the line current out-of-limit risk OLR is as follows: $OLR=\text{}{\displaystyle \underset{i=1}{\overset{NL}{.Math.}}{S}_{OL}\left(C/E\right)}$ wherein NL is number of lines of a whole network; the voltage out-of-limit value L.sub.ov is as follows: $L_{OV}=\left|1.05-V\right|$ wherein V is per-unit value of node voltage; the busbar overvoltage severity is as follows: $S_{OV}\left(C/E\right)={\text{e}}^{L_{OV}}-1$ the busbar voltage out-of-limit risk OVR is as follows: $OVR={\displaystyle \underset{i=1}{\overset{NP}{.Math.}}{S}_{OV}\left(C/E\right)}$ wherein NP is the number of nodes of the whole network; and step 503) sequentially arranging the calculation results of the step 502) from the time section T.sub.0 to the nn-th time section to obtain the variation tendency of the line current and busbar voltage out-of-limit risks under the continuous time sections, namely the future operation state variation tendency of the power distribution network with the DGs.

12. The method for predicting the operation state of the power distribution network with the DGs based on scene analysis according to claim 3, wherein the specific process of the step 50) is as follows: step 501) deeply traversing the scenes in the future multi-time section operation scene tree, namely, regarding a predicted output value of the DG as a negative load under each scene, calculating the power distribution network load flow through forward-back substitution, and obtaining line current and busbar voltage conditions; step 502) based on a load flow calculation result, calculating a line overload value L.sub.oL, a line overload severity S.sub.OL(C/E), a voltage out-of-limit value L.sub.ov and a busbar overvoltage severity S.sub.ov(C/E) under each scene respectively according to the following formulas, so as to obtain a line current out-of-limit risk OLR and a busbar voltage out-of-limit risk OVR of the power distribution network, wherein the line overload value L.sub.oL is as follows: $L_{OL}=L-0.8$ wherein L represents a proportion of current passing through a line to a rated current; the line overload severity is as follows: $S_{OL}\left(C/E\right)={\text{e}}^{L_{OL}}-1$ the line current out-of-limit risk OLR is as follows: $OLR={\displaystyle \underset{i=1}{\overset{NL}{.Math.}}{S}_{OL}\left(C/E\right)}$ wherein NL is number of lines of a whole network; the voltage out-of-limit value L.sub.ov is as follows: $L_{OV}=\left|1.05-V\right|$ wherein V is per-unit value of node voltage; the busbar overvoltage severity is as follows: $S_{OV}\left(C/E\right)={\text{e}}^{L_{OV}}-1$ the busbar voltage out-of-limit risk OVR is as follows: $OVR={\displaystyle \underset{i=1}{\overset{NP}{.Math.}}{S}_{OV}\left(C/E\right)}$ wherein NP is the number of nodes of the whole network; and step 503) sequentially arranging the calculation results of the step 502) from the time section T.sub.0 to the nn-th time section to obtain the variation tendency of the line current and busbar voltage out-of-limit risks under the continuous time sections, namely the future operation state variation tendency of the power distribution network with the DGs.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0045] FIG. 1 is a flow schematic diagram of a method of an embodiment of the present invention.

[0046] FIG. 2 is a structural diagram of an IEEE-33 node power distribution system connected with a DG.

DETAILED DESCRIPTION OF THE INVENTION

[0047] As shown in FIG. 1, the present invention provides a method for predicting an operation state of a power distribution network with DGs based on scene analysis, FIG. 2 is an IEEE-33 node power distribution system connected with the DGs, the voltage amplitude and phase angle of the balance node, the load of each PQ node and the voltage amplitude of each PV node in the network are given, and the historical output information of the DGs connected into the system is known (output data is recorded every five minutes). For the purpose of making objectives, technical schemes and advantages of the present invention more clear, deep and detailed explanation will be made to the present invention by combining drawings and the embodiment. It should be understood that the specific embodiment described herein is merely used for illustrating the present invention, but not intended to limit the present invention.

[0048] The network structure data of the distribution system is stored in a power system database. The data is obtained by accessing the power system database through network (eg, wireless network or wired network) with a computer device. The computer device includes a memory, an external interface, and a processor coupled to the memory. The network structure data of the power distribution system is obtained, from the power system database, through the external interface of the computer device. The memory has one or more computer-executable instructions stored which when executed by the processor, causing the computer device perform the method including the following steps.

[0049] step 10) Receiving, through the external interface, the network structure data of the power distribution system from the power system database, numbering the nodes by traversing the network structure data from the network topology table in the database, and obtaining the type of each node and interconnected positions of the DGs (as shown in FIG. 2) from the device table in the database, and obtaining the historical output sequences of the DGs and the historical demand information of each load point.

[0050] step 20) Extracting representative scene sequences of output of the DGs according to the historical output sequences of the DGs, and the specific steps are as follows: [0051] step 201) here, the operation state of the power distribution system in the future two hours needs to be predicted with a prediction interval of fifteen minutes, supposing that the current time is 12:00 a.m., Jun. 1, 2017, the output sequence fragments, from which the representative scene sequence fragments need to be extracted, of the DG include the output information of 10:05- 14:00 from May 15 to June 18 in the past three years, and the length of each time sequence fragment is 48, and determining the number M of the needed representative scene sequence fragments as 5; [0052] step 202) intercepting time sequence fragments with the length of 48, from which the representative scene sequence fragments are to be extracted, from the historical output sequence of the DG, and recording the number N as 105, so as to form a scene set; [0053] step 203) calculating the occurrence probability p(c.sub.i) of each scene sequence fragment in the scene set according to the following formula: [00014]$p\left(c_i\right)=\frac{1}{N}i=1,2,3,\mathrm{...}N$ in the formula, c.sub.i represents the i-th scene sequence fragment in the scene set, and i is a scene sequence fragment number; [0054] step 204) for each scene sequence fragment c.sub.i, calculating the Kantorovich distance between the scene sequence fragment c.sub.i and other scene sequence fragments according to the following formula, finding out the scene sequence fragment nearest to the scene sequence fragment c.sub.i and marking it in the scene set to form a minimum scene distance matrix KD, and calculating a matrix element KD(i), corresponding to the scene sequence fragment c.sub.i, in the KD according to the following formula: [00015]$KD\left(i\right)=\min \left\{{‖c_i-c_j‖}_2,j\in \left[1,2,3,\mathrm{...}N\right],j\ne i\right\},i\in \left[1,2,3,\mathrm{...}N\right]$ wherein c.sub.j represents the j-th scene sequence fragment in the scene set, and j is a scene sequence fragment number; [0055] step 205) for each scene sequence fragment c.sub.i, multiplying the minimum scene distance corresponding to the scene sequence fragment c.sub.i by the probability of the scene sequence fragment c.sub.i so as to obtain a minimum scene probability distance corresponding to the scene sequence fragment c.sub.i, finding out a scene sequence fragment with the smallest minimum probability distance in the scene set as a removed scene sequence fragment c*, and removing the removed scene sequence fragment c* from the scene set, wherein the removed scene sequence fragment c* is as follows: [00016]$c*=\text{min}\left\{KD\left(i\right)*\left.p\left(i\right)\right|i\in \left[1,2,3,\mathrm{...}N\right]\right\}$ [0056] step 206) finding out the scene sequence fragment c.sup.n nearest to the removed scene sequence fragment c*, and updating the probability p(c.sup.n) of c.sup.n according to the following formula: [00017]$p\left(c^n\right)=p\left(c^{*}\right)+p\left(c^n\right)$ [0057] step 207) setting the total number N of the scene sequence fragments as N-1, and if the total number N of the updated scene sequence fragments is M, ending the step 20), otherwise, returning to the step 204).

[0058] step 30) Obtaining multi-scene prediction result of a future single-time section through matching the real-time scene with historical similar scenes by calculating a dynamic time warping distance between a real-time output sequence and representative scenes of the DGs, and the specific steps are as follows: [0059] step 301) calculating the dynamic time warping distance DTW.sub.k between the real-time output sequence R and the k-th representative scene sequence fragment Q of the DG based on five representative scene sequence fragments of the output sequence of the DG extracted in the step 20), wherein the specific calculation method is as follows: wherein f=2, 3, ..., 24, g=2, 3, ..., 24, and D(24, 24) is the minimum accumulated value of the distance matrix A, namely the shortest distance DTW.sub.k between the real-time output sequence R and the k-th representative scene sequence fragment Q of the DG; and [0060] setting the length l of the k-th representative scene sequence fragment Q as 24 (only the time sequence fragments of front 10:05-12:00 are calculated), and the length p of the real-time output sequence R of the DG as 24, that is, T={t.sub.1, t.sub.2, ...t.sub.1}, and R={r.sub.1,r.sub.2, ...r.sub.p}, [0061] constructing a distance matrix A with 24 rows and 24 columns, namely, [00018]$A=\left[\begin{array}{cccc}d\left(q_1,r_1\right)& d\left(q_1,r_2\right)& .Math.& d\left(q_1,r_p\right)\\ d\left(q_2,r_1\right)& d\left(q_2,r_2\right)& .Math.& d\left(q_2,r_p\right)\\ .Math.& .Math.& \ddots & .Math.\\ d\left(q_l,r_1\right)& d\left(q_l,r_2\right)& .Math.& d\left(q_l,r_p\right)\end{array}\right]$ [00019]$a_{fg}=d\left(q_{f,}{r}_g\right)=\sqrt{{\left(q_f-r_g\right)}^2}$ [00020]$\left\{\begin{array}{l}D\left(<>,<>\right)=0;\\ D\left(f,<>\right)=D\left(<>,g\right)=\infty ;\\ D\left(1,1\right)=a_{11};\\ D\left(f,g\right)=a_{fg}+\text{min}\left\{D\left(f-1,g-1\right),D\left(f,g-1\right),D\left(f-1,g\right)\right\}\end{array}\right.$ [0062] step 302) taking the reciprocals of the dynamic time warping distances and performing normalization treatment on the reciprocals to obtain the similarity of the real-time output sequence and the representative scene sequence fragments of the DG, taking the similarity as the occurrence probability of a corresponding prediction scene, and calculating an output predicted value F.sub.k at 12: 15 in the output sequence of the DG through the k-th representative scene sequence and the corresponding dynamic time warping distance DTW.sub.k, wherein M future predicted values form the multi-scene prediction result of the future single-time section (12: 15, Jun. 1, 2017).

[0063] step 40) Establishing a future multi-time section operation scene tree according to the multi-scene prediction result, and the specific steps are as follows: [0064] step 401) incorporating the multi-scene prediction result (totally five scenes) of the future single-time section T=T.sub.0=12: 15, Jun. 1, 2017 generated in the step 30) into the output sequence of the DG, and conducting the step 30) again to perform multi-scene prediction work of a next time section T’=12: 30, Jun. 1, 2017, wherein the prediction interval Δt is 15 min; [0065] step 402) performing scene reduction for the multi-scene prediction result of the time section 12: 30, Jun. 1, 2017, setting the scene sequence number M’ after reduction as 5 while there are U=M.sup.2=25 scenes before reduction, respectively calculating the Kantorovich distances among 25 scene sequences to form a minimum scene distance matrix KD’, and calculating a matrix element KD’(s), corresponding to the scene sequence c.sub.s, in the KD’ according to the following formula: [00021]$KD\text{'}\left(s\right)=\text{min}\left\{{‖c_s-c_t‖}_2,t\in \left[1,2,3,.Math.25\right],t\ne s\right\},s\in \left[1,2,3,.Math.25\right]$ wherein c.sub.s and c.sub.t represent the s-th scene sequence and the t-th scene sequence in the real-time output sequence set, including the multi-scene prediction result of the time section 12: 30, Jun. 1, 2017, of the DG respectively, and s and t are scene sequence numbers; [0066] step 403) for each scene sequence c.sub.s, multiplying the minimum scene distance corresponding to the scene sequence c.sub.s by the probability of the scene sequence c.sub.s to obtain a minimum scene probability distance corresponding to the scene sequence c.sub.s, finding out a scene sequence with the smallest minimum scene probability distance in the scene set as a removed scene sequence c^, and removing the removed scene sequence c^ from the scene set, wherein the removed scene sequence c^ is as follows: [00022]$c^{\wedge }=\text{min}\left\{KD\text{'}\left(s\right)\ast p\left(s\right)\left|s\in \left[1,2,3,.Math.M^2\right]\right.\right\}$ finding out the scene sequence c.sup.m nearest to the removed scene sequence c^, and updating the probability p(c.sup.m) of c.sup.m according to the following formula: [00023]$p\left(c^m\right)=p\left(c^{\wedge }\right)+p\left(c^m\right)$ [0067] step 404) setting the total number U of the scenes as U-1, and if the total number U of the updated scenes is M′, conducting the step 405), otherwise, returning to the step 402); [0068] step 405) if T’=T.sub.0+8 *Δt, arranging the prediction results of all the time sections in sequence of time to generate the future multi-time section operation scene tree and end the step 40), otherwise, setting T=T’, T’=T+Δt, and M=M’, and returning to the step 401).

[0069] Step 50) Performing power distribution network load flow analysis for each scene by deeply traversing all scenes in the future multi-time section operation scene tree, calculating the line current out-of-limit risk and the busbar voltage out-of-limit risk of the power distribution network, and a variation tendency of the line current and busbar voltage out-of-limit risks under continuous time sections, namely the future operation state variation tendency of the power distribution network with the DGs, is obtained. The specific steps are as follows: [0070] step 501) deeply traversing the scenes in the future multi-time section operation scene tree, and sequentially searching father nodes, namely predicted values of the previous time, with the single-time section multi-scene predicted value generated by the last time of prediction of the future multi-time section operation scene tree as the starting point till to the root node so as to reversely generate the continuous time sections through the route; [0071] regarding the predicted output values of the DG as negative loads under each scene, calculating the power distribution network load flow through forward-back substitution, and obtaining the line current and busbar voltage conditions; [0072] initializing, specifically, giving the voltage of balance nodes, assigning a voltage initial value for other PQ nodes of the whole network, and assigning a reactive input initial power Q.sub.i.sup.(0) for PV nodes; [0073] calculating the operation power of each node: [00024]$S_i^{\left(0\right)}=S_{Li}+U_i^{\left(0\right)2}{\widehat{y}}_{io}$ [0074] inferring forward step by step from the tail end of the network, and solving the power distribution of all branches of the whole network from the node voltage wherein the forward inference process is as follows: [00025]$\begin{array}{l}{P}_{ij}^{\left(1\right)}=P_j^{\left(0\right)}+{\displaystyle \underset{k\in C_j}{.Math.}{P}_{jk}^{\left(1\right)}+\Delta P_{ij}^{\left(1\right)}}\\ Q_{ij}^{\left(1\right)}=Q_j^{\left(0\right)}+{\displaystyle \underset{k\in C_j}{.Math.}{Q}_{jk}^{\left(1\right)}+\Delta Q_{ij}^{\left(1\right)}}\end{array}$ [0075] inferring backward hop by hop from the initial end, and solving the voltage of each node through the power of each branch: [00026]$\begin{array}{l}{U}_j=\sqrt{\left(U_j{}^{\left(1\right)}-\frac{P_{ij}{}^{\left(1\right)}{R}_{ij}+Q_{ij}{}^{\left(1\right)}{X}_{ij}}{U_j{}^{\left(1\right)}}\right)+{\left(\frac{P_{ij}{}^{\left(1\right)}{X}_{ij}-Q_{ij}{}^{\left(1\right)}{R}_{ij}}{U_i{}^1}\right)}^2}\\ {\theta }_j{}^{\left(1\right)}={\theta }_i{}^{\left(1\right)}-\arctan \frac{\frac{P_{ij}{}^{\left(1\right)}{X}_{ij}-Q_{ij}{}^{\left(1\right)}{R}_{ij}}{U_i{}^{\left(1\right)}}}{U_i{}^{\left(1\right)}-\frac{P_{ij}{}^{\left(1\right)}{R}_{ij}+Q_{ij}{}^{\left(1\right)}{X}_{ij}}{U_i{}^{\left(1\right)}}}\end{array}$ [0076] amending the voltage and reactive power of the PV nodes through the obtained voltage of the nodes: [00027]$\begin{array}{l}{\dot{U}}_i{}^{\left(1\right)}=U_i{}^{\left(1\right)}\angle {\theta }_i{}^{\left(1\right)}\\ Q_i{}^{\left(1\right)}=U_i{}^{\left(1\right)}{\displaystyle \underset{j=1}{\overset{n}{.Math.}}{U}_j{}^{\left(1\right)}\left(G_{ij}\sin {\theta }_{ij}{}^{\left(1\right)}-B_{ij}\cos {\theta }_{ij}{}^{\left(1\right)}\right)}\end{array}$ [0077] detecting whether convergence is obtained or not according to convergence criterion, taking the voltage calculated value of each node as the new initial value to be substituted into Formula (2) if not meet the convergence condition, and starting to conduct next iteration; [00028]$\begin{array}{l}\left|\Delta P_i{}^{\left(1\right)}\right|<{\epsilon }_1\\ \left|\Delta Q_i{}^{\left(1\right)}\right|<{\epsilon }_1\end{array}$ [00029]$\begin{array}{l}\Delta P_i{}^{\left(1\right)}=P_{is}-U_i{}^{\left(1\right)}{\displaystyle \underset{j=1}{\overset{n}{.Math.}}{U}_j{}^{\left(1\right)}\left(G_{ij}\cos {\theta }_{ij}{}^{\left(1\right)}+B_{ij}\sin {\theta }_{ij}{}^{\left(1\right)}\right)}\\ \Delta Q_i{}^{\left(1\right)}=Q_{is}-U_i{}^{\left(1\right)}{\displaystyle \underset{j=1}{\overset{n}{.Math.}}{U}_j{}^{\left(1\right)}\left(G_{ij}\sin {\theta }_{ij}{}^{\left(1\right)}-B_{ij}\cos {\theta }_{ij}{}^{\left(1\right)}\right)}\end{array}$ [0078] step 502) based on the load flow calculation result, calculating the line overload value L.sub.OL, the line overload severity S.sub.OL(C/E), the voltage out-of-limit value L.sub.OV and the busbar overvoltage severity S.sub.OV(C/E) under each scene, so as to obtain the line current out-of-limit risk OLR and the busbar voltage out-of-limit risk OVR of the power distribution network, wherein [0079] the line overload value L.sub.OL is as follows: [00030]$L_{OL}=L-0.8$ [0080] wherein L represents the proportion of current passing through the line to the rated current; [0081] the above formula reflects the overload value of a single line, and the line overload risk is defined on this basis. The overload risk severity function S.sub.OL(C/E) of equipment is defined. The current flowing through each line is set to determine the line overload risk severity. When the line current is less than or equal to 80% of the rated current, S.sub.OL(C/E) is 0; along with increase of the current flowing through the line, S.sub.OL(C/E) is increased, and the increase rate becomes faster; [0082] the line overload severity is as follows: [00031]$S_{OL}\left(C/E\right)={\text{e}}^{L_{OL}}-1$ [0083] the line current out-of-limit risk OLR is as follows: [00032]$OLR={\displaystyle \underset{i=1}{\overset{NL}{.Math.}}{S}_{OL}\left(C/E\right)}$ [0084] wherein NL is the number of the lines of the whole network; [0085] the voltage out-of-limit value L.sub.OV is as follows: [00033]$L_{OV}=\left|1.05-V\right|$ [0086] wherein V is the per-unit value of node voltage; [0087] the above formula reflects the voltage out-of-limit value of a single busbar, the voltage overload risk is defined on this basis, and the busbar overvoltage risk level of the whole area is evaluated. The voltage out-of-limit risk severity function of each busbar is defined as S.sub.OV(C/E). When the voltage of each busbar is 1.05 p.u., the severity function is set as 0; along with increase of the voltage out-of-limit value, the voltage out-of-limit risk severity of each node is also increased; the busbar overvoltage severity is as follows: [00034]$S_{OV}\left(C/E\right)={\text{e}}^{L_{LOV}}-1$ [0088] the busbar voltage out-of-limit risk OVR is as follows: [00035]$OVR={\displaystyle \underset{i=1}{\overset{NP}{.Math.}}{S}_{OV}}\left(C/E\right)$ [0089] wherein NP is the number of nodes of the whole network; [0090] step 503) sequentially arranging the calculation results of the step 502) from the time section T.sub.0 to the nn-th time section to obtain the variation tendency of the line current and busbar voltage out-of-limit risks under the continuous time sections, namely the future operation state variation tendency of the power distribution network with the DGs.

[0091] Based on the future operation state variation tendency of the power distribution network with the DGs, the DGs and/or relevant devices in the power distribution network can be adjusted accordingly, for example, the output power of the DGs, or the distributed generator nodes connected to the distribution network, or the output power of the distribution system can be adjusted to make the power supply operate in coordination with the local load, so as to suppress the voltage fluctuation.

[0092] The abovementioned embodiment is merely a preferred mode of execution of the present invention. It should be noted that a person of ordinary skill in the art may further make certain modifications and equivalent substitutions without departing from the conception of the present invention, and the technical schemes after modifications and equivalent substitutions for the claims of the present invention all fall within the protection scope of the present invention.