Optimization method, device and computer storage medium for confluence area division

Abstract

The present invention discloses an optimization method for the division of a convergence area, including: among a plurality of convergence areas of a photovoltaic power station, detecting whether any two convergence areas intersect; when there are two intersecting target convergence areas, merging the two target convergence areas; and re-dividing the merged convergence area into two convergence areas by horizontal division or vertical division. The present invention also discloses an optimization device for the division of a convergence area and a computer storage medium. The present invention detects whether the convergence areas intersect, and re-divides the convergence areas by horizontal or vertical division when they intersect, so as to flatten the convergence areas, avoid the intersection of photovoltaic strings in different convergence areas, better conform to the logic of manual division, reduce the cable laying cost, and optimize the convergence area division results.

Description

Technical Field

[0001] The invention relates to the technical field of photovoltaic power stations, and in particular to an optimization method, a device and a computer storage medium for dividing a confluence area. Background Art

[0002] When dividing the confluence area, an improved unsupervised clustering method is usually used to perform cluster analysis on the photovoltaic strings in the photovoltaic power station and divide different categories of photovoltaic strings into different confluence areas. This method divides the confluence area by considering global factors, and takes into account that a single category of the confluence area division does not exceed the upper limit of the string branches that can be connected to the confluence equipment. At the same time, the improved confluence area division method can eliminate isolated single strings / multiple strings.

[0003] However, after dividing the bus area using this method, there are situations where photovoltaic strings in different bus areas intersect with each other, which does not conform to the logic of manual division and leads to excessively high cable laying costs. Therefore, the current bus area division results are relatively poor.

[0004] The above contents are only used to assist in understanding the technical solution of the present invention and do not constitute an admission that the above contents are prior art. Summary of the invention

[0005] The main purpose of the present invention is to provide an optimization method, device and computer storage medium for dividing a confluence area, aiming to optimize the division of the confluence area.

[0006] To achieve the above object, the present invention provides an optimization method for dividing a confluence area, and the optimization method for dividing a confluence area comprises the following steps:

[0007] Among multiple confluence areas of a photovoltaic power station, detecting whether any two confluence areas intersect;

[0008] When there are two intersecting target catchment areas, the two target catchment areas are merged;

[0009] The merged catchment area is redivided into two catchment areas by horizontal division or vertical division.

[0010] Optionally, the step of detecting whether any two confluence areas intersect includes:

[0011] Obtaining coordinate points of photovoltaic strings included in any two confluence areas, wherein the any two confluence areas are a first confluence area and a second confluence area;

[0012] Determine the number of rows and columns of coordinate points of the first confluence area according to the coordinate points in the first confluence area, and determine the number of rows and columns of coordinate points of the second confluence area according to the coordinate points in the second confluence area;

[0013] Obtain the total number of rows and columns of coordinate points after the first confluence area and the second confluence area are merged;

[0014] Whether the first confluence area intersects with the second confluence area is determined based on the number of rows of coordinate points in the first confluence area, the number of rows of coordinate points in the second confluence area, and the total number of rows of coordinate points, and / or whether the first confluence area intersects with the second confluence area is determined based on the number of columns of coordinate points in the first confluence area, the number of columns of coordinate points in the second confluence area, and the total number of columns of coordinate points.

[0015] Optionally, the step of judging whether the first confluence area intersects with the second confluence area according to the number of rows of coordinate points in the first confluence area, the number of rows of coordinate points in the second confluence area, and the total number of rows of coordinate points includes:

[0016] Detecting whether the total number of rows of coordinate points is less than the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area;

[0017] If yes, judging whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area;

[0018] Optionally, the step of judging whether the first confluence area intersects with the second confluence area according to the number of coordinate point columns of the first confluence area, the number of coordinate point columns of the second confluence area, and the total number of coordinate point columns comprises:

[0019] Detecting whether the total number of columns of coordinate points is less than the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area;

[0020] If so, whether the first confluence area intersects with the second confluence area is determined based on the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area.

[0021] Optionally, if yes, the step of determining whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area comprises:

[0022] If so, obtaining the minimum distance between the coordinate point in the first confluence area and the coordinate point in the second confluence area;

[0023] When the minimum distance is less than or equal to the preset threshold, it is determined whether the first confluence area intersects with the second confluence area based on the maximum and minimum values ​​of the coordinate points in the first confluence area and the maximum and minimum values ​​of the coordinate points in the second confluence area.

[0024] Optionally, after the step of obtaining the minimum distance between the coordinate point in the first confluence area and the coordinate point in the second confluence area, the method further includes:

[0025] When the minimum distance is greater than a preset threshold, it is determined that the first confluence area does not intersect with the second confluence area.

[0026] Optionally, the step of judging whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area comprises:

[0027] Whether the first confluence area intersects the second confluence area is determined based on whether any of the following conditions are met:

[0028] x max1 >x min2 , and y max2 ≥y max1 ≥y min2 ;

[0029] x max1 >x min2 , and y max2 ≥y min1 ≥y min2 ;

[0030] y max2 >y min1 , and x max1 ≥x min2 ≥x min1 ;

[0031] y max2 >y min1 , and x max1 ≥x max2 ≥x min1 ;

[0032] Among them, among the maximum values ​​of the coordinate points in the first confluence area, the maximum value of the horizontal coordinate is x max1 , the maximum value of the vertical coordinate is y max1 ; Among the minimum values ​​of the coordinate points in the first confluence area, the minimum value of the horizontal coordinate is x min1 , the minimum value of the vertical coordinate is y min1 ; Among the maximum values ​​of the coordinate points in the second confluence area, the maximum value of the horizontal coordinate is x max2 , the maximum value of the vertical coordinate is y max2 ; Among the minimum values ​​of the coordinate points in the second confluence area, the minimum value of the horizontal coordinate is x min2 , the minimum value of the vertical coordinate is y min2 .

[0033] Optionally, the step of determining whether the first confluence area intersects with the second confluence area according to the number of coordinate point rows of the first confluence area, the number of coordinate point rows of the second confluence area, and the total number of coordinate point rows, and / or determining whether the first confluence area intersects with the second confluence area according to the number of coordinate point columns of the first confluence area, the number of coordinate point columns of the second confluence area, and the total number of coordinate point columns comprises:

[0034] When the total number of rows of coordinate points is greater than or equal to the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area, and the total number of columns of coordinate points is greater than or equal to the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area, it is determined that the first confluence area and the second confluence area do not intersect.

[0035] Optionally, the step of re-dividing the merged confluence area into two confluence areas by horizontal division or vertical division includes:

[0036] Obtain the maximum length and the maximum width of the merged confluence area, and / or the total number of rows and columns of coordinate points in the merged confluence area;

[0037] When the maximum length and the maximum width, and / or the total number of rows and the total number of columns of coordinate points meet the preset conditions corresponding to the longitudinal distribution, the merged confluence area is redivided into two confluence areas by horizontal division;

[0038] When the maximum length and the maximum width, and / or the total number of rows and columns of coordinate points meet the preset conditions corresponding to the horizontal distribution, the merged confluence area is redivided into two confluence areas by vertical division.

[0039] In addition, to achieve the above-mentioned purpose, the present invention also provides an optimization device for confluence area division, and the optimization device for confluence area division includes: a memory, a processor, and an optimization program for confluence area division stored in the memory and executable on the processor, and when the optimization program for confluence area division is executed by the processor, the steps of the optimization method for confluence area division as described in any one of the above are implemented.

[0040] In addition, to achieve the above-mentioned purpose, the present invention also provides a computer storage medium, on which is stored an optimization program for confluence area division, and when the optimization program for confluence area division is executed by a processor, the steps of the optimization method for confluence area division as described in any one of the above are implemented.

[0041] The optimization method, device and computer storage medium for dividing the convergence area proposed in the embodiment of the present invention detect whether any two convergence areas intersect among the multiple convergence areas of the photovoltaic power station; when there are two intersecting target convergence areas, merge the two target convergence areas; and redivide the merged convergence area into two convergence areas by horizontal division or vertical division. The present invention detects whether the convergence areas intersect, and redivides the convergence areas by horizontal or vertical division when they intersect, so as to flatten the convergence areas, avoid the intersection of photovoltaic strings in different convergence areas, better conform to the logic of manual division, reduce the cost of cable laying, and optimize the results of convergence area division. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 It is a schematic diagram of the terminal structure of the hardware operating environment involved in the embodiment of the present invention;

[0043] Figure 2 A schematic flow chart of an embodiment of an optimization method for dividing a confluence area according to the present invention;

[0044] Figure 3 A schematic flow chart of another embodiment of the optimization method for dividing the confluence area of ​​the present invention;

[0045] Figure 4 A schematic flow chart of another embodiment of the optimization method for dividing the confluence area of ​​the present invention;

[0046] Figure 5 A coordinate point distribution diagram when the minimum distance between the confluence areas of the present invention is greater than a preset threshold value;

[0047] Figure 6 A coordinate point distribution diagram of two intersecting confluence areas of the present invention;

