Photovoltaic power station capacity area division method, device and equipment and storage medium

Abstract

The application discloses a photovoltaic power station capacity area division method, device and equipment and a computer readable storage medium, relates to the technical field of photovoltaic power stations, and comprises the following steps: acquiring a target area capacity list, and acquiring a photovoltaic module arrangement result of a photovoltaic power station setting area; clustering each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result to obtain a plurality of component partitions; calculating the partition distance between each component partition according to the position of each component partition; finding the shortest path from a starting point partition to a terminal point partition through each component partition according to the partition distance, determining the arrangement order of each component partition according to the shortest path, and dividing each component partition into each capacity area according to the arrangement order. The application can meet the capacity demand of a user customization, ensure that the capacity area obtained by division is as concentrated and regular as possible, and facilitate stringing.

Description

Technical Field

[0001] This invention relates to the field of photovoltaic power plant technology, and in particular to a method, apparatus, equipment, and computer-readable storage medium for dividing the capacity area of ​​a photovoltaic power plant. Background Technology

[0002] The common process for electrical design of distributed photovoltaic (PV) power plants is to first arrange the PV modules, then connect the modules in series, and finally divide the current-collector areas based on the series connection results to determine the assignment of each grid-connected point and the modules under the inverter. However, the division of capacity areas (such as current-collector areas or grid-connected areas) in this scheme heavily depends on the module series connection results. Unreasonable series connection, too many types of series connections, and scattered distribution of the same series connections can lead to unreasonable capacity area division, resulting in isolated capacity areas or unbalanced inverter capacity ratios that increase costs. Furthermore, if users want to customize the capacity (such as customized current-collector area capacity or customized grid-connected area capacity) or design in mixed low, medium, and high voltage scenarios, the determined series connection results may also lead to capacity area division that does not meet the scenario requirements.

[0003] Some researchers have also tried to solve this problem from a process perspective, attempting to divide the capacity area before the wiring process. However, they have encountered another problem: how to divide the photovoltaic power station setting area into reasonable capacity areas based on the user's customized capacity, and then connect the wiring separately in each capacity area, while ensuring that the capacity area is as regular as possible to facilitate wiring. Summary of the Invention

[0004] The main objective of this invention is to provide a method, apparatus, device, and computer-readable storage medium for dividing the capacity area of ​​a photovoltaic power station. The aim is to propose a capacity area division scheme for a photovoltaic power station that can meet the customized capacity requirements of users while ensuring that the divided capacity areas are as concentrated and regular as possible, facilitating wiring.

[0005] To achieve the above objectives, the present invention provides a method for dividing the capacity area of ​​a photovoltaic power plant, comprising:

[0006] Obtain the target area capacity list and the photovoltaic module layout results of the photovoltaic power station setting area, wherein the target area capacity list includes the planned capacity of each capacity area;

[0007] The photovoltaic modules are clustered according to their arrangement positions in the photovoltaic module layout results to obtain multiple module partitions, and each module partition contains at least one photovoltaic module.

[0008] Calculate the partition distance between each pair of component partitions based on the location of each component partition;

[0009] Find the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and determine the order of each of the component partitions according to the shortest path, wherein the starting partition and the ending partition are determined from each of the component partitions;

[0010] Each of the component partitions is assigned to a capacity region, wherein the component partitions assigned to the same capacity region are consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules assigned to the capacity region is the same as the planned capacity of the capacity region.

[0011] Optionally, the step of obtaining the target area capacity list includes:

[0012] Get a list of custom area capacities, which includes each custom capacity;

[0013] Each custom capacity is corrected to obtain a corrected capacity. Each corrected capacity is determined as the planned capacity corresponding to each capacity region to obtain the target region capacity list. Each corrected capacity can be divided by the preset serializable capacity of the photovoltaic power station, and the sum of each corrected capacity is equal to the total capacity of the photovoltaic power station.

[0014] Optionally, the step of clustering the photovoltaic modules according to their arrangement positions in the photovoltaic module layout result to obtain multiple module partitions includes:

[0015] The horizontal connectivity distance and the vertical connectivity distance are set. The horizontal connectivity distance is greater than the horizontal distance between two horizontally adjacent photovoltaic modules in a single array and less than the horizontal distance between two horizontally adjacent photovoltaic modules across an array. The vertical connectivity distance is greater than the vertical distance between two vertically adjacent photovoltaic modules in a single array and less than the vertical distance between two vertically adjacent photovoltaic modules across an array.

[0016] Based on the horizontal connectivity distance and the vertical connectivity distance, each photovoltaic module is clustered according to its position in the photovoltaic module layout result to obtain multiple module partitions. In the same module partition, the horizontal distance between two horizontally adjacent photovoltaic modules is less than the horizontal connectivity distance, and the vertical distance between two vertically adjacent photovoltaic modules is less than the vertical connectivity distance.

[0017] Optionally, the step of clustering the photovoltaic modules according to their arrangement positions in the photovoltaic module layout result based on the lateral connectivity distance and the longitudinal connectivity distance to obtain multiple module partitions includes:

[0018] The clustering radius of the DBSCAN clustering algorithm is set to the horizontal connectivity distance and the vertical connectivity distance, and the minimum number of contained points of the DBSCAN clustering algorithm is set to 1. The DBSCAN clustering algorithm is used to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result to obtain multiple module partitions.

[0019] Optionally, the step of calculating the pairwise partition distance between each of the component partitions based on their positions includes:

[0020] For any two component partitions in each of the component partitions, the component distance between each pair of photovoltaic modules in the two component partitions is calculated based on the arrangement position of each photovoltaic module.

[0021] The partition distance between the two component partitions is determined based on the smallest component distance among the various component distances.

[0022] Optionally, the step of determining the partition distance between the two component partitions based on the smallest component distance among the various component distances includes:

[0023] If there are no obstacles blocking the two component partitions, the smallest component distance among the component distances shall be taken as the partition distance between the two component partitions.

[0024] If there is an obstacle blocking the distance between the two component partitions, the minimum component distance among the component distances is added to a preset distance and then used as the partition distance between the two component partitions.

[0025] Optionally, when the photovoltaic power station is located in a roof area, and the roof area is divided into multiple sub-roofs by a ridge line in the column direction, the step of finding the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and determining the arrangement order of each of the component partitions based on the shortest path, includes:

[0026] For each subroof, a start section and an end section are selected from each of the component sections within the subroof, wherein the start section and the end section of the same subroof are located at two opposite corners of the subroof, and for two adjacent subroofs, the start section in one subroof and the end section in the other subroof are on the same side.

[0027] For each sub-roof, find the shortest path from the starting partition within the sub-roof through each of the component partitions within the sub-roof to the ending partition within the sub-roof, according to the partition distance;

[0028] The shortest paths found in each sub-roof are connected according to the order of the sub-roofs in the column direction to obtain the shortest path corresponding to the roof area. The arrangement order of each component partition in the roof area is determined according to the shortest path corresponding to the roof area.

[0029] Optionally, the step of partitioning each of the component partitions into each of the capacity regions includes:

[0030] The component partitions are traversed according to their arrangement order, and the capacity regions are traversed as well.

