Photovoltaic converging array optimization method, terminal and computer readable storage medium

Abstract

The present invention discloses a photovoltaic busbar array optimization method, terminal and computer-readable storage medium, including: obtaining the initial center point of each to-be-optimized array of a photovoltaic system; obtaining the relative center point of two adjacent to-be-optimized arrays according to the initial center points of the two adjacent to-be-optimized arrays, wherein the relative center points of the two adjacent to-be-optimized arrays are in the same horizontal plane or the same vertical plane; determining the target array to which the photovoltaic strings in the two adjacent to-be-optimized arrays belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target array to which they belong, so as to smooth the edges of the two adjacent arrays. The optimized array of this embodiment of the present invention can smooth the edges of the two adjacent busbar arrays, provide convenience for construction personnel to distinguish and identify, reduce the difficulty of cable installation and construction, reduce the arrangement of cables, and reduce cable costs.

Description

Technical Field

[0001] The present invention relates to the field of photovoltaic technology, and in particular to a photovoltaic busbar array optimization method, a terminal and a computer-readable storage medium. Background Art

[0002] In the design process of a photovoltaic power station, after the photovoltaic area brackets are arranged, it is necessary to divide the power generation units, i.e. arrays, according to the array size. Different array divisions (different array shapes) have different corresponding cable installation costs, which will also affect their construction and operation and maintenance. Therefore, it is necessary to optimize the array division.

[0003] The photovoltaic convergence area divided by the convergence area division method currently used has the problem of high cable cost and difficult construction. Summary of the invention

[0004] The main purpose of the present invention is to provide a photovoltaic bus array optimization method, a terminal and a computer-readable storage medium, aiming to solve the technical problem that the photovoltaic bus array optimization method divides the photovoltaic bus array into photovoltaic bus areas, which makes the cable cost high and the construction difficult.

[0005] To achieve the above object, the present invention provides a photovoltaic bus array optimization method, the photovoltaic bus array optimization method comprising the following steps:

[0006] Obtaining the initial center point of each array to be optimized of the photovoltaic system;

[0007] According to the initial center points of two adjacent square arrays to be optimized, the relative center points of two adjacent square arrays to be optimized are obtained, wherein the relative center points of two adjacent square arrays to be optimized are in the same horizontal plane or the same vertical plane;

[0008] The target arrays to which the photovoltaic strings in the two adjacent arrays to be optimized belong are determined according to the two adjacent relative center points, and the photovoltaic strings are divided into the corresponding target arrays to flatten the edges of the two adjacent arrays.

[0009] Optionally, the step of obtaining the relative center points of two adjacent square matrices to be optimized according to the initial center points of two adjacent square matrices to be optimized comprises:

[0010] Calculating the angle between the line connecting the initial center points of two adjacent square arrays to be optimized and the horizontal plane;

[0011] If the angle is less than or equal to a preset threshold, the initial center points of the two adjacent square arrays to be optimized are horizontally processed, and the center points obtained after the horizontal processing of the initial center points are used as the relative center points of the two adjacent square arrays to be optimized, wherein the relative center points obtained by the horizontal processing are in the same horizontal plane;

[0012] If the angle is greater than the preset threshold, the initial center points of the two adjacent square arrays to be optimized are vertically processed, and the center points obtained after the vertical processing of the initial center points are used as the relative center points of the two adjacent square arrays to be optimized, wherein the relative center points obtained by the vertical processing are in the same vertical plane.

[0013] Optionally, the step of horizontalizing the initial center points of two adjacent square matrices to be optimized and using the center points obtained after the horizontalization of the initial center points as the relative center points of two adjacent square matrices to be optimized comprises:

[0014] Obtaining an average ordinate value according to the ordinate values ​​of the initial center points of two adjacent square matrices to be optimized;

[0015] The ordinate value of the initial center point is updated by using the ordinate average value, and the center point after the ordinate value is updated serves as the relative center point of the matrix to be optimized.

[0016] Optionally, the step of verticalizing the initial center points of two adjacent square arrays to be optimized and using the center points obtained after the verticalization of the initial center points as the relative center points of two adjacent square arrays to be optimized comprises:

[0017] Obtaining an average value of the horizontal coordinates according to the horizontal coordinate values ​​of the initial center points of two adjacent square arrays to be optimized;

[0018] The abscissa value of the initial center point is updated by using the abscissa average value, and the center point after the abscissa value is updated serves as the relative center point of the matrix to be optimized.

[0019] Optionally, the step of determining the target arrays to which the photovoltaic strings in the two adjacent arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target arrays to which they belong comprises:

[0020] Determine the position information of two adjacent square arrays to be optimized according to the two adjacent relative centers;

[0021] The target array to which the photovoltaic strings between the two adjacent arrays to be optimized belong is determined according to the position information and the target powers of the two adjacent arrays to be optimized, and the photovoltaic strings are divided into the target array.

[0022] Optionally, the step of determining the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong according to the position information and the target powers of two adjacent arrays to be optimized, and dividing the photovoltaic strings into the target array comprises:

[0023] Determine the relative position relationship between two adjacent square arrays to be optimized according to the position information;

[0024] Determine the square array cutting line according to the relative orientation relationship;

[0025] The array cutting line is moved to determine the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong, and the photovoltaic strings are divided into the target array so that the sum of the differences between the target power and the actual power of the two adjacent target arrays after the re-division is minimized, or the actual power of the two adjacent target arrays after the re-division is within a preset power range.

[0026] Optionally, the step of determining the target arrays to which the photovoltaic strings in the two adjacent arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target arrays to which they belong comprises:

[0027] The target array to which the photovoltaic strings belong is determined according to the distance information between the photovoltaic strings in two adjacent arrays to be optimized and the relative center, and the photovoltaic strings are divided into the target array.

[0028] Optionally, the step of determining the target array to which the photovoltaic strings belong based on the distance information between the photovoltaic strings in two adjacent arrays to be optimized and the relative center, and dividing the photovoltaic strings into the target array comprises:

