New energy power generation gridding on-site consumption planning method, device, equipment and medium

Abstract

The invention discloses a new energy power generation gridding on-site consumption planning method, device and equipment and a medium, and relates to the field of new energy consumption, and the method comprises the steps: screening out a consumption path capable of passing through a current load according to the current power upper limit of a consumption node path, obtaining all nearest consumption paths through a Dijkstra algorithm, and carrying out the optimization of the consumption path through the Dijkstra algorithm; the optimized consumption path of the current load is obtained according to the preset path screening rule, the consumption path planning optimization of each load in the gridding area is realized, the consumption path unreasonability is effectively prevented, the nearby consumption is realized, and the loss is reduced. The method comprises the following steps: determining at least one digestible path and the path distance of each digestible path according to a preset upper limit value and the current load capacity of each node path; based on the Dijkstra algorithm and the path distance of the at least one digestible path, determining at least one target digestible path in the at least one digestible path; and adopting a preset path screening rule to screen out a new energy consumption path from the at least one target consumption path.

Description

Technical Field

[0001] The present application relates to the field of new energy consumption technology, and in particular to a method, device, equipment and medium for planning grid-based on-site consumption of new energy power generation. Background Art

[0002] With the increasing efforts in the development and utilization of renewable energy around the world, especially the remarkable progress in renewable energy power generation such as solar energy, wind energy, and hydropower. These new energy power generation are green, low-carbon, and renewable, which is of great significance for the sustainable development of clean energy. However, the problem of new energy consumption has become an important bottleneck restricting its development. The regional characteristics of new energy have led to an increase in the difficulty of consumption. New energy power generation is mainly concentrated in specific areas, and the transmission loss is large, which brings challenges to the operation of the power grid.

[0003] In the related technology, the distribution network is usually subjected to distributed consumption, but the applicant realizes that the consumption paths planned by the existing consumption methods are not reasonable enough, resulting in too much new energy being unable to be effectively consumed, resulting in waste of resources, and making the consumption results unable to meet the expected requirements, thereby affecting the operating reliability of new energy and the safe production capacity of the power grid. Summary of the invention

[0004] In view of this, the present application provides a method, device, equipment and medium for planning on-site grid-based consumption of renewable energy power generation. The main purpose is to solve the problem that the consumption path planned by the existing consumption method is not reasonable enough, resulting in too much renewable energy being unable to be effectively consumed, resulting in waste of resources, and the consumption results cannot meet the expected requirements, thereby affecting the operating reliability of the renewable energy and the safe production capacity of the power grid.

[0005] According to the first aspect of the present application, a method for planning grid-based local consumption of renewable energy power generation is provided, the method comprising:

[0006] Obtain a set of load nodes, use the set of load nodes to construct multiple node paths, and determine at least one absorptive path and the path distance of each absorptive path according to a preset upper limit value and the current load of each of the node paths, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power;

[0007] Obtaining a Dijkstra algorithm, and determining at least one target consumption path in the at least one consumption path based on the Dijkstra algorithm and the path distance of the at least one consumption path;

[0008] A preset path screening rule is obtained, and the preset path screening rule is used to screen out a new energy consumption path from the at least one target consumption path.

[0009] Optionally, determining at least one amenable path and the path distance of each amenable path according to a preset upper limit value and a current load of each node path includes:

[0010] Taking at least one node path among the multiple node paths whose current load is less than the preset upper limit value as the at least one amenable path;

[0011] The path distance of each of the absorbable paths is determined by referring to the distance between the starting load node and the ending load node of each of the absorbable paths.

[0012] Optionally, the method further comprises:

[0013] The node paths among the multiple node paths whose current loads are greater than or equal to the preset upper limit value are regarded as unavailable consumption paths, and the path distance of the unavailable consumption paths is set to infinity.

[0014] Optionally, the determining at least one target consumption path in the at least one consumeable path based on the Dijkstra algorithm and the path distance of the at least one consumeable path comprises:

[0015] Acquire a new energy power generation node and a final load node from the load node set;

[0016] According to the calculation strategy of the Dijkstra algorithm, a load node with the smallest distance value to the new energy power generation node is selected from the load node set as a target load node, an adjacent load node corresponding to the target load node is determined based on the at least one absorptive path, a shortest path from the new energy power generation node to the adjacent load node is determined according to the path distance of each absorptive path, and the target load node and the adjacent load node are removed from the load node set to obtain a first load node set;

[0017] Repeat the steps of selecting the load node with the smallest distance to the new energy power generation node from the first load node set as the target load node, determining the shortest path from the new energy power generation node to the adjacent load node based on the at least one absorbable path, and removing the target load node and the adjacent load node from the first load node set to obtain the second load node set, until the shortest path from the new energy power generation node to the final load node is determined to obtain the at least one target absorption path.

