A method and device for dividing a photovoltaic power station bus area

Abstract

The application discloses a kind of photovoltaic power station confluence area division method and device, according to the preliminary block of each confluence area preliminary block obtained by processing original support data according to preset linear programming strategy, square matrix is obtained by processing each confluence area preliminary block to divide row, the length of majority of support in square matrix and the length of majority of support left and right spacing are used to determine segmentation length, based on the segmentation length of confluence area division line, based on the segmentation line of confluence area, isolated block detection is carried out, and the isolated block detected is processed to obtain each confluence area block, and the string in each confluence area block is processed according to integer programming to obtain target confluence area division result.The application realizes the automatic division of photovoltaic power station confluence area based on considering global factors of photovoltaic power station, compared with artificial division, improves the confluence area division efficiency and the accuracy of division result, so as to be more in line with the actual design situation of photovoltaic power station.

Description

Technical Field

[0001] This invention relates to the field of photovoltaic power plant technology, and more specifically, to a method and apparatus for dividing the collector zone of a photovoltaic power plant. Background Technology

[0002] In photovoltaic (PV) power plant design, support structures serve as the smallest modules for PV power generation, and a certain number of support structures form a collector zone. Currently, the division of collector zones in PV power plant designs largely relies on the experience of designers. This not only results in low efficiency but also leads to inconsistent results, with significant discrepancies compared to the actual design of the PV power plant. Summary of the Invention

[0003] In view of this, the present invention discloses a method and apparatus for dividing the runner area of ​​a photovoltaic power station, which realizes the automatic division of the runner area of ​​the photovoltaic power station based on the consideration of global factors of the photovoltaic power station, improves the efficiency of runner area division and the accuracy of the division results, and thus better conforms to the actual design of the photovoltaic power station.

[0004] A method for dividing the collector zone of a photovoltaic power station includes:

[0005] The original stent data is processed according to a preset linear programming strategy to obtain preliminary blocks for each busbar area;

[0006] Each of the aforementioned convergence zones is initially divided into blocks and then processed to obtain a matrix;

[0007] The segmentation length is determined based on the mode of the support length and the mode of the left-right spacing length within the square array.

[0008] The confluence zone dividing line is determined based on the stated dividing length;

[0009] Isolated block detection is performed based on the busbar segmentation line, and the detected isolated blocks are processed to obtain each busbar segmentation block;

[0010] The strings in each of the aforementioned busbar regions are processed according to integer programming to obtain the target busbar region division result.

[0011] Optionally, determining the segmentation length based on the mode of the support lengths and the mode of the left-right spacing lengths within the matrix includes:

[0012] Determine the mode of the length of the support within the square array and the mode of the left-right spacing length of the support;

[0013] Determine the maximum number of branches in the convergence zone, the number of rows in the support structure, and the maximum number of strings in the support structure;

[0014] The segmentation length is determined based on the mode of the bracket length, the mode of the left-right spacing length of the bracket, the maximum number of branches, the minimum number of branches, and the maximum number of clusters of the bracket.

[0015] Optionally, determining the merge zone dividing line based on the dividing length includes:

[0016] Determine the number of rows and columns to the left of the dividing line within the first threshold range of the dividing line, and the number of rows and columns to the right of the dividing line within the second threshold range of the dividing line;

[0017] If there exists a first target row where the number of rows and columns on the left is greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the leftmost side of the first target row.

[0018] If there exists a second target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the rightmost side of the second target row.

[0019] If there exists a third target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence area segmentation line will be shifted to the side with fewer columns.

[0020] Optionally, the step of detecting isolated blocks based on the busbar segmentation line and processing the detected isolated blocks to obtain each busbar segmentation block includes:

[0021] The remaining support structure in the busbar region is divided into M clusters by density, resulting in M ​​clusters, where M is a positive integer.

[0022] The previously segmented stents are density-clustered to obtain N classes, where N is a positive integer.

[0023] If M > 1 or N > 1, then the isolated block is determined to exist;

[0024] Build a minimum spanning tree from M+N blocks, and merge blocks in the minimum spanning tree that have less than half the minimum number of branches into adjacent blocks;

[0025] Update the minimum spanning tree and return to determine M and N again, repeating this process until all blocks are no less than half the minimum number of branches.

[0026] Optionally, the step of processing the strings in each of the busbar area blocks according to the overall plan to obtain the target busbar area division result includes:

[0027] The strings in each of the aforementioned busbar blocks are processed using an integer programming method to obtain integer programming results, wherein the integer programming results include: the number of string swaps, the swap direction, and the number of busbars;

[0028] Construct a minimum spanning tree using the adjacent split installation point set in the integer programming result;

[0029] Calculate the shortest distance between each support point in the minimum spanning tree, and determine the support point with the shortest distance;

[0030] Density clustering is performed within a preset range of the nearest support point to obtain cluster data;

[0031] The target confluence area division result is obtained based on the clustered data and the segmented data.

[0032] Optionally, the process of processing the original stent data according to a preset linear programming strategy to obtain preliminary blocks for each busbar region includes:

[0033] The original support data is processed into rows to obtain the array support data;

[0034] The initial blocks are obtained by dynamically calculating the array support data;

[0035] Determine the connection relationship between each of the initialization blocks to obtain each target block containing the group string in the tree data structure;

