A method, device, equipment and storage medium for determining a string path

Abstract

The present invention discloses a method, device, equipment and storage medium for determining a stringing path. The method comprises: obtaining coordinate information of a photovoltaic array to be stringed, the number of columns of the photovoltaic array to be stringed, the target number of strings and the number of components in each string; constructing a path search tree according to the coordinate information of the photovoltaic array to be stringed and the number of columns of the photovoltaic array to be stringed; generating a target stringing path according to the path search tree, the target number of strings and the number of components in each string. The technical solution of the present invention solves the problems of multiple path combinations, large amount of calculation, time-consuming calculation process and output path not meeting actual business rules in the process of stringing components, greatly improves the efficiency of the algorithm and improves the output effect of the optimal path.

Description

[0001] Technology Neighborhood

[0002] The embodiments of the present invention relate to the field of computer technology, and more particularly to a method, device, equipment and storage medium for determining a string path. Background Art

[0003] In photovoltaic power station projects, the installed capacity of household photovoltaics is also increasing year by year. In the design process of household photovoltaic power stations, the stringing problem of components is an extremely complex problem. The traditional manual stringing method is not only time-consuming and labor-intensive, but also difficult to find a more optimized stringing path to reduce the amount of cables. The existing algorithm is to find all possible paths by traversing the entire path, and then select the optimal path. Although this method can find a better path than manual, the amount of calculation is very large, the calculation process is time-consuming, and the output path still does not meet the actual business rules. For example, assuming there are 20 components, divided into 2 strings, and each component has 2 connection points, the number of possible paths for a single starting point is: 2*10^2=2048, and the number of possible paths for the entire path is 20*2048=40960. Summary of the invention

[0004] The embodiments of the present invention provide a method, device, equipment and storage medium for determining a stringing path to solve the problems faced in the component stringing process, such as multiple path combinations, large amount of calculation, time-consuming calculation process and output path not meeting actual business rules, which greatly improves the efficiency of the algorithm and enhances the output effect of the optimal path.

[0005] According to one aspect of the present invention, there is provided a method for determining a string path, comprising:

[0006] Obtaining coordinate information of a photovoltaic array to be connected in series, the number of columns of the photovoltaic array to be connected in series, the number of target strings, and the number of components in each string;

[0007] Constructing a path search tree according to the coordinate information of the photovoltaic array to be connected and the number of columns of the photovoltaic array to be connected;

[0008] A target string line path is generated according to the path search tree, the target number of strings and the number of components in each string.

[0009] Furthermore, a path search tree is constructed according to the coordinate information of the photovoltaic array to be stringed together, the number of rows of the photovoltaic array to be stringed together, and the number of columns of the photovoltaic array to be stringed together, including:

[0010] Determine the connection information of each component in the photovoltaic array to be connected in series according to the coordinate information of the photovoltaic array to be connected in series and the number of columns of the photovoltaic array to be connected in series;

[0011] Build a path search tree based on the connection information of each component.

[0012] Furthermore, the connection information of each component in the photovoltaic array to be stringed together is determined according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together, including:

[0013] Determine the type of each component in the photovoltaic array to be stringed together and obstacle information in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together;

[0014] The connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series.

[0015] Further, the types of components include: first row components, first column components, last row components, last column components and target components, wherein the target component is not a first row component, not a first column component, not a last row component and not a last column component, the first row components do not include: the first component of the first row and the last component of the first row, and the last row components do not include: the first component of the last row and the last component of the last row;

[0016] Accordingly, the connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series, including:

[0017] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the value corresponding to the type of the component;

[0018] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the obstacle;

[0019] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the first target obstacle, wherein the first target obstacle is a lateral obstacle of the component;

[0020] If the type of the component is a target component, the connection information of the component is determined according to the first rule.

[0021] Furthermore, the first rule includes:

[0022] If the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the first value;

[0023] If there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle;

[0024] If there are two obstacles in the neighborhood of a component, the connection information of the component includes: a non-obstacle neighborhood component of the component, a non-obstacle neighborhood component of the obstacle, and direction information of a second target obstacle, wherein the second target obstacle is a lateral obstacle of the component.

[0025] Furthermore, the value corresponding to the first row of components is the number of columns of the photovoltaic array to be connected, the value corresponding to the last row of components is the opposite of the number of columns of the photovoltaic array to be connected, the value corresponding to the first column of components is the second value, and the value corresponding to the last column of components is the opposite of the second value.

[0026] Further, generating a target string line path according to the path search tree, the target number of strings and the number of components in each string includes:

[0027] Acquire a first starting point component, wherein the first starting point component includes: at least one component in the photovoltaic array to be stringed together, a component at a corner point of the photovoltaic array to be stringed together, and at least one component in a neighborhood of an obstacle in the photovoltaic array to be stringed together;

[0028] generating a first string line path according to the first starting point component, the number of components in each string, and the path search tree;

[0029] Determine the Nth starting point component of the N+1th string path according to the neighboring components of the first component and / or the neighboring components of the last component of the first N string paths, where N=1, 2, ..., M-1, and M is the number of target strings;

[0030] An Nth string line path is generated according to the Nth starting point component, the number of components in each string, and the path search tree.

[0031] Further, generating an Nth string line path according to the Nth starting point component, the number of components in each string, and the path search tree includes:

[0032] Determine the initial forward direction of the Nth string path to be leftward with the Nth starting point component as the starting point or rightward with the Nth starting point component as the starting point;

[0033] If there is an obstacle in the forward direction, the branch path and branch point are determined according to the connection information of the adjacent components of the obstacle;

[0034] Determine the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point;

[0035] The Nth string line path is generated according to the forward direction of the path after the branch point, the number of components in each string, and the path search tree.

[0036] Further, determining the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point includes:

[0037] If the path before the branch point and the path after the branch point are adjacent rows or are separated by an even number of rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point;

[0038] If the path before the branch point and the path after the branch point are separated by an odd number of rows, the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point.

[0039] According to another aspect of the present invention, a device for determining a string line path is provided, the device comprising:

[0040] An acquisition module is used to acquire coordinate information of a photovoltaic array to be connected in series, the number of columns of the photovoltaic array to be connected in series, the number of target strings, and the number of components in each string;

