Optimization and grouping method for wiring harness data of power distribution cabinet

Abstract

The invention provides a method for optimizing and grouping wire harness data of a power distribution cabinet. The method comprises the following steps: S1, optimizing the wire harness data and dividing the wire harness data into a head part, a skeleton part and a tail part; s2, calculating the length of each wire harness skeleton part, and arranging the wire harness skeleton parts in a descending order according to the skeleton lengths; the wire harness with the longest framework serves as a group head of a first group, the overlapping ratio of the subsequent wire harnesses and the framework part of each group head is calculated in sequence, and large-group division of the wire harnesses is carried out according to the overlapping ratio; s3, rearranging the wire harnesses in each large group according to the length of the overlapped part, and establishing a loss function to determine a minimum unit group; and S4, establishing a matching degree function, calculating the matching degree between the minimum units, combining the maximum values, and continuously iterating until convergence so as to integrate the data to obtain a final grouping result. According to the method, optimization and grouping of the wiring harness data of the power distribution cabinet are realized, data support is provided for manufacturing of prefabricated wiring harness groups on a pinboard drawing, and the feasibility and implementation efficiency of automatic wiring of the power distribution cabinet are greatly improved.

Description

Technical Field

[0001] The present invention relates to the technical field of automated wiring, and in particular to a method for optimizing and grouping wiring harness data of a power distribution cabinet. Background Art

[0002] As the control terminal for power distribution management, the power distribution cabinet appears almost anywhere power is needed as people use power extensively. Such widely used equipment has not yet been fully automated in its production and manufacturing, especially the wiring of the power distribution cabinet, more than 90% of which still needs to be done manually by skilled workers. Therefore, realizing the automated wiring of the power distribution cabinet has always been a hot research topic.

[0003] For the automated wiring of distribution cabinets, one idea is to perform wiring one by one in the cabinet body. This solution has extremely high requirements on the control accuracy of the robot arm and the flexibility of the gripper, so it has not been commercially applied on a large scale. In order to solve the above problems, inspired by cable assembly, a more feasible wiring solution is: changing from traditional wiring in the cabinet to wiring on the nail board (outside the cabinet). Since there is no interference constraint in the internal space of the cabinet, it has better feasibility and research value. However, in order to facilitate transplantation into cabinets, the wire harness needs to be grouped to make a prefabricated wire harness. However, the prior art does not provide a method for implementing wire harness grouping. In view of this, the present invention proposes a method for optimizing and grouping wire harness data. Summary of the invention

[0004] The purpose of the present invention is to propose a method for optimizing and grouping wiring harness data of a distribution cabinet, thereby realizing the optimization and grouping of wiring harness data of a distribution cabinet, providing data support for the production of prefabricated wiring harness groups on a nail board diagram, and greatly improving the feasibility and implementation efficiency of automated wiring of distribution cabinets.

[0005] To achieve the above object, the technical solution of the present invention is: a method for optimizing and grouping wiring harness data of a power distribution cabinet, specifically comprising the following steps:

[0006] S1. Obtaining harness data, removing non-inflection points of the harness data to obtain optimized harness data, and then dividing the harness route into three parts: head, skeleton, and tail;

[0007] S2. Calculate the length of the skeleton part of each harness and arrange them in descending order according to the skeleton length; take the harness with the longest skeleton as the group head of the first group, calculate the overlap rate of the subsequent harnesses with each group head in turn, and divide the harnesses into large groups according to the overlap rate of the harness skeleton part;

[0008] S3, rearrange the wire bundles in each large group according to the length of the overlapping parts, and after the arrangement is completed, establish a loss function to determine the minimum unit group;

[0009] S4. Establish a matching function, calculate the matching degree between each minimum unit, take the maximum value and combine it, iterate continuously until convergence, and integrate the data to obtain the final grouping result.