[0036] Perform combiner box configuration calculations on the array support data to obtain combiner box configuration information;

[0037] The target block with the fewest strings in each target block in the tree data structure is taken as the starting block. Based on the junction box configuration information, each block is processed starting from the starting block to obtain the preliminary blocks of each junction area.

[0038] Optionally, the process of splitting the original support data into rows to obtain the array support data includes:

[0039] Obtain all the original support data in the photovoltaic power station support planning diagram;

[0040] The original support data in the north-south direction of the photovoltaic power station support plan are sorted in descending order of value to obtain the latest support data;

[0041] The latest support data that have the same north-south direction values ​​belonging to the same row and whose vertical spacing is the preset support width are grouped into the same row.

[0042] The latest support data, after being divided, is sorted in ascending order along the east-west direction of the photovoltaic power station support planning map to obtain the array support data.

[0043] Optionally, the step of dynamically calculating the initial blocks from the array support data includes:

[0044] Obtain basic information about the support positions of each square array from the square array support data;

[0045] Density clustering is performed on the array support data based on the basic information of the support location to obtain the initial blocks.

[0046] Optionally, determining the connection relationships between the initialization blocks to obtain each target block containing the group string in the tree data structure includes:

[0047] Each of the initialization blocks is density-clustered to obtain each intermediate block;

[0048] Each of the intermediate blocks is constructed into a tree-shaped data structure, and the nearest distance between each of the intermediate blocks is determined based on the tree-shaped data structure;

[0049] The minimum spanning tree is obtained based on each of the aforementioned nearest distances;

[0050] In the minimum spanning tree, the target intermediate block that is smaller than one confluence region and the intermediate block that is closest to the target intermediate block are merged to obtain each target segment.

[0051] Optionally, the step of performing combiner box configuration calculations on the array support data to obtain combiner box configuration information includes:

[0052] Based on the data of the array support, the number of groups and the maximum spacing between pile foundation points were statistically determined.

[0053] Based on the number of MPPTs and the maximum spacing between the pile foundation points, the number of strings is divided equally, and all possible string combinations are determined by taking the maximum difference between the strings in each MPPT group as the principle.

[0054] Based on the maximum number of busbars in the combiner area, the minimum number of busbars in the combiner area, and the combination result of the busbars, the corresponding number of branches in the combiner area is determined, and the number of branches in the combiner area is determined as the configuration information of the combiner box.

[0055] A device for dividing the collector zone of a photovoltaic power station, comprising:

[0056] The preliminary segmentation unit is used to process the original support data according to a preset linear programming strategy to obtain preliminary segments of each confluence zone;

[0057] The matrix determination unit is used to perform row-by-row processing on each of the aforementioned convergence zones to obtain a matrix;

[0058] The segmentation length determination unit is used to determine the segmentation length based on the mode of the support length and the mode of the left and right spacing length of the support within the square array;

[0059] A dividing line determination unit is used to determine the confluence area dividing line based on the dividing length;

[0060] An isolated block processing unit is used to detect isolated blocks based on the busbar segmentation line and process the detected isolated blocks to obtain each busbar segmentation block;

[0061] The merging area partitioning unit is used to process the strings in each merging area block according to integer programming to obtain the target merging area partitioning result.

[0062] Optionally, the segment length determination unit is specifically used for:

[0063] Determine the mode of the length of the support within the square array and the mode of the left-right spacing length of the support;

[0064] Determine the maximum number of branches in the convergence zone, the number of rows in the support structure, and the maximum number of strings in the support structure;

[0065] The segmentation length is determined based on the mode of the bracket length, the mode of the left-right spacing length of the bracket, the maximum number of branches, the minimum number of branches, and the maximum number of clusters of the bracket.

[0066] Optionally, the dividing line determining unit is specifically used for:

[0067] Determine the number of rows and columns to the left of the dividing line within the first threshold range of the dividing line, and the number of rows and columns to the right of the dividing line within the second threshold range of the dividing line;

[0068] If there exists a first target row where the number of rows and columns on the left is greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the leftmost side of the first target row.

[0069] If there exists a second target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the rightmost side of the second target row.

[0070] If there exists a third target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence area segmentation line will be shifted to the side with fewer columns.

[0071] Optionally, the isolated block processing unit is specifically used for:

[0072] The remaining support structure in the busbar region is divided into M clusters by density, resulting in M ​​clusters, where M is a positive integer.

[0073] The previously segmented stents are density-clustered to obtain N classes, where N is a positive integer.

[0074] If M > 1 or N > 1, then the isolated block is determined to exist;

[0075] Build a minimum spanning tree from M+N blocks, and merge blocks in the minimum spanning tree that have less than half the minimum number of branches into adjacent blocks;

[0076] Update the minimum spanning tree and return to determine M and N again, repeating this process until all blocks are no less than half the minimum number of branches.

[0077] Optionally, the merge area division unit is specifically used for:

[0078] The strings in each of the aforementioned busbar blocks are processed using an integer programming method to obtain integer programming results, wherein the integer programming results include: the number of string swaps, the swap direction, and the number of busbars;

[0079] Construct a minimum spanning tree using the adjacent split installation point set in the integer programming result;

[0080] Calculate the shortest distance between each support point in the minimum spanning tree, and determine the support point with the shortest distance;

[0081] Density clustering is performed within a preset range of the nearest support point to obtain cluster data;