[0041] A construction module, used for constructing a path search tree according to the coordinate information of the photovoltaic array to be stringed and the number of columns of the photovoltaic array to be stringed;

[0042] A generating module is used to generate a target string line path according to the path search tree, the target number of strings and the number of components in each string.

[0043] Furthermore, the building blocks are specifically used for:

[0044] Determine the connection information of each component in the photovoltaic array to be connected in series according to the coordinate information of the photovoltaic array to be connected in series and the number of columns of the photovoltaic array to be connected in series;

[0045] Build a path search tree based on the connection information of each component.

[0046] Furthermore, the building blocks are specifically used for:

[0047] Determine the type of each component in the photovoltaic array to be stringed together and obstacle information in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together;

[0048] The connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series.

[0049] Further, the types of components include: first row components, first column components, last row components, last column components and target components, wherein the target component is not a first row component, not a first column component, not a last row component and not a last column component, the first row components do not include: the first component of the first row and the last component of the first row, and the last row components do not include: the first component of the last row and the last component of the last row;

[0050] Accordingly, the building blocks are specifically used for:

[0051] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the value corresponding to the type of the component;

[0052] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the obstacle;

[0053] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the first target obstacle, wherein the first target obstacle is a lateral obstacle of the component;

[0054] If the type of the component is a target component, the connection information of the component is determined according to the first rule.

[0055] Furthermore, the first rule includes:

[0056] If the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the first value;

[0057] If there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle;

[0058] If there are two obstacles in the neighborhood of a component, the connection information of the component includes: a non-obstacle neighborhood component of the component, a non-obstacle neighborhood component of the obstacle, and direction information of a second target obstacle, wherein the second target obstacle is a lateral obstacle of the component.

[0059] Furthermore, the value corresponding to the first row of components is the number of columns of the photovoltaic array to be connected, the value corresponding to the last row of components is the opposite of the number of columns of the photovoltaic array to be connected, the value corresponding to the first column of components is the second value, and the value corresponding to the last column of components is the opposite of the second value.

[0060] Furthermore, the generation module is specifically used for:

[0061] Acquire a first starting point component, wherein the first starting point component includes: at least one component in the photovoltaic array to be stringed together, a component at a corner point of the photovoltaic array to be stringed together, and at least one component in a neighborhood of an obstacle in the photovoltaic array to be stringed together;

[0062] generating a first string line path according to the first starting point component, the number of components in each string, and the path search tree;

[0063] Determine the Nth starting point component of the N+1th string path according to the neighboring components of the first component and / or the neighboring components of the last component of the first N string paths, where N=1, 2, ..., M-1, and M is the number of target strings;

[0064] An Nth string line path is generated according to the Nth starting point component, the number of components in each string, and the path search tree.

[0065] Furthermore, the generation module is specifically used for:

[0066] Determine the initial forward direction of the Nth string path to be leftward with the Nth starting point component as the starting point or rightward with the Nth starting point component as the starting point;

[0067] If there is an obstacle in the forward direction, the branch path and branch point are determined according to the connection information of the adjacent components of the obstacle;

[0068] Determine the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point;

[0069] The Nth string line path is generated according to the forward direction of the path after the branch point, the number of components in each string, and the path search tree.

[0070] Furthermore, the generation module is specifically used for:

[0071] If the path before the branch point and the path after the branch point are adjacent rows or are separated by an even number of rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point;

[0072] If the path before the branch point and the path after the branch point are separated by an odd number of rows, the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point.

[0073] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:

[0074] at least one processor; and

[0075] a memory communicatively connected to the at least one processor; wherein,

[0076] The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the string line path determination method described in any embodiment of the present invention.

[0077] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the string line path determination method described in any embodiment of the present invention when executed.

[0078] The technical solution of the embodiment of the present invention builds a path search tree according to the coordinate information of the photovoltaic array to be stringed and the number of columns of the photovoltaic array to be stringed; then generates a target stringing path according to the path search tree, the target number of strings and the number of components in each string, which solves the problems faced in the component stringing process, such as many path combinations, large amount of calculation, time-consuming calculation process and output path not meeting actual business rules, greatly improves the efficiency of the algorithm and enhances the output effect of the optimal path.

[0079] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0080] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0081] Figure 1 is a flow chart of a method for determining a string line path in an embodiment of the present invention;

[0082] Figure 2 is a schematic diagram of four neighborhoods in an embodiment of the present invention;

[0083] Figure 3 is a schematic diagram of a photovoltaic array in an embodiment of the present invention;

[0084] Figure 4 is a schematic diagram of the photovoltaic array arrangement in an embodiment of the present invention;

[0085] Figure 5 is a schematic diagram of a horizontal jumper in a string line in an embodiment of the present invention;

[0086] Figure 6 is a schematic diagram of adjacent row branch paths in an embodiment of the present invention;

[0087] Figure 7 is a schematic diagram of branch paths with one row interval in an embodiment of the present invention;

[0088] Figure 8 is a schematic structural diagram of a string line path determination device in an embodiment of the present invention;

[0089] Fig. 9 It is a structural schematic diagram of an electronic device in an embodiment of the present invention. DETAILED DESCRIPTION

[0090] In order to enable people in the technical field to better understand the scheme of the present invention, the technical scheme in the embodiment of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is only a part of the embodiment of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in the field without creative work should fall within the scope of protection of the present invention.

[0091] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0092] Embodiment 1

[0093] Figure 1A flowchart of a method for determining a string line path provided in an embodiment of the present invention is provided. This embodiment is applicable to the case of determining a string line path. The method can be executed by a string line path determination device in an embodiment of the present invention. The device can be implemented in software and / or hardware. Figure 1 As shown, the method specifically comprises the following steps:

[0094] S110, obtaining coordinate information of a photovoltaic array to be connected in series, the number of columns of the photovoltaic array to be connected in series, the number of target strings, and the number of components in each string.

[0095] The coordinate information of the photovoltaic array to be stringed includes: the coordinate information of the components in the photovoltaic array to be stringed and the coordinate information of the obstacles in the photovoltaic array to be stringed, wherein the obstacles are non-components in the photovoltaic array to be stringed, for example, the coordinate information of the position where there is no component in the photovoltaic array to be stringed, or the coordinate information of objects that do not need to be stringed in the photovoltaic array to be stringed.