[0031] If the capacity of the currently traversed component partition is equal to the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition and the next capacity region are traversed. The already allocated capacity is the sum of the capacities of all the component partitions that have been allocated to the currently traversed capacity region.

[0032] If the capacity of the currently traversed component partition is less than the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition is traversed.

[0033] If the capacity of the currently traversed component partition is greater than the difference between the planned capacity and the already allocated capacity of the currently traversed capacity region, then photovoltaic modules with a capacity equal to the difference are cut out from the currently traversed component partition, the cut-out photovoltaic modules are allocated to the currently traversed capacity region, and the next capacity region is traversed.

[0034] Optionally, the step of cutting out photovoltaic modules with capacities equal to the difference from the currently traversed module partitions includes:

[0035] Identify the photovoltaic module in the currently traversed component partition that is closest to the previously traversed component partition, and use it as the starting component for cutting;

[0036] Arrange the photovoltaic modules in the currently traversed component partitions in ascending order of their distance from the starting component of the cut, and find the photovoltaic module at the front of the list whose capacity is equal to the difference between the two components as the photovoltaic module to be cut.

[0037] To achieve the above objectives, the present invention also provides a photovoltaic power plant capacity area division device, comprising:

[0038] The acquisition module is used to acquire a list of target area capacities and the photovoltaic module layout results of the photovoltaic power station setting area, wherein the list of target area capacities includes the planned capacity of each capacity area;

[0039] The clustering module is used to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result, to obtain multiple module partitions, and each module partition contains at least one photovoltaic module;

[0040] The calculation module is used to calculate the partition distance between each pair of the component partitions based on the position of each component partition;

[0041] The sorting module is used to find the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and to determine the sorting order of each of the component partitions according to the shortest path, wherein the starting partition and the ending partition are determined from each of the component partitions;

[0042] The partitioning module is used to partition each of the component partitions into each of the capacity regions, wherein the component partitions partitioned into the same capacity region are consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules partitioned into the capacity region is the same as the planned capacity of the capacity region.

[0043] To achieve the above objectives, the present invention also provides a photovoltaic power plant capacity area division device, which includes: a memory, a processor, and a photovoltaic power plant capacity area division program stored in the memory and executable on the processor. When the photovoltaic power plant capacity area division program is executed by the processor, it implements the steps of the photovoltaic power plant capacity area division method as described above.

[0044] Furthermore, to achieve the above objectives, the present invention also proposes a computer-readable storage medium storing a photovoltaic power plant capacity area division program, wherein when the photovoltaic power plant capacity area division program is executed by a processor, it implements the steps of the photovoltaic power plant capacity area division method as described above.

[0045] In this embodiment of the invention, a target area capacity list including the planned capacity of each capacity region and the photovoltaic module layout result of the photovoltaic power station setting area are obtained as the data basis for capacity region division. Then, according to the layout position of each photovoltaic module in the photovoltaic module layout result, each photovoltaic module is clustered to obtain multiple module partitions. Each module partition contains at least one photovoltaic module, thus initially dividing each photovoltaic module into relatively concentrated and regular small partitions. Then, according to the position of each module partition, the partition distance between each pair of module partitions is calculated, and the shortest path from the starting partition through each module partition to the ending partition is found according to the partition distance. The arrangement order of each module partition is determined according to the shortest path, wherein the starting partition and the ending partition are determined from each of the module partitions. Finally, each module partition is assigned to each capacity region, and the module partitions assigned to the same capacity region are restricted to be consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules assigned to the capacity region is the same as the planned capacity of the capacity region, thus realizing a photovoltaic power station capacity region division scheme. In this scheme, since the arrangement order is determined according to the shortest distance path found, the distance between two adjacent component partitions is relatively close. Furthermore, by arbitrarily selecting multiple sequentially adjacent component partitions to form a region, the component partitions within this region are relatively concentrated. Therefore, by limiting the total capacity of photovoltaic modules assigned to the capacity region to be the same as the planned capacity of that capacity region, the allocated capacity region can meet the pre-planned capacity size and satisfy customized needs. At the same time, by limiting the component partitions assigned to the same capacity region to be consecutive partitions in the arrangement order, the photovoltaic modules assigned to the capacity region can be concentrated and regular as much as possible, avoiding the emergence of isolated capacity regions, and facilitating the connection of photovoltaic modules within the capacity region. Attached Figure Description

[0046] Figure 1 This is a schematic diagram of the hardware operating environment involved in the embodiments of the present invention;

[0047] Figure 2 This is a flowchart illustrating the first embodiment of the photovoltaic power plant capacity area division method of the present invention;

[0048] Figure 3 This is a schematic diagram of a capacity list correction process according to an embodiment of the present invention;

[0049] Figure 4 This is a schematic diagram showing the positions of the starting and ending zones in three sub-roofs according to an embodiment of the present invention;

[0050] Figure 5This is a schematic diagram of the shortest path for the roof area obtained by connecting the shortest paths of the upper and lower sub-roofs, according to an embodiment of the present invention.

[0051] Figure 6 This is a schematic diagram of a component arrangement according to an embodiment of the present invention;

[0052] Figure 7 This is a schematic diagram of a component partitioning obtained by clustering according to an embodiment of the present invention;

[0053] Figure 8 This is a schematic diagram illustrating a process for partitioning components into capacity regions according to an embodiment of the present invention;

[0054] Figure 9 This is a schematic diagram of the various capacity regions obtained by dividing the data according to an embodiment of the present invention;

[0055] Figure 10 This is a schematic diagram of the functional modules of a preferred embodiment of the photovoltaic power station capacity area division device of the present invention.

[0056] The realization of the objective, functional features and advantages of the present invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0057] It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

[0058] like Figure 1 As shown, Figure 1 This is a schematic diagram of the device structure of the hardware operating environment involved in the embodiments of the present invention.

[0059] It should be noted that the photovoltaic power station capacity area division device in this embodiment of the invention can be a server, personal computer, smartphone, or other device, and no specific limitation is made here.

[0060] like Figure 1As shown, the photovoltaic power station capacity area partitioning device 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. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and an input unit such as a keyboard; optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be a high-speed RAM or a stable, non-volatile memory, such as a disk drive. Optionally, the memory 1005 may also be a storage device independent of the aforementioned processor 1001.

[0061] Those skilled in the art will understand that Figure 1 The equipment structure shown does not constitute a limitation on the capacity area division equipment of a photovoltaic power plant. It may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0062] like Figure 1 As shown, the memory 1005, serving as a computer storage medium, may include an operating system, a network communication module, a user interface module, and a photovoltaic power plant capacity area partitioning program. The operating system is a program that manages and controls the hardware and software resources of the device, supporting the operation of the photovoltaic power plant capacity area partitioning program and other software or programs. Figure 1 In the device shown, the user interface 1003 is mainly used for data communication with the client; the network interface 1004 is mainly used for establishing a communication connection with the server; and the processor 1001 can be used to call the photovoltaic power station capacity area division program stored in the memory 1005 and execute the photovoltaic power station capacity area division method in the following embodiments.

[0063] Based on the above structure, various embodiments of the photovoltaic power plant capacity area division method are proposed.

