A method, apparatus, device and storage medium for determining a serial line path

Abstract

The application discloses a kind of string line path determination method, device, equipment and storage medium.The method comprises: obtaining the component coordinates and component coding in at least two photovoltaic square arrays to be wired;Determine the connection point coding corresponding to the corner point coding in each photovoltaic square array to be wired according to the component coordinates and component coding in at least two photovoltaic square arrays to be wired, wherein the connection point coding and the corner point coding belong to different photovoltaic square arrays to be wired;According to the connection point coding corresponding to the corner point coding in each photovoltaic square array to be wired and the neighborhood component coding corresponding to each component coding in each photovoltaic square array to be wired, generate target string line path, through the technical scheme of the application, it can meet the scene demand of multiple photovoltaic square arrays of any distribution in actual project, so that string line algorithm has better universality.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method, apparatus, device and storage medium for determining a serial line path. Background Technology

[0002] In photovoltaic (PV) projects, wiring the modules is a crucial step. Existing methods for wiring PV modules mostly involve manual wiring or wiring methods specific to a single PV array. These existing methods suffer from the following problems:

[0003] Manual wiring is not only time-consuming and labor-intensive, but also, from a cost perspective, the wiring results are not optimal.

[0004] The stringing method for a single photovoltaic array cannot meet the needs of complex scenarios. For example, if there are multiple photovoltaic arrays in the project and the coordinate relationships between the multiple photovoltaic arrays are not strictly aligned, then stringing can not be performed by stringing within a single photovoltaic array. Summary of the Invention

[0005] This invention provides a method, apparatus, device, and storage medium for determining a wiring path, which can meet the needs of arbitrarily distributed multi-photovoltaic array scenarios in actual projects, and make the wiring algorithm more universal.

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

[0007] Obtain the component coordinates and component codes of at least two photovoltaic arrays to be strung together;

[0008] The connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the component coordinates and component codes in at least two photovoltaic arrays to be strung, wherein the connection point code and the corner code belong to different photovoltaic arrays to be strung.

[0009] The target stringing path is generated based on the connection point code corresponding to the corner code in each photovoltaic array to be strung and the neighboring component code corresponding to the component code in each photovoltaic array to be strung.

[0010] According to another aspect of the present invention, a wired path determination apparatus is provided, the wired path determination apparatus comprising:

[0011] The acquisition module is used to acquire the component coordinates and component codes of at least two photovoltaic arrays to be strung together;

[0012] A connection point coding determination module is used to determine the connection point coding corresponding to the corner coding in each photovoltaic array to be strung together based on the component coordinates and component coding in at least two photovoltaic arrays to be strung together, wherein the connection point coding and the corner coding belong to different photovoltaic arrays to be strung together;

[0013] The path generation module is used to generate the target stringing path based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung.

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

[0015] At least one processor; and

[0016] A memory communicatively connected to the at least one processor; wherein,

[0017] The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the wire path determination method according to any embodiment of the present invention.

[0018] According to another aspect of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the wire path determination method according to any embodiment of the present invention.

[0019] This invention obtains the component coordinates and component codes of at least two photovoltaic arrays to be strung together; determines the connection point code corresponding to the corner code in each photovoltaic array to be strung together based on the component coordinates and component codes of the at least two photovoltaic arrays to be strung together, wherein the connection point code and the corner code belong to different photovoltaic arrays to be strung together; and generates a target stringing path based on the connection point code corresponding to the corner code in each photovoltaic array to be strung together and the neighboring component code corresponding to each component code in each photovoltaic array to be strung together. This can meet the needs of arbitrarily distributed multi-photovoltaic array scenarios in actual projects, making the stringing algorithm more universal.

[0020] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0021] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0022] Figure 1 This is a flowchart of a method for determining a wire path in an embodiment of the present invention;

[0023] Figure 2 This is a schematic diagram of the photovoltaic array A to be connected in series in an embodiment of the present invention;

[0024] Figure 3 This is a schematic diagram of photovoltaic array A and photovoltaic array B to be connected in series in an embodiment of the present invention;

[0025] Figure 4 This is a schematic diagram of a multi-square array in an embodiment of the present invention;

[0026] Figure 5 This is a schematic diagram of the corner distance matrix in an embodiment of the present invention;

[0027] Figure 6 This is a schematic diagram of the structure of a wire path determination device according to an embodiment of the present invention;

[0028] Figure 7 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present invention. Detailed Implementation

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

[0030] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0031] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure in an appropriate manner in accordance with relevant laws and regulations, and user authorization should be obtained.

[0032] Example 1

[0033] Figure 1 This is a flowchart illustrating a string path determination method provided in an embodiment of the present invention. This embodiment is applicable to situations where components in at least two photovoltaic arrays are connected in series. The method can be executed by the string path determination device in this embodiment, which can be implemented in software and / or hardware, such as... Figure 1 As shown, the method specifically includes the following steps:

[0034] S110, obtain the component coordinates and component codes of at least two photovoltaic arrays to be connected in series.

[0035] It should be noted that the embodiments of the present invention are applicable to the case of connecting at least two photovoltaic arrays to be connected in series.

