Day-ahead scheduling method and device based on distributed power flow control, equipment and medium

Abstract

The present application relates to the technical field of power grid operation day-ahead scheduling, and particularly relates to a day-ahead scheduling method and device based on distributed power flow control, equipment and medium, the method comprising: inputting each node information in the network, inputting line conductance, susceptance values, inputting DPFC series side converter number, capacity and position in the line; adding additional power of the DPFC element in the network, taking the operation cost of the conventional unit and the wind power abandonment cost as the optimization target to form a day-ahead scheduling model; solving the day-ahead scheduling model to obtain the total output voltage of the DPFC series side, distributing the output voltage to each DPFC series side converter on the corresponding line to realize coordinated control, and scheduling each unit based on the day-ahead scheduling plan. The present application can adjust the power generation of the conventional unit to optimize wind power consumption and reduce the wind power abandonment rate of the system.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of power grid operation day-ahead scheduling, and in particular to a day-ahead scheduling method and device based on distributed power flow control, equipment and medium. BACKGROUND

[0002] With the increasing emphasis on renewable energy worldwide, the proportion of new energy in the power system is rising year by year. Wind power is one of the important clean energy sources today, and the abundant wind resources in China's coastal areas provide conditions for the development of wind power.

[0003] However, as the proportion of wind power rises, the challenges faced by the power system in wind power consumption capacity are increasingly evident. Wind power, as a power source, has intermittency and uncertainty, which may lead to the risk of excess load or power generation during the valley and peak times of wind power grid. Therefore, optimizing wind power consumption is a common demand to reduce carbon emissions and ensure efficient and safe operation of the power grid.

[0004] The information disclosed in this BACKGROUND section is only intended to deepen the understanding of the general background of the present application and should not be considered as recognition or implicit admission in any form that this information constitutes prior art known to those skilled in the art. SUMMARY

[0005] The present application provides a day-ahead scheduling method and device based on distributed power flow control, equipment and medium, thereby effectively solving the problems in the background art.

[0006] In order to achieve the above purpose, the technical solution adopted by the present application is as follows: a day-ahead scheduling method based on distributed power flow control, comprising the following steps:

[0007] Inputting the information of each node in the network, inputting the line conductance and susceptance values, inputting the DPFC series side converter number, capacity and position in the line;

[0008] Adding additional power of DPFC elements in the network, taking the comprehensive minimum of the operation cost of conventional units and the wind power abandonment cost as the optimization target to form a day-ahead scheduling model;

[0009] Solving the day-ahead scheduling model to obtain the total output voltage of the DPFC series side, distributing the output voltage to each DPFC series side converter on the corresponding line to realize coordinated control, and scheduling each unit based on the day-ahead scheduling plan.

[0010] Further, the optimization target comprises:

[0011]

[0012] where T is the total number of time periods in the target range, N is the total number of units in the target range, C SSit = m it S STi + n it S SDi is the start-up cost of the conventional unit i, m it is a 0-1 variable of the start-up of the unit, n it is a 0-1 variable of the shut-down of the unit, S STi is the start-up cost of the conventional unit i, S SDi is the shut-down cost of the conventional unit i, C Git is the generation cost of the conventional unit i at time t, p is a penalty function factor, is the curtailed wind power at time t, and ΔT is the time granularity of the generation plan.

[0013] Further, the curtailed wind cost is represented using a penalty function.

[0014] Further, the day-ahead scheduling model further comprises:

[0015] a power balance constraint, in which the additional power of the DPFC element is connected to the power on the bus in the line;

[0016] an inequality constraint, in which the power output limit of the DPFC and the output voltage limit of the element in series are added.

[0017] Further, the output voltage of each DPFC series side converter on the corresponding line is allocated to achieve coordinated control, comprising the following steps:

[0018] calculating the sensitivity SEN of the power flow of each line in the network to the end voltage of the DPFC s and SEN r ;