[0029] Obtaining a target photovoltaic string set whose relative distance to the center of the current array is greater than the relative distance to the center of the adjacent array in two adjacent arrays to be optimized;

[0030] The adjacent square array is determined as a target square array to which the photovoltaic strings of the target photovoltaic string set belong, and the photovoltaic strings are divided into the target square array.

[0031] Optionally, the step of determining the adjacent array as a target array to which the photovoltaic strings of the target photovoltaic string set belong, and dividing the photovoltaic strings into the target array comprises:

[0032] Obtaining the number of photovoltaic strings of the target photovoltaic string set in two adjacent arrays to be optimized;

[0033] Taking the number of photovoltaic strings with a small number as the target number, determining the adjacent array as the target array to which the target number of photovoltaic strings belongs in the target photovoltaic string set, and dividing the photovoltaic strings into the target array;

[0034] Return to the step of obtaining the initial center point of each to-be-optimized square array of the photovoltaic system until the number of photovoltaic strings in the target photovoltaic string set is zero.

[0035] Optionally, the step of obtaining the initial center point of each to-be-optimized array of the photovoltaic system includes:

[0036] According to the target number of arrays of the photovoltaic system, the target power of the arrays and the coordinate information of the outlet terminals of the photovoltaic strings, a center point consistent with the target number of arrays is randomly generated, and the center point is used as the initial center point of each array to be optimized.

[0037] Optionally, the step of obtaining the initial center point of each to-be-optimized array of the photovoltaic system includes:

[0038] Using a clustering method or a distance method to initially divide the confluence area of ​​the photovoltaic system, and using the initially divided confluence area as each of the square arrays to be optimized;

[0039] Determine the center position of the square array to be optimized according to the positions of all photovoltaic strings in the square array to be optimized;

[0040] The center position is used as the initial center point of the matrix to be optimized.

[0041] The present invention also provides a terminal, which includes: a memory, a processor, and a photovoltaic bus array optimization program stored in the memory and executable on the processor, wherein the photovoltaic bus array optimization program implements the steps of the photovoltaic bus array optimization method as described above when executed by the processor.

[0042] In addition, the present invention also provides a computer-readable storage medium, which stores a photovoltaic bus array optimization program. When the photovoltaic bus array optimization program is executed by a processor, the steps of the photovoltaic bus array optimization method described above are implemented.

[0043] The photovoltaic converging array optimization method, terminal and computer-readable storage medium provided by the present invention first determine the initial center position of each array to be optimized of the photovoltaic system, and then obtain the relative center point of the two adjacent arrays to be optimized according to the initial center points of the two adjacent arrays to be optimized, wherein the relative center points of the two adjacent arrays to be optimized are in the same horizontal plane or the same vertical plane. That is, the center position of each array to be optimized is updated based on the initial center position, so that the center point between the two adjacent converging areas is in the same horizontal line or the same vertical line. In this way, when the target array to which the photovoltaic strings in the two adjacent arrays to be optimized belong is determined according to the two adjacent relative center points to divide the photovoltaic strings, a relatively smooth edge line can be obtained based on the relative center point, so that the edge line of the two adjacent converging arrays can be optimized, so that the edges of the two adjacent converging arrays are flattened. After the edges of each converging array are flattened, it is convenient for construction personnel to distinguish and identify, which can reduce the difficulty of cable installation and construction, reduce the arrangement of cables, and reduce cable costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 A schematic diagram of a flow chart of a first embodiment of a photovoltaic busbar array optimization method provided by an embodiment of the present invention;

[0045] Figure 2 A detailed flow chart of step S20 in the second embodiment of the photovoltaic bus array optimization method provided by the embodiment of the present invention;

[0046] Figure 3 A detailed flow chart of step S30 in the third embodiment of the photovoltaic bus array optimization method provided by the embodiment of the present invention;

[0047] Figure 4 A schematic flow chart of a fourth embodiment of a photovoltaic busbar array optimization method provided by an embodiment of the present invention;

[0048] Figure 5 for Figure 4 A detailed flow chart of step S33;

[0049] Figure 6 A schematic diagram of the hardware environment architecture involved in the photovoltaic bus array optimization method provided in an embodiment of the present invention.

[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] In order to better understand the above technical solution, exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments described herein. On the contrary, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

[0053] In the design process of a photovoltaic power station, after the photovoltaic area brackets are arranged, it is necessary to divide the power generation units, i.e., arrays, according to the array array quantity (array power). Different array divisions (different array shapes) have different corresponding cable installation costs, and will also affect their construction and operation and maintenance, so it is necessary to optimize the array division.

[0054] In the exemplary technology, some of the divisions of the square matrix are designed based on personal experience. This kind of artificial design is based on experience and is compared and selected. The number of comparisons is limited and inefficient, and it is difficult to obtain an optimized division result. Some use clustering methods to divide the square matrix. The boundaries of the square matrix divided by this method are relatively messy and present a step-like shape. Some use distance methods to divide the square matrix. The distance method is based on the selection of distance functions. For the Manhattan distance method, the shape of the square matrix after division is a rhombus, and for the Euclidean distance method, the shape of the square matrix after division is a circle.

[0055] This shape of array arrangement will affect the routing of low-voltage cables, and the stepped profile makes it difficult to distinguish the boundaries between arrays during construction. Therefore, when the exemplary technology is used to divide the photovoltaic system into convergence areas, the divided photovoltaic convergence areas have the problem of high cable costs and difficult construction.

[0056] Based on this, the embodiments of the present invention propose a photovoltaic bus array optimization method for a photovoltaic system, which can reduce the difficulty of cable installation and construction, reduce the arrangement of cable lines, and reduce cable costs.

[0057] Optionally, see Figure 2 , the photovoltaic bus array optimization method comprises the following steps:

[0058] Step S10, obtaining the initial center point of each to-be-optimized array of the photovoltaic system;