[0036] Wherein, the component coordinates in the at least two photovoltaic arrays to be strung together are the coordinates of each component in the at least two photovoltaic arrays to be strung together. The component codes in the at least two photovoltaic arrays to be strung together are the codes of each component in the at least two photovoltaic arrays to be strung together.

[0037] In a specific example, such as Figure 2As shown, the component codes in the photovoltaic array A to be connected in series include: 0, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, and 0. Each component code corresponds to a coordinate. For example, the component with code 102 corresponds to the coordinates (P, Q). The coordinates of the other components are not described here.

[0038] S120, determine the connection point code corresponding to the corner code in each photovoltaic array to be strung, based on the component coordinates and component codes in at least two photovoltaic arrays to be strung.

[0039] The connection point code and the corner code belong to different photovoltaic arrays to be strung together. For example, if the corner code belongs to photovoltaic array A to be strung together, then the connection point code can be the code corresponding to the component connected to the corner code in photovoltaic array B to be strung together.

[0040] Specifically, the method for determining the connection point code corresponding to the corner code in each photovoltaic array to be strung can be as follows: determine the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung, and determine the connection point code corresponding to the corner code in each photovoltaic array to be strung based on the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Another method for determining the connection point code corresponding to the corner code in each photovoltaic array to be strung, based on the component coordinates and component codes in at least two photovoltaic arrays to be strung, is as follows: First, determine the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Second, determine the corner code matrix corresponding to at least two photovoltaic arrays to be strung, based on the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Third, determine the connection point code corresponding to the corner code in each photovoltaic array to be strung, based on the corner code matrix corresponding to at least two photovoltaic arrays to be strung and the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Another method for determining the connection point code corresponding to the corner code in each photovoltaic array to be strung, based on the component coordinates and component codes in at least two photovoltaic arrays to be strung, is as follows: First, determine the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Second, determine the corner code matrix corresponding to at least two photovoltaic arrays to be strung, based on the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Third, determine the corner distance matrix based on the corner code matrix and the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung. Finally, determine the connection point code corresponding to the corner code in each photovoltaic array to be strung, based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung.

[0041] In a specific example, such as Figure 3 As shown, the component code 201 in the photovoltaic array B to be connected is the connection point code of the corner code 105 in the photovoltaic array A to be connected.

[0042] S130, generate the target stringing path based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung.

[0043] The target wiring path includes: the wiring path within a single photovoltaic array and the wiring path between two photovoltaic arrays.

[0044] It should be noted that during the wiring process, a single photovoltaic array is first wired according to the neighboring component codes corresponding to the component codes in each photovoltaic array to be wired, thus obtaining the wiring path within the single photovoltaic array; when all components of the current photovoltaic array have been connected, and the number of components in the last string is less than the number of the target string, the connection is made to the possible photovoltaic arrays according to the connection point codes corresponding to the corner codes in each photovoltaic array to be wired, thus completing the wiring path between the two photovoltaic arrays.

[0045] Specifically, the method for generating the target stringing path based on the connection point code corresponding to the corner code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung can be as follows: determine the connection point code corresponding to the corner code in each photovoltaic array to be strung based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung, the component coordinates in at least two photovoltaic arrays to be strung, and the component codes in at least two photovoltaic arrays to be strung.

[0046] Optionally, a target stringing path is generated based on the connection point code corresponding to the corner code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung, including:

[0047] Get the number of target strings and the number of components corresponding to each target string;

[0048] The target stringing path is generated based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung, the neighbor component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string.

[0049] The target string count is the total number of strings corresponding to at least two photovoltaic arrays to be strung together. For example, if the target string count is 6, then 6 target stringing paths need to be generated.

[0050] The number of components corresponding to each target string can be the same or different. This embodiment of the invention does not limit this. For example, if the number of target strings is 3, including string 1, string 2 and string 3, the number of components corresponding to string 1 is A, the number of components corresponding to string 2 is B, and the number of components corresponding to string 3 is C.

[0051] Specifically, the method for generating the target stringing path based on the connection point code corresponding to the corner code in each photovoltaic array to be strung, the neighboring component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string can be as follows: string the components in a single photovoltaic array according to the neighboring component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string to obtain the stringing path in a single photovoltaic array; and determine the stringing path between two photovoltaic arrays based on the connection point code corresponding to the corner code in each photovoltaic array to be strung, the neighboring component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string.

[0052] Optionally, the connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the component coordinates and component codes in at least two photovoltaic arrays to be strung, including:

[0053] The corner point coding matrix is ​​determined based on the component coding of at least two photovoltaic arrays to be strung together;

[0054] The connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the corner code matrix corresponding to at least two photovoltaic arrays to be strung, the component coordinates in at least two photovoltaic arrays to be strung, and the component codes in at least two photovoltaic arrays to be strung.

[0055] Specifically, the method for determining the corner code matrix corresponding to at least two photovoltaic arrays to be strung together, based on the component codes in at least two arrays, is as follows: The code corresponding to the first component in the first row of the photovoltaic array to be strung together is determined as the corner code; the code corresponding to the last component in the first row of the photovoltaic array to be strung together is determined as the corner code; the code corresponding to the first component in the last row of the photovoltaic array to be strung together is determined as the corner code; and the code corresponding to the last component in the last row of the photovoltaic array to be strung together is determined as the corner code. A corner code matrix is ​​then generated based on these corner codes. It should be noted that each photovoltaic array to be strung together has four corners (except for single-row or single-column photovoltaic arrays).