[0082] The target confluence area division result is obtained based on the clustered data and the segmented data.

[0083] Optionally, the initial segmentation unit includes:

[0084] The row-by-row processing subunit is used to process the original support data into rows to obtain the matrix support data.

[0085] An initialization block calculation subunit is used to dynamically calculate the array support data to obtain initialization blocks;

[0086] The connection relationship determination subunit is used to determine the connection relationship between each of the initialization blocks, so as to obtain each target block containing the group string in the tree data structure;

[0087] The configuration information calculation subunit is used to perform combiner box configuration calculation on the array support data to obtain combiner box configuration information;

[0088] The preliminary block determination subunit is used to take the target block with the fewest strings among the target blocks in the tree data structure as the starting block, and process each block from the starting block based on the combiner box configuration information to obtain the preliminary blocks of each combiner area.

[0089] As can be seen from the above technical solution, this invention discloses a method and apparatus for dividing the collector area of ​​a photovoltaic power station. The method involves processing the original support data according to a preset linear programming strategy to obtain preliminary blocks for each collector area. These preliminary blocks are then divided into rows to form a matrix. A segmentation length is determined based on the mode of the support length and the mode of the left-right spacing length within the matrix. A collector area segmentation line is determined based on the segmentation length. Isolated blocks are detected based on the collector area segmentation line, and the detected isolated blocks are processed to obtain further collector area blocks. The strings within each collector area block are processed according to an integer programming algorithm to obtain the target collector area division result. This invention achieves automatic division of the collector area of ​​a photovoltaic power station by considering global factors. Compared to manual division, it improves the efficiency and accuracy of collector area division results, thus better reflecting the actual design of photovoltaic power stations. Attached Figure Description

[0090] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the published drawings without creative effort.

[0091] Figure 1 This is a flowchart of a method for dividing a photovoltaic power station's combiner zone according to an embodiment of the present invention;

[0092] Figure 2 This is a flowchart of a method for processing raw stent data according to a preset linear programming strategy to obtain preliminary blocks of each busbar area, as disclosed in an embodiment of the present invention.

[0093] Figure 3 This is a schematic diagram of a preliminary block division of a busbar region disclosed in an embodiment of the present invention;

[0094] Figure 4 This is a flowchart of a method for determining the segmentation length based on the mode of the support length and the mode of the left and right spacing length of the supports within a square array, as disclosed in an embodiment of the present invention.

[0095] Figure 5 This is a schematic diagram of a target catchment area division result disclosed in an embodiment of the present invention;

[0096] Figure 6This is a schematic diagram of a device for dividing the combiner zone of a photovoltaic power station, as disclosed in an embodiment of the present invention. Detailed Implementation

[0097] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0098] This invention discloses a method and apparatus for dividing the current collector area of ​​a photovoltaic (PV) power plant. The method involves processing the original support structure data according to a preset linear programming strategy to obtain preliminary blocks for each current collector area. These preliminary blocks are then divided into rows to form a matrix. A segmentation length is determined based on the mode of the support structure length and the mode of the left-right spacing length within the matrix. Current collector area segmentation lines are then determined based on these segmentation lengths. Isolated blocks are detected based on these segmentation lines, and the detected isolated blocks are processed to obtain further current collector area blocks. Finally, strings within each current collector area block are processed using integer programming to obtain the target current collector area division result. This invention achieves automatic current collector area division of a PV power plant by considering global factors. Compared to manual division, this method improves the efficiency and accuracy of current collector area division, thus better reflecting the actual design of PV power plants.

[0099] See Figure 1 The present invention discloses a flowchart of a method for dividing a photovoltaic power station's catchment area, the method comprising:

[0100] Step S101: Process the original stent data according to a preset linear programming strategy to obtain preliminary blocks for each busbar area;

[0101] The preset linear programming strategy in this embodiment includes: bracket data splitting, combiner box configuration, dynamic calculation initialization block, and dynamic calculation initialization block.

[0102] Step S102: Perform preliminary block division processing on each of the aforementioned convergence zones to obtain a matrix;

[0103] Step S103: Determine the segmentation length based on the mode of the support length and the mode of the left and right spacing length of the supports within the square array;

[0104] The process of determining the mode of the bracket length (bracket_length) and the mode of the left-right spacing length (l_r_dist) from the matrix can be found in existing mature solutions and will not be elaborated here.

[0105] Step S104: Determine the confluence zone dividing line based on the stated dividing length;

[0106] In practical applications, the number of columns in each row to the left of the dividing line and the number of columns in each row to the right of the dividing line can be determined by the dividing length. By comparing the number of columns in each row to the left of the dividing line and the number of columns in each row to the right of the dividing line with the column number threshold, the position of the cutting point can be determined, thereby determining the dividing line of the confluence zone.

[0107] Step S105: Detect isolated blocks based on the busbar segmentation line, and process the detected isolated blocks to obtain each busbar segmentation block;

[0108] In this embodiment, when an isolated block is detected, the region containing the isolated block is merged into an adjacent block to complete the processing of the isolated block, thereby obtaining each confluence block.

[0109] Step S106: Process the strings in each of the busbar area blocks according to integer programming to obtain the target busbar area division result.

[0110] Processing the strings in each busbar block according to the integer programming method actually involves deleting strings that do not conform to the overall programming method and retaining strings that do conform to the overall programming method, thereby obtaining the target busbar partitioning result.

