A photovoltaic string coding method based on the minimum geometric coefficient benchmark method

By using the minimum geometric coefficient benchmark method, the number of photovoltaic strings is automatically determined and encoded, which solves the problem of low encoding efficiency of photovoltaic strings on irregularly arranged supports, realizes fast and automatic encoding drawing, and reduces labor costs.

CN117390717BActive Publication Date: 2026-11-10POWERCHINA HEBEI ELECTRIC POWER SURVEY & DESIGN INST CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202311221319.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-09-21
Publication Date
2026-11-10
Estimated Expiration
2043-09-21

AI Technical Summary

Technical Problem

In existing technologies, the automatic coding of photovoltaic strings on irregularly arranged photovoltaic supports is inefficient, resulting in a large workload and high labor costs for manual design.

Method used

The minimum geometric coefficient benchmark method is adopted. By obtaining the coordinates of the feature points of the photovoltaic support elements, the minimum geometric coefficient is calculated to determine the number of photovoltaic strings, and the encoding and drawing are performed according to the sorting results.

Benefits of technology

It enables rapid and automatic encoding of photovoltaic strings on irregularly arranged photovoltaic supports, improving design efficiency and reducing labor costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117390717B_ABST
    Figure CN117390717B_ABST
Patent Text Reader

Abstract

This invention discloses a photovoltaic string coding method based on the minimum geometric coefficient benchmark method, belonging to the field of photovoltaic design technology. The method includes selecting the range L of the photovoltaic support structure to be coded in CAD, sorting L by coordinates to set the minimum number of strings C required for the photovoltaic support structure, and then calculating the relative minimum geometric coefficient G. min Through the geometric coefficients G and G of the photovoltaic support min The ratio relationship determines the number of strings, and the strings are encoded and drawn. This invention enables rapid encoding of photovoltaic strings, greatly improves work efficiency, and provides strong support for the design of practical engineering projects.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of photovoltaic design technology, and in particular to a photovoltaic string coding method based on the minimum geometric coefficient benchmark method. Background Technology

[0002] With the continuous and in-depth advancement of national new energy construction, an increasing number of photovoltaic power generation systems need to be built. In photovoltaic design, CAD is typically used to draw photovoltaic strings. During the drawing process, different numbers of photovoltaic strings need to be drawn according to the size of the photovoltaic support structure, and these strings need to be coded. However, the drawings usually show a large number of photovoltaic support structures, and their arrangement is not necessarily regular. Furthermore, different specifications of photovoltaic support structures can accommodate different numbers of photovoltaic strings, and the placement is not based on a standard multiple relationship. Therefore, manual design is labor-intensive, inefficient, and significantly increases labor costs.

[0003] Document CN 113792614 A discloses a method for matching the position and numbering of photovoltaic array string components. Based on CAD drawings, it matches the actual visible light photovoltaic area to the string components, then identifies the string numbers and DC combiner box numbers, and matches them to the visible light image. This improves the efficiency of on-site personnel in inspection and maintenance and saves time spent matching strings one by one according to drawings. It solves the problem of matching the codes on CAD drawings with the actual photovoltaic string codes. However, it cannot effectively solve the problem of automatically and effectively encoding several photovoltaic strings on the photovoltaic support on the CAD drawings. Therefore, there is an urgent need for a method that can automatically and quickly encode and draw photovoltaic strings. Summary of the Invention

[0004] The technical problem to be solved by the present invention is to provide a photovoltaic string encoding method based on the minimum geometric coefficient benchmark method, so as to realize the problem of placing photovoltaic modules on photovoltaic brackets of different specifications in irregularly arranged positions and effectively encoding and drawing them.

[0005] To solve the above-mentioned technical problems, the technical solution adopted by the present invention is: 1. A photovoltaic string coding method based on the minimum geometric coefficient benchmark method, comprising the following steps:

[0006] Step 1: Obtain all photovoltaic support elements that need to be coded in CAD to form a set L;

[0007] Step 2: Extract the feature point coordinates of each photovoltaic support element in L to form a set M, sort the coordinates in M, and obtain the encoding order from the top left corner to the bottom right corner;

[0008] Step 3: Define the number of photovoltaic strings N that can be arranged on the photovoltaic support with the smallest geometric coefficient and the photovoltaic string coding prefix, and calculate the relatively smallest geometric coefficient G in L. min;