[0019] comparing the size of SEN s and SEN r to determine the voltage output strategy of each element in the series side of the DPFC, specifically as follows:

[0020] for the case of SEN s > SEN r , the DPFC series side element close to the sending end is preferentially scheduled;

[0021] for the case of SEN s < SEN r , the DPFC series side element close to the receiving end is preferentially scheduled.

[0022] Further, the sensitivity SEN of the power flow of each line in the network to the end voltage of the DPFCs SEN r , comprising:

[0023]

[0024] where s and r represent the sending end or receiving end of the DPFC installed line respectively, j is other nodes in the network, P ij is the active power component of the power flow between nodes i and j, U i is the bus voltage of node i, G ij is the real part of the (i, j) element in the node admittance matrix, B ij is the imaginary part of the (i, j) element in the node admittance matrix, θ ij is the phase angle difference between nodes i and j.

[0025] Further, the priority scheduling of the DPFC series side elements close to the sending end comprises:

[0026] For n series side elements on the line, numbered from the sending end bus, in turn, k = 1, 2, 3, …, n. From k = 1, the elements are allocated power according to their maximum voltage U k，max , until k Ds elements are called to meet the line U se demand, that is:

[0027]

[0028] where U 0，max is defined as zero.

[0029] Further, the priority scheduling of the DPFC series side elements close to the receiving end comprises:

[0030] For n series side elements on the line, numbered from the receiving end bus, in turn, k = 1, 2, 3, …, n. From k = 1, the elements are allocated power according to their maximum voltage U k，max , until k Dr elements are called to meet the line U se demand, that is:

[0031]

[0032] Further, the comparison of SEN s and SEN r size determines the voltage output strategy of each element of the DPFC series side, further comprising:

[0033] For the case of SEN s = SEN r , the output voltage of each element is allocated according to the following rules:

[0034]

[0035] The application also comprises a day-ahead scheduling device based on distributed power flow control, using the method as described above, the device comprising:

[0036] an input unit for inputting information of each node in the network, inputting line conductance and susceptance values, inputting serial side converter number, capacity and position in the line of the distributed power flow controller (DPFC) ;

[0037] a modeling unit for adding additional power of the DPFC element in the network to form a day-ahead scheduling model with the operation cost of conventional units and the cost of abandoned wind power as the optimization target;

[0038] a solving scheduling unit for solving the day-ahead scheduling model to obtain total output voltage of the serial side of the DPFC, distributing the output voltage to each DPFC serial side converter on the corresponding line to realize coordinated control, and scheduling each unit based on the day-ahead scheduling plan.

[0039] The application also comprises a computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, when the processor executes the computer program, the method as described above is realized.

[0040] The application also comprises a storage medium having a computer program stored thereon, when the processor executes the computer program, the method as described above is realized.

[0041] The application has the beneficial effect that the application can adjust the power generation of conventional units to optimize wind power consumption and reduce the abandoned wind power rate of the system. According to the characteristics of the distributed power flow controller that can provide distributed control, the connection between the line end of the distributed power flow controller and other buses is considered, the output voltage of each unit is reasonably configured according to the position and capacity of each element of the serial side of the distributed power flow controller, the execution efficiency of the distributed power flow controller to the scheduling command is optimized, the power grid operation state is optimized through the distributed power flow controller, and the wind power is better consumed. BRIEF DESCRIPTION OF DRAWINGS

[0042] In order to more clearly illustrate the technical solutions of the embodiments of the application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiment or prior art description. Obviously, the drawings in the following description are only some embodiments of the application, and for those skilled in the art, other drawings can also be obtained without creative labor.

[0043] Figure 1 Flow chart of the method in embodiment 1;

[0044] Figure 2 Structure diagram of the device in Example 1;

[0045] Figure 3 Flow chart of the method in Example 2;

[0046] Figure 4 Structure diagram of the computer device. DETAILED DESCRIPTION