[0048] Figure 7 for Figure 6 The distribution map of the optimized coordinate points of the catchment area;

[0049] Figure 8 for Figure 5 The coordinate point distribution map of the catchment area after optimization.

[0050] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0051] It should be understood that the specific embodiments described herein are only used to explain the present invention, and are not used to limit the present invention.

[0052] An embodiment of the present invention provides a solution by detecting whether the convergence areas intersect and redividing the convergence areas horizontally or vertically when they intersect, so as to flatten the convergence areas and avoid the intersection of photovoltaic strings in different convergence areas. This is more in line with the logic of manual division, reduces the cost of cable laying, and optimizes the results of convergence area division.

[0053] like Figure 1 As shown, Figure 1 It is a schematic diagram of the terminal structure of the hardware operating environment involved in the embodiment of the present invention.

[0054] The terminal in the embodiment of the present invention is an optimization device for dividing the confluence area.

[0055] like Figure 1 As shown, the terminal may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, and a communication bus 1002. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 may be a high-speed RAM memory, or a stable memory (non-volatile memory), such as a disk memory. The memory 1005 may also be a storage device independent of the aforementioned processor 1001.

[0056] Those skilled in the art will understand that Figure 1 The terminal structure shown in the figure does not constitute a limitation on the terminal, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0057] like Figure 1 As shown, the memory 1005 as a computer storage medium may include a network communication module, a user interface module, and an optimization program for dividing the confluence area.

[0058] exist Figure 1 In the terminal shown, the network interface 1004 is mainly used to connect to the backend server and perform data communication with the backend server; the user interface 1003 is mainly used to connect to the client (user end) and perform data communication with the client; and the processor 1001 can be used to call the optimization program for the confluence area division stored in the memory 1005, and perform the following operations:

[0059] Among multiple confluence areas of a photovoltaic power station, detecting whether any two confluence areas intersect;

[0060] When there are two intersecting target catchment areas, the two target catchment areas are merged;

[0061] The merged catchment area is redivided into two catchment areas by horizontal division or vertical division.

[0062] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0063] Obtaining coordinate points of photovoltaic strings included in any two confluence areas, wherein the any two confluence areas are a first confluence area and a second confluence area;

[0064] Determine the number of rows and columns of coordinate points of the first confluence area according to the coordinate points in the first confluence area, and determine the number of rows and columns of coordinate points of the second confluence area according to the coordinate points in the second confluence area;

[0065] Obtain the total number of rows and columns of coordinate points after the first confluence area and the second confluence area are merged;

[0066] Whether the first confluence area intersects with the second confluence area is determined based on the number of rows of coordinate points in the first confluence area, the number of rows of coordinate points in the second confluence area, and the total number of rows of coordinate points, and / or whether the first confluence area intersects with the second confluence area is determined based on the number of columns of coordinate points in the first confluence area, the number of columns of coordinate points in the second confluence area, and the total number of columns of coordinate points.

[0067] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0068] Detecting whether the total number of rows of coordinate points is less than the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area;

[0069] If yes, judging whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area;

[0070] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0071] Detecting whether the total number of columns of coordinate points is less than the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area;

[0072] If so, whether the first confluence area intersects with the second confluence area is determined based on the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area.

[0073] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0074] If so, obtaining the minimum distance between the coordinate point in the first confluence area and the coordinate point in the second confluence area;

[0075] When the minimum distance is less than or equal to the preset threshold, it is determined whether the first confluence area intersects with the second confluence area based on the maximum and minimum values ​​of the coordinate points in the first confluence area and the maximum and minimum values ​​of the coordinate points in the second confluence area.

[0076] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0077] When the minimum distance is greater than a preset threshold, it is determined that the first confluence area does not intersect with the second confluence area.

[0078] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0079] Whether the first confluence area intersects the second confluence area is determined based on whether any of the following conditions are met:

[0080] x max1 >x min2 , and y max2 ≥y max1 ≥y min2 ;

[0081] x max1 >x min2 , and y max2 ≥y min1 ≥y min2 ;

[0082] y max2 >y min1 , and x max1 ≥x min2 ≥x min1 ;

[0083] y max2 >y min1 , and x max1 ≥x max2 ≥x min1 ;

[0084] Among them, among the maximum values ​​of the coordinate points in the first confluence area, the maximum value of the horizontal coordinate is x max1 , the maximum value of the vertical coordinate is y max1; Among the minimum values ​​of the coordinate points in the first confluence area, the minimum value of the horizontal coordinate is x min1 , the minimum value of the vertical coordinate is y min1 ; Among the maximum values ​​of the coordinate points in the second confluence area, the maximum value of the horizontal coordinate is x max2 , the maximum value of the vertical coordinate is y max2 ; Among the minimum values ​​of the coordinate points in the second confluence area, the minimum value of the horizontal coordinate is x min2 , the minimum value of the vertical coordinate is y min2 .