[0056] In a specific example, such as Figure 3 As shown, the corner point encoding matrix corresponding to the photovoltaic array A to be strung together is: [102, 105, 121, 124], and the corner point encoding matrix corresponding to the photovoltaic array B to be strung together is: [201, 204, 213, 216].

[0057] Specifically, the method for determining the connection point code corresponding to the corner code of each photovoltaic array to be strung together, based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together, can be as follows: determine the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together, based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together; determine the connection point code corresponding to the corner code of each photovoltaic array to be strung together, based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together.

[0058] Optionally, the connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung, the component coordinates in at least two photovoltaic arrays to be strung, and the component codes in at least two photovoltaic arrays to be strung, including:

[0059] The corner distance matrix corresponding to at least two photovoltaic arrays to be strung together is determined based on the corner point coding matrix corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together.

[0060] The connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung.

[0061] Specifically, the method for determining the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together, based on the corner point coding matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together, can be as follows: determine the correspondence between the component coordinates and component codes in at least two photovoltaic arrays to be strung together, query the correspondence between the component coordinates and component codes to obtain the component coordinates corresponding to the corner codes in the corner point coding matrix, and determine the distance between two corner points based on the component coordinates corresponding to the corner codes of any two photovoltaic arrays to be strung together.

[0062] Specifically, the method for determining the connection point code corresponding to the corner code in each photovoltaic array to be strung, based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung, can be as follows: the code corresponding to the component whose distance to the component corresponding to the corner code is less than a distance threshold is determined as the connection point code. It should be noted that the corner code and the connection point code corresponding to the corner code belong to different photovoltaic arrays.

[0063] Optionally, a corner distance matrix corresponding to at least two photovoltaic arrays to be strung is determined based on the corner coding matrices corresponding to at least two photovoltaic arrays to be strung, the component coordinates in at least two photovoltaic arrays to be strung, and the component codes in at least two photovoltaic arrays to be strung, including:

[0064] The component coordinates corresponding to each corner code are determined based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together.

[0065] The distance between any two corner points in different photovoltaic arrays to be strung is determined based on the component coordinates corresponding to each corner point code.

[0066] The distance between two corner points in the same photovoltaic array to be strung together is determined as the first value;

[0067] Determine the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together based on the distance between any two corner points in different photovoltaic arrays to be strung together and the distance between two corner points in the same photovoltaic array to be strung together.

[0068] Specifically, the method for determining the component coordinates corresponding to each corner code based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together can be as follows: Determine the relationship between component coordinates and component codes based on the component coordinates in at least two photovoltaic arrays to be strung together and the component codes in at least two photovoltaic arrays to be strung together. Then, query the relationship between component coordinates and component codes based on the corner codes in the corner code matrix to obtain the component coordinates corresponding to the corner code. For example, if the relationship between component coordinates and component codes includes: component code 102 corresponds to component coordinate R, component code 102 corresponds to component coordinate T, component code 105 corresponds to component coordinate Y, component code 106 corresponds to component coordinate K, ..., and if the corner code matrix includes: [102, 105, ...], query the relationship between component coordinates and component codes based on corner code 102 to obtain the component coordinate R corresponding to corner code 102. By querying the relationship between component coordinates and component codes based on corner code 105, the component coordinate Y corresponding to corner code 105 can be obtained. The method for determining the component coordinates corresponding to other corner codes is similar and will not be elaborated here.

[0069] Specifically, the method for determining the distance between any two corner points in different photovoltaic arrays to be strung, based on the component coordinates corresponding to each corner point code, can be as follows: The distance between any two corner points in different photovoltaic arrays to be strung can be calculated using Manhattan distance or straight-line distance. For example, if the coordinates of the components corresponding to two corner point codes are P1(x1,y1) and P2(x2,y2), then the distance between the two corner points is:

[0070] Dist=abs(x1-x2)+abs(y1-y2).

[0071] The first value can be 0 or other set values, and the embodiments of the present invention do not impose any restrictions on this.

[0072] In this matrix, the first row and first column are corner codes, and the remaining rows and columns represent the distances between the component coordinates corresponding to two corner codes. If two corner codes are within the same photovoltaic array, the distance between the component coordinates corresponding to the two corner codes is determined as a first value. This first value can be any value much smaller than or much larger than the distance value; this embodiment of the invention does not impose any restrictions on this. It should be noted that if the first value is any value much smaller than the distance value, then when determining the connection point code corresponding to the corner code, i.e., when calculating the shortest distance, the first value is excluded and not considered.