[0096] The number of columns of the photovoltaic array to be connected in series is the total number of columns of the photovoltaic array to be connected in series. For example, if the photovoltaic array to be connected in series is a matrix of H*W, the number of columns of the photovoltaic array to be connected in series is W.

[0097] The target number of strings is the total number of strings corresponding to the photovoltaic array to be connected in series. For example, if the target number of strings is 6, 6 target stringing paths need to be generated.

[0098] The number of components in each string is related to the target number of strings. For example, if the target number of strings is 3, the number of components in string 1 is A, the number of components in string 2 is B, and the number of components in string 3 is C.

[0099] S120, constructing a path search tree according to the coordinate information of the photovoltaic array to be connected in series and the number of columns of the photovoltaic array to be connected in series.

[0100] Specifically, the method of constructing a path search tree according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together may be: determining the connection information of each component in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together; and constructing a path search tree according to the connection information of each component. The method of constructing a path search tree according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together may also be: determining the coordinate information of the components in the photovoltaic array to be stringed together and the coordinate information of the obstacles in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together, and constructing a path search tree according to the coordinate information of the components in the photovoltaic array to be stringed together, the coordinate information of the obstacles in the photovoltaic array to be stringed together, and the number of columns of the photovoltaic array to be stringed together, which is not limited in this embodiment of the present invention.

[0101] Optionally, constructing a path search tree according to the coordinate information of the photovoltaic array to be stringed together, the number of rows of the photovoltaic array to be stringed together, and the number of columns of the photovoltaic array to be stringed together includes:

[0102] Determine the connection information of each component in the photovoltaic array to be connected in series according to the coordinate information of the photovoltaic array to be connected in series and the number of columns of the photovoltaic array to be connected in series;

[0103] Build a path search tree based on the connection information of each component.

[0104] Among them, the connection information of each component includes: the neighborhood components and obstacle direction information of each component. For example, the neighborhood components of component P are P1, P2, P3 and P4, the obstacle direction information is 0, and the connection information of component P is: [P1, P2, P3, P4, 0].

[0105] Specifically, the method of determining the connection information of each component in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together may be: determining the coordinate information of the components in the photovoltaic array to be stringed together and the coordinate information of the obstacles in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together, and determining the connection information of each component in the photovoltaic array to be stringed together according to the coordinate information of the components in the photovoltaic array to be stringed together, the coordinate information of the obstacles in the photovoltaic array to be stringed together, and the number of columns of the photovoltaic array to be stringed together. The method of determining the connection information of each component in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together may also be: determining the type of each component in the photovoltaic array to be stringed together and the obstacle information in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together; determining the connection information of each component according to the type of each component, the obstacle information in the photovoltaic array to be stringed together, and the number of columns of the photovoltaic array to be stringed together, and the embodiment of the present invention is not limited to this.

[0106] Specifically, the path search tree can be constructed based on the connection information of each component by determining the components in the photovoltaic array to be connected as nodes of the path search tree, determining the relationship between the nodes based on the connection information of each component, and constructing the path search tree based on the relationship between the nodes.

[0107] Optionally, determining the connection information of each component in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together includes:

[0108] Determine the type of each component in the photovoltaic array to be stringed together and obstacle information in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together;

[0109] The connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series.

[0110] Among them, the types of components include: first row components, first column components, last row components, last column components and target components, wherein the target component is not a first row component, a first column component, a last row component and a last column component, the first row components do not include: the first component in the first row and the last component in the first row, and the last row components do not include: the first component in the last row and the last component in the last row.

[0111] Among them, the obstacle information in the photovoltaic array to be stringed is the coordinate information of non-components in the photovoltaic array to be stringed, for example, it can be the coordinate information of the position without components in the photovoltaic array to be stringed, or the coordinate information of objects that do not need to be stringed in the photovoltaic array to be stringed.

[0112] Specifically, the method of determining the type of each component in the photovoltaic array to be stringed and the obstacle information in the photovoltaic array to be stringed according to the coordinate information of the photovoltaic array to be stringed can be: determining the coordinate information of the components in the photovoltaic array to be stringed and the coordinate information of the obstacles in the photovoltaic array to be stringed according to the coordinate information of the photovoltaic array to be stringed, determining the type of each component in the photovoltaic array to be stringed according to the coordinate information of the components in the photovoltaic array to be stringed, and determining the obstacle information in the photovoltaic array to be stringed according to the coordinate information of the obstacles in the photovoltaic array to be stringed.

[0113] Specifically, the method of determining the type of each component in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together can be: if it is determined according to the coordinate information of the component in the photovoltaic array to be stringed together that the component is located in the first row of the photovoltaic array, not the first component in the first row, and not the last component in the first row, then the type of the component is determined to be a first-row component; if it is determined according to the coordinate information of the component in the photovoltaic array to be stringed together that the component is located in the last row of the photovoltaic array, not the first component in the last row, and not the last component in the last row, then the type of the component is determined to be a last-row component; if it is determined according to the coordinate information of the component in the photovoltaic array to be stringed together that the component is located in the first column of the photovoltaic array, then the type of the component is determined to be a first-column component; if it is determined according to the coordinate information of the component in the photovoltaic array to be stringed together that the component is located in the last column of the photovoltaic array, then the type of the component is determined to be a last-column component; if it is determined according to the coordinate information of the component in the photovoltaic array to be stringed together that the component is located in non-first row, non-first column, non-last row, and non-last column, then the type of the component is determined to be a target component.

[0114] Optionally, the types of components include: first row component, first column component, last row component, last column component and target component, wherein the target component is not a first row component, not a first column component, not a last row component and not a last column component, the first row component does not include: the first component of the first row and the last component of the first row, and the last row component does not include: the first component of the last row and the last component of the last row;

[0115] Accordingly, the connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series, including:

[0116] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the value corresponding to the type of the component;

[0117] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the obstacle;

[0118] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the first target obstacle, wherein the first target obstacle is a lateral obstacle of the component;

[0119] If the type of the component is a target component, the connection information of the component is determined according to the first rule.