[0047] The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments of the present application.

[0048] Example 1:

[0049] As shown in the figure: a day-ahead scheduling method based on distributed power flow control, comprising the following steps: Figure 1 Inputting information of each node in the network, inputting line conductance and susceptance values, inputting DPFC series side converter number, capacity and position in the line;

[0050] Adding additional power of the DPFC element in the network, taking the comprehensive minimum of the operation cost of the conventional unit and the wind curtailment cost as the optimization objective to form a day-ahead scheduling model;

[0051] Solving the day-ahead scheduling model to obtain the total output voltage of the DPFC series side, distributing the output voltage to each DPFC series side converter on the corresponding line to realize coordinated control, and scheduling each unit based on the day-ahead scheduling plan.

[0052] The embodiment simultaneously considers the influence of the distributed power flow controller on the active and reactive power injection of the node, adds power balance equation constraints considering the power injection of the distributed power flow controller and distributed power flow controller capacity inequality constraints. By solving the optimization problem, the voltage output by the distributed power flow controller series side on the line can be determined, and then the sensitivity of the line power flow to the distributed power flow controller end voltage is compared to determine the output voltage distribution strategy of each element on the series side. The day-ahead scheduling method utilizes the functions of the distributed power flow controller to flexibly adjust the output voltage and control the line power flow, can ensure the consumption of new energy while improving the utilization efficiency of the distributed power flow controller element, improving the safety of line operation, and optimizing the power grid operation state through the distributed power flow controller, thereby better consuming wind power.

[0053] In the embodiment, the optimization objective includes:

[0054]

[0055] ​

[0056] where T is the total number of time periods in the target range, N is the total number of units in the target range, C SSit = m it S STi + n it S SDi is the start-up cost of the conventional unit i, m it is a 0-1 variable of the start-up of the unit, n it is a 0-1 variable of the shutdown of the unit, S STi is the start-up cost of the conventional unit i, S SDi is the shutdown cost of the conventional unit i, C Git is the generation cost of the conventional unit i at time t, p is a penalty function factor, is the curtailed wind power at time t, and ΔT is the time granularity of the generation plan.

[0057] where the curtailed wind power cost is represented using a penalty function.

[0058] In this embodiment, the day-ahead scheduling model further comprises:

[0059] a power balance constraint, in which the DPFC element is connected to the additional power on the line bus;

[0060] an inequality constraint, in which the power output limit of the DPFC and the output voltage limit of the series side element are added.

[0061] The output voltage of each DPFC series side converter on the corresponding line is allocated to achieve coordinated control, including the following steps:

[0062] The sensitivity SEN s of the power flow of each line in the network to the DPFC end voltage is calculated r ;

[0063] The SEN s and SEN r are compared in size to determine the voltage output strategy of each element of the DPFC series side, specifically as follows:

[0064] For the case of SEN s > SEN r , the DPFC series side element close to the sending end is preferentially scheduled;

[0065] For the case of SEN s < SEN r , the DPFC series side element close to the receiving end is preferentially scheduled.

[0066] The sensitivity SEN sSEN r , comprising:

[0067]

[0068] where s and r represent the sending end or receiving end of the DPFC installation line respectively, j is other nodes in the network, P ij is the active component of the power flow between nodes i and j, U i is the bus voltage of node i, G ij is the real part of the (i, j) element in the node admittance matrix, B ij is the imaginary part of the (i, j) element in the node admittance matrix, θ ij is the phase angle difference between nodes i and j.

[0069] where the DPFC series side elements close to the sending end are preferentially scheduled, comprising:

[0070] For n series side elements on the line, numbering from the sending end bus, in turn, k = 1, 2, 3, …, n. From k = 1, the elements are assigned power according to their maximum voltage U k，max , until k Ds elements are called to meet the line U se requirements, that is:

[0071]

[0072] where U 0，max is defined as zero.