[0085] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0086] When the total number of rows of coordinate points is greater than or equal to the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area, and the total number of columns of coordinate points is greater than or equal to the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area, it is determined that the first confluence area and the second confluence area do not intersect.

[0087] Furthermore, the processor 1001 may call the optimization program for dividing the confluence area stored in the memory 1005, and further perform the following operations:

[0088] Obtain the maximum length and the maximum width of the merged confluence area, and / or the total number of rows and columns of coordinate points in the merged confluence area;

[0089] When the maximum length and the maximum width, and / or the total number of rows and the total number of columns of coordinate points meet the preset conditions corresponding to the longitudinal distribution, the merged confluence area is redivided into two confluence areas by horizontal division;

[0090] When the maximum length and the maximum width, and / or the total number of rows and columns of coordinate points meet the preset conditions corresponding to the horizontal distribution, the merged confluence area is redivided into two confluence areas by vertical division.

[0091] Reference Figure 2 In one embodiment, the optimization method for dividing the confluence area includes the following steps:

[0092] Step S10, detecting whether any two confluence areas of the photovoltaic power station intersect with each other among the multiple confluence areas of the photovoltaic power station;

[0093] This embodiment is to optimize the result of the catchment area division, so the photovoltaic power station can be divided into multiple catchment areas in advance, wherein the division method can be to use a clustering algorithm, and the clustering algorithm includes an improved unsupervised clustering algorithm. Figure 5 as well as Figure 6As shown, the photovoltaic power station includes multiple confluence areas, and multiple photovoltaic strings are arranged in the confluence areas. The coordinate points of different photovoltaic strings are different. Figure 5 The coordinate points of different colors belong to different catchment areas. Figure 6 Coordinate points of different shapes belong to different catchment areas.

[0094] Optionally, among the multiple confluence areas of the photovoltaic power station, every two confluence areas are traversed in turn to detect whether every two confluence areas intersect, and the two intersecting confluence areas are optimized until all the confluence areas of the photovoltaic power station do not intersect.

[0095] Optionally, since each confluence area includes a plurality of coordinate points, whether two confluence areas intersect may be determined based on the position distribution of the coordinate points.

[0096] Optionally, the coordinate points in each confluence area may be divided row by row and column by column to determine the number of rows and columns of the coordinate points in each confluence area. Whether the two confluence areas intersect is determined based on the change in the number of rows and columns of the two confluence areas before merging and the total number of rows and columns of the two confluence areas after merging.

[0097] Step S20, when there are two intersecting target confluence areas, merging the two target confluence areas;

[0098] Step S30, re-dividing the merged confluence area into two confluence areas by horizontal division or vertical division.

[0099] In this embodiment, if two intersecting target confluence areas are detected, the two target confluence areas need to be flattened to optimize the confluence area division result. Specifically, the two target confluence areas are first merged into one confluence area, and then the merged confluence area is re-divided. In order to ensure that the two re-divided confluence areas do not intersect and are flattened, the re-division is performed by horizontal division or vertical division, for example, Figure 7 for Figure 6 The optimization results of the catchment area in Figure 8 for Figure 5 It can be understood that the optimized confluence area has a higher flatness, which is more in line with the logic of manual division, and there will be no situation where photovoltaic strings in different confluence areas cross each other, thereby reducing the cost of cable laying.

[0100] Optionally, when horizontal or vertical division is adopted, the dividing line for horizontal or vertical division can be determined according to at least one of the total number of rows, the total number of columns, the maximum length, and the maximum width of the merged confluence. For example, when the total number of rows of the merged confluence is 8, a dividing line can be set near the 4th row to perform horizontal division according to the dividing line.

[0101] Optionally, after all intersecting confluence areas of the photovoltaic power station are optimized, confluence equipment may be arranged in each confluence area to achieve confluence of electric energy.

[0102] In the technical solution disclosed in this embodiment, by detecting whether the convergence areas intersect, and redividing the convergence areas horizontally or vertically when they intersect, the convergence areas are flattened, thereby avoiding the intersection of photovoltaic strings in different convergence areas, being more in line with the logic of manual division, reducing the cable laying cost, and optimizing the convergence area division results.

[0103] In another embodiment, if Figure 3 As shown in the above Figure 2 Based on the embodiment shown, step S10 includes:

[0104] Step S11, obtaining coordinate points of photovoltaic strings included in any two confluence areas, wherein the any two confluence areas are a first confluence area and a second confluence area;

[0105] In this embodiment, a plurality of photovoltaic strings are arranged in each confluence area, and the coordinate points of the photovoltaic strings can be determined according to the positions of the photovoltaic strings. When detecting whether two confluence areas intersect, the coordinate points of all photovoltaic strings in the two confluence areas can be obtained, for example, Figure 5 as well as Figure 6 As shown, Figure 5 The points in are all coordinate points. Figure 6 In the figure, the coordinate points in the first confluence area are represented by a five-pointed star to distinguish them from the coordinate points in the second confluence area.

[0106] Step S12, determining the number of rows and columns of coordinate points in the first confluence area according to the coordinate points in the first confluence area, and determining the number of rows and columns of coordinate points in the second confluence area according to the coordinate points in the second confluence area;

[0107] In this embodiment, a coordinate point data set corresponding to the first confluence area is generated according to the coordinate points in the first confluence area, and a coordinate point data set corresponding to the second confluence area is generated according to the coordinate points in the second confluence area.

[0108] Optionally, the coordinate point data set corresponding to the first confluence area is divided into rows and columns to obtain multiple rows of coordinate points and multiple columns of coordinate points in the first confluence area. Specifically, when dividing the rows, the ordinate of each coordinate point can be obtained, and the ordinates of the multiple coordinate points can be divided into different ordinate intervals according to the distribution density of the ordinates, thereby realizing the division of the rows. The division method of the columns is similar to the division method of the rows, which will not be repeated here.

[0109] Optionally, the coordinate point data set corresponding to the second confluence area is divided into rows and columns to obtain multiple rows of coordinate points and multiple columns of coordinate points in the second confluence area. Specifically, when dividing the rows, the ordinate of each coordinate point can be obtained, and the ordinates of the multiple coordinate points can be divided into different ordinate intervals according to the distribution density of the ordinates, thereby realizing the division of the rows. The division method of the columns is similar to the division method of the rows, which will not be repeated here.

[0110] Step S13, obtaining the total number of rows and columns of coordinate points after the first confluence area and the second confluence area are combined;

[0111] In this embodiment, the coordinate point data set corresponding to the first confluence area and the coordinate point data set corresponding to the second confluence area are combined to obtain the coordinate point data set corresponding to the confluence area after the first confluence area and the second confluence area are merged. For the coordinate point data set corresponding to the merged confluence area, the rows and columns are re-divided to obtain the total number of rows and columns of coordinate points after the first confluence area and the second confluence area are merged.

[0112] Step S14, judging whether the first confluence area intersects with the second confluence area according to the number of rows of coordinate points of the first confluence area, the number of rows of coordinate points of the second confluence area and the total number of rows of coordinate points, and / or judging whether the first confluence area intersects with the second confluence area according to the number of columns of coordinate points of the first confluence area, the number of columns of coordinate points of the second confluence area and the total number of columns of coordinate points.

[0113] In this embodiment, if the total number of rows of coordinate points after the first confluence area and the second confluence area are merged is less than the sum of the number of rows of coordinate points of the first confluence area and the number of rows of coordinate points of the second confluence area, it indicates that the first confluence area and the second confluence area may intersect, so it is possible to continue to detect whether the first confluence area and the second confluence area do intersect, of course, it is also possible to directly determine that the first confluence area and the second confluence area intersect. And / or, if the total number of columns of coordinate points after the first confluence area and the second confluence area are merged is less than the sum of the number of columns of coordinate points of the first confluence area and the number of columns of coordinate points of the second confluence area, it indicates that the first confluence area and the second confluence area may intersect, so it is possible to continue to detect whether the first confluence area and the second confluence area do intersect, of course, it is also possible to directly determine that the first confluence area and the second confluence area intersect. Optionally, when the total number of rows of coordinate points is greater than or equal to the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area, and the total number of columns of coordinate points is greater than or equal to the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area, it is determined that the first confluence area does not intersect with the second confluence area. It is understandable that when the first confluence area intersects with the second confluence area, if some of the coordinate points in the first confluence area and some of the coordinate points in the second confluence area are in the same row or the same column, the number of rows or the number of columns will be reduced.

[0114] Optionally, when the total number of rows of coordinate points after the first confluence area and the second confluence area are merged is less than the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area, and / or the total number of columns of coordinate points after the first confluence area and the second confluence area are merged is less than the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area, it is possible to continue to detect whether the first confluence area and the second confluence area do intersect. Specifically, it is possible to determine whether the first confluence area and the second confluence area do intersect based on the maximum and minimum values ​​of the coordinate points in the first confluence area and the maximum and minimum values ​​of the coordinate points in the second confluence area.