[0111] In summary, this invention discloses a method for dividing the current collector area of ​​a photovoltaic power station. The method involves processing the original support data according to a preset linear programming strategy to obtain preliminary blocks for each current collector area. These preliminary blocks are then processed into rows to form a matrix. The segmentation length is determined based on the mode of the support length and the mode of the left-right spacing length within the matrix. The current collector area segmentation line is determined based on the segmentation length. Isolated blocks are detected based on the current collector area segmentation line, and the detected isolated blocks are processed to obtain further current collector area blocks. Finally, the strings within each current collector area block are processed using integer programming to obtain the target current collector area division result. This invention achieves automatic current collector area division of a photovoltaic power station by considering global factors. Compared to manual division, it improves the efficiency and accuracy of current collector area division, thus better reflecting the actual design of photovoltaic power stations.

[0112] To further optimize the above embodiments, see [link to relevant documentation]. Figure 2 The present invention discloses a method for processing raw stent data according to a preset linear programming strategy to obtain preliminary blocks of each busbar region. Specifically, step S101 may include:

[0113] Step S201: Perform row splitting on the original support data to obtain the array support data;

[0114] Specifically, obtain all the original support data in the photovoltaic power station support planning diagram;

[0115] The original support data in the north-south direction (y-axis) of the photovoltaic power station support planning map are sorted in descending order of value to obtain the latest support data;

[0116] The latest support data that have the same north-south direction values ​​belonging to the same row and whose vertical spacing is the preset support width are grouped into the same row.

[0117] The latest support data, after being divided, is sorted in ascending order along the east-west direction (x-axis) of the photovoltaic power station support planning diagram to obtain the array support data.

[0118] The value of the preset bracket width is determined according to actual needs, such as 0.5, and is not limited in this invention.

[0119] Step S202: Dynamically calculate the array support data to obtain initial blocks;

[0120] Specifically, basic information about the location of each support structure in the array is obtained from the array support data. Based on this basic information, density clustering is performed on the array support data to obtain initial blocks.

[0121] Step S203: Determine the connection relationship between each of the initialization blocks to obtain each target block containing the group string in the tree data structure;

[0122] Step S204: Calculate the combiner box configuration based on the array support data to obtain combiner box configuration information;

[0123] Step S205: Take the target block with the fewest strings in each target block in the tree data structure as the starting block, and process each block starting from the starting block based on the junction box configuration information to obtain the preliminary blocks of each junction area.

[0124] This embodiment uses the target block with the fewest strings among all target blocks in the tree data structure as the starting block. Based on the combiner box configuration information, it processes each block starting from the starting block. After performing algorithmic operations of retention and deletion on the processing results, it obtains... Figure 3 The diagram shown illustrates the initial segmentation of the merge area. Figure 3 Each framed section is initially divided into blocks as a confluence area.

[0125] To further optimize the above embodiments, step S203 may specifically include:

[0126] Each initial block is density-clustered to obtain each intermediate block;

[0127] Each of the intermediate blocks is constructed into a tree-shaped data structure, and the nearest distance between each of the intermediate blocks is determined based on the tree-shaped data structure;

[0128] The minimum spanning tree is obtained based on each of the aforementioned nearest distances;

[0129] In the minimum spanning tree, target intermediate blocks smaller than one confluence region are merged with the intermediate block closest to the target intermediate block to obtain each target block.

[0130] To further optimize the above embodiments, step S204 may specifically include:

[0131] The number of groups and the maximum spacing between pile foundation points were statistically determined based on the data of the square array support.

[0132] Based on the number of MPPTs (Maximum Power Point Tracking) and the maximum spacing between pile foundation points, the number of strings is evenly divided, and all possible string combinations are determined by taking the maximum difference between the strings in each MPPT group as the principle.

[0133] Based on the maximum number of busbars in the combiner area, the minimum number of busbars in the combiner area, and the combination result of the busbars, the corresponding number of branches in the combiner area is determined, and the number of branches in the combiner area is determined as the configuration information of the combiner box.

[0134] In practical applications, this invention divides the MPPT strings equally based on the number of MPPT strings and the maximum spacing between pile foundation points. Using the maximum difference d between each MPPT string group (where d represents the maximum difference between all MPPT strings in each MPPT group) as the principle, all possible string combinations are calculated. The calculation method is as follows:

[0135] Let the maximum number of MPPT strings in one channel be branch_num_max. Construct an array [0, 1, ..., d]. Perform permutations and combinations on this array, and the number of permutations and combinations is (d+1). n-1 This will generate a new permutation and combination. For example, if d is 2 and n is the number of MPPTs set to 3, and 9 combinations are selected from [0, 1, 2], the result is as follows: [0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]. The difference between branch_num_max and the above combinations is calculated, for example:

[0136] branch_num_max-0+branch_num_max-0+branch_num_max=string_num;

[0137] If the calculated branch_num_max is a positive integer, then this combination satisfies the condition, and the corresponding combination is:

[0138] [branch_num_max, branch_num_max, branch_num_max]

[0139] branch_num_max-0+branch_num_max-1+branch_num_max=string_num;

[0140] If the calculated branch_num_max is a positive integer, then this combination satisfies the condition, and the corresponding combination is:

[0141] [branch_num_max, branch_num_max-0, branch_num_max-1]