[0073] The DPFC series side elements close to the receiving end are preferentially scheduled, comprising:

[0074] For n series side elements on the line, numbering from the receiving end bus, in turn, k = 1, 2, 3, …, n. From k = 1, the elements are assigned power according to their maximum voltage U k，max , until k Dr elements are called to meet the line U se requirements, that is:

[0075]

[0076] As a preferred embodiment of the above, the size of SEN s and SEN r is compared to determine the voltage output strategy of each element of the DPFC series side, further comprising:

[0077] For SEN s = SEN r , the output voltage of each element is assigned according to the following rules:

[0078]

[0079] As Figure 2 shown, the embodiment also includes a day-ahead scheduling device based on distributed power flow control, using the method as described above, the device includes:

[0080] An input unit for inputting information of each node in the network, inputting line conductance, susceptance values, inputting DPFC series side converter number, capacity and position in the line;

[0081] A modeling unit for adding additional power of DPFC elements in the network, forming a day-ahead scheduling model with the lowest comprehensive operation cost and wind power abandonment cost of conventional units as the optimization target;

[0082] A solving scheduling unit for solving the day-ahead scheduling model to obtain the total output voltage of the DPFC series side, distributing the output voltage to each DPFC series side converter on the corresponding line to realize coordinated control, and scheduling each unit based on the day-ahead scheduling plan.

[0083] Embodiment 2:

[0084] The embodiment includes a day-ahead scheduling method for optimizing wind power consumption by using a distributed power flow controller, as Figure 3 shown, the strategy making method includes the following steps:

[0085] Step S1), input information of each node in the network, input line conductance, susceptance values, input DPFC series side converter number, capacity and position in the line.

[0086] Step S2), add additional power of DPFC elements in the network to form a day-ahead scheduling model with the lowest comprehensive operation cost and wind power abandonment cost of conventional units as the optimization target. The wind power abandonment cost is represented by a penalty function to realize preferential wind power consumption. The additional power calculation method is:

[0087]

[0088] Where, P sr，se and Q sr，se are the superimposed powers of the DPFC series part at the sending end of the line, P rs，se and Q rs，se are the superimposed powers of the DPFC series part at the receiving end of the line, g sr and b sr are the line conductance and susceptance, respectively, U se ∠θ se is the voltage source equivalent to the DPFC series part, U s ∠θ s and U r ∠θr Vbus is the voltage of the bus at both ends of the line.

[0089] The optimization objective calculation method is:

[0090]

[0091] Wherein, T is the total number of time periods in the target range, N is the total number of units in the target range, C SSit = m it S STi +n it S SDi is the start-stop cost of the conventional unit i, M it is the 0-1 variable of unit start, n it is the 0-1 variable of unit shutdown, S STi is the start cost of the conventional unit i, S SDi is the shutdown cost of the conventional unit i, C Git is the generation cost of the conventional unit i at time t, is the penalty function factor, is the curtailment power at time t, and ΔT is the time granularity of the generation plan.

[0092] The equality constraints and inequality constraints of the optimization problem include:

[0093]

[0094]

[0095] P Gi , min ≤ P Gi ≤ P Gi，max ;

[0096] QG i，min ≤ Q Gi ≤ Q Gi，max ;

[0097] U i，min ≤ U i ≤ U i，max ;

[0098] P sr，min ≤ P sr ≤ P sr，max ;

[0099] Q sr，min ≤ Q sr ≤ Q sr，max ;

[0100] U se，min ≤ U se ≤ U se，max ;