[0073] In a specific example, such as Figure 4 As shown, Figure 4 The system includes three photovoltaic (PV) arrays to be connected. Within each array, the coordinates of the components are aligned by row and column, but the arrangement of the three arrays is arbitrary, without strict row and column alignment. In this scenario, it's impossible to merge multiple PV arrays into a single array for processing. The corner codes of all the PV arrays to be connected are pre-obtained. The distance between any two corner codes is calculated using the mapping relationship between component codes and component coordinates. Manhattan distance or straight-line distance can be used to calculate the distance between corner codes, and the distance between corner codes within the same array is not calculated. (Because segmented interval coding is used during coding, it is easy to distinguish the codes of the same array). In actual projects, Manhattan distance is usually used to calculate the distance between components corresponding to two corner codes. If the coordinates of components corresponding to two corner codes are P1(x1,y1) and P2(x2,y2), then the distance between the two corner codes is:

[0074] Dist=abs(x1-x2)+abs(y1-y2);

[0075] Calculate the distances between all corner points and construct a corner distance matrix. Corner points with the same matrix number are represented by a distance of 0. This matrix will then have a symmetrical triangular shape. The corner distance matrix in the above example is as follows: Figure 5 As shown.

[0076] Optionally, the connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung, including:

[0077] The set of candidate connection point codes corresponding to the corner point codes in each photovoltaic array to be strung is determined based on the corner point distance matrix corresponding to at least two photovoltaic arrays to be strung.

[0078] If the set of candidate connection point codes corresponding to the first corner point code includes the second corner point code, and the set of candidate connection point codes corresponding to the second corner point code includes the first corner point code, then the second corner point code is determined as the connection point code corresponding to the first corner point code.

[0079] Specifically, the method for determining the set of candidate connection point codes corresponding to the corner codes in each photovoltaic array to be strung can be as follows: Based on the corner distance matrices corresponding to at least two photovoltaic arrays to be strung, determine the set of candidate connection point codes corresponding to components in other photovoltaic arrays to be strung that are less than the distance threshold between them and the components corresponding to the corner codes in each photovoltaic array to be strung.

[0080] Another way to determine the set of candidate connection point codes corresponding to the corner code in each photovoltaic array to be strung is as follows: sort the distance between the current corner code and other corner codes according to the corner distance matrices corresponding to at least two photovoltaic arrays to be strung, from largest to smallest, and determine the set of candidate connection point codes corresponding to the current corner code according to the other corner codes ranked after N.

[0081] Another way to determine the set of candidate connection point codes corresponding to the corner codes in each photovoltaic array to be strung, based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung, is as follows: After sorting the distances between the current corner code and other corner codes, if the corner codes ranked last N are not corner codes in the same photovoltaic array to be strung, then the corner codes ranked last N are determined as the set of candidate connection point codes corresponding to the current corner code; if the corner codes ranked last N are corner codes in the same photovoltaic array to be strung, then the corner code with the smallest distance from the current corner code among the corner codes ranked last N is determined as the set of candidate connection point codes corresponding to the current corner code. It should be noted that if the corner codes ranked in the last N positions include corner codes belonging to the same photovoltaic array to be strung together and corner codes belonging to different photovoltaic arrays to be strung together, then the set of candidate connection point codes corresponding to the current corner code is determined based on the corner code with the smallest distance among the corner codes belonging to the same photovoltaic array to be strung together and the corner codes belonging to different photovoltaic arrays to be strung together.

[0082] Specifically, if the set of candidate connection point codes corresponding to the first corner point code includes the second corner point code, and the set of candidate connection point codes corresponding to the second corner point code includes the first corner point code, then the second corner point code is determined as the connection point code corresponding to the first corner point code. By determining the connection point code in the above way, unreasonable connection relationships can be filtered out.

[0083] In a specific example, first, extract all distances corresponding to each row of corner points, sort them in descending order of distance, and then take the last N corner point codes (N is a positive integer greater than or equal to 1) as possible link points for that corner point; usually, N=2 is sufficient. For example... Figure 5 The last two corner codes corresponding to corner point 102 are 201 and 213. Next, it's determined whether the N corner codes belong to the same photovoltaic array. If they do, the code with the smallest distance is retained; otherwise, all codes are retained. Because in actual projects, the final wiring result needs to minimize the total cable length, the closest point within the same photovoltaic array is chosen when determining the corner connection relationship. For example... Figure 5 Corner point 102 corresponds to the nearest corner points numbered 201 and 213. However, these two corner points belong to the same photovoltaic array, so the connection point code corresponding to corner point 102 is 201. Finally, based on the reciprocity of connection relationships—that is, the connection relationship between two points is mutual, and the connection direction is opposite—irrational connection relationships among the array corner points are filtered out. For example... Figure 5 As shown:

[0084] The two connectable points corresponding to corner code 105 are [201, 204], that is, 105→[201, 204];

[0085] The two connectable points corresponding to corner code 102 are [201, 213], that is, 102→[201, 213];

[0086] The two connectable points corresponding to corner code 201 are [105, 124], that is, 201→[105, 124]; Figure 5 In the diagram, corner code 102 and corner code 105 can both be connected to corner code 201, but corner code 201 is only connected to corner code 105. Therefore, unreasonable connection relationship 102→201 can be filtered out. Similarly, unreasonable connection relationship 121→204 can be filtered out.

[0087] It should be noted that by following the above steps, a table of corner connection relationships between photovoltaic arrays can be established, thereby determining the connection relationships between photovoltaic arrays.