[0142] And so on.

[0143] To further optimize the above embodiments, see [link to relevant documentation]. Figure 4 The present invention discloses a method for determining the segmentation length based on the mode of the support length and the mode of the left-right spacing length within a square matrix. The method includes:

[0144] Step S301: Determine the mode of the support length and the mode of the left-right spacing length within the square array;

[0145] Step S302: Determine the maximum number of branches in the combiner area, the number of rows in the support structure, and the maximum number of strings in the support structure;

[0146] Step S303: Determine the segmentation length based on the mode of the support length, the mode of the left and right spacing length of the support, the maximum number of branches, the minimum number of branches, and the maximum number of groups of the support.

[0147] Specifically, determine the mode of the bracket length (bracket_length) and the mode of the left-right spacing (l_r_dist) within the matrix, and calculate the maximum number of branches (max_num) in the confluence area of ​​the block and the maximum number of strings (string_num) of the brackets.

[0148] The segment length dist is calculated using the following formula:

[0149] dist=ceil(max_num / row_num / string_num)*(bracket_length+l_r_dist);

[0150] In the formula, row_num represents the number of rows in the support structure, and ceil represents rounding up.

[0151] To further optimize the above embodiments, step S104 may specifically include:

[0152] Determine the number of rows and columns to the left of the dividing line within the first threshold range of the dividing line, and the number of rows and columns to the right of the dividing line within the second threshold range of the dividing line;

[0153] If there exists a first target row where the number of rows and columns on the left is greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the leftmost side of the first target row.

[0154] If there exists a second target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the rightmost side of the second target row.

[0155] If there exists a third target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence area segmentation line will be shifted to the side with fewer columns.

[0156] The value of the column number threshold is determined according to actual needs. For example, the column number threshold is 2. This invention does not limit this value.

[0157] The values ​​of the first threshold range and the second threshold range can be the same or different, depending on the actual needs, and are not limited in this invention.

[0158] Taking a column number threshold of 2 as an example, the specific process of determining the confluence zone dividing line based on the dividing length is explained as follows:

[0159] Determine the number of rows and columns on the left side of the dividing line within the first threshold range of the dividing line, Col_left, and the number of rows and columns on the right side of the dividing line within the second threshold range of the dividing line, Col_right.

[0160] If Col_left>2 and Col_right>2, then no action is taken on the cutting point;

[0161] If Col_left>2 and Col_right<=2, then the cutting point is shifted to the leftmost position of the row;

[0162] If Col_left <= 2 and Col_right > 2, then the cutting point is shifted to the rightmost position of the row;

[0163] If Col_left <= 2 and Col_right <= 2, then determine which side has fewer columns, and move the cutting edge to the side with fewer columns. For example, if there are more columns on the left, move the cutting edge to the right.

[0164] To further optimize the above embodiments, step S105 may specifically include:

[0165] The remaining scaffolds in the busbar region are divided into M clusters by density, resulting in M ​​clusters, where M is a positive integer.

[0166] The previously segmented stents are density-clustered to obtain N classes, where N is a positive integer.

[0167] If M > 1 or N > 1, then the isolated block is determined to exist;

[0168] Build a minimum spanning tree from M+N blocks, and merge blocks in the minimum spanning tree that have less than half the minimum number of branches into adjacent blocks;

[0169] Update the minimum spanning tree and return to determine M and N again, repeating this process until all blocks are no less than half the minimum number of branches.

[0170] In this embodiment, when M=1 and N=1, the overall planning operation of retaining and deleting the segmented strings is directly performed.

[0171] In summary, the present invention, based on the cutting and block detection method, can achieve the simultaneous recording of flat cuts and ensuring the connectivity of the busbar support, thereby ensuring that no isolated blocks appear in the busbar area.

[0172] To further optimize the above embodiments, step S106 may specifically include:

[0173] The strings in each busbar block are processed using an integer programming method to obtain integer programming results, wherein the integer programming results include: the number of string swaps, the swap direction, and the number of busbars;

[0174] Construct a minimum spanning tree using the adjacent split installation point set in the integer programming result;

[0175] Calculate the shortest distance between each support point in the minimum spanning tree, and determine the support point with the shortest distance;

[0176] Density clustering is performed within a preset range of the nearest support point to obtain cluster data;

[0177] The target confluence area division results are obtained based on the clustered data and the segmented data.

[0178] The target catchment area delineation results are as follows: Figure 5 As shown.

[0179] Specifically, the number of string swaps is calculated using the integer programming method. The following mathematical model is adopted, and the integer programming result obtained includes: the number of string swaps process_num, the swap direction, the number of merging regions y_i, and the value of x_i is updated, x_i-=y_i, and the number of strings in the block exchange_num is updated.

[0180] The mathematical model is as follows:

[0181] exchange_num+=process_num;

[0182]

[0183]

[0184] In the formula, all_str_num represents the number of strings in the block, and y i n represents the number of substrings in the array. i The index represents the column of the group string, max_branch_num represents the number of groups in the maximum confluence zone, k represents the array length, and i represents the index of the group string in the array.

[0185] In summary, the present invention adopts an improved overall planning approach, considering dynamic busbar division, thereby ensuring that each busbar in the target busbar division result does not experience power limitation.