[0064] Reference Figure 2 , Figure 2 This is a flowchart illustrating the first embodiment of the photovoltaic power plant capacity area division method of the present invention.

[0065] This invention provides an embodiment of a photovoltaic power plant capacity area division method. It should be noted that although the flowchart shows a logical order, in some cases, the steps shown or described may be executed in a different order. In this embodiment, the executing entity of the photovoltaic power plant capacity area division method can be a server, personal computer, smartphone, or other device; no limitation is made in this embodiment. For ease of description, the execution entity is omitted from the following description of each embodiment. In this embodiment, the photovoltaic power plant capacity area division method includes steps S10 to S50:

[0066] Step S10: Obtain the target area capacity list and the photovoltaic module layout results of the photovoltaic power station setting area, wherein the target area capacity list includes the planned capacity of each capacity area.

[0067] A photovoltaic (PV) power plant site area refers to the area where a PV power plant is planned to be built, such as a rooftop area. In practical applications, after the PV modules are deployed in the site area, the total capacity of all PV modules may be large. In reality, it may be necessary to divide this total capacity into multiple smaller capacities to meet the construction requirements of the PV power plant. For example, all PV modules may need to be divided into multiple collector areas, with PV modules within each collector area connected to a single grid-connected unit, and the capacity of each collector area may be specifically planned. Alternatively, all PV modules may need to be divided into multiple grid-connected areas, with PV modules within each grid-connected area connected to a single grid-connected unit, and the capacity of each grid-connected area may be specifically planned. In this embodiment, the area that needs to be divided according to the planned capacity is called a capacity area. For example, a capacity area can refer to a collector area, a grid-connected area, or other types of areas; this embodiment does not impose any limitations. The planned capacity of a capacity area is called the planned capacity.

[0068] In this embodiment, a target area capacity list can be obtained, including the planned capacity of each capacity area. For example, the target area capacity list is [X1kw, X2kw, X3kw, X4kw], which means that the photovoltaic power station will be divided into four capacity areas, and the planned capacity of each capacity area is X1kw, X2kw, X3kw and X4kw respectively.

[0069] The photovoltaic module layout results can include the position of each photovoltaic module within the photovoltaic power station installation area. In specific embodiments, other data may also be included as needed, such as the total capacity of all photovoltaic modules, the spacing between photovoltaic modules, obstacle information, roofline information, etc. It should be noted that a photovoltaic module can be regarded as a rectangular area. In various embodiments of the present invention, the position of the photovoltaic module is exemplarily represented by the center point of the rectangular area. However, it is understood that this method is not limited. For example, it is also feasible to represent the position of the photovoltaic module by the top left corner of the rectangular area.

[0070] In one feasible implementation, the step of obtaining the target area capacity list in step S10 includes S101 to S102.

[0071] Step S101: Obtain a list of custom area capacities, which includes various custom capacities.

[0072] Step S102: Correct each custom capacity to obtain each corrected capacity, determine each corrected capacity as the planned capacity corresponding to each capacity region, and obtain the target region capacity list. Each corrected capacity can be divided by the preset serializable capacity of the photovoltaic power station, and the sum of each corrected capacity is equal to the total capacity of the photovoltaic power station.

[0073] The preset string capacity can be set in advance or calculated. It is the capacity corresponding to the number of photovoltaic modules that can be connected in series. For example, a string of photovoltaic modules can include 20, 21 or 22 photovoltaic modules. Then, the three string capacities can be preset: the total capacity of 20 photovoltaic modules, the total capacity of 21 photovoltaic modules and the total capacity of 22 photovoltaic modules.

[0074] Custom capacity refers to the capacity defined by the user, which is input based on the approximate capacity of the photovoltaic power plant and the actual grid connection restrictions of the plant area. If the capacity meets the requirements, it can be directly used as the planned capacity of the capacity area. If the capacity does not meet the requirements, it needs to be corrected to meet the requirements before being used as the planned capacity of the capacity area. The capacity must meet the following requirements: it must be able to be divided into preset series-connectable capacities, and the sum of all capacities in the list must be equal to the total capacity of the photovoltaic power plant.

[0075] In one feasible implementation, taking the area where the photovoltaic power station is installed as the rooftop area and the capacity area as the grid-connected area as an example, it can be implemented as follows: Figure 3The process shown calibrates each custom capacity. Based on the user-input grid-connected capacity list, component parameter information, and rooftop component layout capacity information, the user-input grid-connected capacity list is calibrated to meet the required number of interconnected lines, and the total capacity meets the rooftop capacity limit. The specific steps are as follows:

[0076] 1) Calculate the maximum number of modules in series based on component parameter information, such as maximum current, power, and temperature. For example, if the calculation result is 22 modules, it means that the maximum number of modules in series in this scenario is 22. Within the normal range of N to N-2, the string constraint is 20 to 22. That is, the number of photovoltaic modules in series is constrained to be 20 to 22. Therefore, each capacity in the grid-connected capacity list needs to be corrected to be able to be divided into three series-compatible capacities: the total capacity of 20 photovoltaic modules, the total capacity of 21 photovoltaic modules, and the total capacity of 22 photovoltaic modules.

[0077] 2) Verify whether each capacity in the current user-input grid-connected capacity list can be divided into preset serializable capacities. If not, proceed to correction module 1, which decrements the number of module blocks corresponding to that capacity by 1 each time, and then continues verification until it meets the requirement. For example, suppose a capacity in the grid-connected capacity list is 450kW and the capacity of a single photovoltaic module is 10kW. Then, the number of module blocks corresponding to this capacity is 450kW / 10kW = 45. 45 cannot be divided into 20, 21, and 22. Subtract 1 from 45 to get 44. 44 can be divided into two 22s. Therefore, the capacity is corrected to 44*10kW = 440kW.

[0078] 3) Verify whether the current grid-connected capacity meets the roof capacity constraint, i.e., whether the sum of the listed capacities equals the roof capacity. If not, proceed with correction module 2 to correct the grid-connected capacity list to be equal to the roof capacity constraint. If it exceeds the constraint, correct the capacity at the end of the grid-connected capacity list one by one until the requirement is met. If it is insufficient, add additional grid-connected capacity to the end of the list. For example, the list includes four capacities [440kW, 630kW, 650kW, 430kW]. If the roof capacity is 1290kW, the list is corrected to [440kW, 630kW, 220kW]. If the roof capacity is 2370kW, the list can be corrected to [440kW, 630kW, 650kW, 430kW, 220kW], or corrected to [440kW, 630kW, 650kW, 650kW].

[0079] Step S20: Cluster each photovoltaic module according to its arrangement position in the photovoltaic module arrangement result to obtain multiple module partitions, each module partition containing at least one photovoltaic module.

[0080] The photovoltaic (PV) modules are clustered according to their arrangement, resulting in multiple clusters. Each cluster contains PV modules that form a module partition, and each module partition contains at least one PV module. The purpose of clustering is to group PV modules that are close together into the same cluster, ensuring that the PV modules within a single module partition are close together. In other words, a single module partition is a well-organized area within the PV power plant, rather than being composed of scattered PV modules.