[0115] Optionally, while continuing to detect whether the first confluence area and the second confluence area do intersect, it is also possible to first detect whether the distance between the first confluence area and the second confluence area is too far. Specifically, the minimum distance between the coordinate point in the first confluence area and the coordinate point in the second confluence area can be obtained. When the minimum distance is less than or equal to a preset threshold, it is determined that the distance between the first confluence area and the second confluence area is not too far, so it is possible to continue to detect whether the first confluence area and the second confluence area do intersect. When the minimum distance is greater than the preset threshold, it is determined that the distance between the first confluence area and the second confluence area is too far, so it can be determined that the first confluence area and the second confluence area do not intersect, so as to avoid redividing the first confluence area and the second confluence area. It can be understood that if the distance between the first confluence area and the second confluence area is too far, then after leveling, some of the strings in a single confluence area may cross the middle area between the confluence areas, for example, Figure 5 As shown, Figure 5 The red box area is the middle area between the bus areas. The distance between the first bus area and the second bus area is too far. If the bus area is redivided in this case, the cable laying cost will increase. Therefore, the redivision will lead to unreasonable division, so no redivision is performed.

[0116] Optionally, when judging whether the first confluence area and the second confluence area do intersect based on the maximum and minimum values ​​of the coordinate points in the first confluence area and the maximum and minimum values ​​of the coordinate points in the second confluence area, judging whether the first confluence area and the second confluence area intersect may be based on whether any one of the following conditions is met:

[0117] x max1 >x min2 , and y max2 ≥y max1 ≥y min2 , that is, the first confluence area intersects the second confluence area longitudinally;

[0118] x max1 >x min2 , and y max2 ≥y min1 ≥y min2, that is, the first confluence area intersects the second confluence area longitudinally;

[0119] y max2 >y min1 , and x max1 ≥x min2 ≥x min1 , that is, the first confluence area intersects the second confluence area laterally;

[0120] y max2 >y min1 , and x max1 ≥x max2 ≥x min1 , that is, the first confluence area intersects the second confluence area laterally;

[0121] Among them, among the maximum values ​​of the coordinate points in the first confluence area, the maximum value of the horizontal coordinate is x max1 , the maximum value of the vertical coordinate is y max1 ; Among the minimum values ​​of the coordinate points in the first confluence area, the minimum value of the horizontal coordinate is x min1 , the minimum value of the vertical coordinate is y min1 ; Among the maximum values ​​of the coordinate points in the second confluence area, the maximum value of the horizontal coordinate is x max2 , the maximum value of the vertical coordinate is y max2 ; Among the minimum values ​​of the coordinate points in the second confluence area, the minimum value of the horizontal coordinate is x min2 , the minimum value of the vertical coordinate is y min2 .

[0122] When the above conditions are not met, it can be determined that the first confluence area and the second confluence area do not intersect.

[0123] In the technical solution disclosed in this embodiment, the determination of whether the convergence areas intersect is achieved by obtaining the coordinate points of the photovoltaic strings included in the two convergence areas and judging whether the first convergence area intersects with the second convergence area based on the distribution of the coordinate points.

[0124] In yet another embodiment, Figure 4 As shown, in Figures 2 to 3 Based on any of the embodiments, step S30 includes:

[0125] Step S31, obtaining the maximum length and the maximum width of the merged confluence area, and / or the total number of rows and columns of coordinate points of the merged confluence area;

[0126] In this embodiment, when the merged confluence area is re-divided, it is necessary to determine whether to adopt horizontal division or vertical division. Specifically, the maximum length and maximum width of the merged confluence area, and / or the total number of rows and columns of coordinate points of the merged confluence area can be obtained, and the length and / or the number of rows and columns can be used to determine whether the merged confluence area is distributed horizontally or vertically as a whole, and the corresponding division method can be determined according to the distribution direction. For example, when the merged confluence area is distributed horizontally as a whole, vertical division is adopted, and when the merged confluence area is distributed vertically as a whole, horizontal division is adopted.

[0127] Optionally, the maximum length of the merged confluence area can be obtained based on the difference between the maximum value and the minimum value of the horizontal coordinate in the coordinate point data set corresponding to the merged confluence area, and the maximum width of the merged confluence area can be obtained based on the difference between the maximum value and the minimum value of the vertical coordinate in the coordinate point data set corresponding to the merged confluence area.