[0059] Step S20, obtaining the relative center points of two adjacent square arrays to be optimized according to the initial center points of two adjacent square arrays to be optimized, wherein the relative center points of two adjacent square arrays to be optimized are in the same horizontal plane or the same vertical plane;

[0060] Step S30, determining the target arrays to which the photovoltaic strings in the two adjacent arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the corresponding target arrays to flatten the edges of the two adjacent arrays.

[0061] This embodiment is applied to a photovoltaic system, or to a setting system of a photovoltaic system.

[0062] Optionally, the center point mentioned in this embodiment of the present invention is the installation position of the busbar transformer. The position information of the center point can be two-dimensional position information or three-dimensional position information. In an optional embodiment, if the position information of the center point is three-dimensional position information, then before obtaining the initial center point of each array to be optimized of the photovoltaic system, the three-dimensional position information of the initial center point of the array to be optimized is converted into two-dimensional position information, and the photovoltaic busbar array is optimized with two-dimensional data. The center point position information mentioned in the embodiment of the present invention is two-dimensional position information or converted two-dimensional position information.

[0063] When optimizing the photovoltaic busbar array, the present embodiment first obtains the initial center points of each array to be optimized of the photovoltaic system, and then determines the relative center points of two adjacent arrays to be optimized based on the initial center points of the two adjacent arrays to be optimized. Then, the relative center points are used as the center points of the two adjacent arrays, and the two adjacent arrays to be optimized are optimized based on the two adjacent relative center points, thereby achieving edge smoothing of the two adjacent arrays.

[0064] Optionally, in an optional embodiment, the optimization method can directly divide the photovoltaic system into regions and apply it to the distance algorithm of the front-end confluence area. The steps of obtaining the initial center point of each to-be-optimized square array of the photovoltaic system include:

[0065] According to the target number of arrays of the photovoltaic system, the target power of the arrays and the coordinate information of the outlet terminals of the photovoltaic strings, a center point consistent with the target number of arrays is randomly generated, and the center point is used as the initial center point of each array to be optimized.

[0066] After the photovoltaic system is set up, the target number of arrays, the target power of each array and the coordinate information of the outlet of the photovoltaic module are determined, and the coordinates of the outlet of the string are read. Then, based on the photovoltaic system to be set up, the number of confluence areas to be divided is determined, and based on the number of confluence areas, the number of target arrays (one array includes at least one confluence area) and the target power of each target array are determined. Then, n non-overlapping points are randomly generated as center points. Each target array has at least one center point. These randomly generated center points are used as the initial center points of each array to be optimized.

[0067] Then, steps S20 and S30 are performed to obtain the target square array to which each photovoltaic string belongs. Then, in a clustering manner, the mean value of the string coordinates in the cluster is used as a new cluster center to obtain each square array.

[0068] As an optional implementation:

[0069] 1) Read the coordinates of the photovoltaic string outlet terminal;

[0070] 2) Determine the number of confluence areas (or square arrays n) that need to be divided and the power p of the square array;

[0071] 3) Randomly generate n non-overlapping points as center points;

[0072] 4) Perform two-dimensional horizontal and vertical processing on the center point to obtain the two-dimensional center point of the square matrix;

[0073] 5) Assign the cable cost weight to the distance from the string outlet to the center of the confluence area to obtain the cost from each string to the center of the array;

[0074] 6) Allocate the strings to the square array to which the nearest center point belongs based on the minimum cost principle;

[0075] 7) Use the mean of the group string coordinates in each cluster as the new cluster center;

[0076] 8) Repeat 4), 5), 6), and 7) until the cluster center no longer changes, and then n clusters are obtained, that is, n square matrix divisions are initially obtained.

[0077] Optionally, in another embodiment, the optimization method can also be applied to the secondary correction optimization process after the initial division of the confluence area (square array) is completed. The step of obtaining the initial center point of each square array to be optimized of the photovoltaic system includes:

[0078] Using a clustering method or a distance method to initially divide the confluence area of ​​the photovoltaic system, and using the initially divided confluence area as each of the square arrays to be optimized;

[0079] Determine the center position of the square array to be optimized according to the positions of all photovoltaic strings in the square array to be optimized;

[0080] The center position is used as the initial center point of the matrix to be optimized.

[0081] Then, step S10, step S20 and step S30 are executed to perform secondary correction optimization on the square matrix to be optimized to obtain a square matrix with smoothed edges.

[0082] Optionally, in this embodiment, the method for determining the initial center point includes determining the center position of the array to be optimized according to the positions of all photovoltaic strings in the array to be optimized; and using the center position as the initial center point of the array to be optimized.

[0083] Optionally, the center point of each square array (confluence area) to be optimized is the average of the center points of each photovoltaic string, and one calculation method is:

[0084]

[0085] Among them, Center_i is the initial center point of the square matrix, k is the group string, s is the coefficient, χ is the horizontal coordinate, and y is the vertical coordinate.

[0086] Optionally, in some embodiments, the initial center position is also determined based on environmental information of the array to be optimized. For example, if the environmental information includes road information, when there is a road within a preset distance of the initial center position, the initial center point is set on the road, with the point on the road serving as the initial center point.

[0087] Optionally, in this embodiment, determining the relative center points of two adjacent arrays to be optimized based on the initial center points of the adjacent arrays to be optimized includes vertical processing and horizontal processing, such as updating the initial center points of two adjacent arrays to be optimized to the same horizontal plane (same horizontal line) or the same vertical plane (same vertical line). In this way, when the center points of the two arrays are on the same horizontal plane or the same vertical plane, when the arrays to which the photovoltaic strings belong are replanned based on the center points, the edges between the arrays can be flattened.