[0018] Optionally, the determining the adjacent load node corresponding to the target load node based on the at least one absorptive path, and determining the shortest path from the new energy power generation node to the adjacent load node according to the path distance of each absorptive path, comprises:

[0019] Acquire at least one target absorptive path including the target load node in the at least one absorptive path, and select a load node with the shortest path distance to the target load node in the at least one target absorptive path as the adjacent load node;

[0020] Obtaining a target path distance from the target load node to the adjacent load node from the path distance of the at least one target amenable path;

[0021] If the sum of the path distance from the target load node to the new energy power generation node and the target path distance is less than the path distance from the adjacent load node to the new energy power generation node, the sum of the path distance from the target load node to the new energy power generation node and the target path distance is used as the path distance from the adjacent load node to the new energy power generation node;

[0022] A path that passes through the new energy power generation node, the target load node, and the adjacent load node in sequence is taken as the shortest path from the new energy power generation node to the adjacent load node.

[0023] Optionally, the adopting the preset path screening rule to screen out a new energy consumption path from the at least one target consumption includes:

[0024] Respectively counting the number of turning points in each of the target consumption paths as the turning value of each of the target consumption paths;

[0025] The target consumption path with the smallest turning value is selected from the at least one target consumption path as the minimum new energy consumption path.

[0026] Optionally, the method further comprises:

[0027] If there are multiple target digestion paths with the smallest turning value, the multiple target digestion paths with the smallest turning value are used as multiple target digestible paths to be screened;

[0028] Obtaining the power generation of the new energy device, and calculating the total value of the current load of each target amenable path to be screened;

[0029] The difference between the total current load value of each target absorptive path to be screened and the power generation of the new energy device is calculated respectively, and the target absorptive path to be screened with the smallest difference is used as the new energy absorption path.

[0030] According to the second aspect of the present application, a new energy power generation grid-based local consumption planning device is provided, the device comprising:

[0031] An acquisition module is used to acquire a load node set, construct a plurality of node paths using the load node set, and determine at least one absorptive path and a path distance of each absorptive path according to a preset upper limit value and a current load of each of the node paths, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power;

[0032] A calculation module, used for obtaining a Dijkstra algorithm, and determining at least one target consumption path in the at least one consumption path based on the Dijkstra algorithm and the path distance of the at least one consumption path;

[0033] The screening module is used to obtain a preset path screening rule, and use the preset path screening rule to screen out a new energy consumption path from the at least one target consumption path.

[0034] Optionally, the acquisition module is used to take at least one node path among the multiple node paths whose current load is less than the preset upper limit value as the at least one absorbable path; and determine the path distance of each absorbable path by referring to the distance between the starting load node and the ending load node of each absorbable path.

[0035] Optionally, the acquisition module is used to take a node path among the multiple node paths whose current load is greater than or equal to the preset upper limit value as an unavailable consumption path, and set the path distance of the unavailable consumption path to infinity.

[0036] Optionally, the calculation module is used to obtain a new energy power generation node and a final load node in the load node set; according to the calculation strategy of the Dijkstra algorithm, select the load node with the smallest distance value to the new energy power generation node in the load node set as the target load node, determine the adjacent load node corresponding to the target load node based on the at least one absorbable path, determine the shortest path from the new energy power generation node to the adjacent load node according to the path distance of each absorbable path, and remove the target load node and the adjacent load node from the load node set to obtain a first load node set; repeat the operation of selecting the load node with the smallest distance value to the new energy power generation node in the first load node set as the target load node, determining the shortest path from the new energy power generation node to the adjacent load node based on the at least one absorbable path, and removing the target load node and the adjacent load node from the first load node set to obtain a second load node set, until the shortest path from the new energy power generation node to the final load node is determined to obtain the at least one target absorption path.

[0037] Optionally, the calculation module is used to obtain at least one target absorptive path including the target load node in the at least one absorptive path, select the load node with the shortest path distance to the target load node in the at least one target absorptive path as the adjacent load node; obtain the target path distance from the target load node to the adjacent load node in the path distance of the at least one target absorptive path; if the sum of the path distance from the target load node to the new energy power generation node and the target path distance is less than the path distance from the adjacent load node to the new energy power generation node, then the sum of the path distance from the target load node to the new energy power generation node and the target path distance is used as the path distance from the adjacent load node to the new energy power generation node; and the path passing through the new energy power generation node, the target load node, and the adjacent load node in sequence is used as the shortest path from the new energy power generation node to the adjacent load node.

[0038] Optionally, the screening module is used to count the number of turning points in each of the target consumption paths as the turning value of each of the target consumption paths; and select the target consumption path with the smallest turning value from at least one target consumption path as the minimum new energy consumption path.