[0120] Among them, if there are two obstacles in the neighborhood of the component, the two obstacles can only be one obstacle in the horizontal direction of the component and one obstacle in the longitudinal direction of the component. For example, there may be an obstacle on the left side of the component and an obstacle above the component; or, there is an obstacle on the right side of the component and an obstacle below the component; or, there is an obstacle on the left side of the component and an obstacle below the component; or, there is an obstacle on the right side of the component and an obstacle above the component. The embodiments of the present invention are not limited to this.

[0121] The neighborhood of the component includes: objects above the component, objects below the component, objects on the left of the component, and objects on the right of the component, for example, Figure 2 As shown, the neighborhood of component P is P1, P2, P3 and P4.

[0122] The non-obstacle neighborhood components of the obstacle may be: the obstacle left component and the obstacle right component; the non-obstacle neighborhood components of the obstacle may also be: the obstacle upper component and the obstacle lower component. It should be noted that if the obstacle is an object above the component or an object below the component, the non-obstacle neighborhood components of the obstacle are the obstacle left component and the obstacle right component; if the obstacle is an object on the left of the component or an object on the right of the component, the non-obstacle neighborhood components of the obstacle are the obstacle upper component and the obstacle lower component.

[0123] Among them, the value corresponding to the first row of components is the number of columns of the photovoltaic array to be connected, the value corresponding to the last row of components is the opposite of the number of columns of the photovoltaic array to be connected, the value corresponding to the first column of components is the second value, and the value corresponding to the last column of components is the opposite of the second value.

[0124] Specifically, if the type of the component is any one of the first row component, the last row component, the first column component, and the last column component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the numerical value corresponding to the type of the component. For example, if the type of the component is the first row component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the number of columns of the photovoltaic array to be connected (component X is the first row component, the object below the component is component X1, the object on the left of the component is component X2, the object on the right of the component is component X3, the number of columns of the photovoltaic array to be connected is W, then the connection information of component X is [X1, X2, X3, W]). If the type of the component is the last row component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood components of the component and the number of columns of the photovoltaic array to be connected (component Y is the last row component, the object above the component is component Y1, the object on the left of the component is component Y2, the object on the right of the component is component Y3, and the number of columns of the photovoltaic array to be connected is W, then the connection information of component Y is [Y1, Y2, Y3, -W]). If the type of the component is the first row component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood components of the component and the second value (component Z is the first row component, the object above the component is component Z1, the object below the component is component Z2, and the object on the right of the component is component Z3, then the connection information of component Z is [Z1, Z2, Z3, 1]). If the component type is the last row component and none of the component's neighbors are obstacles, the component's connection information includes: the component's neighborhood component and the opposite of the second value (component T is the first row component, the object above the component is component T1, the object below the component is component T2, and the object to the left of the component is component T3, then the connection information of component T is [T1, T2, T3, -1]).

[0125] Among them, the direction information of the obstacle is related to the relative position of the obstacle and the component. For example, if the obstacle is on the left side of the component, the direction information of the obstacle is determined to be the second value; if the obstacle is on the right side of the component, the direction information of the obstacle is determined to be the opposite of the second value; if the obstacle is above the component, the direction information of the obstacle is determined to be the number of columns of the photovoltaic array to be connected; if the obstacle is below the component, the direction information of the obstacle is determined to be the opposite of the number of columns of the photovoltaic array to be connected.

[0126] Specifically, if the type of a component is any of the first row component, the last row component, the first column component, and the last column component, and there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle. For example, the type of component R may be the first row component, and the object below component R is obstacle 1, the object on the left of component R is component R1, the object on the right of component R is component R2, the object on the left of obstacle 1 is component R3, and the object on the right of obstacle 1 is component R4. The connection information of component R is [R1, R2, R3, R4, -W]).

[0127] Specifically, if the type of a component is any one of the first row component, the last row component, the first column component, and the last column component, and there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the first target obstacle, wherein the first target obstacle is the lateral obstacle of the component. For example, the type of component F is the first row component, and the object below component F is obstacle 1, the object on the left side of component F is component F1, the object on the right side of component R is obstacle 2, the object on the left side of obstacle 1 is component F2, the object on the right side of obstacle 1 is component F3, and the object below obstacle 2 is component F3, the direction information of obstacle 2 is determined as the direction information of the first target obstacle, and the connection information of component F is [F1, F2, F3, -1]). It should be noted that if the object on the right side of obstacle 1 is obstacle 3, the object F4 on the right side of obstacle 3 is obtained, and the connection information of component F is [F1, F2, F4, -1]).

[0128] Specifically, if the type of the component is a target component, the method of determining the connection information of the component according to the first rule can be: if the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and a first numerical value; if there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle; if there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the second target obstacle, wherein the second target obstacle is a lateral obstacle of the component.

[0129] Optionally, the first rule includes:

[0130] If the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the first value;

[0131] If there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle;

[0132] If there are two obstacles in the neighborhood of a component, the connection information of the component includes: a non-obstacle neighborhood component of the component, a non-obstacle neighborhood component of the obstacle, and direction information of a second target obstacle, wherein the second target obstacle is a lateral obstacle of the component.

[0133] Specifically, if the neighborhood of a component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and a first value, which may be, for example, Figure 2 As shown, the neighborhood of component P is P1, P2, P3 and P4. If P1, P2, P3 and P4 are not obstacles, the connection information of component P is [P1, P2, P3, P4, 0].

[0134] Specifically, if there is an obstacle in the neighborhood of a component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle. For example, if there is an obstacle on the left side of component P, that is, p1 = 0. Then the connection information of component P is [p2, p3, p4, q1, q3, 1], such as Figure 3 As shown in the figure, the connection information of point 53 is [54, 63, 43, 62, 42, 1]. If there is an obstacle on the right side of component P, that is, p2 = 0. Then the connection information of component P is [p1, p3, p4, q2, q4, -1], as shown in the figure. Figure 3 As shown in the figure, the connection information of point 48 is [47,58,38,59,39,-1]. If there is an obstacle above component P, that is, p3=0. Then the connection information of component P is [p1,p2,p4,q1,q2,w], as shown in the figure. Figure 3 Point 39 in the figure has a connection information of [38,40,29,48,10]. If there is an obstacle under component P, that is, p4=0. Then the connection information of component P is [p1,p2,p3,q3,q4,-w], such as Figure 3 Point 59 in the figure has a connection information of [58, 60, 49, 48, -10].