[0088] Optionally, a set of candidate connection point codes corresponding to the corner codes in each photovoltaic array to be strung is determined based on the corner distance matrices corresponding to at least two photovoltaic arrays to be strung, including:

[0089] Determine at least two other corner codes whose distances to the current corner code satisfy preset conditions based on the corner distance matrices corresponding to at least two photovoltaic arrays to be strung together;

[0090] Obtain the target corner code that has the smallest distance from the current corner code among the other corner code belonging to the same photovoltaic array to be strung;

[0091] Based on the target corner code and the other corner codes belonging to different photovoltaic arrays to be strung together, a set of candidate connection point codes corresponding to the current corner code is generated.

[0092] Among them, the codes of at least two other corner points that meet the preset conditions can be: the codes of at least two other corner points whose distance is less than the distance threshold; the codes of at least two other corner points that meet the preset conditions can also be: the codes of the last N corner points after sorting in descending order of distance; the codes of at least two other corner points that meet the preset conditions can also be: the codes of the first N corner points after sorting in ascending order of distance.

[0093] It should be noted that if at least two other corner point codes include: corner point codes belonging to the same photovoltaic array to be strung and corner point codes belonging to different photovoltaic arrays to be strung, then the set of candidate connection point codes corresponding to the current corner point code is generated based on the target corner point code with the smallest distance from the current corner point code among the other corner point codes belonging to the same photovoltaic array to be strung and the other corner point codes belonging to different photovoltaic arrays to be strung.

[0094] Optionally, a target stringing path is generated based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung, the neighboring component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string, including:

[0095] If the number of unconnected components in the photovoltaic array to be connected is greater than or equal to the number of components corresponding to the target string, then the connection path corresponding to the target string is determined according to the neighboring component codes corresponding to the component codes of each component in the photovoltaic array to be connected.

[0096] If the number of unconnected components in the photovoltaic array to be connected is less than the number of components corresponding to the target string, then the connection path corresponding to the target string is determined according to the connection point code corresponding to the corner code of each photovoltaic array to be connected and the neighboring component code corresponding to the component code of each component in the photovoltaic array to be connected.

[0097] Specifically, if the number of unconnected components in the photovoltaic array to be connected is greater than or equal to the number of components corresponding to the target string, the connection information of each component in the photovoltaic array to be connected can be determined based on the neighboring component codes corresponding to the codes of each component in the photovoltaic array to be connected. The connection path corresponding to the target string can be generated based on the connection information of each component in the photovoltaic array to be connected and the number of components corresponding to the target string.

[0098] Specifically, if the number of unconnected components in the photovoltaic array to be connected is less than the number of components corresponding to the target string, the connection path corresponding to the target string can be determined by the connection point code corresponding to the corner code of each photovoltaic array to be connected and the neighbor component code corresponding to the component code of each component in the photovoltaic array to be connected. If the number of unconnected components in the photovoltaic array to be connected is less than the number of components corresponding to the target string, the target adjacent photovoltaic arrays are connected according to the connection point code corresponding to the corner code of each photovoltaic array to be connected (the target adjacent photovoltaic array is the photovoltaic array to be connected to the connection point code). Then, the connection path corresponding to the target string is generated according to the number of components corresponding to the target string and the neighbor component code corresponding to the component code of each component in the target adjacent photovoltaic array.

[0099] It should be noted that a corner code connection relationship table for photovoltaic arrays can be established based on the connection point codes corresponding to the corner codes. During the stringing algorithm, the stringing path between different photovoltaic arrays is determined through the corner code connection relationship table.

[0100] Optionally, the stringing path corresponding to the target string is determined based on the neighboring component codes corresponding to each component code in the photovoltaic array to be strung, including:

[0101] Obtain the starting component code of the first array, wherein the starting component code of the first array includes at least one of the following: at least one component code in the photovoltaic array to be strung together, the component code of the corner position of the photovoltaic array to be strung together, the neighbor component code of the first component of the previous strung path, and the neighbor component code of the last component of the previous strung path.

[0102] The stringing path corresponding to the target string is generated based on the starting component of the first array, the number of components corresponding to the target string, and the neighboring component codes corresponding to the component codes in each photovoltaic array to be strung.

[0103] It should be noted that if the number of unconnected components in the photovoltaic array to be connected is greater than or equal to the number of components corresponding to the target string, it is considered a connection within a single photovoltaic array. Connection within a single photovoltaic array can be either the first connection or a subsequent connection. If it is the first connection, the starting component of the first array can be the code of at least one component in the photovoltaic array to be connected, or the code of a component at a corner position of the photovoltaic array to be connected. If it is a subsequent connection, the starting component of the first array can be the code of a neighboring component of the first component of the previous connection path, or the code of a neighboring component of the last component of the previous connection path.

[0104] The first array starting point component encoding may also include: the neighboring component encoding of obstacles in the photovoltaic array to be strung.

[0105] Optionally, the stringing path corresponding to the target string is determined based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in the photovoltaic array to be strung, including:

[0106] Obtain the starting component code of the second array, wherein the starting component code of the second array includes at least one of the following: at least one component code in the photovoltaic array to be strung together, the component code of the corner position of the photovoltaic array to be strung together, the neighbor component code of the first component of the previous strung path, and the neighbor component code of the last component of the previous strung path.