[0009] Step 4: Calculate the geometric coefficients G and G of the photovoltaic support system. min The ratio relationship determines the number of photovoltaic strings;

[0010] Step 5: Encode and draw the photovoltaic strings according to the number of photovoltaic strings.

[0011] A further improvement to the technical solution of the present invention is that: step 1 specifically involves obtaining the minimum outer rectangle of all photovoltaic support elements that need to be encoded in CAD to form a set L.

[0012] A further improvement to the technical solution of the present invention is as follows: Step 2 is specifically as follows:

[0013] Step 2.1: Obtain the centroid coordinates (X) of the smallest outer rectangle of each photovoltaic support element. i ,Y i Form a set M;

[0014] Step 2.2: Sort the Y coordinates in M ​​in descending order and the X coordinates in ascending order, and then perform a combined sorting.

[0015] Step 2.3: Use a counter to generate a new sequence number based on the sorting result;

[0016] Step 2.4: Starting from the first photovoltaic support element in the upper left corner, the newly generated sequence numbers are sequentially returned to the corresponding photovoltaic support elements to obtain the coding sequence number of L from the upper left corner to the lower right corner.

[0017] A further improvement to the technical solution of the present invention is as follows: Step 3 is specifically as follows:

[0018] Step 3.1: Set the minimum number of photovoltaic strings N that can be arranged on the photovoltaic support structure;

[0019] Step 3.2: Set the photovoltaic string encoding prefix Q, including photovoltaic array encoding, equipment type, and equipment encoding;

[0020] Step 3.3: Calculate the geometric coefficient G of the minimum outer rectangle of each photovoltaic support element. i This forms the geometric coefficient set G. s ,

[0021] Where C is the perimeter of the smallest outer rectangle of the photovoltaic support element, and S is the area of ​​the smallest outer rectangle of the photovoltaic support element;

[0022] Step 3.4: Find G s The smallest geometric coefficient G t ;

[0023] Step 3.5: Traverse G sFor each element, calculate the deviation. Form the deviation set G ds ;

[0024] Step 3.6: Filter G ds Mid-film deviation G d Photovoltaic support primitives with a value <= 1.1 form a new set of geometric coefficients G. sn ;

[0025] Step 3.7: Obtain the set of geometric coefficients G sn The average of these is the relative minimum geometric coefficient G. min .

[0026] A further improvement to the technical solution of the present invention is as follows: Step 4 is specifically as follows:

[0027] Step 4.1: Traverse each photovoltaic support element in L and calculate the number of photovoltaic strings that need to be arranged for each photovoltaic support element: T = N + R - 1; R = ceil(G i ÷G min ), ceil represents rounding up the decimal.

[0028] A further improvement to the technical solution of the present invention is as follows: Step 5 is specifically as follows:

[0029] Step 5.1: Set the initial value of the photovoltaic string encoding X = 1;

[0030] Step 5.2: Traverse each photovoltaic support element in L, where the number of photovoltaic support elements is N. p Let the counter I = 1;

[0031] Step 5.3: Generate the photovoltaic string code set S of the i-th photovoltaic support element in L. l =

[0032] [concat(Q,X),concat(Q,X+1)……concat(Q,X+T-1)], set S l It contains T photovoltaic string codes, and concat represents concatenating two text segments into one text segment;

[0033] Step 5.4: Encode the photovoltaic string set S l Draw evenly at a suitable position within the minimum outer rectangle of the photovoltaic support;

[0034] Step 5.5: Let X = X + 1;

[0035] Step 5.6: Let I = I + 1, if I ≤ N p If the condition is met, proceed to step 5.3; otherwise, end the process.

[0036] The technological advancements achieved by this invention, due to the adoption of the aforementioned technical solution, are as follows: By setting and introducing a minimum geometric coefficient, the number of photovoltaic strings that can be arranged on photovoltaic support structures of different specifications can be determined more conveniently and quickly, creating a prerequisite for subsequent coding. By fully sorting the coordinates of the feature points of the minimum outer rectangle of each photovoltaic support element, the sorting order can be obtained. Subsequent coding is then performed according to the sorting order, ensuring effective sequential coding and resulting in a highly ordered final sequence code. Attached Figure Description

[0037] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0038] Figure 1 This is a flowchart of the invention;

[0039] Figure 2 This is a schematic diagram of the photovoltaic support structure of the present invention;

[0040] Figure 3 This is a diagram illustrating the effect of drawing the photovoltaic support string encoding of the present invention; Detailed Implementation