[0135] Among them, if there are two obstacles in the neighborhood of the component, the two obstacles can only be one obstacle in the horizontal direction of the component and one obstacle in the longitudinal direction of the component. For example, there may be an obstacle on the left side of the component and an obstacle above the component; or, there is an obstacle on the right side of the component and an obstacle below the component; or, there is an obstacle on the left side of the component and an obstacle below the component; or, there is an obstacle on the right side of the component and an obstacle above the component. The embodiments of the present invention are not limited to this.

[0136] Specifically, if there are two obstacles in the neighborhood of a component, the connection information of the component includes: a non-obstacle neighborhood component of the component, a non-obstacle neighborhood component of the obstacle, and direction information of a second target obstacle, wherein the second target obstacle is a lateral obstacle of the component, for example, the object below component G is obstacle 1, the left side of component G is component G1, the right side of component G is obstacle 2, the top of component G is component G2, the left side of obstacle 1 is component G3, the right side of obstacle 1 is component G4, the top of obstacle 2 is component G5, and the bottom of obstacle 2 is component G4, and the connection information of component G is [G1, G2, G3, G4, G5, -1]. It should be noted that if the right side of obstacle 1 is obstacle 3, the object G6 on the right side of obstacle 3 is obtained, and the connection information of component F is [G1, G2, G3, G6, G5, -1].

[0137] Optionally, the value corresponding to the first row of components is the number of columns of the photovoltaic array to be connected, the value corresponding to the last row of components is the opposite of the number of columns of the photovoltaic array to be connected, the value corresponding to the first column of components is the second value, and the value corresponding to the last column of components is the opposite of the second value.

[0138] S130, generating a target string line path according to the path search tree, the target number of strings, and the number of components in each string.

[0139] The number of target string line paths is equal to the target number of strings. For example, the target number of strings is 3, the number of components in string 1 is A, the number of components in string 2 is B, and the number of components in string 3 is C. The target string line path includes 3 paths, path 1, path 2, and path 3. The number of components in the string corresponding to path 1 is A, the number of components in the string corresponding to path 2 is B, and the number of components in the string corresponding to path 3 is C.

[0140] Specifically, the method of generating the target string line path according to the path search tree, the target number of strings, and the number of components in each string can be: obtaining the starting component and the path direction, and generating the target string line path according to the starting component, the path direction, the path search tree, the target number of strings, and the number of components in each string. For example, it can be that the starting component is obtained, the first string line path is generated according to the number of components in each string of the starting component and the path search tree, the Nth starting component of the N+1th string line path is determined according to the neighboring components of the first component and / or the neighboring components of the tail component of the Nth string line path, and the Nth string line path is generated according to the Nth starting component, the number of components in each string, and the path search tree.

[0141] Optionally, generating a target string line path according to the path search tree, the target number of strings, and the number of components in each string includes:

[0142] Acquire a first starting point component, wherein the first starting point component includes: at least one component in the photovoltaic array to be stringed together, a component at a corner point of the photovoltaic array to be stringed together, and at least one component in a neighborhood of an obstacle in the photovoltaic array to be stringed together;

[0143] generating a first string line path according to the first starting point component, the number of components in each string, and the path search tree;

[0144] Determine the Nth starting point component of the N+1th string path according to the neighboring components of the first component and / or the neighboring components of the last component of the first N string paths, where N=1, 2, ..., M-1, and M is the number of target strings;

[0145] An Nth string line path is generated according to the Nth starting point component, the number of components in each string, and the path search tree.

[0146] The first starting point component is the starting point of the first string path. The first starting point component may be one or more, which is not limited in the embodiment of the present invention.

[0147] Specifically, the first starting point component may be obtained by randomly selecting at least one component from the photovoltaic array to be stringed together, and determining the at least one randomly selected component as the first starting point component. The first starting point component may also be obtained by determining the component at the corner position of the photovoltaic array to be stringed together as the first starting point component; the first starting point component may also be obtained by determining the component in the neighborhood of the obstacle in the photovoltaic array to be stringed together as the first starting point component, and the embodiment of the present invention does not limit this.

[0148] Specifically, the method of generating the first string line path according to the first starting point component, the number of components in each string group, and the path search tree may be: generating the first string line path according to the first starting point component, the number of components in the first string group, and the path search tree; the method of generating the first string line path according to the first starting point component, the number of components in each string group, and the path search tree may also be: generating the first string line path according to the first starting point component, the number of components in the first string group, the path forward direction, and the path search tree. For example, it may be, Figure 3 As shown, the component corresponding to point 61 is the first starting point component, the path advances in the right direction, and the number of components in the string corresponding to the first string path is 8. Then the first string path is: point 61→point 62→point 63→point 64→point 65→point 66→point 67→point 68.

[0149] Specifically, after the first path search is completed, the neighborhood components of the first and last components of the path are recorded as possible starting components of the next path, and new path searches are performed on all possible starting components. This ensures the continuity of all paths and prevents isolated components from appearing. This is done by analogy until all path searches except the last one are completed. The search starting point of the last path includes the neighborhood components of the first and last components of all previous paths and the original starting component.

[0150] Optionally, generating an Nth string line path according to the Nth starting point component, the number of components in each string, and the path search tree includes:

[0151] Determine the initial forward direction of the Nth string path to be leftward with the Nth starting point component as the starting point or rightward with the Nth starting point component as the starting point;

[0152] If there is an obstacle in the forward direction, the branch path and branch point are determined according to the connection information of the adjacent components of the obstacle;

[0153] Determine the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point;

[0154] The Nth string line path is generated according to the forward direction of the path after the branch point, the number of components in each string, and the path search tree.

[0155] The initial moving direction may be left or right.