[0101] where P Di is the active load of node i connected to the branch without DPFC device, Q Di is the reactive load of node i connected to the branch without DPFC device, P Gi is the active power output of generator at node i, Q Gi is the reactive power output of generator at node i, U i is the node voltage, θ ij is the phase angle difference between nodes, G ij and B ij are the real and imaginary parts of the element in the node admittance matrix, P' Di is the active load of node i at the sending end of the DPFC branch, Q' Di is the reactive load of node i at the sending end of the DPFC branch, P" Di is the active load of node i at the receiving end of the DPFC branch, Q" Di is the reactive load of node i at the receiving end of the DPFC branch, P Gi，min and P Gi，max are the upper and lower limits of the active power output of generator at node i, U i，min and U i，max are the upper and lower limits of the node voltage, P sr，min and P sr，max are the upper and lower limits of the active power flow of the line subject to DPFC capacity constraint, Q sr，min and Q sr，max are the upper and lower limits of the reactive power flow of the line subject to DPFC capacity constraint, U se，min and U se，max are the upper and lower limits of the output voltage amplitude at the series side of the DPFC.

[0102] Step S3), solving the day-ahead scheduling model to obtain the total output voltage at the series side of the DPFC, assigning the output voltage to each DPFC series side converter on the corresponding line to achieve coordinated control, and scheduling each unit based on the day-ahead scheduling plan, the specific steps being:

[0103] S3.1) calculating the sensitivity SEN of each line flow in the network to the DPFC end voltage s and SEN r :

[0104]

[0105] where s and r respectively represent the sending end or receiving end of the DPFC installed line, j is other node in the network, P ij is the active power component of the flow between nodes i and j, U i is the bus voltage at node i, G ij is the real part of the (i, j) element in the node admittance matrix, B ijImaginary part of the (i, j) element of the nodal admittance matrix, θ ij Phase angle difference between i and j.

[0106] S3.2) Comparing SEN s with SEN r , determine the voltage output strategy of each element on the series side of the DPFC, as follows:

[0107] 3.2.1) For SEN s > SEN r , preferentially schedule the elements on the series side of the DPFC close to the sending end. For n elements on the series side of the line, numbered from the sending end bus, in turn, k = 1, 2, 3,..., n. From k = 1, the elements are assigned power in order of their maximum voltage U k，max , until k Ds elements are called to meet the line U se demand, that is:

[0108]

[0109] where U 0，max is defined as zero.

[0110] 3.2.2) For SEN s < SEN r , preferentially schedule the elements on the series side of the DPFC close to the receiving end. For n elements on the series side of the line, numbered from the receiving end bus, in turn, k = 1, 2, 3,..., n. From k = 1, the elements are assigned power in order of their maximum voltage U k，max , until k Dr elements are called to meet the line U se demand, that is:

[0111]

[0112] 3.2.3) For SEN s = SEN r , the output voltage of each element is assigned as follows:

[0113]

[0114] The optimization target selected in the embodiment introduces a wind curtailment cost with a penalty factor, which can adjust the power generation of conventional units to optimize wind power consumption and reduce the wind curtailment rate of the system. According to the characteristic that the distributed power flow controller can provide distributed control, the connection between the line end part of the distributed power flow controller and other buses is considered, and according to the position and capacity of each element on the series side of the distributed power flow controller, the output voltage of each unit is reasonably configured, and the execution efficiency of the distributed power flow controller to the dispatching command is optimized.

[0115] See Figure 4 The embodiment of the application shown provides a structural schematic diagram of a computer device. The computer device 400 provided by the embodiment of the application comprises a processor 410 and a memory 420, the memory 420 stores a computer program executable by the processor 410, and the computer program is executed by the processor 410 to execute the method as above.

[0116] The embodiment of the application further provides a storage medium 430, the storage medium 430 stores a computer program, and the computer program is executed by the processor 410 to execute the method as above.

[0117] The storage medium 430 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as a static random access memory (SRAM), an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a programmable read-only memory (PROM), a read-only memory (ROM), a magnetic memory, a flash memory, a magnetic disk or an optical disk.

[0118] In the description of the application, the terms "first", "second" are only used for the purpose of description, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include one or more of the features. The meaning of "a plurality of" is two or more, unless otherwise specifically limited.