[0088] It can be understood that the relative center point of adjacent arrays to be optimized refers to the center point of each array to be optimized relative to the adjacent array to be optimized. When the adjacent arrays to be optimized are different, the relative center points of the arrays to be optimized are different. For example, when the photovoltaic system includes three arrays to be optimized, the first array to be optimized and the second array to be optimized are two adjacent arrays to be optimized, and the first array to be optimized and the third array to be optimized are two adjacent arrays to be optimized. In this way, the relative center point of the first array to be optimized relative to the second array to be optimized is a1, and the relative center point of the first array to be optimized relative to the third array to be optimized may be a2. This embodiment optimizes each array to be optimized in a certain order, so when optimizing two arrays, the relative center point of the array to be optimized needs to be recalculated.

[0089] Optionally, in this embodiment, the two adjacent arrays to be optimized are optimized according to the two adjacent relative center points to achieve edge smoothing of the two adjacent arrays. The arrays to which all photovoltaic strings belong can be re-divided using a distance method or a clustering method directly according to the updated relative center point to make the edges of the arrays smoother. Alternatively, the attribution of photovoltaic strings between two adjacent arrays to be optimized can be adjusted according to the method of the third embodiment below to smooth the edges.

[0090] In this embodiment, the initial center position of each array to be optimized of the photovoltaic system is first determined, and then the relative center point of the two adjacent arrays to be optimized is obtained according to the initial center points of the two adjacent arrays to be optimized, wherein the relative center points of the two adjacent arrays to be optimized are in the same horizontal plane or the same vertical plane. That is, the center position of each array to be optimized is updated based on the initial center position, so that the center point between the two adjacent confluence areas is in the same horizontal line or the same vertical line. In this way, when the target array to which the photovoltaic strings in the two adjacent arrays to be optimized belong is determined according to the two adjacent relative center points to divide the photovoltaic strings, a relatively smooth edge line can be obtained based on the relative center point, so that the edge line of the two adjacent confluence arrays can be optimized, so that the edges of the two adjacent confluence arrays are smoothed. After the edges of each confluence array are smoothed, it is convenient for construction personnel to distinguish and identify, which can reduce the difficulty of cable installation and construction, reduce the arrangement of cables, and reduce cable costs.

[0091] Second embodiment

[0092] Please refer to Figure 2 Based on the first embodiment, this embodiment proposes an optional implementation of the relative center point of the matrix to be optimized. Optionally, step S20 includes:

[0093] Step S21, calculating the angle between the line connecting the initial center points of two adjacent square arrays to be optimized and the horizontal plane;

[0094] Step S22, if the angle is less than or equal to a preset threshold, the initial center points of the two adjacent square arrays to be optimized are horizontally processed, and the center points obtained after the horizontal processing of the initial center points are used as the relative center points of the two adjacent square arrays to be optimized, wherein the relative center points obtained by the horizontal processing are in the same horizontal plane;

[0095] Step S23, if the angle is greater than the preset threshold, the initial center points of the two adjacent square arrays to be optimized are vertically processed, and the center points obtained after the vertical processing of the initial center points are used as the relative center points of the two adjacent square arrays to be optimized, wherein the relative center points obtained by the vertical processing are in the same vertical plane.

[0096] This embodiment uses different methods to determine the relative center point of each matrix to be optimized according to the relative position relationship between two adjacent matrixes to be optimized, so as to improve the accuracy of optimization. Optionally, the relative position relationship includes up-down distribution or left-right distribution.

[0097] Connect the initial center points of two adjacent squares to be optimized, and then calculate the angle between the connecting line and the horizontal plane. In an optional embodiment, the angle between the connecting line and the horizontal plane is Tilt(i, j):

[0098]

[0099] Wherein, abs(yi-yj) is the difference between the two-dimensional y coordinates of the initial center points of two adjacent square matrices to be optimized, and abs(yi-yj) is the difference between the two-dimensional x coordinates of the initial center points of two adjacent square matrices to be optimized.

[0100] In this way, the relative position relationship of the two adjacent square arrays can be known according to the angle between the connecting line and the horizontal plane. If the angle is greater than a preset threshold (such as greater than 45° or greater than 90°), the relative position relationship of the two adjacent square arrays is determined to be an up-and-down distribution. If the angle is less than the preset threshold, the relative relationship of the two adjacent square arrays is determined to be a left-and-right distribution.

[0101] If the relative position relationship between two adjacent arrays is an up-and-down distribution, the photovoltaic strings between the two arrays are redivided according to the up-and-down distribution. If the relative position relationship between two adjacent arrays is a left-and-right distribution, the photovoltaic strings between the two arrays are redivided according to the left-and-right distribution. In this embodiment, the redivision is based on the center point. Therefore, the center points of the two arrays distributed up and down are set vertically, that is, the center points of the upper and lower arrays are aligned with the same vertical line. The center points of the two horizontally distributed arrays are set horizontally, that is, the center points of the two horizontal arrays are aligned with the same horizontal line. In this way, the relative center points of the two arrays are obtained (the same horizontal plane or the same vertical plane).

[0102] Optionally, the horizontal processing of the center point means that the horizontal coordinate of the processed center point (relative center point) remains unchanged as the horizontal coordinate of the two initial center points, and the vertical coordinate takes the average of the vertical coordinates of the two initial center points. Based on this, in this embodiment, the step of horizontalizing the initial center points of the two adjacent matrixes to be optimized and using the center point obtained after the horizontal processing of the initial center point as the relative center point of the two adjacent matrixes to be optimized includes:

[0103] Obtaining an average ordinate value according to the ordinate values ​​of the initial center points of two adjacent square matrices to be optimized;

[0104] The ordinate value of the initial center point is updated by using the ordinate average value, and the center point after the ordinate value is updated serves as the relative center point of the matrix to be optimized.

[0105] Optionally, three square matrices are listed below to illustrate the method of horizontal processing of the initial center point. For example, the first square matrix a and the second square matrix b are two adjacent square matrices to be optimized, and the first square matrix a and the third square matrix c are two adjacent square matrices to be optimized.

[0106] Optionally, if the angle Tilt(a, b) between the line connecting the initial center points of the first matrix and the second matrix and the horizontal plane is less than a preset threshold.

[0107] Then the relative center point of the first matrix a relative to the second matrix b is:

[0108]

[0109] Among them, Center_ax is the horizontal coordinate value of the initial center point of the first matrix; Center_ay is the vertical coordinate value of the initial center point of the first matrix; Center_by is the vertical coordinate value of the initial center point of the second matrix.

[0110] The relative center point of the second matrix b relative to the first matrix a is:

[0111]

[0112] Among them, Center_bx is the horizontal coordinate value of the initial center point of the second matrix; Center_ay is the vertical coordinate value of the initial center point of the first matrix; Center_by is the vertical coordinate value of the initial center point of the second matrix.

[0113] Optionally, if the angle Tilt(a,c) between the line connecting the initial centers of the first matrix and the third matrix and the horizontal plane is less than a preset threshold;

[0114] Then the relative center point of the first matrix a relative to the third matrix c is:

[0115]

[0116] Among them, Center_ax is the horizontal coordinate value of the initial center point of the first matrix; Center_ay is the vertical coordinate value of the initial center point of the first matrix; Center_cy is the vertical coordinate value of the initial center point of the third matrix.

[0117] The center point of the third matrix c with respect to the first matrix a is:

[0118]

[0119] Among them, Center_cx is the horizontal coordinate value of the initial center point of the third matrix; Center_ay is the vertical coordinate value of the initial center point of the first matrix; Center_cy is the vertical coordinate value of the initial center point of the third matrix.

[0120] Optionally, the vertical processing of the center point means that the ordinate of the processed center point (relative center point) keeps the ordinate of the two initial center points unchanged, and the horizontal coordinate takes the average of the horizontal coordinates of the two initial center points. Based on this, in this embodiment, the step of verticalizing the initial center points of the two adjacent matrixes to be optimized and using the center point obtained after the vertical processing of the initial center point as the relative center point of the two adjacent matrixes to be optimized includes:

[0121] Obtaining an average value of the horizontal coordinates according to the horizontal coordinate values ​​of the initial center points of two adjacent square arrays to be optimized;

[0122] The abscissa value of the initial center point is updated by using the abscissa average value, and the center point after the abscissa value is updated serves as the relative center point of the matrix to be optimized.

[0123] Optionally, three square arrays are listed below to illustrate the method of verticalizing the initial center point. For example, the first square array a and the second square array b are two adjacent square arrays to be optimized, and the first square array a and the third square array c are two adjacent square arrays to be optimized.

[0124] Optionally, if the angle Tilt(a,b) between the line connecting the initial center points of the first matrix and the second matrix and the horizontal plane is greater than a preset threshold;

[0125] Then the relative center point of the first matrix a relative to the second matrix b is:

[0126]

[0127] Among them, Center_ax is the horizontal coordinate value of the initial center point of the first matrix; Center_bx is the horizontal coordinate value of the initial center point of the second matrix; Center_ay is the vertical coordinate value of the initial center point of the first matrix.

[0128] The relative center point of the second matrix b relative to the second matrix a is:

[0129]

[0130] Among them, Center_ax is the horizontal coordinate value of the initial center point of the first matrix; Center_bx is the horizontal coordinate value of the initial center point of the second matrix; Center_by is the vertical coordinate value of the initial center point of the second matrix.

[0131] Optionally, if the angle Tilt(a,c) between the line connecting the initial centers of the first matrix and the third matrix and the horizontal plane is greater than a preset threshold;

[0132] Then the relative center point of the first matrix a relative to the third matrix c is:

[0133]

[0134] Among them, Center_ax is the horizontal coordinate value of the initial center point of the first matrix; Center_cx is the horizontal coordinate value of the initial center point of the third matrix; Center_ay is the vertical coordinate value of the initial center point of the first matrix.

[0135] The center point of the third matrix c with respect to the first matrix a is:

[0136]

[0137] Among them, Center_ax is the horizontal coordinate value of the initial center point of the first matrix; Center_cx is the horizontal coordinate value of the initial center point of the third matrix; Center_cy is the vertical coordinate value of the initial center point of the third matrix.

[0138] Finally, we get a two-dimensional center point matrix:

[0139]

[0140] Optionally, this embodiment horizontally or vertically processes the initial center point so that the center points of two adjacent arrays to be optimized are located on the same horizontal plane or the same numerical plane. In this way, when the attribution areas of the photovoltaic strings in the array are readjusted according to the updated relative center point, the division interface tends to be flat based on the horizontal or vertical division.

[0141] Third embodiment

[0142] Optionally, this embodiment proposes one of the embodiments of optimizing the square matrix based on relative center points based on all the above embodiments.

[0143] Please refer to Figure 3 The step of determining the target square array to which the photovoltaic strings in the two adjacent square arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target square array to which they belong comprises:

[0144] Step S31, determining the position information of two adjacent square arrays to be optimized according to the two adjacent relative centers;

[0145] Step S32, determining the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong according to the position information and the target powers of the two adjacent arrays to be optimized, and dividing the photovoltaic strings into the target array.

[0146] Optionally, this embodiment adjusts the photovoltaic strings to belong to the array based on the geometric method to obtain a low-cost and high-concentration array, thereby reducing the cost and difficulty of array layout.

[0147] The geometric method is the relative relationship of the positions of the arrays. Therefore, the position information in this embodiment includes the relative orientation relationship. Then, the dividing line between two adjacent arrays is determined based on the relative orientation relationship, and then the array to which the photovoltaic strings in the array to be optimized belong is determined by the dividing line.

[0148] In an optional embodiment, the array cutting line can be directly determined based on the position information, and then the cutting line is used as a dividing line to divide the ownership of each photovoltaic module. Optionally, the cutting line is a straight line, or a line segment with a simplified shape, such as "Z".

[0149] In another optional embodiment, in order to further improve the accuracy of the array division and make the power distribution of the photovoltaic system uniform, when dividing the ownership of photovoltaic components, the target power corresponding to each target array is combined. It can be understood that the target power refers to the power demand of each array when dividing the array.