[0010] Preferably, the optimized wiring harness data is obtained by eliminating non-inflection points of the wiring harness data, specifically: for each path point except the first and last path points in each wiring harness, the difference with the path points before and after it in the three directions of X, Y, and Z axes is calculated, and the size of the change in each axis between the current path point and the path points before and after is compared, and the front and rear path change direction of the current path point is located according to the direction with the largest change; if the front and rear change directions are consistent, it is determined to be a non-inflection point, and the non-inflection point is eliminated to obtain the optimized wiring harness data.

[0011] Preferably, the coordinates of the skeleton parts have the same Z value.

[0012] Preferably, the wiring harness is divided into large groups according to the overlap rate of the wiring harness skeleton part, specifically, the following operations are performed on each wiring harness in the subsequent wiring harness until the division of all subsequent wiring harnesses into large groups is completed: find the group head with the largest overlap rate with the current wiring harness, if the maximum overlap rate meets the set threshold, divide the current wiring harness into the large group corresponding to the group head with the largest overlap rate; if it does not meet the set threshold, divide the current wiring harness into the group head of a new group.

[0013] Preferably, the calculation of the overlap rate of the harness skeleton part is as follows:

[0014]

[0015] Where: l b Indicates the length of the skeleton b to be compared; l ab It represents the length of the overlapped part between the original comparison skeleton a and the skeleton b to be compared.

[0016] Preferably, the length of the overlapped portion between the original comparison skeleton a and the skeleton to be compared b is calculated as follows:

[0017] 1) Divide the original comparison skeleton a and the skeleton to be compared b into k segments according to the coordinate differences, and determine whether the segments overlap;

[0018] 2) If there is overlap, continue to determine whether the points overlap:

[0019] Assume that the coordinates of the left endpoint of the i-th segment of the original comparison skeleton a are a1, and the coordinates of the right endpoint are a2; the coordinates of the left endpoint of the i-th segment of the skeleton to be compared b are b1, and the coordinates of the right endpoint are b2, and calculate a1-b1 and a2-b2 respectively; the length of the original comparison skeleton a in the i-th segment is The length of the skeleton b to be compared in segment i is the overlap length of the two wire bundles in the i-th segment;

[0020] If (a1-b1)(a2-b2)≤0, then compare and length; if any but otherwise

[0021] If (a1-b1)>0 and (a2-b2)>0, then calculate b2-a1; if b2-a1>0, then otherwise

[0022] If (a1-b1)<0 and (a2-b2)<0, then calculate a2-b1; if a2-b1>0, then otherwise

[0023] 3) Calculate the length of the overlap between the original comparison skeleton a and the skeleton to be compared b:

[0024]

[0025] In the formula, n is the number of overlapping segments.

[0026] Preferably, S3 is specifically:

[0027] S31, calculating the length of the overlapping part between the head of each large group and the skeleton of each other harness in the large group, and arranging the remaining harnesses in the group in descending order according to the length of the overlapping part of the skeleton starting from the head of the large group;

[0028] S32. For each large group, the head of the large group is used as the head of the first minimum unit group, and the loss rate of the remaining harnesses arranged in descending order is calculated in turn with the loss rate of the previous harness. If the set threshold is met, the current harness and the previous harness are divided into the same minimum unit group, otherwise the current harness is divided into a new minimum unit group.

[0029] Preferably, the loss function is established as follows:

[0030] Define variables: L0 is the length of the overlapping part of the original comparison wire; L1 is the length of the overlapping part of the wire to be compared; Ax and Ay are the average values ​​of the x and y coordinates of each inflection point of the harness:

[0031]

[0032] Establish the loss function:

[0033] Loss = a1L len (L0,L1)+a2L pos (L0,Ax0,Ax1,Ay0,Ay1) (3)

[0034]

[0035] Among them, j is the inflection point index, m is the number of inflection points, and x j ,y j are the x and y coordinates of the inflection point j, L len Indicates the overlap length loss rate of the two conductors, L pos It represents the position loss rate of the two conductors, a1 and a2 are weight values, Ax0 and Ay0 represent the average values ​​of the x and y coordinates of the inflection points of the original comparison conductor, and Ax1 and Ay1 represent the average values ​​of the x and y coordinates of the inflection points of the conductor to be compared.

[0036] Preferably, the establishment of the matching function is specifically:

[0037] Fit=b1F pos (L0,L1,Ax0,Ax1,Ay0,Ay1)+b2F pot (n')+b3F num (n0,n1) (6)

[0038] Where b1, b2, b3 are weight values, F pos Indicates the position and length matching degree of each unit group:

[0039]

[0040] d=Max(|Ax0-Ax1|,|Ay0-Ay1|) (8)

[0041] F pot Indicates the endpoint matching degree of each unit group, that is, the number of common inflection points:

[0042] F pot =Min(5n',10) (9)

[0043] In the above formula, n' is the number of common inflection points of the two harnesses,

[0044] F num Indicates the number of unit groups matching:

[0045]

[0046] In the above formula, n0 is the number of wire harnesses in the original minimum unit group, n1 is the number of wire harnesses in the minimum unit group to be merged, and s is the preset optimal number of wire harnesses per group.

[0047] Preferably, S4 specifically includes, for each minimum unit group to be matched, performing the following operations to integrate the minimum unit groups until the integration of all minimum units is completed:

[0048] Calculate the matching degree between the current minimum unit group head to be matched and each of the remaining minimum unit group heads according to the matching degree function;

[0049] Select the smallest unit group with the highest matching degree and combine it with the current smallest unit group to be matched to determine whether the number of wiring harnesses after combination reaches s; if not, continue to select the smallest unit group with the highest matching degree among the remaining smallest unit groups for combination until the number of wiring harnesses after combination reaches s, completing the integration of the current smallest unit group to be matched.

[0050] Compared with the prior art, the present invention has the following beneficial effects:

[0051] The present invention realizes the optimization and grouping of the wiring harness data of the power distribution cabinet, provides data support for the production of prefabricated wiring harness groups on the nail board diagram, and greatly improves the feasibility and implementation efficiency of the automatic wiring of the power distribution cabinet. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 It is an original wire harness data diagram in one embodiment of the present invention;

[0053] Figure 2 It is a wiring harness data diagram optimized in one embodiment of the present invention;

[0054] Figure 3 This is an example diagram of descending order arrangement of skeleton lengths in one embodiment of the present invention;

[0055] Figure 4 This is a schematic diagram of the large group division result in one embodiment of the present invention;

[0056] Figure 5 This is a result diagram of the length of the overlapping parts of each group in a large group according to an embodiment of the present invention;

[0057] Figure 6 This is a schematic diagram of the division of the minimum unit groups of group 1 and group 2 in one embodiment of the present invention;

[0058] Figure 7 It is a schematic diagram of the re-combination of the minimum unit groups of group 1 and group 2 in one embodiment of the present invention;

[0059] Figure 8 This is a diagram of the final grouping result in one embodiment of the present invention;

[0060] Fig. 9 The figure is a flowchart of the overall algorithm implementation in one embodiment of the present invention. DETAILED DESCRIPTION

[0061] The following is combined with Figure 1-9 , the technical solution of the present invention is specifically described.

[0062] The present invention proposes a method for optimizing and grouping wiring harness data of a power distribution cabinet, referring to Fig. 9 , including the following detailed steps:

[0063] Step 1: Optimize the wiring harness data processing.

[0064] After obtaining the harness data from the harness design software or CAD software, for each path point in each harness except the first and last path points, calculate the difference between it and the path points before and after it in the three directions of X, Y, and Z axes, compare the size of the change in each axis between the current path point and the path points before and after it, and locate the change direction of the front and rear paths of the current path point according to the direction with the largest change; if the front and rear change directions are the same, it is determined to be a non-inflection point, and the non-inflection point is eliminated to obtain the optimized harness data.

[0065] The harness path is then divided into three parts: the head, the skeleton, and the tail, where the skeleton coordinates have the same Z value and can be viewed as coordinates located in a two-dimensional plane.

[0066] Step 2: Calculate the overlap rate and divide into large groups.

[0067] This step first calculates the length of each harness skeleton part and arranges them in descending order according to the skeleton length. Then the harness with the longest skeleton is used as the head of the first group. The subsequent harnesses calculate the overlap rate with the head of the group in turn, and find the head with the largest overlap rate. If it meets the set threshold, the harness is divided into this group. If it does not meet the set threshold, the harness is divided into a new group head. Repeat this process to finally get the divided large group. The overlap rate calculation method is as follows:

[0068] The overlap rate calculation is to calculate the overlap degree of the two conductor skeleton parts. If the overlap rate η of a and b is calculated, the calculation formula is:

[0069]

[0070] Where: l a Represents the length of the original comparison skeleton a;

[0071] l b represents the length of the skeleton b to be compared;

[0072] l ab Represents the length of the overlapping part of skeleton a and skeleton b.

[0073] For two paths, this paper calculates the overlap rate as follows:

[0074] 1) Divide each harness into k segments according to the coordinate difference, and determine whether the segments overlap. The k segment is based on the number of wire slots passed through as a reference value. Different path harnesses pass through different wire slots, so k generally refers to the maximum number of wire slots passed through;

[0075] 2) If there is overlap, continue to determine whether the points overlap;