[0081] The clustering algorithm used can be selected according to actual needs, and no restrictions are imposed in this embodiment.

[0082] Step S30: Calculate the partition distance between each pair of component partitions based on the position of each component partition.

[0083] The distance between two module partitions is called the partition distance for distinction. The position of a module partition can be represented by the position of a point within the module partition. For example, the center point of the module partition can be used to represent the distance between the module partitions, and then the partition distance between each pair of module partitions can be calculated; alternatively, the positions of all photovoltaic modules in the module partition can be used to calculate the partition distance. In this embodiment, there is no limitation on the method of calculating the partition distance.

[0084] Step S40: Find the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and determine the arrangement order of each of the component partitions according to the shortest path, wherein the starting partition and the ending partition are determined from each of the component partitions.

[0085] In a specific implementation, the photovoltaic power station area can be treated as a whole. The shortest path for this area is then found. This involves identifying a starting zone and an ending zone from all component zones within the photovoltaic power station area. There are many paths from the starting zone through all component zones to the ending zone. The shortest path (the path with the shortest distance) is found, and its distance is calculated based on the distances between component zones. The order in which the component zones are traversed along this shortest path can then be used as the arrangement order for the component zones. Alternatively, if the photovoltaic power station area is composed of multiple dispersed regions, it can be divided into sub-regions. A shortest path can be found for each sub-region, and these sub-regions' shortest paths can be concatenated to obtain the shortest path for the entire photovoltaic power station area.

[0086] In one feasible embodiment, when the area where the photovoltaic power station is located is a roof area, and the roof area is divided into multiple sub-roofs by a ridge line in the column direction, step S40 includes S401 to S403:

[0087] Step S401: For each sub-roof, select a starting section and an ending section from each of the component partitions within the sub-roof, wherein the starting section and the ending section of the same sub-roof are located at two opposite corners of the sub-roof, and for two adjacent sub-roofs, the starting section in one sub-roof and the ending section in the other sub-roof are on the same side.

[0088] For example, Figure 4 The diagram shows the locations of the starting and ending zones in the three sub-roofs.

[0089] By selecting the starting and ending partitions in step S401, the shortest path can be connected between the various sub-roofs, resulting in the shortest possible path.

[0090] Step S402: For each sub-roof, find the shortest path from the starting partition within the sub-roof through each of the component partitions within the sub-roof to the ending partition within the sub-roof, according to the partition distance.

[0091] The method for finding the shortest path within a sub-roof is not limited in this embodiment.

[0092] Step S403: Connect the shortest paths found in each sub-roof according to the order of each sub-roof in the column direction to obtain the shortest path corresponding to the roof area, and determine the arrangement order of each component partition in the roof area according to the shortest path corresponding to the roof area.

[0093] For example, Figure 5 A schematic diagram is given showing the shortest path for the roof area obtained by connecting the shortest paths of the upper and lower sub-roofs.

[0094] There are many ways to find the shortest path, and this embodiment does not impose any restrictions. One feasible method is to traverse each feasible path and find the one with the shortest distance.

[0095] In one feasible implementation, the shortest path can be found by solving the Traveling Salesman Problem (TSP). For the photovoltaic module installation area or for each sub-region of the photovoltaic module installation area, specify the starting point q and ending point p of the TSP problem, that is, the starting partition and the ending partition, and define the TSP problem as follows:

[0096]

[0097]

[0098] Where Z represents the total distance traversed by the path, minZ represents finding the shortest path; n represents the total number of component partitions in the region, and d ij This represents the distance between the i-th partition component and the j-th partition component. Two partition components traversed sequentially on a path can be understood as being connected by an edge, with the direction of the edge indicating the order in which the two partition components are traversed. Determining a path involves determining whether there are edges connecting the partition components and the direction of those edges. ij `x` indicates whether there is an edge on the path pointing from the `i`th partition component to the `j`th partition component; `V` represents the set of indices of all partition components within the region. In the TSP problem above, `st` lists six constraints. The first constraint ensures that every point on the path except the endpoint `p` (i.e., every component partition except the endpoint partition) can have only one edge pointing to another point. The second constraint ensures that every point on the path except the starting point (i.e., every component partition except the starting point partition) can have only one edge pointing to that point. The third constraint ensures that no cycles can form on the path. The fourth constraint constrains `x`... ij The value can be 0 or 1. 0 means that the path needs to go from the i-th partition component to the j-th partition component, and 1 means that the path does not need to go from the i-th partition component to the j-th partition component. The fifth constraint is used to constrain p to be the end point, that is, there are no edges from p to other points. The sixth constraint is used to constrain q to be the start point, that is, there are no edges from other points to q.

[0099] For the TSP problem defined above, a solution algorithm can be used to obtain minZ. Many algorithms can be used, and no limitation is made here. For example, in a feasible implementation, the ant colony algorithm can be used to solve the problem. The basic idea of ​​applying the ant colony algorithm to solve optimization problems is: use the walking paths of ants to represent a feasible solution to the problem to be optimized; the entire path of the ant colony constitutes the solution space of the problem. Ants with shorter paths release more pheromones. As the calculation progresses, more pheromones accumulate on shorter paths, thus increasing the number of ants choosing that path. Eventually, the entire ant colony will converge on the optimal path under the effect of positive feedback, which is the optimal solution to the corresponding problem.

[0100] Step S50: Divide each of the component partitions into each of the capacity regions, wherein the component partitions assigned to the same capacity region are consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules assigned to the capacity region is the same as the planned capacity of the capacity region.

[0101] After obtaining the arrangement order of each component partition within the photovoltaic power plant's installation area, each component partition is assigned to a different capacity area according to this arrangement order. The assignment results must meet the following requirements: component partitions assigned to the same capacity area must be consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules assigned to the capacity area must be the same as the planned capacity of that capacity area. Since the arrangement order is determined based on the shortest distance path found, adjacent component partitions are relatively close in this arrangement order. Furthermore, any region formed by randomly selecting multiple sequentially adjacent component partitions will have relatively concentrated component partitions. Therefore, by restricting the total capacity of the photovoltaic modules assigned to a capacity area to be the same as the planned capacity of that capacity area, the assigned capacity areas can conform to the pre-planned capacity size, meeting customized needs. Simultaneously, by restricting the component partitions assigned to the same capacity area to be consecutive partitions in the arrangement order, the photovoltaic modules assigned to the capacity area can be as concentrated and orderly as possible, avoiding isolated capacity areas and facilitating the interconnection of photovoltaic modules within the capacity area.

[0102] Based on the solution of this embodiment, the problem of discrete and isolated capacity areas can be effectively avoided, making the divided capacity areas more concentrated and regular, and can meet the customized capacity needs of users in various low, medium and high voltage mixed scenarios. It also facilitates the subsequent wiring process and simplifies the wiring difficulty.

[0103] Based on the first embodiment described above, a second embodiment of the photovoltaic power plant capacity area division method of the present invention is proposed. In this embodiment, a feasible implementation method for clustered photovoltaic modules is proposed. Step S20 includes S201 to S202:

[0104] Step S201: Set the horizontal connectivity distance and the vertical connectivity distance, wherein the horizontal connectivity distance is greater than the horizontal distance between two horizontally adjacent photovoltaic modules within a single array and less than the horizontal distance between two horizontally adjacent photovoltaic modules across an array, and the vertical connectivity distance is greater than the vertical distance between two vertically adjacent photovoltaic modules within a single array and less than the vertical distance between two vertically adjacent photovoltaic modules across an array.

[0105] When photovoltaic (PV) modules are deployed within a PV power plant area, they are arranged in an array. An array consists of multiple rows and columns of PV modules, with equal spacing between modules within each array. Multiple arrays also maintain this equal spacing. The distance between two adjacent modules within a single array is less than the distance between two adjacent modules across an array. Because PV modules are rectangular areas of varying lengths and widths, the lateral distance between two horizontally adjacent PV modules within a single array differs from the longitudinal distance between two vertically adjacent PV modules. Similarly, the lateral distance between two horizontally adjacent PV modules across an array differs from the longitudinal distance between two vertically adjacent PV modules across an array. Therefore, different connectivity distances are set for the lateral and longitudinal directions, i.e., lateral connectivity distance and longitudinal connectivity distance. Figure 6 The diagram shows a schematic of the component arrangement, which consists of four arrays. L1 represents the lateral distance between two horizontally adjacent photovoltaic modules in a single array, L2 represents the longitudinal distance between two vertically adjacent photovoltaic modules in a single array, L3 represents the lateral distance between two horizontally adjacent photovoltaic modules across arrays, and L4 represents the longitudinal distance between two vertically adjacent photovoltaic modules across arrays.

[0106] In one feasible implementation, the lateral connectivity distance and the longitudinal connectivity distance can be obtained as follows: componentLength and componentWidth are defined as the length and width of the photovoltaic module, and componentSpacing is the spacing between the photovoltaic modules.

[0107] Lateral connectivity distance = componentLength + componentSpacing + 1

[0108] Vertical connectivity distance = componentWidth + componentSpacing + 1

[0109] Step S202: Based on the horizontal connectivity distance and the vertical connectivity distance, the photovoltaic modules are clustered according to their arrangement positions in the photovoltaic module layout results to obtain multiple module partitions. In the same module partition, the horizontal distance between two horizontally adjacent photovoltaic modules is less than the horizontal connectivity distance, and the vertical distance between two vertically adjacent photovoltaic modules is less than the vertical connectivity distance.

[0110] Photovoltaic modules are clustered based on horizontal and vertical connectivity distances. The resulting clustering partitions must meet the following conditions: Within the same partition, the horizontal distance between two horizontally adjacent photovoltaic modules is less than the horizontal connectivity distance; that is, two horizontally adjacent photovoltaic modules with a horizontal distance greater than or equal to the horizontal connectivity distance will not be assigned to the same partition. Similarly, within the same partition, the vertical distance between two vertically adjacent photovoltaic modules is less than the vertical connectivity distance; that is, two vertically adjacent photovoltaic modules with a vertical distance greater than or equal to the vertical connectivity distance will not be assigned to the same partition. Since the horizontal connectivity distance is greater than the horizontal distance between two horizontally adjacent photovoltaic modules within a single array but less than the horizontal distance between two horizontally adjacent photovoltaic modules across arrays, and the vertical connectivity distance is greater than the vertical distance between two vertically adjacent photovoltaic modules within a single array but less than the vertical distance between two vertically adjacent photovoltaic modules across arrays, photovoltaic modules that are essentially within the same array and not separated by non-layable areas will be assigned to the same partition. It should be noted that when photovoltaic modules are laid out in an array within the area where a photovoltaic power station is set up, the entire area may be fully covered first, and then photovoltaic modules in areas where they cannot be laid, such as obstacles or roof ridges, may be removed, leaving only those in the layable areas. These photovoltaic modules still retain the gaps that were present when they were laid out in an array. However, some photovoltaic modules within the array may be in areas where they cannot be laid and have been removed, resulting in a large distance between the photovoltaic modules in that array. In this case, the array may not be suitable as a component partition. The clustering method proposed in this embodiment can cluster the photovoltaic modules in the original array into the same component partition as much as possible. The original array is conducive to the formation of C-strings, while also avoiding clustering arrays that are not suitable as a component partition into a single component partition.

[0111] It should be noted that there are many clustering algorithms that can meet the above clustering conditions. This embodiment does not limit which clustering algorithm can be used, and can be selected as needed.

[0112] In one feasible implementation, a feasible clustering algorithm is proposed to satisfy the above clustering conditions, wherein step S202 includes S2021.

[0113] Step S2021: Set the clustering radius of the DBSCAN clustering algorithm to the horizontal connectivity distance and the vertical connectivity distance, set the minimum number of contained points of the DBSCAN clustering algorithm to 1, and use the DBSCAN clustering algorithm to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result to obtain multiple module partitions.

[0114] The DBSCAN clustering algorithm is a density-based clustering algorithm. In this embodiment, it is improved to ensure that the clustered components in each partition satisfy the aforementioned clustering conditions. The improvement involves setting the clustering radius of the DBSCAN algorithm to the horizontal and vertical connectivity distances, and setting the minimum number of contained points to 1. The minimum number of contained points refers to the minimum number of points contained in each cluster. In this embodiment, setting it to 1 ensures that all photovoltaic modules can be assigned to a module partition, preventing any photovoltaic module from not belonging to any partition and thus avoiding isolated photovoltaic modules. Setting the clustering radius to the horizontal and vertical connectivity distances ensures that the clustered components in each partition satisfy the aforementioned clustering conditions.

[0115] like Figure 7 As shown, an exemplary diagram of component partitioning obtained through clustering is provided, with a total of 28 component partitions. It should be noted that... Figure 7 Each small rectangle in the diagram represents a photovoltaic (PV) module. The position of the PV module is represented by the center point of the rectangle. Because the PV modules are relatively small in size, the gaps between adjacent PV modules within a single array and between adjacent PV modules across arrays are even smaller relative to the size of the PV modules. Figure 7 The lines cannot be clearly drawn, but that doesn't mean there are no gaps. Figure 5 and Figure 9 That's also true.

[0116] Based on the first and / or second embodiments described above, a third embodiment of the photovoltaic power plant capacity area division method of the present invention is proposed. In this embodiment, a feasible implementation method for calculating the partition distance between component partitions is proposed. Step S30 includes S301 to S302:

[0117] Step S301: For any two component partitions in each of the component partitions, calculate the component distance between each pair of photovoltaic modules in the two component partitions according to the arrangement position of each photovoltaic module.

[0118] For example, if the two component partitions are represented as A and B respectively, (x A i, y A i) represents the x-axis and y-axis coordinates of the center point of the i-th photovoltaic module in module A partition. B j, y B j) represents the x-axis and y-axis coordinates of the center point of the j-th photovoltaic module in the B-module partition, dist((x A i, y A i), (x B j, y Bj)) represents the straight-line distance between the center point of the i-th photovoltaic module in module A and the center point of the j-th photovoltaic module in module B, which is also the module distance between the two photovoltaic modules.

[0119] Step S302: Determine the partition distance between the two component partitions based on the smallest component distance among the various component distances.