[0128] Step S32, when the maximum length and the maximum width, and / or the total number of rows and the total number of columns of coordinate points meet the preset conditions corresponding to the longitudinal distribution, the merged confluence area is re-divided into two confluence areas by horizontal division;

[0129] In this embodiment, the maximum length and the maximum width, and / or the total number of rows and columns of coordinate points are detected to see whether they meet the preset conditions corresponding to the longitudinal distribution. If the preset conditions corresponding to the longitudinal distribution are met, it indicates that the merged confluence area is distributed longitudinally as a whole, and therefore a horizontal division method is adopted.

[0130] Optionally, the preset condition corresponding to the longitudinal distribution may include any one of the following: length ≥2*x length , does not meet the preset conditions corresponding to the horizontal distribution. Among them, y length is the maximum width, x length is the maximum length.

[0131] Step S33, when the maximum length and the maximum width, and / or the total number of rows and columns of coordinate points meet the preset conditions corresponding to the horizontal distribution, the merged confluence area is redivided into two confluence areas by vertical division.

[0132] In this embodiment, the maximum length and the maximum width, and / or the total number of rows and the total number of columns of coordinate points are detected to see whether they meet the preset conditions corresponding to the horizontal distribution. If the preset conditions corresponding to the horizontal distribution are met, it indicates that the merged confluence area is horizontally distributed as a whole, so the vertical division method is adopted. Figure 7 as well as Figure 8 The following figure shows the catchment area after redivision.

[0133] Optionally, the preset condition corresponding to the longitudinal distribution may include any one of the following: length ≥2*y length 、col all ≥row all +2, where col all is the total number of columns of coordinate points in the merged catchment area, row all is the total number of rows of coordinate points in the merged catchment area. length ≥2*y length When vertical division is adopted, length ≥2*x length When horizontal partitioning is used, if x length With y length The size relationship does not satisfy the above two conditions, then in col all ≥row all When the value is +2, vertical division is used; otherwise, horizontal division is used.

[0134] In the technical solution disclosed in this embodiment, based on the maximum length and maximum width of the merged convergence area, and / or the total number of rows and columns of coordinate points of the merged convergence area, it is determined whether the merged convergence area is distributed horizontally or vertically, and the merged convergence area is re-divided by a corresponding division method to flatten the convergence area and reduce the cable laying cost.

[0135] In addition, an embodiment of the present invention also proposes an optimization device for confluence area division, and the optimization device for confluence area division includes: a memory, a processor, and an optimization program for confluence area division stored in the memory and executable on the processor. When the optimization program for confluence area division is executed by the processor, the steps of the optimization method for confluence area division described in the above embodiments are implemented.

[0136] In addition, an embodiment of the present invention further proposes a computer storage medium, on which an optimization program for confluence area division is stored. When the optimization program for confluence area division is executed by a processor, the steps of the optimization method for confluence area division described in the above embodiments are implemented.

[0137] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.

[0138] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.

[0139] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present invention.

[0140] The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. An optimization method for dividing a catchment area, characterized in that: The optimization method for dividing the confluence area comprises the following steps: Among multiple confluence areas of a photovoltaic power station, detecting whether any two confluence areas intersect; When there are two intersecting target catchment areas, the two target catchment areas are merged; Re-divide the merged catchment area into two catchment areas by horizontal or vertical division; The step of detecting whether any two confluence areas intersect comprises: Obtaining coordinate points of photovoltaic strings included in any two confluence areas, wherein the any two confluence areas are a first confluence area and a second confluence area; Determine the number of rows and columns of coordinate points of the first confluence area according to the coordinate points in the first confluence area, and determine the number of rows and columns of coordinate points of the second confluence area according to the coordinate points in the second confluence area; Obtain the total number of rows and columns of coordinate points after the first confluence area and the second confluence area are merged; Whether the first confluence area intersects with the second confluence area is determined based on the number of rows of coordinate points in the first confluence area, the number of rows of coordinate points in the second confluence area, and the total number of rows of coordinate points, and / or whether the first confluence area intersects with the second confluence area is determined based on the number of columns of coordinate points in the first confluence area, the number of columns of coordinate points in the second confluence area, and the total number of columns of coordinate points.

2. The optimization method for dividing the catchment area according to claim 1, characterized in that: The step of judging whether the first confluence area intersects with the second confluence area according to the number of coordinate point rows of the first confluence area, the number of coordinate point rows of the second confluence area, and the total number of coordinate point rows comprises: Detecting whether the total number of rows of coordinate points is less than the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area; If yes, judging whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area; The step of judging whether the first confluence area intersects with the second confluence area according to the number of coordinate point columns of the first confluence area, the number of coordinate point columns of the second confluence area, and the total number of coordinate point columns comprises: Detecting whether the total number of columns of coordinate points is less than the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area; If so, whether the first confluence area intersects with the second confluence area is determined based on the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area.