[0150] In this embodiment, the step of determining the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong according to the position information and the target powers of the two adjacent arrays to be optimized, and dividing the photovoltaic strings into the target array includes:

[0151] Determine the relative position relationship between two adjacent square arrays to be optimized according to the position information;

[0152] Determine the square array cutting line according to the relative orientation relationship;

[0153] The array cutting line is moved to determine the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong, and the photovoltaic strings are divided into the target array so that the sum of the differences between the target power and the actual power of the two adjacent target arrays after the re-division is minimized, or the actual power of the two adjacent target arrays after the re-division is within a preset power range.

[0154] Optionally, the square matrix cutting line may be a straight line or a “Z” shaped line.

[0155] Optionally, the relative positions of the two squares are determined. If the positions of the two squares (defined as squares a and b) are distributed vertically, that is, Tilt(a, b) is greater than a preset threshold, a horizontal line is used to divide the two squares a and b, and the square cutting line can be a "Z" shape, an inverted "Z" shape, or a straight cut. If the positions of the two squares (defined as squares a and b) are distributed horizontally, that is, Tilt(a, b) is less than a preset threshold, a vertical line is used to divide the two squares a and b, and the square cutting line can be a "Z" shape rotated 90°, an inverted "Z" shape rotated 90°, or a "1" shape (a straight shape rotated 90°) cut.

[0156] Optionally, the step of moving the array cutting line to fit two adjacent arrays to be optimized to determine the target array to which the photovoltaic strings between the two adjacent arrays to be optimized belong includes:

[0157] Based on the relative center points of two adjacent arrays to be optimized, a line segment perpendicular to the end point of the line connecting the two relative center points is constructed, and the line segment is the array cutting line. Move along the direction of the two adjacent arrays to be optimized (such as up and down or left and right. If the two adjacent arrays to be optimized are distributed up and down, the array cutting line is up and down. If the two adjacent arrays to be optimized are moved left and right, the array cutting line is left and right); use the array cutting line as the dividing line, calculate the actual power of the photovoltaic strings in the arrays on both sides respectively, and then calculate the difference between the actual power and the target power of the array. If the difference between the target power and the actual power of the two adjacent target arrays is too large, stop moving the array cutting line, and determine the array to which each photovoltaic string belongs according to the position of the array cutting line (such as the photovoltaic string on the left side of the array cutting line belongs to the left array, the photovoltaic string on the right side of the array belongs to the right array, and the same is true for the upper and lower arrays). Alternatively, the actual power is calculated to determine whether the actual power of the target array after redivision is within the preset power range, and if so, a final array is formed based on the array cutting line, and if not, the array cutting line is continuously fine-tuned until the actual power of the target array after redivision is within the preset power range. Optionally, the preset power may be a preset required power or the target power.

[0158] In an optional embodiment, the following formula is used to determine the moving position of the square array cutting line:

[0159] Right now Minimum (real-time detection of the continuity of photovoltaic strings during cutting to ensure the connectivity of brackets within the array). is the target power of the matrix, and P is the actual power of the matrix.

[0160] In an optional embodiment, Δp is at least 0 (or can be any value greater than 0 and less than infinity). If ΔP=0 or the power of two adjacent target square arrays is within the preset power range, the cutting is completed to obtain a square array division result with clear edges and corners.

[0161] If ΔP≠0 and the power of two adjacent target arrays is not within the preset power range, the shape of the array cutting line is changed, such as changing the straight line to a "Z" shape, or changing the "Z" shape to an inverted "Z" shape or rotating the "Z" shape by 90°, or rotating the inverted "Z" shape by 90° to fine-tune the power (or capacity) to obtain a clear-cut area division result.

[0162] That is, in an optional embodiment, the step of moving the array cutting line to determine the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong, and dividing the photovoltaic strings into the target array so that the sum of the differences between the target power and the actual power of the two adjacent target arrays after the re-division is minimized includes:

[0163] Moving the array cutting line, and determining the target array to which each photovoltaic string belongs according to the moved position of the array cutting line;

[0164] Calculate the actual power of the target array according to the photovoltaic components;

[0165] Obtaining a difference between the target power and the actual power of two adjacent target arrays;

[0166] If the sum of the two differences is greater than or equal to the preset difference, return to re-execute the step of moving the array cutting line and determining the target array to which each photovoltaic string belongs according to the position of the moved array cutting line; until the sum of the two differences is less than the preset difference.

[0167] Alternatively, if the sum of the two differences is greater than or equal to the preset difference, the type of the array cutting line is changed, and the process of "moving the array cutting line and determining the target array to which each photovoltaic string belongs according to the moved position of the array cutting line" is returned to be re-executed until the sum of the two differences is less than the preset difference.

[0168] Optionally, in a further embodiment, after executing the step of moving the array cutting line to determine the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong, and dividing the photovoltaic strings into the target array so that the sum of the differences between the target power and the actual power of the two adjacent target arrays after the redivision is minimized, the relative center coordinate point is updated again according to step S10, and steps S20 and S30 are re-executed until there are no exchangeable bracket points in the pairwise array sets.

[0169] This embodiment performs square matrix optimization based on a geometric method, which is simple and easy to implement, and the obtained square matrix tends to be flat.

[0170] Fourth embodiment

[0171] Optionally, this embodiment proposes one of the embodiments of optimizing the square matrix based on relative center points based on all the above embodiments.

[0172] Please refer to Figure 4 The step of determining the target square array to which the photovoltaic strings in the two adjacent square arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target square array to which they belong comprises:

[0173] Step S33, determining the target array to which the photovoltaic strings belong according to the distance information between the photovoltaic strings in two adjacent arrays to be optimized and the relative center, and dividing the photovoltaic strings into the target array.

[0174] This embodiment adjusts the photovoltaic strings to which they belong based on the distance trade-off method to obtain a low-cost, high-concentration array, thereby reducing the array layout cost and difficulty.