[0120] In some feasible implementations, without considering the impact of obstacles on the module partition distance, the minimum module distance among the pairwise module distances between two module partitions can be directly determined as the partition distance between the two module partitions.

[0121] The method for calculating the partition distance between component partitions provided in this embodiment avoids the shortcomings of traditional distance calculation methods that result in insufficient representation of class (i.e., component partition) features.

[0122] In one feasible implementation, in practical application scenarios, obstacles may exist within the photovoltaic power station installation area, blocking the connection between two module partitions. Although the straight-line distance between the two module partitions is relatively short, the wiring needs to bypass the obstacles, so it should actually be considered a relatively long distance. Considering this situation, the partition distance between the module partitions can be determined based on the obstacle situation. Specifically, step S302 includes S3021 to S3022:

[0123] Step S3021: If there are no obstacles blocking the two component partitions, then the smallest component distance among the component distances is taken as the partition distance between the two component partitions.

[0124] Step S3022: If there is an obstacle blocking the two component partitions, the minimum component distance among the component distances is added to a preset distance and used as the partition distance between the two component partitions.

[0125] The preset distance is a positive number and can be preset as needed. The purpose of adding the preset distance is to increase the distance between two component partitions that are blocked by obstacles. There are many ways to determine whether there are obstacles blocking the component partitions, and this embodiment does not limit the methods. For example, the photovoltaic modules in the two component partitions can be connected by wires. If at least one wire passes through the area where the obstacle is located, it is considered that there is an obstacle blocking the two component partitions.

[0126] Based on the first, second, and / or third embodiments described above, a fourth embodiment of the photovoltaic power plant capacity area division method of the present invention is proposed. In this embodiment, a feasible implementation method is proposed to divide the modules into various capacity areas according to their arrangement order. Step S50 includes S501 to S504:

[0127] Step S501: Traverse each component partition according to the arrangement order of each component partition, and traverse each capacity region.

[0128] It should be noted that the traversal order of each capacity region is not restricted in this embodiment and can be traversed according to a user-defined order. Before the traversal begins, each capacity region has not been partitioned into component partitions, that is, the partitioned capacity of each capacity region is 0.

[0129] For example, if the current traversal is of the i-th component partition and the j-th capacity region, assuming that the j-th capacity region has been divided into three component partitions that are in the order of the i-th component partition, the sum of the capacities of the three component partitions is the already divided capacity of the j-th capacity region; subtracting the already divided capacity from the planned capacity of the j-th capacity region, the difference is the capacity that the j-th capacity region can still be divided into.

[0130] Step S502: If the capacity of the currently traversed component partition is equal to the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition and the next capacity region are traversed. The already allocated capacity is the sum of the capacities of each component partition that has been allocated to the currently traversed capacity region.

[0131] In the example above, if the capacity of the i-th component partition is equal to the difference between the planned capacity of the j-th capacity region and the already allocated capacity, it means that the capacity that the j-th capacity region can be allocated to is exactly the capacity of the i-th component partition. Therefore, by allocating the i-th component partition to the j-th capacity region, we can traverse the next component partition and the next capacity partition.

[0132] Step S503: If the capacity of the currently traversed component partition is less than the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition is traversed.

[0133] In the example above, if the capacity of the i-th component partition is less than the difference between the planned capacity of the j-th capacity region and the already allocated capacity, it means that the capacity that the j-th capacity region can still be allocated is greater than the capacity of the i-th component partition. After allocating the i-th component partition to the j-th capacity region, the j-th capacity region still needs to be further partitioned to reach the planned capacity. Therefore, after allocating the i-th component partition to the j-th capacity region, the next component partition is traversed, but the next capacity region is not traversed. That is, the capacity of the (i+1)-th component partition is compared with the difference between the planned capacity of the j-th capacity region and the already allocated capacity.

[0134] Step S504: If the capacity of the currently traversed component partition is greater than the difference between the planned capacity and the already divided capacity of the currently traversed capacity region, then a photovoltaic module with a capacity equal to the difference is cut out from the currently traversed component partition, the cut-out photovoltaic module is assigned to the currently traversed capacity region, and the next capacity region is traversed.

[0135] In the example above, if the capacity of the i-th component partition is greater than the difference between the planned capacity of the j-th capacity region and the already allocated capacity, it means that the remaining capacity of the j-th capacity region is less than the capacity of the i-th component partition. In this case, the i-th component partition can be cut to extract photovoltaic modules with a capacity equal to the difference, and these modules can be allocated to the j-th capacity region. This will ensure that the allocated capacity of the j-th capacity region reaches the planned capacity. Then, the (j+1)-th capacity region is traversed, but the next component partition is not traversed. That is, the capacity of the remaining photovoltaic modules in the i-th component partition is compared with the difference between the planned capacity of the (j+1)-th capacity region and the already allocated capacity.

[0136] It should be noted that there are many ways to cut photovoltaic modules with the same capacity as the difference from the module partition, and no limitation is made in this embodiment.

[0137] In one feasible implementation, a method is proposed to cut out photovoltaic modules with capacities equal to the difference from the module partition. This method involves cutting out the photovoltaic modules closest to the previous module partition and assigning them to the currently traversed capacity region. This makes the photovoltaic modules in the capacity region as concentrated and regular as possible, thus facilitating interconnection. Specifically, step S504, which involves cutting out photovoltaic modules with capacities equal to the difference from the currently traversed module partition, includes steps S5041 to S5042:

[0138] Step S5041: Determine the photovoltaic module in the currently traversed component partition that is closest to the previously traversed component partition, and use it as the starting module for cutting.

[0139] Step S5042: Arrange each photovoltaic module in the currently traversed component partition in ascending order of distance from the cutting starting module, and find the photovoltaic module at the front of the list whose capacity is equal to the difference as the photovoltaic module to be cut.

[0140] Continuing with the example above, identify the photovoltaic (PV) module in the i-th component partition that is closest to the (i+1)-th component partition, and designate this PV module as the starting component for cutting. Calculate the distance between each PV module in the i-th component partition and the starting component for cutting. Arrange the PV modules in ascending order of distance, and sequentially accumulate the capacity of each PV module in this order. When the accumulated capacity equals the difference, determine the PV module corresponding to the accumulated capacity as the PV module to be cut.

[0141] It should be noted that the distance between a photovoltaic module and a module partition can be calculated in two ways: using the center point of the module partition to represent that module partition, calculating the distance from the photovoltaic module to the center point, which represents the distance from the photovoltaic module to the module partition; or, calculating the distance from the photovoltaic module to each photovoltaic module in the module partition, and selecting the shortest distance as the distance from the photovoltaic module to the module partition.

[0142] For example, it can be done as follows Figure 8 The process shown divides each component into different capacity areas. Figure 8 In this system, the rooftop area is used as the photovoltaic power station setting area, the grid-connected area is used as the capacity area, the regularized component area block is the component partition, the corrected grid-connected point capacity list is the target area capacity list obtained by correcting the custom area capacity list, and the cutting starting corner point is the cutting starting component.

[0143] For example, Figure 9 A schematic diagram of the divided capacity regions is given. The capacity regions are divided into four regions, denoted as 0-200, 1-300, 2-200 and 3-24, where 200, 300, 200 and 24 represent the number of photovoltaic modules in the four capacity regions.