[0186] Corresponding to the above method embodiments, the present invention also discloses a device for dividing the collector zone of a photovoltaic power station.

[0187] See Figure 6 The present invention discloses a schematic diagram of a device for dividing a photovoltaic power station's catchment area. The device includes:

[0188] The preliminary segmentation unit 401 is used to process the original support data according to a preset linear programming strategy to obtain preliminary segments of each confluence zone;

[0189] The preset linear programming strategy in this embodiment includes: bracket data splitting, combiner box configuration, dynamic calculation initialization block, and dynamic calculation initialization block.

[0190] The matrix determination unit 402 is used to perform row-by-row processing on each of the aforementioned convergence zones to obtain a matrix;

[0191] The segmentation length determination unit 403 is used to determine the segmentation length based on the mode of the support length and the mode of the left and right spacing length of the support within the square array;

[0192] The dividing line determining unit 404 is used to determine the confluence area dividing line based on the dividing length;

[0193] In practical applications, the number of columns in each row to the left of the dividing line and the number of columns in each row to the right of the dividing line can be determined by the dividing length. By comparing the number of columns in each row to the left of the dividing line and the number of columns in each row to the right of the dividing line with the column number threshold, the position of the cutting point can be determined, thereby determining the dividing line of the confluence zone.

[0194] The isolated block processing unit 405 is used to detect isolated blocks based on the busbar segmentation line and process the detected isolated blocks to obtain each busbar segmentation block.

[0195] In this embodiment, when an isolated block is detected, the region containing the isolated block is merged into an adjacent block to complete the processing of the isolated block, thereby obtaining each confluence block.

[0196] The merging area division unit 406 is used to process the strings in each merging area block according to integer programming to obtain the target merging area division result.

[0197] Processing the strings in each busbar block according to the integer programming method actually involves deleting strings that do not conform to the overall programming method and retaining strings that do conform to the overall programming method, thereby obtaining the target busbar partitioning result.

[0198] In summary, this invention discloses a device and method for dividing the current collector area of ​​a photovoltaic power station. The method involves processing the original support data according to a preset linear programming strategy to obtain preliminary blocks for each current collector area. These preliminary blocks are then processed into rows to form a matrix. The segmentation length is determined based on the mode of the support length and the mode of the left-right spacing length within the matrix. The current collector area segmentation line is determined based on the segmentation length. Isolated blocks are detected based on the current collector area segmentation line, and the detected isolated blocks are processed to obtain further current collector area blocks. Finally, the strings within each current collector area block are processed using integer programming to obtain the target current collector area division result. This invention achieves automatic current collector area division of a photovoltaic power station by considering global factors. Compared to manual division, it improves the efficiency and accuracy of current collector area division, thus better reflecting the actual design of photovoltaic power stations.

[0199] To further optimize the above embodiments, the segmentation length determination unit 403 can specifically be used for:

[0200] Determine the mode of the length of the support within the square array and the mode of the left-right spacing length of the support;

[0201] Determine the maximum number of branches in the convergence zone, the number of rows in the support structure, and the maximum number of strings in the support structure;

[0202] The segmentation length is determined based on the mode of the bracket length, the mode of the left-right spacing length of the bracket, the maximum number of branches, the minimum number of branches, and the maximum number of clusters of the bracket.

[0203] To further optimize the above embodiments, the dividing line determination unit 404 can specifically be used for:

[0204] Determine the number of rows and columns to the left of the dividing line within the first threshold range of the dividing line, and the number of rows and columns to the right of the dividing line within the second threshold range of the dividing line;

[0205] If there exists a first target row where the number of rows and columns on the left is greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the leftmost side of the first target row.

[0206] If there exists a second target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the rightmost side of the second target row.

[0207] If there exists a third target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence area segmentation line will be shifted to the side with fewer columns.

[0208] To further optimize the above embodiments, the isolated block processing unit 405 can specifically be used for:

[0209] The remaining support structure in the busbar region is divided into M clusters by density, resulting in M ​​clusters, where M is a positive integer.

[0210] The previously segmented stents are density-clustered to obtain N classes, where N is a positive integer.

[0211] If M > 1 or N > 1, then the isolated block is determined to exist;

[0212] Build a minimum spanning tree from M+N blocks, and merge blocks in the minimum spanning tree that have less than half the minimum number of branches into adjacent blocks;

[0213] Update the minimum spanning tree and return to determine M and N again, repeating this process until all blocks are no less than half the minimum number of branches.

[0214] To further optimize the above embodiments, the merging area division unit 406 can specifically be used for:

[0215] The strings in each of the aforementioned busbar blocks are processed using an integer programming method to obtain integer programming results, wherein the integer programming results include: the number of string swaps, the swap direction, and the number of busbars;

[0216] Construct a minimum spanning tree using the adjacent split installation point set in the integer programming result;

[0217] Calculate the shortest distance between each support point in the minimum spanning tree, and determine the support point with the shortest distance;

[0218] Density clustering is performed within a preset range of the nearest support point to obtain cluster data;

[0219] The target confluence area division result is obtained based on the clustered data and the segmented data.

[0220] To further optimize the above embodiments, the preliminary segmentation unit 401 may include:

[0221] The row-by-row processing subunit is used to process the original support data into rows to obtain the matrix support data.

[0222] An initialization block calculation subunit is used to dynamically calculate the array support data to obtain initialization blocks;