[0039] Optionally, the screening module is used to, if there are multiple target consumption paths with the smallest turning values, use the multiple target consumption paths with the smallest turning values ​​as multiple target absorptive paths to be screened; obtain the power generation of the new energy device, and calculate the total current load value of each of the target absorptive paths to be screened; calculate the difference between the total current load value of each of the target absorptive paths to be screened and the power generation of the new energy device, and use the target absorptive path to be screened with the smallest difference as the new energy consumption path.

[0040] According to a third aspect of the present application, a device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of any one of the methods described in the first aspect when executing the computer program.

[0041] According to a fourth aspect of the present application, a medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the steps of any one of the methods described in the first aspect are implemented.

[0042] By means of the above technical solution, the technical solution provided by the embodiment of the present invention has at least the following advantages:

[0043] The present application provides a method, device, equipment and medium for planning grid-based local consumption of new energy power generation. The present application obtains a set of load nodes, constructs multiple node paths using the set of load nodes, determines at least one absorptive path and the path distance of each absorptive path according to a preset upper limit value and the current load of each node path, obtains the Dijkstra algorithm, determines at least one target consumption path in at least one absorptive path based on the Dijkstra algorithm and the path distance of at least one absorptive path, obtains a preset path screening rule, and uses the preset path screening rule to screen out a new energy consumption path from at least one target consumption path, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power. According to the current power upper limit of the consumption node path, the consumption path that can pass the current load is screened out, and then the Dijkstra algorithm is used to obtain all the nearest consumption paths. Finally, the optimized consumption path of the current load is obtained according to the preset path screening rule, which can realize the optimization of the consumption path planning of each load in the grid area, effectively prevent unreasonable consumption paths, realize local consumption, and reduce losses.

[0044] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present application. Also, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:

[0046] Figure 1 A schematic diagram of a method flow for planning grid-based local consumption of renewable energy power generation provided in an embodiment of the present application is shown;

[0047] Figure 2A A schematic diagram of another method flow for grid-based local consumption planning of renewable energy power generation provided in an embodiment of the present application is shown;

[0048] Figure 2B The weighted directed graph provided by the embodiment of the present application is shown;

[0049] Figure 2C A first shortest path schematic diagram provided in an embodiment of the present application is shown;

[0050] Figure 2D A second shortest path schematic diagram provided in an embodiment of the present application is shown;

[0051] Figure 3 A schematic diagram of the structure of a grid-based local consumption planning for renewable energy power generation provided in an embodiment of the present application is shown;

[0052] Figure 4 A schematic diagram of the device structure of a device provided in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0053] The exemplary embodiments of the present application will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present application are shown in the accompanying drawings, it should be understood that the present application can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided in order to enable a more thorough understanding of the present application and to fully convey the scope of the present application to those skilled in the art.

[0054] The present application embodiment provides a method for planning the grid-based local consumption of renewable energy power generation. Figure 1 As shown, the method includes:

[0055] 101. Obtain a load node set, use the load node set to construct multiple node paths, and determine at least one absorptive path and a path distance of each absorptive path according to a preset upper limit value and a current load of each node path.

[0056] Since renewable energy power generation is mainly concentrated in specific areas, transmission losses are large, which brings challenges to the operation of the power grid. The regional characteristics of renewable energy also increase the difficulty of absorption. Therefore, it is necessary to study new power grid technologies and local absorption strategies to better integrate and utilize renewable energy.

[0057] To solve this problem, this application proposes a grid-based local consumption planning method for renewable energy power generation. According to the current power upper limit of the consumption node path, the consumption path that can pass the current load is screened out, and the Dijkstra algorithm is used to obtain all the nearest consumption paths. According to the preset path screening rules, the optimized consumption path of the current load is obtained, which can realize the optimization of the consumption path planning of each load in the grid area, effectively prevent unreasonable consumption paths, realize local consumption, and reduce losses. The execution subject of this application can be a consumption planning system, which relies on the computing power of the server to provide services to users. The server can be an independent server, or it can provide cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDN), and servers of basic cloud computing such as big data and artificial intelligence platforms, so that the consumption planning system can quickly, accurately and reasonably plan the optimal consumption path.

[0058] In an embodiment of the present application, the consumption planning system obtains a set of load nodes, wherein the set of load nodes includes a starting point for renewable energy power generation, a load end point, and a plurality of intermediate load nodes. Next, the consumption planning system uses the set of load nodes to construct a plurality of node paths, and determines at least one digestible path and the path distance of each digestible path according to a preset upper limit value and the current load of each node path, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the renewable energy power generation device and the upper limit value of the line power. The gridding of renewable energy power generation is realized through the set of load nodes, so as to determine the optimal path for local consumption.

[0059] 102. Obtain a Dijkstra algorithm, and determine at least one target consumption path in the at least one consumption path based on the Dijkstra algorithm and a path distance of at least one consumption path.