[0119] In the present application, unless specifically defined otherwise and limited in the specification, the terms "mount", "connect", "connection", "contact", and the like, are to be construed as being apt to indicate either a fixed connection, or a detachable connection, or as one body; either a mechanical connection, or an electrical connection; either a direct connection, or an indirect connection via an intermediate medium; either an internal connection between two elements, or an interaction relationship between two elements. For those skilled in the art, the specific meanings of the above terms in the present application can be understood according to the specific circumstances.

[0120] In the description of the present application, the description of the terms "one embodiment", "some embodiments", "an example", "a specific example", or "some examples" means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present application. In the present specification, the illustrative description of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in any one or more embodiments or examples. In addition, the person skilled in the art can combine and combine the different embodiments or examples described in the present specification and the features of the different embodiments or examples, without contradiction.

[0121] Any process or method descriptions or descriptions of the flow diagrams in the present application can be understood as representing code modules, segments, or portions of code which include one or more executable instructions for performing specific logic functions or steps in the process, and the preferred embodiments of the present application include additional implementations in which the order of steps can be changed, including use of an alternate order of steps, for example, as can be necessary or desirable in part or in whole, to implement the functionality of the described functionality, and such an order of steps can be understood by one of ordinary skill in the art having the benefit of this description. The various embodiments of the application can be implemented in hardware, software, or a combination thereof.