[0107] The stringing path corresponding to the target string is determined based on the starting component code of the second array, the number of components corresponding to the target string, the connection point code corresponding to the corner code of each photovoltaic array to be strung, and the neighboring component code corresponding to the component code of each component in the photovoltaic array to be strung.

[0108] If the number of unconnected components in the photovoltaic array to be connected is less than the number of components corresponding to the target string, then it is determined that inter-array connection is required. Inter-array connection can be either the first connection or a subsequent connection. If it is the first connection, the starting component of the second array can be the code of at least one component in the photovoltaic array to be connected, or the code of a component at a corner position of the photovoltaic array to be connected. If it is a subsequent connection, the starting component of the second array can be the code of a neighboring component of the first component of the previous connection path, or the code of a neighboring component of the last component of the previous connection path.

[0109] The second array starting point component encoding may also include: the neighboring component encoding of obstacles in the photovoltaic array to be strung.

[0110] It should be noted that during the wiring process, single square arrays are wired first; when all components of the current square array have been connected, and the number of components in the last string is less than the number of components in the target string, the possible square arrays are connected through the connection relationship table of corner points to complete the wiring path.

[0111] In a specific example, during the execution of the multi-array stringing algorithm, a connection relationship table is generated based on the photovoltaic array where the starting component is located and the neighboring component codes corresponding to each component code in the photovoltaic array to be strung. The stringing path corresponding to all target strings in the current photovoltaic array to be strung is completed by querying the connection relationship table of the component codes in the photovoltaic array to be strung. When the last string needs to be connected to other photovoltaic arrays to be strung, the remaining path is searched and connected by querying the corner code connection relationship table.

[0112] Optionally, a corner coding matrix corresponding to at least two photovoltaic arrays to be strung is determined based on the component codes in at least two photovoltaic arrays to be strung, including:

[0113] The first coding matrix corresponding to each photovoltaic array to be strung is determined based on the component coding in at least two photovoltaic arrays to be strung.

[0114] Obtain the corner code in the first encoding matrix corresponding to each photovoltaic array to be connected in series, wherein the corner code includes: the first non-zero code of the first row, the last non-zero code of the first row, the first non-zero code of the last row, and the last non-zero code of the last row in the first encoding matrix.

[0115] Generate at least two corner coding matrices corresponding to the photovoltaic arrays to be strung together based on the corner coding in the first coding matrix corresponding to each photovoltaic array to be strung together.

[0116] The corner point encoding includes the encoding of each corner point in the photovoltaic array to be strung together, for example, it can be, as shown in the example... Figure 2 As shown, the corner codes include: 102, 105, 121, 124, and the corner code matrix is ​​[102, 105, 121, 124].

[0117] It should be noted that the photovoltaic array to be connected includes modules and non-modules (obstacles). The code corresponding to the non-module is a first value, for example, the code corresponding to the non-module can be zero. When the code corresponding to the non-module is zero, the corner code includes: the first non-zero code of the first row of the first coding matrix, the last non-zero code of the first row, the first non-zero code of the last row, and the last non-zero code of the last row.

[0118] In a specific example, in a multi-array photovoltaic (PV) scenario, the positions of each array are typically quite arbitrary, and the coordinates of components between arrays cannot be strictly aligned row and column. In such arbitrarily arranged multi-array PV scenarios, existing stringing algorithms are clearly insufficient to meet actual business needs. As the complexity of PV industry scenarios increases, arbitrarily arranged distributed multi-array systems will become the main market demand, leading to a corresponding increase in business requirements for this type of scenario. To address these requirements, this invention proposes a stringing algorithm suitable for distributed multi-array PV systems. The specific scheme and steps are as follows:

[0119] Obtain the component coordinates and codes, the number of target strings, and the number of components corresponding to each target string in all photovoltaic arrays to be strung. Within each photovoltaic array, based on the relationship between component coordinates, use a segmented interval coding method to obtain the coding mapping matrix for each array. In each coding mapping matrix, construct the four-neighborhood connectivity relationship for each array, that is, the relationship between the current component code and the codes of connectable components in its surrounding neighborhood. The constructed connectivity relationships are as follows:

[0120] Map k [n] = [n1, n2, ..., n i [,oflag];

[0121] Where k is the current matrix index, n is the current code in the encoding mapping matrix, and n1, n2, ..., n iThe `oflag` is the neighboring component code of component `n`, and `oflag` is the obstacle direction flag within the four neighbors of the current component. After the connection relationship of each photovoltaic array to be connected is established, all connection relationships are merged into one table. If there are N photovoltaic arrays to be connected in the project, the total connection relationship is represented as follows:

[0122]

[0123] It should be noted that the Map contains a set of connection relationships for the component codes within all single photovoltaic arrays, and does not include connection relationships between different photovoltaic arrays. Therefore, the Map mainly reflects the connection relationships of independent photovoltaic arrays. Thus, in a multi-array system, to complete the serial connection of all arrays, it is first necessary to determine the connection relationships between the photovoltaic arrays, also known as the corner connection relationships of the photovoltaic arrays. Determining the corner connection relationships mainly involves the following process:

[0124] (1) Determine the corner points of each photovoltaic array to be connected in series, i.e., the corner point codes in the coding mapping matrix;

[0125] (2) Construct the corner distance matrix: Obtain the actual coordinates of the corner points through the encoding mapping table, and calculate the distance between each corner point based on the actual coordinates;

[0126] (3) Determine the connection relationship between corner points based on the principle of shortest distance.

[0127] By following the steps above, a corner connection table Map_conner can be established, thereby determining the connection relationship between the photovoltaic arrays to be connected in series.

[0128] A corner connection table can be established using the corner distance matrix to connect the photovoltaic arrays to be connected. During the connection algorithm, the connection path between different photovoltaic arrays to be connected is determined using the corner connection table. During the execution of the multi-array connection algorithm, the connection path corresponding to all target strings of the current array is completed using the connection table Map_pos, based on the photovoltaic array to be connected where the starting point is located. When the last string needs to be connected to other photovoltaic arrays to be connected, the remaining path is searched and connected using the corner connection table Map_conner.

[0129] The technical solution of this embodiment obtains the component coordinates and component codes of at least two photovoltaic arrays to be strung together; determines the connection point code corresponding to the corner code of each photovoltaic array to be strung together based on the component coordinates and component codes of the at least two photovoltaic arrays to be strung together, wherein the connection point code and the corner code belong to different photovoltaic arrays to be strung together; and generates a target stringing path based on the connection point code corresponding to the corner code of each photovoltaic array to be strung together and the neighboring component code corresponding to each component code of each photovoltaic array to be strung together. This can meet the needs of arbitrarily distributed multi-photovoltaic array scenarios in actual projects, making the stringing algorithm more universal.

[0130] Example 2

[0131] Figure 6 This is a schematic diagram of a wiring path determination device provided in an embodiment of the present invention. This embodiment is applicable to wiring path determination. The device can be implemented using software and / or hardware, and can be integrated into any device that provides wiring path determination functionality, such as… Figure 6 As shown, the cable path determination device specifically includes: an acquisition module 210, a connection point encoding determination module 220, and a path generation module 230.

[0132] The acquisition module is used to acquire the component coordinates and component codes of at least two photovoltaic arrays to be strung together.

[0133] A connection point coding determination module is used to determine the connection point coding corresponding to the corner coding in each photovoltaic array to be strung together based on the component coordinates and component coding in at least two photovoltaic arrays to be strung together, wherein the connection point coding and the corner coding belong to different photovoltaic arrays to be strung together;

[0134] The path generation module is used to generate the target stringing path based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung.

[0135] The above-described products can perform the methods provided in any embodiment of the present invention, and have the corresponding functional modules and beneficial effects for performing the methods.

[0136] Example 3

[0137] Figure 7A schematic diagram of an electronic device 10 that can be used to implement embodiments 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 processors, cellular phones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0138] like Figure 7 As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 may also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

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

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

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

[0142] Various embodiments 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-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0143] Computer programs used to implement 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, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0144] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0145] To provide interaction with a user, the systems and techniques described herein can 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 pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0146] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or computing systems that include middleware components (e.g., application servers), or computing systems that include frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0147] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0148] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0149] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand 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 this invention should be included within the scope of protection of this invention.

Claims

1. A method for determining a wiring path, characterized in that, include: Obtain the component coordinates and component codes of at least two photovoltaic arrays to be strung together; The connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the component coordinates and component codes in at least two photovoltaic arrays to be strung, wherein the connection point code and the corner code belong to different photovoltaic arrays to be strung. The target stringing path is generated based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung. The step of determining the connection point code corresponding to the corner point code in each photovoltaic array to be strung, based on the component coordinates and component codes in at least two photovoltaic arrays to be strung, includes: Determine the corner point coding matrix corresponding to at least two photovoltaic arrays to be strung together based on the component coding in at least two photovoltaic arrays to be strung together; The corner distance matrix corresponding to at least two photovoltaic arrays to be strung together is determined based on the corner point coding matrix corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together. The connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung.

2. The method according to claim 1, characterized in that, The target stringing path is generated based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung, including: Get the number of target strings and the number of components corresponding to each target string; The target stringing path is generated based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung, the neighbor component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string.

3. The method according to claim 1, characterized in that, Based on the corner point coding matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together, determine the corner point distance matrices corresponding to at least two photovoltaic arrays to be strung together, including: The component coordinates corresponding to each corner code are determined based on the corner code matrices corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component codes in at least two photovoltaic arrays to be strung together. The distance between any two corner points in different photovoltaic arrays to be strung is determined based on the component coordinates corresponding to each corner point code. The distance between two corner points in the same photovoltaic array to be strung together is determined as the first value; Determine the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together based on the distance between any two corner points in different photovoltaic arrays to be strung together and the distance between two corner points in the same photovoltaic array to be strung together.