[0041] The present invention will be further described in detail below with reference to embodiments:

[0042] like Figure 1 The diagram shown is a flowchart of the present invention, which specifically includes the following steps:

[0043] Step 1: In such Figure 2 Obtain all photovoltaic bracket elements that need to be coded from the CAD file shown. Specifically, the set L is formed by the minimum outer rectangle of each of the 32 photovoltaic bracket elements.

[0044] Step 2: Extract the feature point coordinates of each photovoltaic support element in L to form a set M, sort the coordinates in M, and obtain the encoding order from the top left corner to the bottom right corner;

[0045] Step 2.1: Obtain the centroid coordinates (X) of the smallest outer rectangle of each photovoltaic support element. i ,Y i Form a set M;

[0046] Step 2.2: Sort the Y coordinates in M ​​in descending order and the X coordinates in ascending order, and then perform a combined sorting.

[0047] Step 2.3: Use a counter to generate a new sequence number based on the sorting result;

[0048] Step 2.4: Starting from the first photovoltaic support element in the upper left corner, the newly generated sequence numbers are sequentially returned to the corresponding photovoltaic support elements to obtain the coding sequence number of L from the upper left corner to the lower right corner.

[0049] Step 3: Define the number of photovoltaic strings N that can be arranged on the photovoltaic support with the smallest geometric coefficient and the photovoltaic string coding prefix, and calculate the relatively smallest geometric coefficient G in L. min ;

[0050] Step 3.1: Set the minimum number of photovoltaic strings N that can be arranged on the photovoltaic support structure. In this embodiment, N = 1.

[0051] Step 3.2: Set the photovoltaic string encoding prefix Q, including the photovoltaic array code, equipment type, equipment code, and equipment indicating whether it is a DC combiner box or a centralized inverter; the format is like E01·NB01·, where E01 represents photovoltaic array number 01 and NB01 represents inverter number 01; in this embodiment, the specific format of Q is "E01-NB·1-ZC·".

[0052] Step 3.3: Calculate the geometric coefficient G of the minimum outer rectangle of each photovoltaic support element. i This forms the geometric coefficient set G. s ,

[0053] Where C is the perimeter of the smallest outer rectangle of the photovoltaic support element, and S is the area of ​​the smallest outer rectangle of the photovoltaic support element;

[0054] Step 3.4: Find G s The smallest geometric coefficient G t ;

[0055] Step 3.5: Traverse G s For each element, calculate the deviation. Form the deviation set G ds ;

[0056] Step 3.6: Filter G ds Mid-film deviation G d Photovoltaic support primitives with a value <= 1.1 form a new set of geometric coefficients G. sn ;

[0057] Step 3.7: Obtain the set of geometric coefficients G sn The average of these is the relative minimum geometric coefficient G. min In this embodiment, the relative minimum geometric coefficient G of the photovoltaic support is obtained. min =158.52;

[0058] Step 4: Calculate the geometric coefficients G and G of the photovoltaic support system.min The ratio relationship determines the number of photovoltaic strings;

[0059] Step 4.1: Traverse each photovoltaic support element in L and calculate the number of photovoltaic strings that need to be arranged for each photovoltaic support element: T = N + R - 1; R = ceil(G i ÷G min ), ceil represents rounding up the decimal; in this embodiment, the area of ​​each photovoltaic bracket is calculated sequentially and then compared with G. min The ratio R is 1 for all of them except for the three in the lower right corner where R = 2. Therefore, the three photovoltaic brackets in the lower right corner contain two photovoltaic string codes, while the other photovoltaic brackets contain only one photovoltaic string code.

[0060] Step 5: Encode and draw the photovoltaic strings according to their number.

[0061] Step 5.1: Set the initial value of the photovoltaic string encoding X = 1;

[0062] Step 5.2: Traverse each photovoltaic support element in L, where the number of photovoltaic support elements is N. p Let the counter I = 1;

[0063] Step 5.3: Generate the photovoltaic string code set S of the i-th photovoltaic support element in L. l =

[0064] [concat(Q,X),concat(Q,X+1)……concat(Q,X+T-1)], set S l It contains T photovoltaic string codes, and concat represents concatenating two text segments into one text segment;

[0065] Step 5.4: Encode the photovoltaic string set S l Draw evenly at a suitable position within the minimum outer rectangle of the photovoltaic support;

[0066] Step 5.5: Let X = X + 1;