[0156] Specifically, the initial forward direction of the Nth string path is determined to be to the left with the Nth starting point component as the starting point or to the right with the Nth starting point component as the starting point. If the Nth starting point component is the first row component, the initial forward direction of the Nth string path is determined to be to the right with the starting point. If the Nth starting point component is the last row component, the initial forward direction of the Nth string path is determined to be to the left with the starting point. If there is an obstacle on the right side of the Nth starting point component, the initial forward direction of the Nth string path is determined to be to the left with the starting point. If there is an obstacle on the left side of the Nth starting point component, the initial forward direction of the Nth string path is determined to be to the right with the starting point. The embodiments of the present invention do not limit this.

[0157] Specifically, if there is an obstacle in the forward direction, the branch path and branch point are determined according to the connection information of the adjacent components of the obstacle, for example, Figure 3As shown, if the driving path is point 45→point 46→point 47→point 48, the right side of point 48 is "0", that is, there is an obstacle in the forward direction of point 48, and the connection information of point 48 is [47,58,38,59,39,-1], then point 48 is determined to be a branch point, and the branch paths include: a branch path with point 38 as the starting point, a branch path with point 58 as the starting point, a branch path with point 39 as the starting point, and a branch road path with point 59 as the starting point.

[0158] Specifically, the method for determining the forward direction of the path after the branch point based on the initial forward direction of the Nth string path, the branch path and the branch point can be: if the path before the branch point and the path after the branch point are in adjacent rows or are separated by an even number of rows, then the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point; if the path before the branch point and the path after the branch point are separated by an odd number of rows, then the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point.

[0159] Specifically, the method for generating the Nth string line path according to the forward direction of the path after the branch point, the number of components in each string group, and the path search tree can be: determine the path after the branch point corresponding to the Nth string line path according to the forward direction of the path after the branch point, the number of components in the string group corresponding to the Nth string line path, and the path search tree; generate the Nth string line path according to the path before the branch point corresponding to the Nth string line path and the path after the branch point corresponding to the Nth string line path.

[0160] Optionally, determining the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path, and the branch point includes:

[0161] If the path before the branch point and the path after the branch point are adjacent rows or are separated by an even number of rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point;

[0162] If the path before the branch point and the path after the branch point are separated by an odd number of rows, the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point.

[0163] Specifically, if the path before the branch point and the path after the branch point are adjacent rows or are separated by an even number of rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point. For example, if the path before the branch point and the path after the branch point are separated by 2 rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point.

[0164] Specifically, if the path before the branch point is separated from the path after the branch point by an odd number of rows, the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point. For example, if the path before the branch point is separated from the path after the branch point by 1 row, the forward direction of the path after the branch point is determined to be the same as the forward direction of the path before the branch point.

[0165] In a specific example, a path search tree is constructed based on the coordinate information of the photovoltaic array to be connected and the number of columns of the photovoltaic array to be connected. According to the coordinate position relationship of the components in the array, a connection relationship tree structure of all components is constructed through the four-neighborhood relationship, and the direction of the obstacles is marked at the same time. The tree structure is used in the path search process to directly search based on the connection relationship between two points. Figure 2 The coordinates of point P are (x, y), and its four neighboring points are [p1, p2, p3, p4]. The connection relationship of this point is [p1, p2, p3, p4, X], where X is the obstacle information flag, which can be 0, -1, 1, -w, w. If X is 0, it means there is no obstacle in the neighborhood of this point, -1, 1 means obstacles in the horizontal direction, and -w, w means obstacles in the vertical direction. If there is a point "0" in the neighborhood of this point, it is allowed to expand to the neighboring points of the "0" point, combined with Figure 3 The dot diagram (h=7, w=10) shows the specific relationship as follows:

[0166] If there are no obstacles in the four directions of point P, then the connection information of point P is [p1,p2,p3,p4,0]. Figure 3 Point 58 in the figure has a connection information of [57,59,68,48,0].

[0167] If there is an obstacle on the left side of point P, that is, p1 = 0. Then the connection information of point P is [p2, p3, p4, q1, q3, 1], such as Figure 3 For point 53 in the graph, the connection information of this point is [54,63,43,62,42,1].

[0168] If there is an obstacle on the right side of point P, that is, p2 = 0. Then the connection information of point P is [p1, p3, p4, q2, q4, -1], such as Figure 3 Point 48 in the figure has a connection information of [47,58,38,59,39,-1].

[0169] If there is an obstacle on the upper side of point P, that is, p3 = 0. Then the connection information of point P is [p1, p2, p4, q1, q2, w], such as Figure 3 Point 39 in the figure has a connection information of [38,40,29,48,10].

[0170] If there is an obstacle below point P, that is, p4 = 0. Then the connection information of point P is [p1, p2, p3, q3, q4, -w], such as Figure 3 For point 59, the connection relationship of this point is expressed as [58,60,49,48,-10].

[0171] If point P is located in the first or last row, and the four neighboring points do not include the "0" point, the default obstacle direction is the upper side or the lower side; when point P is located in the first or last column, and the four neighboring points do not include the "0" point, the obstacle direction is the left side or the right side; the four corner points are defaulted to the first column or the last column.

[0172] If there is a "0" point in the neighborhood of the first row component, the last row component, the first column component, and the last column component, then the "0" point is taken as the obstacle direction of the point. If there are "0" points in both the horizontal and vertical directions in the neighborhood of the point, then the horizontal direction is taken as the obstacle direction of the point.

[0173] Determine the search starting point: Different search starting points will have different path result outputs. In the actual stringing process, any point can be used as the starting point, but the final output results of most points are invalid paths.

[0174] So when determining the search starting point, there are two ways:

[0175] 1. Take all data points as the starting point. All component positions can be used as the starting point for path search to search for all possible paths. Figure 3 All non-zero points in .

[0176] 2. Take the corner points of the square matrix and the points adjacent to the obstacle as the starting point. The four corner points in the square matrix are the points adjacent to the obstacle. Figure 3 The four corner points in , and the points adjacent to point 0, are [62, 53, 41, 42, 48, 59, 60, 39, 40].

[0177] When arranging components, Figure 4 As shown in the figure, the components in two adjacent rows are arranged in reverse, that is, the positive and negative electrodes are opposite. And in actual business, it is necessary to avoid Figure 5 As shown in the wiring situation, the increase of jumpers means the increase of construction difficulty and cost. Therefore, the following constraint rules are set in the path search algorithm:

[0178] 1. The search direction of the row direction is the path forward direction.