[0076] Assume that the coordinates of the left endpoint of the original comparison skeleton in a certain segment are a1, and the coordinates of the right endpoint are a2, and the coordinates of the left endpoint of the skeleton to be compared in this segment are b1, and the coordinates of the right endpoint are b2. Calculate a1-b1 and a2-b2 respectively, and there are nine cases as shown in Table 1:

[0077] Table 1

[0078]

[0079]

[0080] 1) The results shown in ①②⑤⑥⑦⑧ can be combined to judge that: (a1-b1)(a2-b2)≤0. If this is the case, you only need to compare and Length, if any but otherwise

[0081] 2) If it is the case shown in ⑨, then

[0082] 3) If it is the case shown in ③, it is necessary to further calculate b2-a1. If b2-a1>0, then Otherwise, the overlap length of this segment

[0083] 4) If it is the case shown in ④, it is necessary to further calculate a2-b1. If a2-b1>0, then Otherwise, the overlap length of this segment

[0084] in is the length of the original comparison skeleton in the i-th segment, is the length of the skeleton to be compared in the i-th segment, is the overlap length of the two wire bundles in the i-th segment,

[0085] Then there is

[0086] n is the number of overlapping segments,

[0087] The overlap rate η can be calculated according to formula (1).

[0088] Step 3: Divide the minimum unit group by loss rate calculation.

[0089] The minimum unit group refers to the group of wire harnesses with very similar path data, which cannot be further divided. In order to obtain the minimum unit group, the previous arrangement by skeleton length cannot group the wires suitable as the minimum unit group into one group. For this reason, we rearrange the wire harnesses in each group by the length of the overlapping parts. After the arrangement is completed, a loss function is established to determine the division of the minimum unit group.

[0090] Before establishing the loss function, some variables are defined:

[0091] L0: length of the overlapping part of the original comparison wire;

[0092] L1: length of the overlapping part of the wires to be compared;

[0093] Ax, Ay: average values ​​of x and y coordinates of each inflection point of the harness;

[0094]

[0095] In order to compare the relevance of each bundle, a loss function is established:

[0096] Loss = a1L len (L0,L1)+a2L pos (L0,Ax0,Ax1,Ay0,Ay1) (3)

[0097]

[0098] Among them, j is the inflection point index, m is the number of inflection points, and x j ,y j are the x and y coordinates of the inflection point j, L len Indicates the overlap length loss rate of the two conductors, L pos It represents the position loss rate of the two conductors, a1 and a2 are weight values, Ax0 and Ay0 represent the average values ​​of the x and y coordinates of the inflection points of the original comparison conductor, and Ax1 and Ay1 represent the average values ​​of the x and y coordinates of the inflection points of the conductor to be compared.

[0099] After rearranging the wires in the group according to the length of the overlapping parts, the loss rate of each wire and the wire in front of it is calculated in turn according to the loss function. If it is less than the set threshold, it can be divided into the minimum unit group, otherwise it will be divided into a new minimum unit group, as follows:

[0100] (1) Calculate the length of the overlapping part between the head of each large group and the skeleton of each other harness in the large group, and arrange the remaining harnesses in the group in descending order according to the length of the overlapping part of the skeleton starting from the head of the large group;

[0101] (2) For each large group, the head of the large group is used as the head of the first minimum unit group. The loss rate of the remaining bundles in descending order is calculated in turn with the previous bundle. If the set threshold is met, the current bundle and the previous bundle are divided into the same minimum unit group. Otherwise, the current bundle is divided into a new minimum unit group.

[0102] Step 4: The minimum unit group is recombined after the matching degree is calculated.

[0103] After the minimum unit group is established, in order to obtain a better clustering effect, the minimum unit group needs to be recombined. When combining, factors such as the position of the wire bundle, the overlap of the wire bundle endpoints, and the number of wire bundles in each group should be considered, and the matching function is established accordingly:

[0104] Fit=b1F pos (L'0,L'1,A'x0,A'x1,A'y0,A'y1)+b2F pot (n)+b3F num (n0,n1) (6)

[0105] In the above formula, b1, b2, and b3 are weight values, L'0 and L'1 represent the heads of the two smallest unit groups, A'x0, A'y0 and A'x1, A'y1 represent the average values ​​of the x and y coordinates of the inflection points of the two groups of heads, and F pos Indicates the position and length matching of each unit group:

[0106]

[0107] d=Max(|Ax0-Ax1|,|Ay0-Ay1|) (8)

[0108] F pot Indicates the endpoint matching degree of each unit group, that is, the number of common inflection points:

[0109] F pot =Min(5n',10) (9)

[0110] In the above formula, n' is the number of common inflection points of the two harnesses,

[0111] F num Indicates the number matching degree of the unit group. Since the optimal number of each harness group is about 10, the calculation formula for the number matching degree is:

[0112]

[0113] In the above formula, n0 is the number of wire harnesses of the original minimum unit group, n1 is the number of wire harnesses of the minimum unit group to be merged,

[0114] After establishing the matching function, the matching degree between each minimum unit is calculated, and the iteration is continued until convergence; specifically, for each minimum unit group to be matched, the following operations are performed to integrate the minimum unit group until the integration of all minimum units is completed:

[0115] Calculate the matching degree between the current minimum unit group head to be matched and each of the remaining minimum unit group heads according to the matching degree function;

[0116] Select the smallest unit group with the highest matching degree and combine it with the current smallest unit group to be matched to determine whether the number of wiring harnesses after combination reaches s; if not, continue to select the smallest unit group with the highest matching degree among the remaining smallest unit groups for combination until the number of wiring harnesses after combination reaches s, completing the integration of the current smallest unit group to be matched.

[0117] Step 5: Integrate the data to get the final grouping result.

[0118] The following is an example demonstration, using a power distribution cabinet as an example to show the specific implementation process and results:

[0119] 1) Figure 1 This is the wiring harness data of a power distribution cabinet obtained from the CAD wiring harness design software. The power distribution cabinet has a total of 174 wiring harness paths;

[0120] Harness data optimization: Through harness segmentation processing, the three-dimensional coordinate harness trajectory points are converted into two-dimensional harness trajectory points with only the skeleton, such as Figure 2 As shown;

[0121] 2) Arrange the harnesses in descending order according to the length of the skeleton, such as Figure 3 As shown; according to formula (1), the overlap rate is calculated to obtain the group division result, as shown in Figure 4 As shown;

[0122] 3) Rearrange the groups according to the length of the overlapping parts and calculate the loss rate to obtain the minimum unit group of each group. Take group 1 and group 2 as examples. Figure 5-Figure 6 As shown;

[0123] 4) Calculate the matching degree between each minimum unit group, take the maximum value and combine it, iterate continuously until convergence, and re-combine the minimum unit group. Take group 1 and group 2 as an example. Figure 7 As shown;

[0124] 5) The data of each group is integrated to obtain the final grouping result. The 174 wiring harnesses of the distribution cabinet are divided into 10 groups, as shown in Figure 8.