[0175] Optionally, the distance trade-off method refers to a method of weighing the distance cost of each photovoltaic string in the array to be optimized relative to the new relative center.

[0176] In an optional embodiment, the target photovoltaic strings in two adjacent arrays to be optimized whose relative center is greater than the relative center of the current array can be directly re-divided into interfaces, such as assigning the target photovoltaic strings to the adjacent arrays.

[0177] Alternatively, in another alternative embodiment, please refer to Figure 5 The step of determining the target array to which the photovoltaic strings belong based on the distance information between the photovoltaic strings in two adjacent arrays to be optimized and the relative center, and dividing the photovoltaic strings into the target array comprises:

[0178] Step S331, obtaining a target photovoltaic string set whose relative distance to the center of the current array is greater than the relative distance to the center of the adjacent array in two adjacent arrays to be optimized;

[0179] Step S332: determine the adjacent square array as the target square array to which the photovoltaic strings of the target photovoltaic string set belong, and divide the photovoltaic strings into the target square array.

[0180] For example, two adjacent arrays to be optimized are the first array a and the first array b, the relative center of the first array a relative to the second array b is Center_a_b, and the relative center of the second array b relative to the first array a is Center_b_a. Calculate the photovoltaic string set 1 that is closer to Center_a_b and farther from Center_b_a in the b array, and calculate the photovoltaic string set 2 that is closer to Center_b_a and farther from Center_a_b in the a array, and then assign the photovoltaic string set 1 to the first array a; and assign the photovoltaic string set 2 to the second array b.

[0181] In an optional embodiment, the target photovoltaic strings in the array are directly divided into adjacent arrays to form two new adjacent target arrays, that is, the photovoltaic strings farther away in the array are divided into arrays closer to the center, and the photovoltaic strings are pulled into the arrays closer to reduce the cost of optical cables.

[0182] In another optional embodiment, the step of determining the adjacent array as the target array to which the photovoltaic strings of the target photovoltaic string set belong, and dividing the photovoltaic strings into the target array includes:

[0183] Obtaining the number of photovoltaic strings of the target photovoltaic string set in two adjacent arrays to be optimized;

[0184] Taking the number of photovoltaic strings with a small number as the target number, determining the adjacent array as the target array to which the target number of photovoltaic strings belongs in the target photovoltaic string set, and dividing the photovoltaic strings into the target array;

[0185] Return to the step of obtaining the initial center point of each to-be-optimized square array of the photovoltaic system until the number of photovoltaic strings in the target photovoltaic string set is zero.

[0186] That is, in the process of PV string attribution and division, the PV strings are divided according to the set with the smallest number, so as to achieve equal division of two adjacent arrays and avoid concentrating too many PV strings in one array.

[0187] For example, two adjacent arrays to be optimized are the first array a and the first array b, the relative center of the first array a relative to the second array b is Center_a_b, and the relative center of the second array b relative to the first array a is Center_b_a. Calculate the photovoltaic string set 1 that is closer to Center_a_b and farther from Center_b_a in the b array, and at the same time calculate the photovoltaic string set 2 that is closer to Center_b_a and farther from Center_a_b in the a array. Among them, the number of photovoltaic strings in the photovoltaic string set 1 and the photovoltaic string set 2 may be the same or different. If the number of photovoltaic strings in the photovoltaic string set 1 and the photovoltaic string set 2 is the same, all the photovoltaic strings in the photovoltaic string set 1 are directly assigned to the first array a, and the photovoltaic string set 2 is assigned to the second array b.

[0188] If the number of photovoltaic strings in the photovoltaic string set 1 and the photovoltaic string set 2 is different, then the photovoltaic string set with the smallest number is obtained, and the number of photovoltaic strings in the photovoltaic string set is used as the target number, and then the photovoltaic strings corresponding to the target number in all photovoltaic string sets are assigned and divided according to the target array. If the number of photovoltaic strings in the photovoltaic string set 1 is 30, and the number of photovoltaic strings in the photovoltaic string set 2 is 50, then 30 is used as the target number, and 30 photovoltaic strings in the photovoltaic string set 1 are assigned to the first array a, and 30 photovoltaic strings in the photovoltaic string set 2 are assigned to the second array b. In this way, during the re-division process, the actual power and target power in each array can also remain unchanged, without affecting the power division.

[0189] It can be understood that if the number of photovoltaic strings in the photovoltaic string set is different, the division is not the optimal division of the array. Therefore, in order to optimize the array, this embodiment updates the relative centers of the two adjacent arrays again according to step S10, and then continues to execute steps S20 and S30 until the number in the target photovoltaic string set is less than a preset value (optionally, the preset value may be less than or equal to 00).

[0190] This embodiment optimizes the matrix by using the distance trade-off method, and can obtain a low-cost high-density matrix, thereby reducing the cost and difficulty of matrix layout. The defects of the current distance function are solved, and the invention can be applied to the field of distance trade-off optimal solution.

[0191] As an implementation method, the hardware environment architecture involved in the photovoltaic array optimization method can be as follows: Figure 6 shown.

[0192] Specifically, the hardware architecture involved in the control method of the air handling equipment may include a terminal, such as a photovoltaic system, a computer, or the like.

[0193] As an implementation, the terminal includes: a processor 101, such as a CPU, a memory 102, and a communication bus 103. The communication bus 103 is used to implement connection and communication between these components. The processor 102 is used to call an application to perform optimization operations.

[0194] The memory 102 may be a high-speed RAM memory or a stable memory (non-volatile memory), such as a disk memory.