[0223] The connection relationship determination subunit is used to determine the connection relationship between each of the initialization blocks, so as to obtain each target block containing the group string in the tree data structure;

[0224] The configuration information calculation subunit is used to perform combiner box configuration calculation on the array support data to obtain combiner box configuration information;

[0225] The preliminary block determination subunit is used to take the target block with the fewest strings among the target blocks in the tree data structure as the starting block, and process each block from the starting block based on the combiner box configuration information to obtain the preliminary blocks of each combiner area.

[0226] It should be noted that the specific working principles of each component in the device embodiment can be found in the corresponding section of the method embodiment, and will not be repeated here.

[0227] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0228] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other.

[0229] The above description of the disclosed embodiments enables those skilled in the art to make or use the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the invention. Therefore, the invention is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for dividing the collector zone of a photovoltaic power station, characterized in that, include: The original support data is processed according to a preset linear programming strategy to obtain preliminary blocks for each hub area; wherein, the preset linear programming strategy includes: support data row processing, hub box configuration, and dynamic calculation initialization of blocks; Each of the aforementioned convergence zones is initially divided into blocks and then processed to obtain a matrix; The segmentation length is determined based on the mode of the support length and the mode of the left-right spacing length within the square array. The confluence zone dividing line is determined based on the stated dividing length; Isolated block detection is performed based on the busbar segmentation line, and the detected isolated blocks are processed to obtain each busbar segmentation block; The strings in each of the aforementioned busbar blocks are processed according to integer programming to obtain integer programming results, and the target busbar partitioning results are obtained based on the integer programming results; wherein, the integer programming results include: the number of strings swapped, the swapping direction, and the number of busbars.

2. The method according to claim 1, characterized in that, The step of determining the segmentation length based on the mode of the support length and the mode of the left-right spacing length within the square matrix includes: Determine the mode of the length of the support within the square array and the mode of the left-right spacing length of the support; Determine the maximum number of branches in the convergence zone, the number of rows in the support structure, and the maximum number of strings in the support structure; The segmentation length is determined based on the mode of the bracket length, the mode of the left and right spacing length of the bracket, the maximum number of branches, the minimum number of branches, and the maximum number of clusters of the bracket.

3. The method according to claim 1, characterized in that, The step of determining the confluence zone dividing line based on the dividing length includes: Determine the number of rows and columns to the left of the dividing line within the first threshold range and the number of rows and columns to the right of the dividing line within the second threshold range; If there exists a first target row where the number of rows and columns on the left is greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the leftmost side of the first target row. If there exists a second target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the rightmost side of the second target row. If there exists a third target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence area segmentation line will be shifted to the side with fewer columns.

4. The method according to claim 1, characterized in that, The process of detecting isolated blocks based on the busbar segmentation line and processing the detected isolated blocks to obtain individual busbar segment blocks includes: The remaining support structure in the busbar region is divided into M clusters by density, resulting in M ​​clusters, where M is a positive integer. The previously segmented stents are density-clustered to obtain N classes, where N is a positive integer. If M > 1 or N > 1, then the isolated block is determined to exist; Build a minimum spanning tree from M+N blocks, and merge blocks in the minimum spanning tree that have less than half the minimum number of branches into adjacent blocks; Update the minimum spanning tree and return to determine M and N again, repeating this process until all blocks are no less than half the minimum number of branches.

5. The method according to claim 1, characterized in that, The process of processing the strings in each of the aforementioned busbar area blocks according to the overall plan to obtain the target busbar area division result includes: The strings in each of the aforementioned busbar blocks are processed using an integer programming method to obtain integer programming results, wherein the integer programming results include: the number of string swaps, the swap direction, and the number of busbars; Construct a minimum spanning tree using the adjacent split installation point set in the integer programming result; Calculate the shortest distance between each support point in the minimum spanning tree, and determine the support point with the shortest distance; Density clustering is performed within a preset range of the nearest support point to obtain cluster data; The target confluence area division result is obtained based on the clustered data and the segmented data.

6. The method according to claim 1, characterized in that, The process of processing the original stent data according to a preset linear programming strategy to obtain preliminary blocks for each bus region includes: The original support data is processed into rows to obtain the array support data; The initial blocks are obtained by dynamically calculating the array support data; Determine the connection relationship between each of the initialization blocks to obtain each target block containing the group string in the tree data structure; Perform combiner box configuration calculations on the array support data to obtain combiner box configuration information; The target block with the fewest strings in each target block in the tree data structure is taken as the starting block. Based on the junction box configuration information, each block is processed starting from the starting block to obtain the preliminary blocks of each junction area.

7. The method according to claim 6, characterized in that, The process of splitting the original support data into rows to obtain the array support data includes: Obtain all the original support data in the photovoltaic power station support planning diagram; The original support data in the north-south direction of the photovoltaic power station support plan are sorted in descending order of value to obtain the latest support data; The latest support data that have the same north-south direction values ​​belonging to the same row and whose vertical spacing is the preset support width are grouped into the same row. The latest support data, after being divided, is sorted in ascending order along the east-west direction of the photovoltaic power station support planning map to obtain the array support data.

8. The method according to claim 6, characterized in that, The step of dynamically calculating the initial blocks from the array support data includes: Obtain basic information about the support positions of each square array from the square array support data; Density clustering is performed on the array support data based on the basic information of the support location to obtain the initial blocks.