[0067] Step 5.6: Let I = I + 1, if I ≤ N p If the condition is met, proceed to step 5.3; otherwise, end the process.

[0068] After the drawing is completed, the photovoltaic string encoding effect is as follows: Figure 3 As shown, this invention enables rapid encoding of photovoltaic strings, greatly improving work efficiency and providing strong support for the design of practical engineering projects.

[0069] The embodiments described above are merely preferred embodiments of the present invention and are not intended to limit the scope of the present invention. Various modifications and improvements made by those skilled in the art to the technical solutions of the present invention without departing from the spirit of the present invention should fall within the protection scope defined by the claims of the present invention.

Claims

1. A photovoltaic string coding method based on the minimum geometric coefficient benchmark method, characterized in that: Includes the following steps: Step 1: Obtain all photovoltaic support elements that need to be coded in CAD to form a set L; Step 1 specifically involves obtaining the minimum bounding rectangles of all photovoltaic support elements that need to be coded in CAD, forming a set L; Step 2: Extract the feature point coordinates of each photovoltaic support element in L to form a set M, sort the coordinates in M, and obtain the encoding order from the top left corner to the bottom right corner; Step 2 is detailed below: Step 2.1: Obtain the centroid coordinates (X) of the smallest outer rectangle of each photovoltaic support element. i ,Y i Form a set M; Step 2.2: Sort the Y coordinates in M ​​in descending order and the X coordinates in ascending order, and then perform a combined sorting. Step 2.3: Use a counter to generate a new sequence number based on the sorting result; Step 2.4: Starting from the first photovoltaic support element in the upper left corner, the newly generated sequence numbers are sequentially returned to the corresponding photovoltaic support elements to obtain the coding sequence number of L from the upper left corner to the lower right corner; Step 3: Define the number of photovoltaic strings N that can be arranged on the photovoltaic support with the smallest geometric coefficient and the photovoltaic string coding prefix, and calculate the relatively smallest geometric coefficient G in L. min ; Step 3 is detailed below: Step 3.1: Set the minimum number of photovoltaic strings N that can be installed on the photovoltaic support structure; Step 3.2: Set the photovoltaic string encoding prefix Q, including photovoltaic array encoding, equipment type, and equipment encoding; Step 3.3: Calculate the geometric coefficient G of the minimum outer rectangle of each photovoltaic support element. i This forms the geometric coefficient set G. s , Where C is the perimeter of the smallest outer rectangle of the photovoltaic support element, and S is the area of ​​the smallest outer rectangle of the photovoltaic support element; Step 3.4: Find G s The smallest geometric coefficient G t ; Step 3.5: Traverse G s For each element, calculate the deviation. This forms the deviation set G. ds ; Step 3.6: Filter G ds Mid-film deviation G d Photovoltaic support primitives with a value <= 1.1 form a new set of geometric coefficients G. sn ; Step 3.7: Obtain the set of geometric coefficients G sn The average of these is the relative minimum geometric coefficient G. min ; Step 4: Calculate the geometric coefficients G and G of the photovoltaic support system. min The ratio relationship determines the number of photovoltaic strings; Step 4 is detailed below: Step 4.1: Traverse each photovoltaic support element in L and calculate the number of photovoltaic strings that need to be arranged for each photovoltaic support element, T=N+R-1; ,ceil means rounding the decimal up; Step 5: Encode and draw the photovoltaic strings according to the number of photovoltaic strings; Step 5 is detailed below: Step 5.1: Set the initial value of the photovoltaic string encoding to X=1; Step 5.2: Traverse each photovoltaic support element in L, where the number of photovoltaic support elements is N. p Let counter I = 1; Step 5.3: Generate the photovoltaic string code set S of the i-th photovoltaic support element in L. l = [concat(Q,X),concat(Q,X+1)……concat(Q,X+T-1)], set S l It contains T photovoltaic string codes, and concat represents concatenating two text segments into one text segment; Step 5.4: Encode the photovoltaic string set S l Draw evenly at a suitable position within the minimum outer rectangle of the photovoltaic support; Step 5.5: Let X = X + 1; Step 5.6: Let I = I + 1. If I ≤ N p If the condition is met, proceed to step 5.3; otherwise, end the process.

Citation Information

Patent Citations

  • Photovoltaic array string assembly position matching and serial number identification method

    CN113792614A

  • Photovoltaic panel arrangement method based on maximum common divisor grid division

    CN115618536A