[0060] In an embodiment of the present application, the consumption planning system obtains the Dijstra algorithm, and based on the Dijstra algorithm and the path distance of at least one absorptive path, determines at least one target consumption path in at least one absorptive path, that is, the shortest path from the renewable energy power generation node to the final load node. The consumption planning system uses the Dijstra algorithm to accurately find the shortest path from the renewable energy power generation node to the final load node, ensuring that the result obtained is optimal and correct.

[0061] 103. Obtain a preset path screening rule, and use the preset path screening rule to screen out a new energy consumption path from at least one target consumption path.

[0062] In the embodiment of the present application, the consumption planning system obtains a preset path screening rule, and uses the preset path screening rule to screen out a new energy consumption path from at least one target consumption path. Since there may be multiple paths between nodes and multiple shortest paths, the consumption planning system further screens out the preferred shortest path from all shortest paths according to the preset path screening rule, and uses the preferred shortest path as the consumption path of the current load, effectively preventing unreasonable consumption paths, achieving nearby consumption, and reducing losses.

[0063] The method provided by the embodiment of the present application has at least the following advantages: obtaining a set of load nodes, using the set of load nodes to construct multiple node paths, determining at least one absorptive path and the path distance of each absorptive path according to the preset upper limit value and the current load of each node path, obtaining the Dijkstra algorithm, determining at least one target absorptive path in at least one absorptive path based on the Dijkstra algorithm and the path distance of at least one absorptive path, obtaining a preset path screening rule, and using the preset path screening rule to screen out a new energy absorptive path from at least one target absorptive path, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power. According to the current power upper limit of the absorptive node path, a absorptive path that can pass the current load is screened out, and then the Dijkstra algorithm is used to obtain all the nearest absorptive paths. Finally, according to the preset path screening rule, the optimized absorptive path of the current load is obtained, which can realize the optimization of the absorptive path planning of each load in the grid area, effectively prevent the unreasonable absorptive path, realize the nearest absorptive path, and reduce the loss.

[0064] Further, as a refinement and expansion of the specific implementation of the above embodiment, in order to fully illustrate the specific implementation process of this embodiment, the embodiment of the present application provides another grid-based local consumption planning method for renewable energy power generation, such as Figure 2A As shown, the method includes:

[0065] 201. Obtain a load node set, use the load node set to construct multiple node paths, and determine at least one absorptive path and a path distance of each absorptive path according to a preset upper limit value and a current load amount of each node path.

[0066] In the embodiment of the present application, the consumption planning system constructs multiple node paths according to the load node set. Then, the consumption planning system obtains the preset upper limit value and the current load of each node path, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power, and the current load of the node path is the total load assuming that all loads before the current load pass through this node path.

[0067] Subsequently, the consumption planning system traverses the current load of all node paths, and uses the node paths whose current load does not exceed the upper limit of the power generation of the new energy power generation device or the upper limit of the line power (the smaller value of the two) as the node paths that can absorb the current load. Specifically, the consumption planning system uses at least one node path whose current load is less than the preset upper limit value among multiple node paths as at least one absorbable path. Next, the consumption planning system determines the path distance of each absorbable path with reference to the distance between the starting load node and the ending load node of each absorbable path. In addition, the consumption planning system uses the node paths whose current load is greater than or equal to the preset upper limit value among multiple node paths as unavailable absorption paths, and sets the path distance of the unavailable absorption paths to infinity.

[0068] In one embodiment, Total(e) is defined to represent the current load on the node path e, and the two adjacent nodes corresponding to the node path e are Vi and Vj. When Total(e) < the upper limit of the power generation of the new energy power generation device or the upper limit of the line power (the smaller value between the two), the state quantity f of the node path e is set to 1, indicating an available consumption path, and the path distance between the two nodes is w(Vi, Vj); when Total(e) ≥ the upper limit of the power generation of the new energy power generation device or the upper limit of the line power (the smaller value between the two), the state quantity f of the node path e is set to 0, indicating an unavailable consumption path, and the consumption path length between the two nodes is infinite.

[0069] Further, as described in steps 202 to 204 below, the consumption planning system uses the Dijkstra algorithm to determine all shortest paths from the new energy power generation node to the final load node based on the screened node paths.

[0070] 202. Obtain the new energy generation node and the final load node from the load node set.

[0071] In the embodiment of the present application, the consumption planning system obtains the new energy generation node and the final load node in the load node set. Moreover, the consumption planning system defines an auxiliary vector and initializes the auxiliary vector.

[0072] 203. According to the calculation strategy of the Dijkstra algorithm, the load node with the smallest distance value to the new energy power generation node is selected as the target load node in the load node set, the adjacent load node corresponding to the target load node is determined based on at least one absorptive path, the shortest path from the new energy power generation node to the adjacent load node is determined according to the path distance of each absorptive path, and the target load node and the adjacent load nodes are removed from the load node set to obtain the first load node set.