9. The method according to claim 6, characterized in that, The process of determining the connection relationships between the initialization blocks to obtain target blocks containing strings in the tree data structure includes: Each of the initialization blocks is density-clustered to obtain each intermediate block; Each of the intermediate blocks is constructed into a tree data structure, and the nearest distance between each of the intermediate blocks is determined based on the tree data structure; The minimum spanning tree is obtained based on each of the aforementioned nearest distances; In the minimum spanning tree, the target intermediate block that is less than one confluence region and the intermediate block that is closest to the target intermediate block are merged to obtain each target block.

10. The method according to claim 6, characterized in that, The step of performing combiner box configuration calculations on the array support data to obtain combiner box configuration information includes: Based on the data of the array support, the number of groups and the maximum spacing between pile foundation points were statistically determined. Based on the number of MPPTs and the maximum spacing between the pile foundation points, the number of strings is divided equally, and all possible string combinations are determined by taking the maximum difference between the strings in each MPPT group as the principle. Based on the maximum number of busbars in the combiner area, the minimum number of busbars in the combiner area, and the combination result of the busbars, the corresponding number of branches in the combiner area is determined, and the number of branches in the combiner area is determined as the configuration information of the combiner box.

11. A device for dividing the collector zone of a photovoltaic power station, characterized in that, include: The preliminary segmentation unit is used to process the original support data according to a preset linear programming strategy to obtain preliminary segments for each hub area; wherein, the preset linear programming strategy includes: support data row processing, hub box configuration, and dynamic calculation initialization of segments; The matrix determination unit is used to perform row-by-row processing on each of the aforementioned convergence zones to obtain a matrix; The segmentation length determination unit is used to determine the segmentation length based on the mode of the support length and the mode of the left and right spacing length of the support within the square array; A dividing line determination unit is used to determine the confluence area dividing line based on the dividing length; An isolated block processing unit is used to detect isolated blocks based on the busbar segmentation line and process the detected isolated blocks to obtain each busbar segmentation block; The merging area partitioning unit is used to process the strings in each merging area block according to integer programming to obtain integer programming results, and to obtain the target merging area partitioning results based on the integer programming results; wherein, the integer programming results include: the number of strings swapped, the swapping direction, and the number of merging areas.

12. The apparatus according to claim 11, characterized in that, The segment length determination unit is specifically used for: Determine the mode of the length of the support within the square array and the mode of the left-right spacing length of the support; Determine the maximum number of branches in the convergence zone, the number of rows in the support structure, and the maximum number of strings in the support structure; The segmentation length is determined based on the mode of the bracket length, the mode of the left and right spacing length of the bracket, the maximum number of branches, the minimum number of branches, and the maximum number of clusters of the bracket.

13. The apparatus according to claim 11, characterized in that, The dividing line determining unit is specifically used for: Determine the number of rows and columns to the left of the dividing line within the first threshold range and the number of rows and columns to the right of the dividing line within the second threshold range; If there exists a first target row where the number of rows and columns on the left is greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the leftmost side of the first target row. If there exists a second target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is greater than the column number threshold, then the cutting point for determining the confluence zone segmentation line will be shifted to the rightmost side of the second target row. If there exists a third target row where the number of rows and columns on the left is not greater than the column number threshold and the number of rows and columns on the right is not greater than the column number threshold, then the cutting point for determining the confluence area segmentation line will be shifted to the side with fewer columns.

14. The apparatus according to claim 11, characterized in that, The isolated block processing unit is specifically used for: The remaining support structure in the busbar region is divided into M clusters by density, resulting in M ​​clusters, where M is a positive integer. The previously segmented stents are density-clustered to obtain N classes, where N is a positive integer. If M > 1 or N > 1, then the isolated block is determined to exist; Build a minimum spanning tree from M+N blocks, and merge blocks in the minimum spanning tree that have less than half the minimum number of branches into adjacent blocks; Update the minimum spanning tree and return to determine M and N again, repeating this process until all blocks are no less than half the minimum number of branches.

15. The apparatus according to claim 11, characterized in that, The confluence area division unit is specifically used for: The strings in each of the aforementioned busbar blocks are processed using an integer programming method to obtain integer programming results, wherein the integer programming results include: the number of string swaps, the swap direction, and the number of busbars; Construct a minimum spanning tree using the adjacent split installation point set in the integer programming result; Calculate the shortest distance between each support point in the minimum spanning tree, and determine the support point with the shortest distance; Density clustering is performed within a preset range of the nearest support point to obtain cluster data; The target confluence area division result is obtained based on the clustered data and the segmented data.

16. The apparatus according to claim 11, characterized in that, The initial segmentation unit includes: The row-by-row processing subunit is used to process the original support data into rows to obtain the matrix support data. An initialization block calculation subunit is used to dynamically calculate the array support data to obtain initialization blocks; The connection relationship determination subunit is used to determine the connection relationship between each of the initialization blocks, so as to obtain each target block containing the group string in the tree data structure; The configuration information calculation subunit is used to perform combiner box configuration calculation on the array support data to obtain combiner box configuration information; The preliminary block determination subunit is used to take the target block with the fewest strings among the target blocks in the tree data structure as the starting block, and process each block from the starting block based on the combiner box configuration information to obtain the preliminary blocks of each combiner area.

Images