[0179] The path's forward direction includes left and right directions. If the actual path's forward direction is one of them, the search direction for the next point will continue along that direction and will not go up or down unless there is an obstacle in the forward direction. If there is an obstacle, enter Rule 2.

[0180] 2. After encountering an obstacle, a branch path is selected, and the horizontal direction is prioritized after selecting the branch path.

[0181] When an obstacle is encountered during the path search, all possible branch paths are selected based on the connection point of the current point. If there is a valid path in the horizontal direction, it is given priority. After the path is selected, Rule 3 is entered.

[0182] 3. Avoid skipping lines in the row direction. Two adjacent rows should walk in a "C" shape route, adjacent even-numbered rows should walk in a "C" shape route, and adjacent odd-numbered rows should walk in a "Z" shape route.

[0183] The branch point of the recorded path is used as the boundary. The path before this point is recorded as L1, and the branch path after this point is recorded as L2. If L2 and L1 are adjacent rows or L2 and L1 are separated by an even number of rows, the search direction of the branch path L2 is the opposite of L1, such as Figure 6 As shown; if L2 and L1 are separated by one row, that is, L2 and L1 are separated by an odd number of rows, then the search direction of the branch path L2 is the direction of L1, as shown Figure 7 shown.

[0184] The technical solution of this embodiment constructs a path search tree according to the coordinate information of the photovoltaic array to be stringed and the number of columns of the photovoltaic array to be stringed; then generates a target stringing path according to the path search tree, the target number of strings and the number of components in each string, which solves the problems faced in the component stringing process, such as many path combinations, large amount of calculation, time-consuming calculation process and output path not meeting actual business rules, greatly improves the efficiency of the algorithm and improves the output effect of the optimal path.

[0185] Embodiment 2

[0186] Figure 8 This is a schematic diagram of the structure of a string line path determination device provided by an embodiment of the present invention. This embodiment is applicable to the case of string line path determination. The device can be implemented in software and / or hardware. The device can be integrated in any device that provides a string line path determination function, such as Figure 8 As shown, the string line path determination device specifically includes: an acquisition module 210, a construction module 220 and a generation module 230.

[0187] The acquisition module 210 is used to acquire the coordinate information of the photovoltaic array to be connected, the number of columns of the photovoltaic array to be connected, the number of target strings, and the number of components in each string;

[0188] A construction module 220, configured to construct a path search tree according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together;

[0189] The generating module 230 is used to generate a target string line path according to the path search tree, the target number of strings and the number of components in each string.

[0190] Optionally, the building block is specifically used for:

[0191] Determine the connection information of each component in the photovoltaic array to be connected in series according to the coordinate information of the photovoltaic array to be connected in series and the number of columns of the photovoltaic array to be connected in series;

[0192] Build a path search tree based on the connection information of each component.

[0193] Optionally, the building block is specifically used for:

[0194] Determine the type of each component in the photovoltaic array to be stringed together and obstacle information in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together;

[0195] The connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series.

[0196] Optionally, the types of components include: first row component, first column component, last row component, last column component and target component, wherein the target component is not a first row component, not a first column component, not a last row component and not a last column component, the first row component does not include: the first component of the first row and the last component of the first row, and the last row component does not include: the first component of the last row and the last component of the last row;

[0197] Accordingly, the building blocks are specifically used for:

[0198] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the value corresponding to the type of the component;

[0199] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the obstacle;

[0200] If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the first target obstacle, wherein the first target obstacle is a lateral obstacle of the component;

[0201] If the type of the component is a target component, the connection information of the component is determined according to the first rule.

[0202] Optionally, the first rule includes:

[0203] If the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the first value;

[0204] If there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle;

[0205] If there are two obstacles in the neighborhood of a component, the connection information of the component includes: a non-obstacle neighborhood component of the component, a non-obstacle neighborhood component of the obstacle, and direction information of a second target obstacle, wherein the second target obstacle is a lateral obstacle of the component.

[0206] Optionally, the value corresponding to the first row of components is the number of columns of the photovoltaic array to be connected, the value corresponding to the last row of components is the opposite of the number of columns of the photovoltaic array to be connected, the value corresponding to the first column of components is the second value, and the value corresponding to the last column of components is the opposite of the second value.

[0207] Optionally, the generation module is specifically used to:

[0208] Acquire a first starting point component, wherein the first starting point component includes: at least one component in the photovoltaic array to be stringed together, a component at a corner point of the photovoltaic array to be stringed together, and at least one component in a neighborhood of an obstacle in the photovoltaic array to be stringed together;

[0209] generating a first string line path according to the first starting point component, the number of components in each string, and the path search tree;

[0210] Determine the Nth starting point component of the N+1th string path according to the neighboring components of the first component and / or the neighboring components of the last component of the first N string paths, where N=1, 2, ..., M-1, and M is the number of target strings;

[0211] An Nth string line path is generated according to the Nth starting point component, the number of components in each string, and the path search tree.

[0212] Optionally, the generation module is specifically used to:

[0213] Determine the initial forward direction of the Nth string path to be leftward with the Nth starting point component as the starting point or rightward with the Nth starting point component as the starting point;

[0214] If there is an obstacle in the forward direction, the branch path and branch point are determined according to the connection information of the adjacent components of the obstacle;

[0215] Determine the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point;

[0216] The Nth string line path is generated according to the forward direction of the path after the branch point, the number of components in each string, and the path search tree.

[0217] Optionally, the generation module is specifically used to:

[0218] If the path before the branch point and the path after the branch point are adjacent rows or are separated by an even number of rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point;

[0219] If the path before the branch point and the path after the branch point are separated by an odd number of rows, the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point.

[0220] The above-mentioned product can execute the method provided by any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0221] The technical solution of this embodiment constructs a path search tree according to the coordinate information of the photovoltaic array to be stringed and the number of columns of the photovoltaic array to be stringed; then generates a target stringing path according to the path search tree, the target number of strings and the number of components in each string, which solves the problems faced in the component stringing process, such as many path combinations, large amount of calculation, time-consuming calculation process and output path not meeting actual business rules, greatly improves the efficiency of the algorithm and improves the output effect of the optimal path.

[0222] Embodiment 3