[0073] In the embodiment of the present application, according to the calculation strategy of the Dijkstra algorithm, the consumption planning system first obtains at least one target absorptive path including the target load node in at least one absorptive path, and selects the load node with the shortest path distance to the target load node in at least one target absorptive path as the adjacent load node. Then, the consumption planning system obtains the target path distance from the target load node to the adjacent load node in the path distance of at least one target absorptive path; if the sum of the path distance from the target load node to the new energy power generation node and the target path distance is less than the path distance from the adjacent load node to the new energy power generation node, then the sum of the path distance from the target load node to the new energy power generation node and the target path distance is used as the path distance from the adjacent load node to the new energy power generation node, and the path passing through the new energy power generation node, the target load node, and the adjacent load node in sequence is used as the shortest path from the new energy power generation node to the adjacent load node.

[0074] 204. Repeat the operation of selecting the load node with the smallest distance value to the new energy power generation node in the first load node set as the target load node, and determining the shortest path from the new energy power generation node to the adjacent load node based on at least one absorbable path, and removing the target load node and the adjacent load node in the first load node set to obtain the second load node set, until the shortest path from the new energy power generation node to the final load node is determined and at least one target absorption path is obtained.

[0075] In an embodiment of the present application, the consumption planning system repeatedly selects the load node with the smallest distance value from the new energy generation node in the first load node set as the target load node, and determines the shortest path from the new energy generation node to the adjacent load node based on at least one absorbable path. For example, step (1) determines the cable laying starting point Vs, initializes the auxiliary vector D[Vs]=0, indicating that the path does not extend outward from the starting position to the absorption path, takes a node Vi with the smallest distance from the node set V that has not been extended and absorbed, and sets the state of Vi to laid. Then, the consumption planning system removes the target load node and the adjacent load node from the first load node set to obtain the operation of the second load node set until the shortest path from the new energy generation node to the final load node is determined, and at least one target absorption path is obtained. For example, step (2) determines the node Vj adjacent to the node Vi, if D[Vi]+w(Vi, Vj)<D[Vj], then D[Vj] is corrected to a shorter distance D[Vi]+w(Vi, Vj), at this time, the previous node of the shortest path from Vs to the node Vj is Vi. Step (3) Repeat step (2) until the end point Vt is found. At this time, the vector D[Vt] is the shortest path from the current load to the new energy power generation device. Based on the Dijkstra algorithm, the consumption planning system can reasonably plan the consumption path of the distribution network and make reasonable use of energy.

[0076] 205. Obtain a preset path screening rule, and use the preset path screening rule to screen out a new energy consumption path from at least one target consumption path.

[0077] In the embodiment of the present application, since there may be multiple paths between nodes, there may also be multiple shortest paths. Therefore, it is necessary to further select the preferred shortest path from all the shortest paths according to the preset path screening rules, and use the preferred shortest path as the current load consumption path. The preset path screening rules are: if there are multiple shortest paths, the shortest path with the least turns is used as the preferred shortest path; if there are multiple shortest paths with the shortest path and the least turns, the shortest path with the sum of the current load closest to the power generation of the new energy device is used as the preferred shortest path.

[0078] Specifically, the consumption planning system counts the number of turning points in each target consumption path as the turning value of each target consumption path. Then, the consumption planning system selects the target consumption path with the smallest turning value in at least one target consumption path as the minimum new energy consumption path, which can optimize the consumption path planning of each load in the grid area, effectively prevent unreasonable consumption paths, realize nearby consumption, and reduce losses.

[0079] In an optional implementation scheme, if there are multiple target consumption paths with the smallest turning value, the consumption planning system uses the multiple target consumption paths with the smallest turning value as multiple target consumption paths to be screened. Next, the consumption planning system obtains the power generation of the new energy device and calculates the total current load value of each target consumption path to be screened. Finally, the consumption planning system calculates the difference between the total current load value of each target consumption path to be screened and the power generation of the new energy device, and uses the target consumption path to be screened with the smallest difference as the new energy consumption path.

[0080] Based on the above process, a grid-based local consumption planning process for renewable energy power generation proposed in the embodiment of the present application is as follows:

[0081] 1) Define a two-dimensional array prev[i][j], which represents the shortest path from node Vi to node Vj, and prev[0][i]→prev[j][i] represents the node set of the shortest path segment connected to Vi. When using the Dijkstra algorithm to solve the shortest path, the point set is continuously updated to eventually obtain the shortest node set to node i, which is the pre-order node set.

[0082] 2) Starting from the end point Vt, search for the pre-order node set of Vt through step 1). If the number of pre-order node arrays is greater than 1, it means that there are multiple shortest consumption paths. Recursively search for each pre-order node of the consumption end point according to the number of pre-order nodes until the starting point is found. In this way, all the shortest consumption paths are output.