[0122] The logic and / or steps represented in flow diagrams or otherwise described herein, for example, can be considered as a sequence of instructions to implement logic functions, and can be realized in any computer-readable medium for use by an instruction execution system, apparatus, or device, such as a computer-based system, processor- containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. In the context of this specification, a "computer-readable medium" can be any means that can contain, store, communicate, propagate or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium include an electronic connection (an electronic device), a portable computer diskette (a magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, and a portable compact disc read-only memory (CDROM). Further, the computer-readable medium can even be paper or other suitable medium upon which the program is printed, as the program can be electronically captured, for example, by optically scanning the paper or other suitable medium, then electronically converted into a form that is suitable for use by the instruction execution system, apparatus, or device, and then stored in computer memory.

[0123] It should be understood that aspects of the application can be implemented in hardware, software, firmware or combinations thereof. In the above embodiments, the various steps or methods can be implemented in software or firmware that is stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any of the following technologies, known in the art, or combinations thereof, can be used: discrete logic circuitry having logic gates for implementing logic functions upon data signals, application specific integrated circuits having appropriate combinational logic gates, programmable gate arrays (PGA), field programmable gate arrays (FPGA), and so forth.

[0124] Those of ordinary skill in the art can understand that all or part of the steps carried out by the above-mentioned embodiments can be completed by programs instructing related hardware, and the programs can be stored in a computer-readable storage medium. When the programs are executed, they include one or a combination of the steps of the method embodiments.

[0125] The storage medium mentioned above can be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it should be understood that the above-mentioned embodiments are exemplary and cannot be understood as limiting the present application, and those of ordinary skill in the art can make changes, modifications, replacements and variations to the above-mentioned embodiments within the scope of the present application.

Claims

1. A day-ahead scheduling method based on distributed power flow control, characterized in that, The method comprises the following steps: inputting information of each node in a network, inputting conductance and susceptance values of lines, inputting serial side converter number, capacity and position in lines of a distributed power flow controller (DPFC); adding additional power of the DPFC element in the network to form a day-ahead scheduling model with a minimum comprehensive operation cost and wind power abandonment cost of conventional units as an optimization target; solving the day-ahead scheduling model to obtain total output voltage of serial side of the DPFC, and distributing the output voltage to each serial side converter on corresponding lines to realize coordinated control, and scheduling each unit based on the day-ahead scheduling plan; the distributing the output voltage to each serial side converter on corresponding lines to realize coordinated control comprises the following steps: Sensitivity of line flows in a power network to dpfc terminal voltages with ; Comparison With Size, determine the voltage output strategy of each element on the series side of the DPFC, as follows: For the case of , the DPFC string-side elements close to the sending end are preferentially dispatched;​ For the case of , the DPFC string-side elements close to the receiving end are preferentially dispatched.​ 2. The day-ahead scheduling method based on distributed power flow control according to claim 1, characterized in that, the optimization target comprises: ； where T is the total number of time periods in the target range, N is the total number of units in the target range, is the start-up cost of conventional unit i, is a 0-1 variable for unit start-up, is a 0-1 variable for unit shut-down, is the start-up cost of conventional unit i, is the shut-down cost of conventional unit i, is the generation cost of conventional unit i at time t, p is the penalty function factor, is the curtailed wind power at time t, is the time granularity of the generation schedule.

3. The day-ahead scheduling method based on distributed power flow control according to claim 1, characterized in that, the wind power abandonment cost is represented by using a penalty function.

4. The day-ahead scheduling method based on distributed power flow control according to claim 1, wherein, the day-ahead scheduling model further comprises: a power balance constraint in which additional power of the DPFC element on a bus connected by a line is added; an inequality constraint in which power output limit value of the DPFC and serial side element output voltage limit value are added.

5. The day-ahead scheduling method based on distributed power flow control according to claim 1, wherein, Sensitivity of line flows in the computing network to the DPFC end voltages With , comprising: ； ； where s represents the sending end of the DPFC installed line, r represents the receiving end of the DPFC installed line, j is other nodes in the network, is the active component of the power flow between nodes s, j, is the active component of the power flow between nodes r, j, is the bus voltage of node j, is the real part of the (s, j) element in the node admittance matrix, is the real part of the (r, j) element in the node admittance matrix, is the imaginary part of the (s, j) element in the node admittance matrix, is the imaginary part of the (r, j) element in the node admittance matrix, is the phase angle difference between nodes s, j, is the phase angle difference between nodes r, j, is the bus voltage of node s, is the bus voltage of node r.

6. The day-ahead scheduling method based on distributed power flow control of claim 1, wherein, the priority scheduling of the serial side element of the DPFC close to a sending end comprises: For n series side elements on the line, numbered from the sending end bus, in turn, k = 1, 2, 3, …, n. From k = 1, the elements are arranged according to their maximum voltage Output until the call k Ds Element so that the line U se Demand, that is: ； wherein U 0,max is defined as zero.

7. The day-ahead scheduling method based on distributed power flow control according to claim 6, characterized in that, the priority scheduling of the serial side element of the DPFC close to a receiving end comprises: For n series side elements on the line, numbered from the busbar close to the receiving end, in turn, k = 1, 2, 3, …, n. From k = 1, the elements are arranged according to their maximum voltage Output until the call k Dr Element so that the line U se Demand, that is: 。 8.The day-ahead scheduling method based on distributed power flow control of claim 7, wherein, The comparison With Size, determine the voltage output strategy of each element on the series side of the DPFC, also includes: For the case of The output voltage for each element is assigned according to the following rules:​ 。 9. A day-ahead scheduling device based on distributed power flow control, characterized by, the device comprises: an input unit configured to input information of each node in a network, input conductance and susceptance values of lines, and input serial side converter number, capacity and position in lines of a distributed power flow controller (DPFC); a modeling unit configured to add additional power of the DPFC element in the network to form a day-ahead scheduling model with a minimum comprehensive operation cost and wind power abandonment cost of conventional units as an optimization target; a solving scheduling unit configured to solve the day-ahead scheduling model to obtain total output voltage of serial side of the DPFC, and distribute the output voltage to each serial side converter on corresponding lines to realize coordinated control, and schedule each unit based on the day-ahead scheduling plan.

10. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor implements the method according to any one of claims 1-8 when executing the computer program.

11. A storage medium having stored thereon a computer program, characterized in that The computer program is executed by the processor to implement the method according to any one of claims 1-8.

Images