4. The method according to claim 1, characterized in that, The connection point code corresponding to the corner code in each photovoltaic array to be strung is determined based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung, including: The set of candidate connection point codes corresponding to the corner point codes in each photovoltaic array to be strung is determined based on the corner point distance matrix corresponding to at least two photovoltaic arrays to be strung. If the set of candidate connection point codes corresponding to the first corner point code includes the second corner point code, and the set of candidate connection point codes corresponding to the second corner point code includes the first corner point code, then the second corner point code is determined as the connection point code corresponding to the first corner point code.

5. The method according to claim 4, characterized in that, Based on the corner distance matrices corresponding to at least two photovoltaic arrays to be strung together, determine the set of candidate connection point codes corresponding to the corner codes in each photovoltaic array to be strung together, including: Determine at least two other corner codes whose distances to the current corner code satisfy preset conditions based on the corner distance matrices corresponding to at least two photovoltaic arrays to be strung together; Obtain the target corner code that has the smallest distance from the current corner code among the other corner code belonging to the same photovoltaic array to be strung; Based on the target corner code and the other corner codes belonging to different photovoltaic arrays to be strung together, a set of candidate connection point codes corresponding to the current corner code is generated.

6. The method according to claim 2, characterized in that, The target stringing path is generated based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung, the neighboring component code corresponding to the component code in each photovoltaic array to be strung, the number of target strings, and the number of components corresponding to each target string, including: If the number of unconnected components in the photovoltaic array to be connected is greater than or equal to the number of components corresponding to the target string, then the connection path corresponding to the target string is determined according to the neighboring component codes corresponding to the component codes of each component in the photovoltaic array to be connected. If the number of unconnected components in the photovoltaic array to be connected is less than the number of components corresponding to the target string, then the connection path corresponding to the target string is determined according to the connection point code corresponding to the corner code of each photovoltaic array to be connected and the neighboring component code corresponding to the component code of each component in the photovoltaic array to be connected.

7. The method according to claim 6, characterized in that, The stringing path corresponding to the target string is determined based on the neighboring component codes corresponding to each component code in the photovoltaic array to be strung, including: Obtain the starting component code of the first array, wherein the starting component code of the first array includes at least one of the following: at least one component code in the photovoltaic array to be strung together, the component code of the corner position of the photovoltaic array to be strung together, the neighbor component code of the first component of the previous strung path, and the neighbor component code of the last component of the previous strung path. The stringing path corresponding to the target string is generated based on the starting component of the first array, the number of components corresponding to the target string, and the neighboring component codes corresponding to the component codes in each photovoltaic array to be strung.

8. The method according to claim 6, characterized in that, The stringing path corresponding to the target string is determined based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in the photovoltaic array to be strung, including: Obtain the starting component code of the second array, wherein the starting component code of the second array includes at least one of the following: at least one component code in the photovoltaic array to be strung together, the component code of the corner position of the photovoltaic array to be strung together, the neighbor component code of the first component of the previous strung path, and the neighbor component code of the last component of the previous strung path. The stringing path corresponding to the target string is determined based on the starting component code of the second array, the number of components corresponding to the target string, the connection point code corresponding to the corner code of each photovoltaic array to be strung, and the neighboring component code corresponding to the component code of each component in the photovoltaic array to be strung.

9. The method according to claim 1, characterized in that, Determine the corner point coding matrix corresponding to at least two photovoltaic arrays to be strung together based on the component codes in at least two photovoltaic arrays to be strung together, including: The first coding matrix corresponding to each photovoltaic array to be strung is determined based on the component coding in at least two photovoltaic arrays to be strung. Obtain the corner code in the first encoding matrix corresponding to each photovoltaic array to be connected in series, wherein the corner code includes: the first non-zero code of the first row, the last non-zero code of the first row, the first non-zero code of the last row, and the last non-zero code of the last row in the first encoding matrix. Generate at least two corner coding matrices corresponding to the photovoltaic arrays to be strung together based on the corner coding in the first coding matrix corresponding to each photovoltaic array to be strung together.

10. A device for determining a wiring path, characterized in that, include: The acquisition module is used to acquire the component coordinates and component codes of at least two photovoltaic arrays to be strung together; A connection point coding determination module is used to determine the connection point coding corresponding to the corner coding in each photovoltaic array to be strung together based on the component coordinates and component coding in at least two photovoltaic arrays to be strung together, wherein the connection point coding and the corner coding belong to different photovoltaic arrays to be strung together; The path generation module is used to generate the target stringing path based on the connection point code corresponding to the corner point code in each photovoltaic array to be strung and the neighboring component code corresponding to each component code in each photovoltaic array to be strung. The connection point coding determination module is specifically used for: determining the corner coding matrix corresponding to at least two photovoltaic arrays to be strung together based on the component coding of at least two photovoltaic arrays to be strung together; determining the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together based on the corner coding matrix corresponding to at least two photovoltaic arrays to be strung together, the component coordinates in at least two photovoltaic arrays to be strung together, and the component coding of at least two photovoltaic arrays to be strung together; and determining the connection point coding corresponding to the corner coding of each photovoltaic array to be strung together based on the corner distance matrix corresponding to at least two photovoltaic arrays to be strung together.

11. An electronic device, characterized in that, The electronic device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the wire path determination method according to any one of claims 1-9.

12. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that cause a processor to execute the wire path determination method according to any one of claims 1-9.

Images