[0144] Furthermore, this invention also proposes a photovoltaic power plant capacity area division device, referring to... Figure 10 The photovoltaic power station capacity area division device includes:

[0145] The acquisition module 10 is used to acquire a target area capacity list and acquire the photovoltaic module layout results of the photovoltaic power station setting area, wherein the target area capacity list includes the planned capacity of each capacity area;

[0146] Clustering module 20 is used to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result to obtain multiple module partitions, and each module partition contains at least one photovoltaic module;

[0147] The calculation module 30 is used to calculate the partition distance between each pair of the component partitions based on the position of each component partition;

[0148] The sorting module 40 is used to find the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and to determine the sorting order of each of the component partitions according to the shortest path, wherein the starting partition and the ending partition are determined from each of the component partitions;

[0149] The partitioning module 50 is used to partition each of the component partitions into each of the capacity regions, wherein the component partitions partitioned into the same capacity region are consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules partitioned into the capacity region is the same as the planned capacity of the capacity region.

[0150] In one feasible embodiment, the acquisition module 10 is further configured to:

[0151] Get a list of custom area capacities, which includes each custom capacity;

[0152] Each custom capacity is corrected to obtain a corrected capacity. Each corrected capacity is determined as the planned capacity corresponding to each capacity region to obtain the target region capacity list. Each corrected capacity can be divided by the preset serializable capacity of the photovoltaic power station, and the sum of each corrected capacity is equal to the total capacity of the photovoltaic power station.

[0153] In one feasible implementation, the clustering module 20 is further configured to:

[0154] The horizontal connectivity distance and the vertical connectivity distance are set. The horizontal connectivity distance is greater than the horizontal distance between two horizontally adjacent photovoltaic modules in a single array and less than the horizontal distance between two horizontally adjacent photovoltaic modules across an array. The vertical connectivity distance is greater than the vertical distance between two vertically adjacent photovoltaic modules in a single array and less than the vertical distance between two vertically adjacent photovoltaic modules across an array.

[0155] Based on the horizontal connectivity distance and the vertical connectivity distance, each photovoltaic module is clustered according to its position in the photovoltaic module layout result to obtain multiple module partitions. In the same module partition, the horizontal distance between two horizontally adjacent photovoltaic modules is less than the horizontal connectivity distance, and the vertical distance between two vertically adjacent photovoltaic modules is less than the vertical connectivity distance.

[0156] In one feasible implementation, the clustering module 20 is further configured to:

[0157] The clustering radius of the DBSCAN clustering algorithm is set to the horizontal connectivity distance and the vertical connectivity distance, and the minimum number of contained points of the DBSCAN clustering algorithm is set to 1. The DBSCAN clustering algorithm is used to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result to obtain multiple module partitions.

[0158] In one feasible embodiment, the computing module 30 is further configured to:

[0159] For any two component partitions in each of the component partitions, the component distance between each pair of photovoltaic modules in the two component partitions is calculated based on the arrangement position of each photovoltaic module.

[0160] The partition distance between the two component partitions is determined based on the smallest component distance among the various component distances.

[0161] In one feasible embodiment, the computing module 30 is further configured to:

[0162] If there are no obstacles blocking the two component partitions, the smallest component distance among the component distances shall be taken as the partition distance between the two component partitions.

[0163] If there is an obstacle blocking the distance between the two component partitions, the minimum component distance among the component distances is added to a preset distance and then used as the partition distance between the two component partitions.

[0164] In one feasible embodiment, when the area where the photovoltaic power station is located is a roof area, and the roof area is divided into multiple sub-roofs by a ridge line in the column direction, the sorting module 40 is further configured to:

[0165] For each subroof, a start section and an end section are selected from each of the component sections within the subroof, wherein the start section and the end section of the same subroof are located at two opposite corners of the subroof, and for two adjacent subroofs, the start section in one subroof and the end section in the other subroof are on the same side.

[0166] For each sub-roof, find the shortest path from the starting partition within the sub-roof through each of the component partitions within the sub-roof to the ending partition within the sub-roof, according to the partition distance;

[0167] The shortest paths found in each sub-roof are connected according to the order of the sub-roofs in the column direction to obtain the shortest path corresponding to the roof area. The arrangement order of each component partition in the roof area is determined according to the shortest path corresponding to the roof area.

[0168] In one feasible embodiment, the partitioning module 50 is further configured to:

[0169] The component partitions are traversed according to their arrangement order, and the capacity regions are traversed as well.

[0170] If the capacity of the currently traversed component partition is equal to the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition and the next capacity region are traversed. The already allocated capacity is the sum of the capacities of all the component partitions that have been allocated to the currently traversed capacity region.

[0171] If the capacity of the currently traversed component partition is less than the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition is traversed.

[0172] If the capacity of the currently traversed component partition is greater than the difference between the planned capacity and the already allocated capacity of the currently traversed capacity region, then photovoltaic modules with a capacity equal to the difference are cut out from the currently traversed component partition, the cut-out photovoltaic modules are allocated to the currently traversed capacity region, and the next capacity region is traversed.

[0173] In one feasible embodiment, the partitioning module 50 is further configured to:

[0174] Identify the photovoltaic module in the currently traversed component partition that is closest to the previously traversed component partition, and use it as the starting component for cutting;

[0175] Arrange the photovoltaic modules in the currently traversed component partitions in ascending order of their distance from the starting component of the cut, and find the photovoltaic module at the front of the list whose capacity is equal to the difference between the two components as the photovoltaic module to be cut.

[0176] The extended content of the specific implementation of the photovoltaic power station capacity area division device of the present invention is basically the same as the various embodiments of the photovoltaic power station capacity area division method described above, and will not be repeated here.

[0177] Furthermore, this embodiment of the invention also proposes a computer-readable storage medium storing a photovoltaic power plant capacity area division program, wherein when the photovoltaic power plant capacity area division program is executed by a processor, it implements the steps of the photovoltaic power plant capacity area division method described below.

[0178] The various embodiments of the photovoltaic power plant capacity area division device and computer-readable storage medium of the present invention can all refer to the various embodiments of the photovoltaic power plant capacity area division method of the present invention, and will not be repeated here.

[0179] It should be noted that, in this document, 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. Unless otherwise specified, 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 that element.

[0180] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0181] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0182] The above are merely preferred embodiments of the present invention and do not limit the scope of the patent. Any equivalent structural or procedural transformations made based on the description and drawings of the present invention, or direct or indirect applications in other related technical fields, are similarly included within the scope of patent protection of the present invention.

Claims

1. A method for dividing the capacity area of ​​a photovoltaic power station, characterized in that, The method for dividing photovoltaic power plant capacity areas includes the following steps: Obtain the target area capacity list and the photovoltaic module layout results of the photovoltaic power station setting area, wherein the target area capacity list includes the planned capacity of each capacity area; The photovoltaic modules are clustered according to their arrangement positions in the photovoltaic module layout results to obtain multiple module partitions, and each module partition contains at least one photovoltaic module. Calculate the partition distance between each pair of component partitions based on the location of each component partition; Find the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and determine the order of each of the component partitions according to the shortest path, wherein the starting partition and the ending partition are determined from each of the component partitions; Each of the component partitions is assigned to a capacity region, wherein the component partitions assigned to the same capacity region are consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules assigned to the capacity region is the same as the planned capacity of the capacity region.