[0125] In summary, the automatic wiring of the distribution cabinet is a popular direction of current research. The traditional wiring in the cabinet is limited by the control accuracy of the robot arm and the size of the gripper, and cannot be commercialized on a large scale. A more feasible way is to group the wire harnesses on the nail board diagram (outside the cabinet) and make them into prefabricated wire harnesses, and then put them into the cabinet to complete the wiring. In view of this, the main technical problem solved by the present invention is to provide a wire harness optimization and grouping method for the distribution cabinet, the method comprising: after obtaining the wire harness trajectory using the wire harness simulation software or CAD software, the wire harness is divided into large groups according to the self-built overlap rate calculation algorithm of the three-dimensional coordinate feature, and then the loss function is established to determine the loss rate to divide the large group into the minimum unit group, and finally the matching function is established according to the length, position, and number of wire harnesses in each group. After calculating the matching value, the minimum unit group is recombined to obtain the final grouping result. The method realizes the optimization and grouping of the wiring harness data of the distribution cabinet, provides data support for the production of prefabricated wire harness groups on the nail board diagram, and greatly improves the feasibility and implementation efficiency of the automatic wiring of the distribution cabinet.

[0126] The above are preferred embodiments of the present invention. Any changes made according to the technical solution of the present invention, as long as the resulting functions do not exceed the scope of the technical solution of the present invention, belong to the protection scope of the present invention.

Claims

1. A method for optimizing and grouping wiring harness data of a power distribution cabinet, characterized in that: The specific steps include: S1. Obtaining harness data, removing non-inflection points of the harness data to obtain optimized harness data, and then dividing the harness route into three parts: head, skeleton, and tail; S2. Calculate the length of the skeleton part of each harness and arrange them in descending order according to the skeleton length; take the harness with the longest skeleton as the group head of the first group, calculate the overlap rate of the subsequent harnesses with each group head in turn, and divide the harnesses into large groups according to the overlap rate of the harness skeleton part; S3, rearrange the wire bundles in each large group according to the length of the overlapping parts, and after the arrangement is completed, establish a loss function to determine the minimum unit group; S4. Establish a matching function, calculate the matching degree between each minimum unit, take the maximum value and combine it, and iterate continuously until convergence; integrate the data to obtain the final grouping result.

2. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The optimized wiring harness data is obtained by eliminating non-inflection points of the wiring harness data, specifically: for each path point except the first and last path points in each wiring harness, the difference with the path points before and after it in the three directions of X, Y, and Z axes is calculated, and the size of the change amount of each axis between the current path point and the path points before and after is compared, and the change direction of the front and rear paths of the current path point is located according to the direction with the largest change amount; if the front and rear change directions are consistent, it is determined to be a non-inflection point, and the non-inflection point is eliminated to obtain the optimized wiring harness data.

3. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The coordinates of the skeleton parts have the same Z value.

4. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The large group division of the wire harnesses is performed according to the overlap rate of the wire harness skeleton parts. Specifically, the following operations are performed on each wire harness in the subsequent wire harnesses until the large group division of all subsequent wire harnesses is completed: find the group head with the largest overlap rate with the current wire harness, and if the maximum overlap rate meets the set threshold, the current wire harness is divided into the large group corresponding to the group head with the largest overlap rate; if it does not meet the set threshold, the current wire harness is divided into the group head of a new group.

5. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The calculation of the overlap rate of the harness skeleton part is as follows: Where: l b Indicates the length of the skeleton b to be compared; l ab It represents the length of the overlapped part between the original comparison skeleton a and the skeleton b to be compared.