[0195] It should be noted that the above are only optional 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 used in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A photovoltaic bus array optimization method, characterized in that: The photovoltaic bus array optimization method comprises the following steps: Obtaining the initial center point of each array to be optimized of the photovoltaic system; According to the initial center points of two adjacent square arrays to be optimized, the relative center points of two adjacent square arrays to be optimized are obtained, wherein the relative center points of two adjacent square arrays to be optimized are in the same horizontal plane or the same vertical plane; Determine the target square arrays to which the photovoltaic strings in the two adjacent square arrays to be optimized belong according to the two adjacent relative center points, and divide the photovoltaic strings into the corresponding target square arrays so as to flatten the edges of the two adjacent square arrays; The step of determining the target square array to which the photovoltaic strings in the two adjacent square arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target square array to which they belong comprises: Determine the position information of two adjacent square arrays to be optimized according to the two adjacent relative centers; Determine the relative position relationship between two adjacent square arrays to be optimized according to the position information; Determine the square array cutting line according to the relative orientation relationship; The array cutting line is moved to determine the target array to which the photovoltaic strings between two adjacent arrays to be optimized belong, and the photovoltaic strings are divided into the target array so that the sum of the differences between the target power and the actual power of the two adjacent target arrays after the re-division is minimized, or the actual power of the two adjacent target arrays after the re-division is within a preset power range.

2. The photovoltaic bus array optimization method according to claim 1, characterized in that: The step of obtaining the relative center points of two adjacent square matrices to be optimized according to the initial center points of the two adjacent square matrices to be optimized comprises: Calculating the angle between the line connecting the initial center points of two adjacent square arrays to be optimized and the horizontal plane; If the angle is less than or equal to a preset threshold, the initial center points of the two adjacent square arrays to be optimized are horizontally processed, and the center points obtained after the horizontal processing of the initial center points are used as the relative center points of the two adjacent square arrays to be optimized, wherein the relative center points obtained by the horizontal processing are in the same horizontal plane; If the angle is greater than the preset threshold, the initial center points of the two adjacent square arrays to be optimized are vertically processed, and the center points obtained after the vertical processing of the initial center points are used as the relative center points of the two adjacent square arrays to be optimized, wherein the relative center points obtained by the vertical processing are in the same vertical plane.

3. The photovoltaic bus array optimization method according to claim 2, characterized in that: The step of horizontalizing the initial center points of two adjacent square arrays to be optimized and using the center points obtained after the horizontalization of the initial center points as the relative center points of the two adjacent square arrays to be optimized comprises: Obtaining an average ordinate value according to the ordinate values ​​of the initial center points of two adjacent square matrices to be optimized; The ordinate value of the initial center point is updated by using the ordinate average value, and the center point after the ordinate value is updated serves as the relative center point of the matrix to be optimized.

4. The photovoltaic bus array optimization method according to claim 2, characterized in that: The step of verticalizing the initial center points of two adjacent square arrays to be optimized and using the center points obtained after the verticalization of the initial center points as the relative center points of the two adjacent square arrays to be optimized comprises: Obtaining an average value of the horizontal coordinates according to the horizontal coordinate values ​​of the initial center points of two adjacent square arrays to be optimized; The abscissa value of the initial center point is updated by using the abscissa average value, and the center point after the abscissa value is updated serves as the relative center point of the matrix to be optimized.

5. The photovoltaic bus array optimization method according to any one of claims 1 to 4, characterized in that: The step of determining the target square array to which the photovoltaic strings in the two adjacent square arrays to be optimized belong according to the two adjacent relative center points, and dividing the photovoltaic strings into the target square array to which they belong comprises: The target array to which the photovoltaic strings belong is determined according to the distance information between the photovoltaic strings in two adjacent arrays to be optimized and the relative center, and the photovoltaic strings are divided into the target array.

6. The photovoltaic bus array optimization method according to claim 5, characterized in that: The step of determining the target array to which the photovoltaic strings belong based on the distance information between the photovoltaic strings in two adjacent arrays to be optimized and the relative center, and dividing the photovoltaic strings into the target array comprises: Obtaining a target photovoltaic string set whose relative distance to the center of the current array is greater than the relative distance to the center of the adjacent array in two adjacent arrays to be optimized; The adjacent square array is determined as a target square array to which the photovoltaic strings of the target photovoltaic string set belong, and the photovoltaic strings are divided into the target square array.

7. The photovoltaic bus array optimization method according to claim 6, characterized in that: The step of determining the adjacent array as the target array to which the photovoltaic strings of the target photovoltaic string set belong, and dividing the photovoltaic strings into the target array comprises: Obtaining the number of photovoltaic strings of the target photovoltaic string set in two adjacent arrays to be optimized; Taking the number of photovoltaic strings with a small number as the target number, determining the adjacent array as the target array to which the target number of photovoltaic strings belongs in the target photovoltaic string set, and dividing the photovoltaic strings into the target array; Return to the step of obtaining the initial center point of each to-be-optimized square array of the photovoltaic system until the number of photovoltaic strings in the target photovoltaic string set is zero.

8. The photovoltaic bus array optimization method according to claim 1, characterized in that: The step of obtaining the initial center point of each to-be-optimized square array of the photovoltaic system comprises: According to the target number of arrays of the photovoltaic system, the target power of the arrays and the coordinate information of the outlet terminals of the photovoltaic strings, a center point consistent with the target number of arrays is randomly generated, and the center point is used as the initial center point of each array to be optimized.

9. The photovoltaic bus array optimization method according to claim 1, characterized in that: The step of obtaining the initial center point of each to-be-optimized square array of the photovoltaic system comprises: Using a clustering method or a distance method to initially divide the confluence area of ​​the photovoltaic system, and using the initially divided confluence area as each of the square arrays to be optimized; Determine the center position of the square array to be optimized according to the positions of all photovoltaic strings in the square array to be optimized; The center position is used as the initial center point of the matrix to be optimized.

10. A terminal, characterized in that: The terminal includes: a memory, a processor, and a photovoltaic bus array optimization program stored in the memory and executable on the processor. When the photovoltaic bus array optimization program is executed by the processor, the steps of the photovoltaic bus array optimization method according to any one of claims 1 to 9 are implemented.

11. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a photovoltaic bus array optimization program, and when the photovoltaic bus array optimization program is executed by a processor, the steps of the photovoltaic bus array optimization method according to any one of claims 1 to 9 are implemented.

Images