[0083] Next, the coordinates of each node are set as Vi (x, y, z) in three dimensions, and whether to turn is determined based on the conditions of the three coordinate points Vi-1, Vi, and Vi+1. Then, based on all the path sets, recursively search for the path with the least number of turns.

[0084] 3) When the number of turns is the least, the path with the load closest to the power generation of the new energy device is preferred. If there are multiple paths with the same number of turns, the load of each path Total(e)min is found, and the path closest to the power generation of the new energy power generation device is the optimal path.

[0085] In one embodiment, if Figure 2BFor the weighted directed graph shown, the travel lengths are w(Vs, V1)=10, w(V1, V2)=7, w(V2, Vt)=4, w(Vs, V3)=8, w(V3, V2)=9, w(V3, V4)=6, w(V4, Vt)=7; the current absorption path quantities are Total(es1)=24, Total(e12)=99, Total(e2t)=12, Total(es3)=9, Total(e32)=79, Total(e34)=33, Total(e4t)=52; and the upper limit of the floor area ratio is 99.

[0086] The process of determining the consumption path is as follows;

[0087] S1) Determine the starting point Vs of renewable energy power generation, the end point Vt of load, and the intermediate nodes V1, V2, V3, and V4;

[0088] S2) Optimizing the consumption path through load limiting algorithm;

[0089] Total(e12)=99≥line load limit, so w(V1, V2)=∞;

[0090] The traffic state quantity of the path between Vs and V1 is fs1=1, the traffic state quantity of the path between V1 and V2 is f12=0, the traffic state quantity of the path between V2 and Vt is f2t=1, the traffic state quantity of the path between Vs and V3 is fs3=1, the traffic state quantity of the path between V3 and V2 is f32=1, the traffic state quantity of the path between V3 and V4 is f34=1, and the traffic state quantity of the path between V4 and Vt is f4t=1; V1 to V2 is not passable.

[0091] S3) Find the shortest path between Vs and Vt by Dijstra algorithm and get two shortest paths, such as Figure 2C , 2D As shown:

[0092] w(Vs, Vt)=w(Vs, V3)+w(V3, V2)+w(V2, Vt)=21;

[0093] w(Vs,Vt)=w(Vs,V4)+w(V4,Vt)=21.

[0094] S4) Optimize the consumption path by the principle of minimum turns;

[0095] The shortest path w(Vs, V3)+w(V3, V2)+w(V2, Vt) has 2 turns, and the shortest path w(Vs, V4)+w(V4, Vt) has 1 turn. Taking the path with the least turns as the optimal path, then the optimal path is w(Vs, V4)+w(V4, Vt).

[0096] The method provided by the embodiment of the present application has at least the following advantages: obtaining a set of load nodes, using the set of load nodes to construct multiple node paths, determining at least one absorptive path and the path distance of each absorptive path according to the preset upper limit value and the current load of each node path, obtaining the Dijkstra algorithm, determining at least one target absorptive path in at least one absorptive path based on the Dijkstra algorithm and the path distance of at least one absorptive path, obtaining a preset path screening rule, and using the preset path screening rule to screen out a new energy absorptive path from at least one target absorptive path, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power. According to the current power upper limit of the absorptive node path, a absorptive path that can pass the current load is screened out, and then the Dijkstra algorithm is used to obtain all the nearest absorptive paths. Finally, according to the preset path screening rule, the optimized absorptive path of the current load is obtained, which can realize the optimization of the absorptive path planning of each load in the grid area, effectively prevent the unreasonable absorptive path, realize the nearest absorptive path, and reduce the loss.

[0097] Further, as Figure 1 In the specific implementation of the method, the embodiment of the present application provides a grid-based local consumption planning device for renewable energy power generation, such as Figure 3 As shown, the device includes: an acquisition module 301, a calculation module 302 and a screening module 303.

[0098] An acquisition module 301 is used to acquire a load node set, and determine at least one absorptive path and a path distance of each absorptive path according to the load node set;

[0099] A calculation module 302 is used to obtain a Dijkstra algorithm, and determine at least one target consumption path in the at least one consumption path based on the Dijkstra algorithm and the path distance of the at least one consumption path;

[0100] The screening module 303 is used to obtain a preset path screening rule, and use the preset path screening rule to screen out a new energy consumption path from the at least one target consumption path.

[0101] In a specific application scenario, the acquisition module 301 is used to construct multiple node paths based on the load node set; obtain a preset upper limit value and the current load of each of the node paths, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power; take at least one node path among the multiple node paths whose current load is less than the preset upper limit value as the at least one absorbable path; and determine the path distance of each absorbable path by referring to the distance between the starting load node and the ending load node of each absorbable path.

[0102] In a specific application scenario, the acquisition module 301 is used to take the node paths among the multiple node paths whose current load is greater than or equal to the preset upper limit value as unavailable consumption paths, and set the path distance of the unavailable consumption path to infinity.