2. The photovoltaic power plant capacity area division method as described in claim 1, characterized in that, The steps for obtaining the target area capacity list include: Get a list of custom area capacities, which includes each custom capacity; Each custom capacity is corrected to obtain a corrected capacity. Each corrected capacity is determined as the planned capacity corresponding to each capacity region to obtain the target region capacity list. Each corrected capacity can be divided into the preset serializable capacity of the photovoltaic power station, and the sum of each corrected capacity is equal to the total capacity of the photovoltaic power station.

3. The photovoltaic power plant capacity area division method as described in claim 1, characterized in that, The step of clustering the photovoltaic modules according to their arrangement positions in the photovoltaic module layout result to obtain multiple module partitions includes: The horizontal connectivity distance and the vertical connectivity distance are set. The horizontal connectivity distance is greater than the horizontal distance between two horizontally adjacent photovoltaic modules in a single array and less than the horizontal distance between two horizontally adjacent photovoltaic modules across an array. The vertical connectivity distance is greater than the vertical distance between two vertically adjacent photovoltaic modules in a single array and less than the vertical distance between two vertically adjacent photovoltaic modules across an array. Based on the horizontal connectivity distance and the vertical connectivity distance, each photovoltaic module is clustered according to its position in the photovoltaic module layout result to obtain multiple module partitions. In the same module partition, the horizontal distance between two horizontally adjacent photovoltaic modules is less than the horizontal connectivity distance, and the vertical distance between two vertically adjacent photovoltaic modules is less than the vertical connectivity distance.

4. The photovoltaic power plant capacity area division method as described in claim 3, characterized in that, The step of clustering the photovoltaic modules according to their arrangement positions in the photovoltaic module layout result based on the horizontal and vertical connectivity distances to obtain multiple module partitions includes: The clustering radius of the DBSCAN clustering algorithm is set to the horizontal connectivity distance and the vertical connectivity distance, and the minimum number of contained points of the DBSCAN clustering algorithm is set to 1. The DBSCAN clustering algorithm is used to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result to obtain multiple module partitions.

5. The photovoltaic power plant capacity area division method as described in claim 1, characterized in that, The step of calculating the partition distance between each component partition based on the position of each component partition includes: For any two component partitions in each of the component partitions, the component distance between each pair of photovoltaic modules in the two component partitions is calculated based on the arrangement position of each photovoltaic module. The partition distance between the two component partitions is determined based on the smallest component distance among the various component distances.

6. The photovoltaic power plant capacity area division method as described in claim 5, characterized in that, The step of determining the partition distance between the two component partitions based on the smallest component distance among the various component distances includes: If there are no obstacles blocking the two component partitions, the smallest component distance among the component distances shall be taken as the partition distance between the two component partitions. If there is an obstacle blocking the distance between the two component partitions, the minimum component distance among the component distances is added to a preset distance and then used as the partition distance between the two component partitions.

7. The photovoltaic power plant capacity area division method as described in claim 1, characterized in that, When the photovoltaic power station is located in a roof area, and the roof area is divided into multiple sub-roofs by a ridge line in the column direction, the step of finding the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and determining the arrangement order of each component partition based on the shortest path, includes: For each subroof, a start section and an end section are selected from each of the component sections within the subroof, wherein the start section and the end section of the same subroof are located at two opposite corners of the subroof, and for two adjacent subroofs, the start section in one subroof and the end section in the other subroof are on the same side. For each sub-roof, find the shortest path from the starting partition within the sub-roof through each of the component partitions within the sub-roof to the ending partition within the sub-roof, according to the partition distance; The shortest paths found in each sub-roof are connected according to the order of the sub-roofs in the column direction to obtain the shortest path corresponding to the roof area. The arrangement order of each component partition in the roof area is determined according to the shortest path corresponding to the roof area.

8. The photovoltaic power plant capacity zone division method according to any one of claims 1 to 7, characterized in that, The step of partitioning each of the component partitions into each of the capacity regions includes: The component partitions are traversed according to their arrangement order, and the capacity regions are traversed as well. If the capacity of the currently traversed component partition is equal to the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition and the next capacity region are traversed. The already allocated capacity is the sum of the capacities of all the component partitions that have been allocated to the currently traversed capacity region. If the capacity of the currently traversed component partition is less than the difference between the planned capacity of the currently traversed capacity region and the already allocated capacity, then the currently traversed component partition is allocated to the currently traversed capacity region, and the next component partition is traversed. If the capacity of the currently traversed component partition is greater than the difference between the planned capacity and the already allocated capacity of the currently traversed capacity region, then photovoltaic modules with a capacity equal to the difference are cut out from the currently traversed component partition, the cut-out photovoltaic modules are allocated to the currently traversed capacity region, and the next capacity region is traversed.

9. The photovoltaic power plant capacity area division method as described in claim 8, characterized in that, The step of cutting out photovoltaic modules with capacities equal to the difference from the currently traversed module partitions includes: Identify the photovoltaic module in the currently traversed component partition that is closest to the previously traversed component partition, and use it as the starting component for cutting; Arrange the photovoltaic modules in the currently traversed component partitions in ascending order of their distance from the starting component of the cut, and find the photovoltaic module at the front of the list whose capacity is equal to the difference between the two components as the photovoltaic module to be cut.

10. A photovoltaic power station capacity zone division device, characterized in that, The photovoltaic power station capacity zone division device includes: The acquisition module is used to acquire a list of target area capacities and the photovoltaic module layout results of the photovoltaic power station setting area, wherein the list of target area capacities includes the planned capacity of each capacity area; The clustering module is used to cluster each photovoltaic module according to the arrangement position of each photovoltaic module in the photovoltaic module arrangement result, to obtain multiple module partitions, and each module partition contains at least one photovoltaic module; The calculation module is used to calculate the partition distance between each pair of the component partitions based on the position of each component partition; The sorting module is used to find the shortest path from the starting partition through each of the component partitions to the ending partition according to the partition distance, and to determine the sorting order of each of the component partitions according to the shortest path, wherein the starting partition and the ending partition are determined from each of the component partitions; The partitioning module is used to partition each of the component partitions into each of the capacity regions, wherein the component partitions partitioned into the same capacity region are consecutive partitions in the arrangement order, and the total capacity of the photovoltaic modules partitioned into the capacity region is the same as the planned capacity of the capacity region.

11. A photovoltaic power plant capacity zone division device, characterized in that, The photovoltaic power plant capacity area division device includes: a memory, a processor, and a photovoltaic power plant capacity area division program stored in the memory and executable on the processor. When the photovoltaic power plant capacity area division program is executed by the processor, it implements the steps of the photovoltaic power plant capacity area division method as described in any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a photovoltaic power plant capacity area division program, which, when executed by a processor, implements the steps of the photovoltaic power plant capacity area division method as described in any one of claims 1 to 9.

Images