3. The optimization method for dividing the catchment area according to claim 2, characterized in that: If so, the step of determining whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area includes: If so, obtaining the minimum distance between the coordinate point in the first confluence area and the coordinate point in the second confluence area; When the minimum distance is less than or equal to the preset threshold, it is determined whether the first confluence area intersects with the second confluence area based on the maximum and minimum values ​​of the coordinate points in the first confluence area and the maximum and minimum values ​​of the coordinate points in the second confluence area.

4. The optimization method for dividing the catchment area according to claim 3, characterized in that: After the step of obtaining the minimum distance between the coordinate point in the first confluence area and the coordinate point in the second confluence area, the method further includes: When the minimum distance is greater than a preset threshold, it is determined that the first confluence area does not intersect with the second confluence area.

5. The optimization method for dividing the catchment area according to claim 2 or 3, characterized in that: The step of judging whether the first confluence area intersects with the second confluence area according to the maximum value and the minimum value of the coordinate points in the first confluence area and the maximum value and the minimum value of the coordinate points in the second confluence area comprises: Whether the first confluence area intersects the second confluence area is determined based on whether any of the following conditions are met: x max1 >x min2 , and y max2 ≥y max1 ≥y min2 ; x max1 >x min2 , and y max2 ≥y min1 ≥y min2 ; y max2 > y min1 , and x max1 ≥ x min2 ≥ x min1 ; y max2 > y min1 , and x max1 ≥ x max2 ≥ x min1 ; Among them, among the maximum values ​​of the coordinate points in the first confluence area, the maximum value of the horizontal coordinate is x max1 , the maximum value of the vertical coordinate is y max1 ; Among the minimum values ​​of the coordinate points in the first confluence area, the minimum value of the horizontal coordinate is x min1 , the minimum value of the vertical coordinate is y min1 ; Among the maximum values ​​of the coordinate points in the second confluence area, the maximum value of the horizontal coordinate is x max2 , the maximum value of the vertical coordinate is y max2 ; Among the minimum values ​​of the coordinate points in the second confluence area, the minimum value of the horizontal coordinate is x min2 , the minimum value of the vertical coordinate is y min2 .

6. The optimization method for dividing the catchment area according to claim 1, characterized in that: The step of judging whether the first confluence area intersects with the second confluence area according to the number of coordinate point rows of the first confluence area, the number of coordinate point rows of the second confluence area, and the total number of coordinate point rows, and / or judging whether the first confluence area intersects with the second confluence area according to the number of coordinate point columns of the first confluence area, the number of coordinate point columns of the second confluence area, and the total number of coordinate point columns comprises: When the total number of rows of coordinate points is greater than or equal to the sum of the number of rows of coordinate points in the first confluence area and the number of rows of coordinate points in the second confluence area, and the total number of columns of coordinate points is greater than or equal to the sum of the number of columns of coordinate points in the first confluence area and the number of columns of coordinate points in the second confluence area, it is determined that the first confluence area and the second confluence area do not intersect.

7. The optimization method for dividing the catchment area according to claim 1, characterized in that: The step of re-dividing the merged confluence area into two confluence areas by horizontal division or vertical division includes: Obtain the maximum length and the maximum width of the merged confluence area, and / or the total number of rows and columns of coordinate points in the merged confluence area; When the maximum length and the maximum width, and / or the total number of rows and the total number of columns of coordinate points meet the preset conditions corresponding to the longitudinal distribution, the merged confluence area is redivided into two confluence areas by horizontal division; When the maximum length and the maximum width, and / or the total number of rows and columns of coordinate points meet the preset conditions corresponding to the horizontal distribution, the merged confluence area is redivided into two confluence areas by vertical division.

8. An optimization device for dividing a confluence area, characterized in that: The optimization device for confluence area division includes: a memory, a processor, and an optimization program for confluence area division stored in the memory and executable on the processor. When the optimization program for confluence area division is executed by the processor, the steps of the optimization method for confluence area division as described in any one of claims 1 to 7 are implemented.

9. A computer storage medium, characterized in that The computer storage medium stores an optimization program for confluence area division, and when the optimization program for confluence area division is executed by a processor, the steps of the optimization method for confluence area division according to any one of claims 1 to 7 are implemented.

Images