6. A method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 5, characterized in that: The length of the overlapped portion of the original comparison skeleton a and the skeleton to be compared b is calculated as follows: 1) Divide the original comparison skeleton a and the skeleton to be compared b into k segments according to the coordinate differences, and determine whether the segments overlap; 2) If there is overlap, continue to determine whether the points overlap: Assume that the coordinates of the left endpoint of the i-th segment of the original comparison skeleton a are a1, and the coordinates of the right endpoint are a2; the coordinates of the left endpoint of the i-th segment of the skeleton to be compared b are b1, and the coordinates of the right endpoint are b2, and calculate a1-b1 and a2-b2 respectively; the length of the original comparison skeleton a in the i-th segment is The length of the skeleton b to be compared in segment i is the overlap length of the two wire bundles in the i-th segment; If (a1-b1)(a2-b2)≤0, then compare and length; if any but otherwise If (a1-b1)>0 and (a2-b2)>0, then calculate b2-a1; if b2-a1>0, then otherwise If (a1-b1)<0 and (a2-b2)<0, then calculate a2-b1; if a2-b1>0, then otherwise 3) Calculate the length of the overlap between the original comparison skeleton a and the skeleton to be compared b: In the formula, n is the number of overlapping segments.

7. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The S3 is specifically: S31, calculating the length of the overlapping part between the head of each large group and the skeleton of each other harness in the large group, and arranging the remaining harnesses in the group in descending order according to the length of the overlapping part of the skeleton starting from the head of the large group; S32. For each large group, the head of the large group is used as the head of the first minimum unit group, and the loss rate of the remaining harnesses arranged in descending order is calculated in turn with the loss rate of the previous harness. If the set threshold is met, the current harness and the previous harness are divided into the same minimum unit group, otherwise the current harness is divided into a new minimum unit group.

8. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The loss function is specifically established as follows: Define variables: L0 is the length of the overlapping part of the original comparison wire; L1 is the length of the overlapping part of the wire to be compared; Ax and Ay are the average values ​​of the x and y coordinates of each inflection point of the harness: Establish the loss function: <h2 style=";text-align:left;direction:ltr">Loss = a1L<h2 style=";text-align:left;direction:ltr"> len <h2 style=";text-align:left;direction:ltr"> (L0,L1)+a2L<h2 style=";text-align:left;direction:ltr"> pos <h2 style=";text-align:left;direction:ltr"> (L0,Ax0,Ax1,Ay0,Ay1) (3) Among them, j is the inflection point index, m is the number of inflection points, and x j ,y j are the x and y coordinates of the inflection point j, L len Indicates the overlap length loss rate of the two conductors, L pos It represents the position loss rate of the two conductors, a1 and a2 are weight values, Ax0 and Ay0 represent the average values ​​of the x and y coordinates of the inflection points of the original comparison conductor, and Ax1 and Ay1 represent the average values ​​of the x and y coordinates of the inflection points of the conductor to be compared.

9. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 1, characterized in that: The specific establishment of the matching function is: Fit=b1F pos (L'0,L'1,A'x0,A'x1,A'y0,A'y1)+b2F pot (n')+b3F num (n0,n1) (6) Where b1, b2, and b3 are weight values, L'0 and L'1 represent the heads of the two smallest unit groups, A'x0, A'y0 and A'x1, A'y1 represent the average values ​​of the x and y coordinates of the inflection points of the two groups, and F pos Indicates the position and length matching degree of each unit group: d=Max(|Ax0-Ax1|,|Ay0-Ay1|) (8) F pot Indicates the endpoint matching degree of each unit group, that is, the number of common inflection points: F pot =Min(5n',10) (9) In the above formula, n' is the number of common inflection points of the two harnesses, F num Indicates the number of unit groups matching: In the above formula, n0 is the number of wire harnesses in the original minimum unit group, n1 is the number of wire harnesses in the minimum unit group to be merged, and s is the preset optimal number of wire harnesses per group.

10. The method for optimizing and grouping wiring harness data of a power distribution cabinet according to claim 9, characterized in that: Specifically, S4 includes, for each minimum unit group to be matched, performing the following operations to integrate the minimum unit groups until all minimum units are integrated: Calculate the matching degree between the current minimum unit group head to be matched and each of the remaining minimum unit group heads according to the matching degree function; Select the smallest unit group with the highest matching degree and combine it with the current smallest unit group to be matched to determine whether the number of wiring harnesses after combination reaches s; if not, continue to select the smallest unit group with the highest matching degree among the remaining smallest unit groups for combination until the number of wiring harnesses after combination reaches s, completing the integration of the current smallest unit group to be matched.

Images