[0223] Fig. 9 A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0224] like Fig. 9As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0225] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0226] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as a string path determination method.

[0227] In some embodiments, the string line path determination method can be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the string line path determination method described above can be performed. Alternatively, in other embodiments, the processor 11 can be configured to perform the string line path determination method in any other appropriate manner (for example, by means of firmware).

[0228] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0229] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0230] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0231] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0232] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0233] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0234] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0235] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for determining a string path, characterized in that: include: Obtaining coordinate information of a photovoltaic array to be connected in series, the number of columns of the photovoltaic array to be connected in series, the number of target strings, and the number of components in each string; Constructing a path search tree according to the coordinate information of the photovoltaic array to be connected and the number of columns of the photovoltaic array to be connected; Generate a target string line path according to the path search tree, the target number of strings, and the number of components in each string; Generating a target string line path according to the path search tree, the target number of strings, and the number of components in each string, including: Acquire a first starting point component, wherein the first starting point component includes: at least one component in the photovoltaic array to be stringed together, a component at a corner point of the photovoltaic array to be stringed together, and at least one component in a neighborhood of an obstacle in the photovoltaic array to be stringed together; generating a first string line path according to the first starting point component, the number of components in each string, and the path search tree; Determine the Nth starting point component of the N+1th string path according to the neighboring components of the first component and / or the neighboring components of the last component of the first N string paths, where N=1, 2, ..., M-1, and M is the number of target strings; An Nth string line path is generated according to the Nth starting point component, the number of components in each string, and the path search tree.

2. The method according to claim 1, characterized in that A path search tree is constructed according to the coordinate information of the photovoltaic array to be connected in series, the number of rows of the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series, including: Determine the connection information of each component in the photovoltaic array to be connected in series according to the coordinate information of the photovoltaic array to be connected in series and the number of columns of the photovoltaic array to be connected in series; Build a path search tree based on the connection information of each component.

3. The method according to claim 2, characterized in that Determining connection information of each component in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together and the number of columns of the photovoltaic array to be stringed together includes: Determine the type of each component in the photovoltaic array to be stringed together and obstacle information in the photovoltaic array to be stringed together according to the coordinate information of the photovoltaic array to be stringed together; The connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series.

4. The method according to claim 3, characterized in that The types of components include: first row components, first column components, last row components, last column components and target components, wherein the target component is not a first row component, a first column component, a last row component and a last column component, the first row components do not include: the first component of the first row and the last component of the first row, and the last row components do not include: the first component of the last row and the last component of the last row; Accordingly, the connection information of each component is determined according to the type of each component, the obstacle information in the photovoltaic array to be connected in series, and the number of columns of the photovoltaic array to be connected in series, including: If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the value corresponding to the type of the component; If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the obstacle; If the type of the component is any one of the first row component, the last row component, the first column component and the last column component, and there are two obstacles in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighboring component of the component, the non-obstacle neighboring component of the obstacle and the direction information of the first target obstacle, wherein the first target obstacle is a lateral obstacle of the component; If the type of the component is a target component, the connection information of the component is determined according to the first rule.

5. The method according to claim 4, characterized in that The first rule includes: If the neighborhood of the component is not an obstacle, the connection information of the component includes: the neighborhood component of the component and the first value; If there is an obstacle in the neighborhood of the component, the connection information of the component includes: the non-obstacle neighborhood component of the component, the non-obstacle neighborhood component of the obstacle, and the direction information of the obstacle; If there are two obstacles in the neighborhood of a component, the connection information of the component includes: a non-obstacle neighborhood component of the component, a non-obstacle neighborhood component of the obstacle, and direction information of a second target obstacle, wherein the second target obstacle is a lateral obstacle of the component.

6. The method according to claim 4, characterized in that The value corresponding to the first row of components is the number of columns of the photovoltaic array to be connected, the value corresponding to the last row of components is the opposite of the number of columns of the photovoltaic array to be connected, the value corresponding to the first column of components is the second value, and the value corresponding to the last column of components is the opposite of the second value.

7. The method according to claim 1, characterized in that Generating an Nth string line path according to the Nth starting point component, the number of components in each string, and the path search tree, including: Determine the initial forward direction of the Nth string path to be leftward with the Nth starting point component as the starting point or rightward with the Nth starting point component as the starting point; If there is an obstacle in the forward direction, the branch path and branch point are determined according to the connection information of the adjacent components of the obstacle; Determine the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point; The Nth string line path is generated according to the forward direction of the path after the branch point, the number of components in each string, and the path search tree.

8. The method according to claim 7, characterized in that Determining the forward direction of the path after the branch point according to the initial forward direction of the Nth string path, the branch path and the branch point, includes: If the path before the branch point and the path after the branch point are adjacent rows or are separated by an even number of rows, the forward direction of the path after the branch point is determined to be the opposite direction of the forward direction of the path before the branch point; If the path before the branch point and the path after the branch point are separated by an odd number of rows, the forward direction of the path after the branch point is determined to be the forward direction of the path before the branch point.

9. A device for determining a string path, characterized in that: include: An acquisition module is used to acquire coordinate information of a photovoltaic array to be connected in series, the number of columns of the photovoltaic array to be connected in series, the number of target strings, and the number of components in each string; A construction module, used for constructing a path search tree according to the coordinate information of the photovoltaic array to be stringed and the number of columns of the photovoltaic array to be stringed; A generating module, used for generating a target string line path according to the path search tree, the target number of strings and the number of components in each string; The generation module is specifically used for: Acquire a first starting point component, wherein the first starting point component includes: at least one component in the photovoltaic array to be stringed together, a component at a corner point of the photovoltaic array to be stringed together, and at least one component in a neighborhood of an obstacle in the photovoltaic array to be stringed together; generating a first string line path according to the first starting point component, the number of components in each string, and the path search tree; Determine the Nth starting point component of the N+1th string path according to the neighboring components of the first component and / or the neighboring components of the last component of the first N string paths, where N=1, 2, ..., M-1, and M is the number of target strings; An Nth string line path is generated according to the Nth starting point component, the number of components in each string, and the path search tree.

10. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can perform the string line path determination method according to any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the string line path determination method according to any one of claims 1 to 8 when executed.

Images