[0103] In a specific application scenario, the calculation module 302 is used to obtain a new energy power generation node and a final load node in the load node set; according to the calculation strategy of the Dijkstra algorithm, select the load node with the smallest distance value from the new energy power generation node in the load node set as the target load node, determine the adjacent load node corresponding to the target load node based on the at least one absorbable path, determine the shortest path from the new energy power generation node to the adjacent load node according to the path distance of each absorbable path, and remove the target load node and the adjacent load node from the load node set to obtain a first load node set; repeat the operation of selecting the load node with the smallest distance value from the new energy power generation node in the first load node set as the target load node, determining the shortest path from the new energy power generation node to the adjacent load node based on the at least one absorbable path, and removing the target load node and the adjacent load node from the first load node set to obtain a second load node set, until the shortest path from the new energy power generation node to the final load node is determined to obtain the at least one target absorption path.

[0104] In a specific application scenario, the calculation module 302 is used to obtain at least one target absorptive path including the target load node in the at least one absorptive path, and select the load node with the shortest path distance to the target load node in the at least one target absorptive path as the adjacent load node; obtain the target path distance from the target load node to the adjacent load node in the path distance of the at least one target absorptive path; if the sum of the path distance from the target load node to the new energy power generation node and the target path distance is less than the path distance from the adjacent load node to the new energy power generation node, then the sum of the path distance from the target load node to the new energy power generation node and the target path distance is used as the path distance from the adjacent load node to the new energy power generation node; and the path passing through the new energy power generation node, the target load node, and the adjacent load node in sequence is used as the shortest path from the new energy power generation node to the adjacent load node.

[0105] In a specific application scenario, the screening module 303 is used to count the number of turning points in each of the target consumption paths as the turning value of each of the target consumption paths; and select the target consumption path with the smallest turning value in at least one target consumption path as the minimum new energy consumption path.

[0106] In a specific application scenario, the screening module 303 is used to, if there are multiple target consumption paths with the smallest turning values, use the multiple target consumption paths with the smallest turning values ​​as multiple target absorptive paths to be screened; obtain the power generation of the new energy device, and calculate the total current load value of each of the target absorptive paths to be screened; calculate the difference between the total current load value of each of the target absorptive paths to be screened and the power generation of the new energy device, and use the target absorptive path to be screened with the smallest difference as the new energy consumption path.

[0107] The device provided by the embodiment of the present application has at least the following advantages: obtaining a set of load nodes, using the set of load nodes to construct multiple node paths, determining at least one absorbable path and the path distance of each absorbable path according to the preset upper limit value and the current load of each node path, obtaining the Dijkstra algorithm, determining at least one target absorption path in at least one absorbable path based on the Dijkstra algorithm and the path distance of at least one absorbable path, obtaining a preset path screening rule, and using the preset path screening rule to filter out a new energy absorption path from at least one target absorption path, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power. According to the current power upper limit of the absorption node path, the absorption path that can pass the current load is filtered out, and then the Dijkstra algorithm is used to obtain all the nearest absorption paths, and finally the optimized absorption path of the current load is obtained according to the preset path screening rule, which can realize the optimization of the absorption path planning of each load in the grid area, effectively prevent the unreasonable absorption path, realize the nearby absorption, and reduce the loss.

[0108] It should be noted that for other corresponding descriptions of the functional units involved in the grid-based local consumption planning device for renewable energy power generation provided in the embodiment of the present application, please refer to Figure 1 and FIG. 2A to FIG. 2D The corresponding description in will not be repeated here.

[0109] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0110] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0111] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

[0112] In an exemplary embodiment, see Figure 4 , and also provides a device, which includes a bus, a processor, a memory and a communication interface, and may also include an input and output interface and a display device, wherein each functional unit can communicate with each other through the bus. The memory stores a computer program, and the processor is used to execute the program stored in the memory and execute the grid-based local consumption planning method for new energy power generation in the above embodiment.

[0113] A medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the steps of the grid-based local consumption planning method for new energy power generation are implemented.

[0114] Through the description of the above implementation methods, those skilled in the art can clearly understand that the present application can be implemented by hardware, or by means of software plus a necessary general hardware platform. Based on such an understanding, the technical solution of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each implementation scenario of the present application.

[0115] Those skilled in the art will appreciate that the accompanying drawings are merely schematic diagrams of a preferred implementation scenario, and the modules or processes in the accompanying drawings are not necessarily required for implementing the present application.

[0116] Those skilled in the art will appreciate that the modules in the device in the implementation scenario can be distributed in the device in the implementation scenario according to the implementation scenario description, or can be changed accordingly and located in one or more devices different from the implementation scenario. The modules in the above implementation scenario can be combined into one module, or can be further split into multiple sub-modules.

[0117] The above application serial numbers are for description only and do not represent the advantages or disadvantages of the implementation scenarios.

[0118] The above disclosure only discloses several specific implementation scenarios of the present application. However, the present application is not limited thereto, and any changes that can be conceived by technicians in this field should fall within the scope of protection of the present application.

Claims

1. A grid-based local consumption planning method for renewable energy power generation, characterized in that: include: Obtain a set of load nodes, use the set of load nodes to construct multiple node paths, and determine at least one absorptive path and the path distance of each absorptive path according to a preset upper limit value and the current load of each of the node paths, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power; Obtaining a Dijkstra algorithm, and determining at least one target consumption path in the at least one consumption path based on the Dijkstra algorithm and the path distance of the at least one consumption path; A preset path screening rule is obtained, and the preset path screening rule is used to screen out a new energy consumption path from the at least one target consumption path.

2. The method according to claim 1, characterized in that The step of determining at least one amenable path and the path distance of each amenable path according to the preset upper limit value and the current load of each node path comprises: Taking at least one node path among the multiple node paths whose current load is less than the preset upper limit value as the at least one amenable path; The path distance of each of the absorbable paths is determined by referring to the distance between the starting load node and the ending load node of each of the absorbable paths.

3. The method according to claim 2, characterized in that The method further comprises: The node paths among the multiple node paths whose current loads are greater than or equal to the preset upper limit value are regarded as unavailable consumption paths, and the path distance of the unavailable consumption paths is set to infinity.

4. The method according to claim 1, characterized in that: The step of determining at least one target consumption path in the at least one consumeable path based on the Dijkstra algorithm and the path distance of the at least one consumeable path comprises: Acquire a new energy power generation node and a final load node from the load node set; According to the calculation strategy of the Dijkstra algorithm, a load node with the smallest distance value to the new energy power generation node is selected from the load node set as a target load node, an adjacent load node corresponding to the target load node is determined based on the at least one absorptive path, a shortest path from the new energy power generation node to the adjacent load node is determined according to the path distance of each absorptive path, and the target load node and the adjacent load node are removed from the load node set to obtain a first load node set; Repeat the steps of selecting the load node with the smallest distance to the new energy power generation node from the first load node set as the target load node, determining the shortest path from the new energy power generation node to the adjacent load node based on the at least one absorbable path, and removing the target load node and the adjacent load node from the first load node set to obtain the second load node set, until the shortest path from the new energy power generation node to the final load node is determined to obtain the at least one target absorption path.

5. The method according to claim 4, characterized in that The step of determining the adjacent load node corresponding to the target load node based on the at least one absorptive path, and determining the shortest path from the new energy power generation node to the adjacent load node according to the path distance of each absorptive path, comprises: Acquire at least one target absorptive path including the target load node in the at least one absorptive path, and select a load node with the shortest path distance to the target load node in the at least one target absorptive path as the adjacent load node; Obtaining a target path distance from the target load node to the adjacent load node from the path distance of the at least one target amenable path; If the sum of the path distance from the target load node to the new energy power generation node and the target path distance is less than the path distance from the adjacent load node to the new energy power generation node, the sum of the path distance from the target load node to the new energy power generation node and the target path distance is used as the path distance from the adjacent load node to the new energy power generation node; A path that passes through the new energy power generation node, the target load node, and the adjacent load node in sequence is taken as the shortest path from the new energy power generation node to the adjacent load node.

6. The method according to claim 1, characterized in that The using the preset path screening rule to screen out a new energy consumption path from the at least one target consumption includes: Respectively counting the number of turning points in each of the target consumption paths as the turning value of each of the target consumption paths; The target consumption path with the smallest turning value is selected from the at least one target consumption path as the minimum new energy consumption path.

7. The method according to claim 6, characterized in that The method further comprises: If there are multiple target digestion paths with the smallest turning value, the multiple target digestion paths with the smallest turning value are used as multiple target digestible paths to be screened; Obtaining the power generation of the new energy device, and calculating the total value of the current load of each target amenable path to be screened; The difference between the total current load value of each target absorptive path to be screened and the power generation of the new energy device is calculated respectively, and the target absorptive path to be screened with the smallest difference is used as the new energy absorption path.

8. A grid-based local consumption planning device for renewable energy power generation, characterized in that: include: An acquisition module is used to acquire a load node set, construct a plurality of node paths using the load node set, and determine at least one absorptive path and a path distance of each absorptive path according to a preset upper limit value and a current load of each of the node paths, wherein the preset upper limit value is the minimum value of the upper limit value of the power generation of the new energy power generation device and the upper limit value of the line power; A calculation module, used for obtaining a Dijkstra algorithm, and determining at least one target consumption path in the at least one consumption path based on the Dijkstra algorithm and the path distance of the at least one consumption path; The screening module is used to obtain a preset path screening rule, and use the preset path screening rule to screen out a new energy consumption path from the at least one target consumption path.

9. A device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images