Blade assembly method, device and equipment

Abstract

The present application discloses a blade assembly method, device and equipment, including: obtaining blade information of a blade; determining the remaining blade number of the remaining blades that do not exist in the preset blade array according to the blade number of the blade and the preset blade number in the preset blade distribution array; classifying a plurality of the blades according to the blade weight value of each blade and the remaining blade number to obtain a first blade set and a second blade set; dividing the turbine disk into regions according to the remaining blade number to form a first region and a second region; respectively assembling each first blade in the first blade set to the first region, and assembling each second blade in the second blade set to the second region. Based on this, it helps to balance the overall weight distribution of the turbine disk, reduce the imbalance, and improve the performance and stability of the aircraft engine. Therefore, the method has significant optimization effect and practical application value.

Description

Technical Field

[0001] The present application relates to the field of engine blade assembly, and in particular to a blade assembly method, device and equipment. Background Art

[0002] During the production process of aircraft engine turbine blades, due to various reasons such as dimensional tolerance and processing accuracy, there is a certain error in the weight of each blade after final molding, and it is not completely consistent. This makes it difficult to ensure the overall imbalance of the turbine disk and blades during assembly. Even if the imbalance of the turbine disk is controlled within a small range, after the entire circle of blades are installed, the weight error of the blades will increase the overall imbalance.

[0003] In order to reduce the impact of the weight error of the blade itself, the overall imbalance of the turbine disk and the blade will be measured when the turbine blade is assembled. If the measurement finds that the blade in a certain direction is too heavy or too light, the blade will be removed and replaced with a blade of more appropriate weight.

[0004] At present, the industry mainly uses computers to run data models to perform a large number of permutations and combinations for balanced assembly of blades to obtain a final assembly method. Among them, the patent with publication number CN115455563A proposes a single-stage rotor blade assembly sequence balance optimization method based on digital twins; the present invention aims to solve the problem of the influence of the assembly sequence of aircraft engine blades on the imbalance, and establishes a physical model based on the physical quantities of blades and blade disks that affect the imbalance and assembly requirements. After measuring and establishing a digital twin model of the blades, a genetic optimization algorithm is used to optimize the blade sorting, and the optimal blade assembly sequence is found by simulating the natural evolution of the population to achieve the purpose of reducing the rotor imbalance.

[0005] The above patent optimizes the blade arrangement by using a physical model to determine the optimal blade arrangement. However, due to the limitations of the blade assembly environment, it may not be possible to provide a computer to perform model calculations, which limits the use of this method. Summary of the invention

[0006] The embodiments of the present application provide a blade assembly method, device and equipment, which improve the balance of turbine disk blade assembly.

[0007] According to a first aspect of the present application, an embodiment of the present application provides a blade assembly method, which may include:

[0008] Obtaining blade information of a blade, where the number of blades is multiple, and the blade information includes a blade weight value;

[0009] Determining the number of remaining blades that do not exist in the preset blade distribution array according to the number of blades of the blade and the preset number of blades in the preset blade distribution array;

[0010] Classifying the plurality of leaves according to the leaf weight value of each leaf and the number of remaining leaves to obtain a first leaf set and a second leaf set;

[0011] Dividing the turbine disk into regions according to the number of remaining blades to form a first region and a second region;

[0012] Each first blade in the first blade set is mounted to the first region, and each second blade in the second blade set is mounted to the second region.

[0013] Optionally, the plurality of leaves are classified according to the leaf weight value of each leaf and the number of remaining leaves to obtain a first leaf set and a second leaf set, including:

[0014] According to the blade weight value of each blade, the multiple blades are sorted in descending order to obtain a blade weight sequence;

[0015] determining a median leaf weight in the leaf weight sequence, the median leaf weight corresponding to the median leaf;

[0016] Calculate the weight difference between the blade weight value of each third blade in the blade weight sequence and the median blade weight value, respectively, the third blade is the blade other than the median blade in the blade weight sequence;

[0017] Sort the weight differences from small to large to obtain a blade weight difference sequence;

[0018] Selecting the first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form a first blade set;

[0019] It is determined that second leaves among the plurality of leaves that are not present in the first set of leaves form a second set of leaves.

[0020] Optionally, selecting a first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form a first blade set includes:

[0021] When the number of remaining blades is equal to 2K, the blade in the first interval is determined to be the first blade, the starting point of the first interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the K+1th blade weight value in the blade weight sequence, where K is a positive integer;

[0022] When the number of remaining blades is equal to 2K, the blade in the second interval is determined to be the first blade, the starting point of the second interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the second interval is the blade corresponding to the K-1th blade weight difference in the blade weight difference sequence;

[0023] Determine the middle leaf as the first leaf;

[0024] The first blade corresponding to the median blade, the first blade in the first interval, and the first blade in the second interval are sequentially combined in an alternating manner to obtain a first blade set.

[0025] Optionally, selecting a first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form a first blade set includes:

[0026] When the number of remaining blades is equal to 2K-1, the blade in the third interval is determined to be the first blade, the starting point of the third interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the Kth blade weight value in the blade weight sequence, where K is a positive integer;

[0027] When the number of remaining blades is equal to 2K-1, the blade in the fourth interval is determined to be the first blade, the starting point of the fourth interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the fourth interval is the blade corresponding to the K-1th blade weight difference in the blade weight difference sequence;

[0028] Determine the middle leaf as the first leaf;

[0029] The first blade corresponding to the median blade, the first blade in the third interval, and the first blade in the fourth interval are sequentially combined in an alternating manner to obtain a first blade set.

[0030] Optionally, the turbine disk is divided into regions according to the number of remaining blades to form a first region and a second region, including:

[0031] Determining a first region from the turbine disk based on the odd or even number of remaining blades;

[0032] The area consisting of the assembly grooves on the turbine disk except the first area is determined as the second area.

[0033] Optionally, the first region includes a first sub-region and a second sub-region, and the first sub-region and the second sub-region are arranged opposite to each other on the turbine disk;

[0034] Based on the odd or even number of remaining blades, a first region is determined from the turbine disk, including:

[0035] When the number of remaining blades is equal to 2K, K adjacent assembly slots of the turbine disk are determined as the first sub-region, and K assembly slots opposite to the first sub-region are determined as the second sub-region, where K is a positive integer;

[0036] When the number of remaining blades is equal to 2K-1, the adjacent K-1 assembly slots of the turbine disk are determined as the first sub-region, and the K assembly slots opposite to the first sub-region are determined as the second sub-region.

[0037] Optionally, each first blade in the first blade set is assembled to the first region, and each second blade in the second blade set is assembled to the second region, comprising:

[0038] sequentially assembling each first blade in the first blade set to the first region in a first clockwise order;

[0039] Each second blade in the second blade set is assembled to the second area in sequence according to a second clockwise sequence, and the first clockwise sequence is opposite to the second clockwise sequence.

[0040] Optionally, assembling each second blade in the second blade set to the second region in sequence according to a second clockwise order includes:

[0041] According to the blade weight value of each second blade, the second blades are arranged in order from large to small according to the blade weight value to obtain a second blade sequence;

[0042] Fill each second blade in the second blade sequence into the preset blade distribution array in order from top to bottom and from left to right to obtain a first blade distribution array;

[0043] Performing a row change on each row of the first blade distribution array to obtain a second blade distribution array;

[0044] Arranging the number of columns that meet the preset conditions in the second blade distribution array in reverse order to obtain a third blade distribution array;

[0045] Performing row transformation on each row of the third blade distribution array to obtain a fourth blade distribution array;

[0046] From left to right and from top to bottom, each second blade in the fourth blade distribution array is assembled to the second area in a second clockwise order.

[0047] According to a second aspect of the present application, a blade assembly device is provided, which may include:

[0048] An acquisition module, used for acquiring blade information of a blade, where the number of blades is multiple, and the blade information includes a blade weight value;

[0049] A first determination module, configured to determine the number of remaining blades of the remaining blades not existing in the preset blade sequence according to the number of blades of the blade and the preset number of blades in the preset blade distribution array;

[0050] A classification module, used for classifying the plurality of leaves according to the leaf weight value of each leaf and the number of remaining leaves, to obtain a first leaf set and a second leaf set;

[0051] A region division module, used for dividing the turbine disk into regions according to the number of remaining blades to form a first region and a second region;

[0052] The assembly module is used to assemble each first blade in the first blade set to the first area, and to assemble each second blade in the second blade set to the second area.

[0053] According to a third aspect of the present application, an embodiment of the present application provides a blade assembly device, which includes: a processor and a memory storing computer program instructions;

[0054] When the processor executes the computer program instructions, the blade assembly method according to any one of the first aspects is implemented.

[0055] The technical solution provided by the embodiments of the present application brings at least the following beneficial effects:

[0056] The embodiments of the present application provide a blade assembly method, device and equipment, which effectively utilizes the blade information of multiple blades, especially the blade weight value, to optimize the blade assembly process. By comparing the number of blades and the number in the preset blade distribution array, the number of remaining blades is determined, and the blades are divided into a first blade set and a second blade set accordingly. Furthermore, the method divides the turbine disk into regions according to the number of remaining blades to form a first region and a second region, so as to assemble blades of different sets in a targeted manner. Based on this, the classification and region division method helps to balance the overall weight distribution of the turbine disk, reduce the imbalance, and improve the performance and stability of the aircraft engine. Therefore, the method has significant optimization effect and practical application value.

[0057] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] The drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present application, and together with the specification are used to explain the principles of the present application, and do not constitute an improper limitation on the present application.

[0059] Figure 1is a flow chart of a blade assembly method according to an exemplary embodiment;

[0060] Figure 2 is a structural schematic diagram of a blade assembly device according to an exemplary embodiment;

[0061] Figure 3 It is a structural block diagram of a blade assembly device according to an exemplary embodiment. DETAILED DESCRIPTION

[0062] In order to more clearly understand the above-mentioned objectives, features and advantages of the present disclosure, the scheme of the present disclosure will be further described below. It should be noted that the embodiments of the present disclosure and the features in the embodiments can be combined with each other without conflict.

[0063] In the following description, many specific details are set forth to facilitate a full understanding of the present disclosure, but the present disclosure may also be implemented in other ways different from those described herein; it is obvious that the embodiments in the specification are only part of the embodiments of the present disclosure, rather than all of the embodiments.

[0064] Based on this, the present application provides a blade assembly method, device and equipment. The following first introduces the blade assembly method provided in the embodiment of the present application.

[0065] Embodiment 1;

[0066] Figure 1 A schematic diagram of a process flow of a blade assembly method provided by an embodiment of the present application is shown. Figure 1 As shown, it may include the following steps:

[0067] S101, obtaining blade information of a blade, where the number of blades is multiple, and the blade information includes a blade weight value;

[0068] S102, determining the number of remaining blades that do not exist in the preset blade distribution array according to the number of blades of the blade and the preset number of blades in the preset blade distribution array;

[0069] S103, classifying the plurality of leaves according to the weight value of each leaf and the number of remaining leaves to obtain a first leaf set and a second leaf set;

[0070] S104, dividing the turbine disk into regions according to the number of remaining blades to form a first region and a second region;

[0071] S105, assembling each first blade in the first blade set to the first region, and assembling each second blade in the second blade set to the second region.

[0072] Based on the above embodiments, the above method effectively utilizes the information to optimize the assembly process of the blades by accurately obtaining the blade information of multiple blades, especially the blade weight values. By comparing the number of blades and the number in the preset blade distribution array, the number of remaining blades is determined, and the blades are divided into a first blade set and a second blade set accordingly. Furthermore, the method divides the turbine disk into regions according to the number of remaining blades to form a first region and a second region, so as to assemble blades of different sets in a targeted manner. Based on this, the classification and region division method helps to balance the overall weight distribution of the turbine disk, reduce the imbalance, and improve the performance and stability of the aircraft engine. Therefore, the method has significant optimization effect and practical application value.

[0073] In the above S101, information of all blades to be assembled on the turbine disk is collected to obtain blade information of each blade, wherein the blade information may include: blade weight value, blade shape information, blade internal crack information, etc.

[0074] In the above S102, a preset blade distribution array is obtained, wherein the preset blade distribution array is a rectangular array of size M×N, into which M×N preset blades can be filled, and blades for assembly on the turbine disk are filled into the preset blade distribution array. When the blades in the preset blade distribution array are already filled, the remaining number of blades that have not been filled into the preset array can be determined.

[0075] As an example, the preset blade distribution array may be expressed as follows:

[0076] 1 2 3 4 5 6 ...... N 1 2 3 4 5 6 ...... M

[0077] It should be noted that, assuming the number of blades is S, and M×N blades can be filled in the preset blade array, then the number of remaining blades is SM×N=Z; in the process of selecting M and N, the smaller the difference between M and N, the smaller Z, and the more balanced the subsequent assembly of the blades on the turbine disk will be.

[0078] In the above S103, the plurality of blades assembled on the turbine disk are classified according to the number of remaining blades and the blade weight value of each blade to form a first blade set and a second blade set.

[0079] Specifically, the above S103 may include:

[0080] S1031, sorting the plurality of blades in descending order according to the blade weight value of each blade to obtain a blade weight sequence;

[0081] S1032, determining a median blade weight in the blade weight sequence, wherein the median blade weight corresponds to a median blade;

[0082] S1033, respectively calculating the weight difference between the blade weight value of each third blade in the blade weight sequence and the median blade weight value, where the third blade is the blade other than the median blade in the blade weight sequence;

[0083] S1034, sorting the weight differences in ascending order to obtain a blade weight difference sequence;

[0084] S1035, selecting a first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form a first blade set;

[0085] S1036: Determine that second leaves among the plurality of leaves that are not included in the first leaf set form a second leaf set.

[0086] In the above S1031-S1036, a systematic method is used to first sort multiple blades according to the blade weight, and determine the median weight and its corresponding median blade. Subsequently, the weight difference between each blade except the median blade and the median blade is calculated, and these differences are sorted, so that the distribution and deviation of the blade weight can be clearly identified. According to the parity of the number of remaining blades, the first blade set is intelligently selected from the original weight sequence and the difference sequence to ensure the scientificity and rationality of the selection process. Finally, the second blade set is determined by the elimination method, which not only improves the efficiency and accuracy of blade classification, but also helps to further analyze and optimize the blade weight distribution, and has a significant beneficial effect on improving production efficiency.

[0087] In the above S1031, the blade weight value of each blade is known, and each blade is sorted in descending order according to the blade weight value of each blade to obtain a blade weight sequence, wherein each blade in the blade weight sequence is arranged in descending order according to weight information.

[0088] In the above S1032, the median value of each blade weight value is selected from the blade weight sequence, and the median value is determined as the blade weight median value, wherein the blade corresponding to the blade weight median value is the median blade.

[0089] Alternatively, in one example, if there are two median values ​​of blade weight, one of them may be selected as the median value.

[0090] In the above S1033, in the blade weight sequence, the blades other than the median blade are third blades, and the weight difference between the blade weight value of each third blade and the median blade weight value is calculated respectively.

[0091] In the above S1034, the weight differences between each third blade and the middle blade are sorted again from small to large to obtain a weight difference sequence.

[0092] The weight difference sequence can reflect the degree of dispersion between the third leaf and the median leaf.

[0093] In the above S1035, by judging the parity of the number of remaining blades, multiple different first blades are selected from the blade weight sequence and the blade difference sequence according to the different parities, and the selected first blades are combined to form a first blade set.

[0094] More specifically, in an example, S1035 may include:

[0095] When the number of remaining blades is equal to 2K, the blade in the first interval is determined to be the first blade, the starting point of the first interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the K+1th blade weight value in the blade weight sequence, where K is a positive integer; the number of remaining blades is equal to 2K, that is, the number of remaining blades is an even number, and thus, the blade corresponding to the second blade weight value in the blade weight sequence is determined to be the starting point of the first interval, and the blade corresponding to the K+1th blade weight value is determined to be the end point of the first interval, and all blades in the first interval are first blades.

[0096] Assuming the blade weight sequence is A, the first interval is [A(2), A(K+1)].

[0097] When the number of remaining leaves is equal to 2K, the blade in the second interval is determined to be the first blade, the starting point of the second interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the second interval is the leaf corresponding to the K-1th blade weight difference in the blade weight difference sequence. Similarly, from the blade weight difference sequence, the leaf corresponding to the first blade weight difference is determined to be the starting point of the second interval, and the leaf corresponding to the K-1th blade weight difference is the end point of the second interval. The leaves corresponding to all blade weight differences in the second interval are all first leaves.

[0098] Assume that the blade weight difference sequence is B, then the second interval is [B(1), B(K-1)].

[0099] Determine the middle leaf as the first leaf;

[0100] The first blade corresponding to the median blade, the first blade in the first interval, and the first blade in the second interval are sequentially interlaced and combined to obtain a first blade set. In the first blade set, the first blade corresponding to the median blade is ranked first, and then the first blade in the first interval and the first blade in the second interval are sequentially interlaced and combined according to the arrangement order in each interval. Thus, the first blade set is formed.

[0101] Assume that the first leaf set is C, then the first leaf set is (median leaf, A(2), B(1), A(3)...).

[0102] In another example, the above S1035 may also include:

[0103] When the number of remaining blades is equal to 2K-1, the blade in the third interval is determined to be the first blade, the starting point of the third interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the Kth blade weight value in the blade weight sequence, where K is a positive integer; similarly, when the number of remaining blades is equal to 2K-1, it can be explained that the number of remaining blades is an odd number, and thus, the blade corresponding to the second blade weight value in the blade weight sequence can be taken as the starting point of the third interval, and the blade corresponding to the Kth blade weight value in the blade weight sequence can be taken as the end point of the third interval, and all corresponding blades in the third interval are second blades.

[0104] When the number of remaining blades is equal to 2K-1, the blade in the fourth interval is determined to be the first blade, the starting point of the fourth interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the fourth interval is the blade corresponding to the K-1th blade weight difference in the blade weight difference sequence; similarly, it can be determined that in the blade weight difference sequence, the blade corresponding to the first blade weight difference is the starting point of the fourth interval, and the blade corresponding to the K-1th blade weight difference is the end point of the fourth interval, then the blade corresponding to all blade weight differences in the fourth interval is the second blade.

[0105] Determine the middle leaf as the first leaf;

[0106] The first leaf corresponding to the median leaf, the first leaf in the third interval, and the first leaf in the fourth interval are sequentially interlaced to obtain a first leaf set. As in the above case where the number of remaining leaves is equal to 2K, in the first leaf set, the first leaf corresponding to the median leaf is ranked first, and then the first leaf in the third interval and the first leaf in the fourth interval are sequentially interlaced according to the arrangement order in each interval. Thus, the first leaf set is formed.

[0107] In the above S1036, among the multiple leaves, the leaves that are not in the first leaf set are all second leaves, and the multiple second leaves constitute the second leaf set.

[0108] In the above S104, the turbine disk on which blades need to be installed is divided into a first area and a second area according to the number of remaining blades.

[0109] Specifically, the above S104 may include:

[0110] S1041, determining a first region from the turbine disk according to the parity of the number of remaining blades;

[0111] S1042: Determine the area on the turbine disk consisting of the assembly grooves except the first area as the second area.

[0112] In the above S1041, by determining the parity of the number of remaining blades, the turbine disk is divided into different first areas and second areas according to different parities.

[0113] The first region may include a first sub-region and a second sub-region, and the first sub-region and the second sub-region are arranged opposite to each other on the turbine disk.

[0114] More specifically, in an example, S1041 may include:

[0115] When the number of remaining blades is equal to 2K, the adjacent K assembly slots of the turbine disk are determined as the first sub-region, and the K assembly slots opposite to the first sub-region are determined as the second sub-region, where K is a positive integer; a plurality of assembly slots are provided on the turbine disk for assembling blades, each assembly slot corresponds to a blade one-to-one, and the angles between each assembly slot are equal. First, K adjacent assembly slots are selected on the turbine disk and set as the first sub-region, and then K assembly slots opposite to the first sub-region are selected as the second sub-region.

[0116] For example, assuming that there are 12 assembly slots on the turbine disk, K=3, the angle between each assembly slot is 30° (which can be viewed as a clock), the area formed by the three slots at 5, 6, and 7 o'clock is taken as the first sub-area, and the area formed by the three slots at 11, 12, and 1 o'clock opposite to the first sub-area is the second sub-area.

[0117] When the number of remaining blades is equal to 2K-1, the adjacent K-1 assembly slots of the turbine disk are determined as the first sub-region, and the K assembly slots corresponding to the first sub-region are determined as the second sub-region. When the number of remaining blades is an odd number, the adjacent K-1 assembly slots on the turbine disk are determined as the first sub-region, and similarly, the K assembly slots corresponding to the first sub-region are determined as the second sub-region.

[0118] Assuming K=2, K-1=1, any assembly slot on the turbine disk is the first sub-area. If there is no assembly slot in the area directly opposite to the assembly slot in the turbine disk, the area formed by the two assembly slots on both sides of the opposite area is the second sub-area.

[0119] By arranging the first sub-region and the second sub-region on the turbine disk opposite to each other, the second region is divided into two parts by the first sub-region and the second sub-region, so that the blade can be more balanced when being assembled on the turbine disk by region.

[0120] In the above S105, the first blade in the first blade set is assembled to the first area, and then the second blade in the second blade set is assembled to the second area.

[0121] Specifically, the above S105 may include:

[0122] S1051, sequentially assembling each first blade in the first blade set to the first area according to a first clockwise order;

[0123] S1052, assembling each second blade in the second blade set to the second area in sequence according to a second clockwise order, wherein the first clockwise order is opposite to the second clockwise order.

[0124] By assembling the first blade and the second blade in opposite clockwise order, the blades on the turbine disk are assembled more balanced.

[0125] More specifically, in an example, the above S1052 may further include:

[0126] According to the blade weight value of each second blade, the second blades are arranged in order from large to small according to the blade weight value to obtain a second blade sequence;

[0127] Fill each second blade in the second blade sequence into the preset blade distribution array in order from top to bottom and from left to right to obtain a first blade distribution array;

[0128] Performing a row change on each row of the first blade distribution array to obtain a second blade distribution array;

[0129] The number of columns satisfying the preset condition in the second blade distribution array is arranged in reverse order to obtain a third blade distribution array; wherein the preset condition refers to N≠4P and N≠4P-1.

[0130] Performing row transformation on each row of the third blade distribution array to obtain a fourth blade distribution array;

[0131] From left to right and from top to bottom, each second blade in the fourth blade distribution array is assembled to the second area in a second clockwise order.

[0132] As an example, assume that the order of the second leaves in the second leaf sequence is a, b, c, d, e...aa, ab, ac...

[0133] The first blade distribution array can be expressed as:

[0134] 1 2 3 4 5 6 ...... N 1 a i q y 2 b j r z 3 c k s aa 4 d l t ab 5 e m u ac 6 f n v ...... ...... g o w M h p x

[0135] Wherein, each column of the first blade distribution array is changed to obtain a second blade distribution array, and the second blade distribution array can be expressed as:

[0136] 1 3 ...... N-1 N ...... 4 2 1 a q y i 2 b r z j 3 c s aa k 4 d t ab l 5 e u ac m 6 f v ad n ...... g w ae o M h x ...... p

[0137] For N≠4P and N≠4P-1, the columns are arranged in reverse order to obtain a third blade distribution array, where the third blade distribution array can be expressed as:

[0138] 1 3 ...... N-1 N ...... 4 2 1 a x ...... i 2 b w ae j 3 c v ad k 4 d u ac l 5 e t ab m 6 f s aa n ...... g r z o M h q y p

[0139] Then, each row of the third blade distribution array is transformed to obtain a fourth blade distribution array, where the fourth blade distribution array can be expressed as:

[0140] 1 3 ...... N-1 N ...... 4 2 1 a x ...... i M h q y p 2 b w ae j M-1 3 c v ad k M-2 4 d u ac l ......

[0141] Thus, after obtaining the fourth blade distribution array, select a, x...i, h, q...y, p, b, w...the second blades from the fourth blade distribution array in order from left to right and from top to bottom, and assemble these second blades into the second area in the second clockwise order.

[0142] Embodiment 2;

[0143] Based on the same inventive concept, this embodiment further provides a blade assembly device 200 on the basis of Embodiment 1, specifically as follows Figure 2 As shown, it includes:

[0144] An acquisition module 210 is used to acquire blade information of a blade, where the number of blades is multiple, and the blade information includes a blade weight value;

[0145] A first determination module 220, configured to determine the number of remaining blades of the remaining blades that are not present in the preset blade sequence according to the number of blades of the blade and the preset number of blades in the preset blade distribution array;

[0146] A classification module 230, configured to classify the plurality of leaves according to the leaf weight value of each leaf and the number of remaining leaves to obtain a first leaf set and a second leaf set;

[0147] A region division module 240 is used to divide the turbine disk into regions according to the number of remaining blades to form a first region and a second region;

[0148] The assembly module 250 is used to assemble each first blade in the first blade set to the first area, and to assemble each second blade in the second blade set to the second area.

[0149] Based on the above embodiment, the acquisition module 210 effectively utilizes the information to optimize the assembly process of the blades by accurately acquiring the blade information of multiple blades, especially the blade weight value. The first determination module 220 determines the number of remaining blades by comparing the number of blades with the number in the preset blade distribution array, and the classification module 230 divides the blades into a first blade set and a second blade set accordingly. Furthermore, the area division module 240 divides the turbine disk into regions according to the number of remaining blades to form a first region and a second region, and the assembly module 250 thus assembles blades of different sets in a targeted manner. Based on this, the classification and area division methods help to balance the overall weight distribution of the turbine disk, reduce the imbalance, and improve the performance and stability of the aircraft engine. Therefore, this method has significant optimization effects and practical application value.

[0150] Optionally, the classification module 230 may include:

[0151] A first sorting unit is used to sort the plurality of blades in descending order according to the blade weight value of each blade to obtain a blade weight sequence;

[0152] A first determining unit, configured to determine a median blade weight in the blade weight sequence, wherein the median blade weight corresponds to a median blade;

[0153] A calculation unit, used for respectively calculating the weight difference between the blade weight value of each third blade in the blade weight sequence and the median weight value of the blade, wherein the third blade is a blade other than the median blade in the blade weight sequence;

[0154] A second sorting unit is used to sort the weight differences in ascending order to obtain a blade weight difference sequence;

[0155] A selection unit, configured to select a first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form the first blade set;

[0156] The second determining unit is used to determine that second leaves among the plurality of leaves that do not exist in the first set of leaves constitute the second set of leaves.

[0157] Optionally, the selection unit may include:

[0158] a first determining subunit, configured to determine, when the number of remaining blades is equal to 2K, that the blade in the first interval is the first blade, the starting point of the first interval being the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval being the blade corresponding to the K+1th blade weight value in the blade weight sequence, where K is a positive integer;

[0159] A second determining subunit is used to determine that the blade in the second interval is the first blade when the number of remaining blades is equal to 2K, the starting point of the second interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the second interval is the blade corresponding to the K-1th blade weight difference in the blade weight difference sequence;

[0160] A third determining subunit is used to determine that the middle leaf is the first leaf;

[0161] The first combination unit is used to alternately combine the first blade corresponding to the median blade, the first blade in the first interval, and the first blade in the second interval in sequence to obtain a first blade set.

[0162] Optionally, the selection unit may further include:

[0163] a fourth determination subunit, configured to determine, when the number of remaining blades is equal to 2K-1, that the blade in the third interval is the first blade, the starting point of the third interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the Kth blade weight value in the blade weight sequence, where K is a positive integer;

[0164] a fifth determining subunit, configured to determine, when the number of remaining blades is equal to 2K-1, that the blade in the fourth interval is the first blade, the starting point of the fourth interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the fourth interval is the blade corresponding to the K-1th blade weight difference in the blade weight difference sequence;

[0165] a sixth determining subunit, configured to determine that the middle leaf is the first leaf;

[0166] The second combining unit is used to sequentially and alternately combine the first blade corresponding to the median blade, the first blade in the third interval, and the first blade in the fourth interval to obtain a first blade set.

[0167] Optionally, the region division module 240 may include:

[0168] a third determining unit, configured to determine a first region from the turbine disk according to the parity of the number of remaining blades;

[0169] The fourth determining unit is used to determine that the area formed by the assembly grooves on the turbine disk except the first area is the second area.

[0170] Optionally, the first region includes a first sub-region and a second sub-region, and the first sub-region and the second sub-region are arranged opposite to each other on the turbine disk;

[0171] The third determining unit may include:

[0172] a seventh determination subunit, for determining, when the number of remaining blades is equal to 2K, K adjacent assembly slots of the turbine disk as the first sub-region, and K assembly slots opposite to the first sub-region as the second sub-region, where K is a positive integer;

[0173] The eighth determination subunit is used to determine, when the number of remaining blades is equal to 2K-1, adjacent K-1 assembly slots of the turbine disk as the first sub-region and K assembly slots opposite to the first sub-region as the second sub-region.

[0174] Optionally, the assembly module 250 may include:

[0175] A first assembly unit, used for sequentially assembling each first blade in the first blade set to the first area in a first clockwise order;

[0176] The second assembly unit is used to assemble each second blade in the second blade set to the second area in sequence according to a second clockwise order, and the first clockwise order is opposite to the second clockwise order.

[0177] Optionally, the second assembly unit may include:

[0178] an arranging subunit, for arranging the second leaves in descending order of the leaf weight value according to the leaf weight value of each second leaf, so as to obtain a second leaf sequence;

[0179] A filling subunit, used to fill each second blade in the second blade sequence into a preset blade distribution array in order from top to bottom and from left to right, to obtain a first blade distribution array;

[0180] A first changing subunit, used for performing a row change on each row of the first blade distribution array to obtain a second blade distribution array;

[0181] A first arrangement subunit is used to arrange the number of columns that meet a preset condition in the second blade distribution array in reverse order to obtain a third blade distribution array;

[0182] a second changing subunit, configured to perform a row transformation on each row of the third blade distribution array to obtain a fourth blade distribution array;

[0183] The first assembly subunit is used to assemble each second blade in the fourth blade distribution array to the second area in a second clockwise order from left to right and from top to bottom.

[0184] In Example 2, each process of the above-mentioned Example 1 can be implemented and the same technical effect can be achieved. To avoid repetition, it will not be described here.

[0185] Embodiment 3:

[0186] Figure 3 A schematic diagram of the hardware structure of a blade assembly device provided by an embodiment of the present invention is shown.

[0187] The blade assembly device may include a processor 301 and a memory 302 storing computer program instructions.

[0188] Specifically, the processor 301 may include a central processing unit (CPU), or a specific integrated circuit (KSIC), or may be configured to implement one or more integrated circuits of the embodiments of the present invention.

[0189] The memory 302 may include a large capacity memory for data or instructions. By way of example and not limitation, the memory 302 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive or a combination of two or more of these. In appropriate cases, the memory 302 may include a removable or non-removable (or fixed) medium. In appropriate cases, the memory 302 may be inside or outside the integrated gateway disaster recovery device. In a specific embodiment, the memory 32 is a non-volatile solid-state memory.

[0190] In certain embodiments, the memory 302 may include a read-only memory (ROM), a random access memory (RKM), a magnetic disk storage media device, an optical storage media device, a flash memory device, an electrical, optical or other physical / tangible memory storage device. Thus, typically, the memory 302 includes one or more tangible (non-transitory) computer-readable storage media (e.g., a memory device) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors 301), it is operable to perform the operations described with reference to the method according to one aspect of the present application.

[0191] The processor 301 implements any one of the blade assembly methods in the above embodiments by reading and executing the computer program instructions stored in the memory 302 .

[0192] In one example, the blade assembly device may further include a communication interface 303 and a bus 304. As shown in the figure, the processor 301, the memory 302, and the communication interface 303 are connected via the bus 304 and communicate with each other.

[0193] The communication interface 303 is mainly used to implement the communication between the modules, devices, units and / or equipment in the embodiment of the present invention.

[0194] The bus 304 includes hardware, software or both. For example and not limitation, the bus 304 may include an accelerated graphics port (KGP) or other graphics bus, an enhanced industry standard architecture (EISK) bus, a front-side bus (FSB), a hypertransport (HT) interconnect, an industry standard architecture (ISK) bus, a wireless bandwidth interconnect, a low pin count (LPC) bus, a memory bus, a micro channel architecture (MCK) bus, a peripheral control interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a serial advanced technology attachment (SKTK) bus, a video electronics standard association local (VLB) bus or other suitable bus or a combination of two or more of these. Where appropriate, the bus 304 may include one or more buses 304. Although the present application embodiment describes and shows a specific bus 304, the present application considers any suitable bus 304 or interconnection.

[0195] The blade assembly equipment can be based on the current blade assembly method to achieve the combination Figure 1 , 2 The blade assembly method and blade assembly device 200 are described.

[0196] In addition, the embodiment of the present application also provides a computer program product, including computer program instructions, and when the computer program product is executed by the processor 301, the steps and corresponding contents of the aforementioned method embodiment can be implemented.

[0197] It should be clear that the present application is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present application is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present application.

[0198] The functional blocks shown in the above-described block diagram can be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present application are programs or code segments that are used to perform the required tasks. Programs or code segments can be stored in machine-readable media, or transmitted on a transmission medium or a communication link by a data signal carried in a carrier wave. "Machine-readable media" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, optical fiber media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0199] It should also be noted that the exemplary embodiments mentioned in this application describe some methods or systems based on a series of steps or devices. However, this application is not limited to the order of the above steps, that is, the steps can be performed in the order mentioned in the embodiment, or in a different order from the embodiment, or several steps can be performed simultaneously.

[0200] Aspects of the present disclosure are described above with reference to the flowcharts and / or block diagrams of the methods, devices (systems) and computer program products according to the embodiments of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer or other programmable blade assembly method, a device and an equipment to produce a machine so that these instructions executed by the processor of a computer or other programmable blade assembly method, a device and an equipment enable the implementation of the function / action specified in one or more boxes of the flowchart and / or block diagram. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor or a field programmable logic circuit. It can also be understood that each box in the block diagram and / or flowchart and the combination of boxes in the block diagram and / or flowchart can also be implemented by dedicated hardware that performs a specified function or action, or can be implemented by a combination of dedicated hardware and computer instructions.

[0201] The above is only a specific implementation of the present application. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, modules and units described above can refer to the corresponding processes in the aforementioned method embodiments, and will not be repeated here. It should be understood that the protection scope of the present application is not limited to this. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed in this application, and these modifications or replacements should be included in the protection scope of this application.

Claims

1. A blade assembly method, characterized in that: The method comprises: Acquire blade information of a blade, where the number of the blades is multiple, and the blade information includes a blade weight value; Determining the number of remaining blades that do not exist in the preset blade distribution array according to the number of blades of the blade and the preset number of blades in the preset blade distribution array; Classifying the plurality of blades according to the blade weight value of each blade and the number of remaining blades to obtain a first blade set and a second blade set; Dividing the turbine disk into regions according to the number of remaining blades to form a first region and a second region; Each first blade in the first blade set is mounted to the first region, and each second blade in the second blade set is mounted to the second region.

2. The method according to claim 1, characterized in that The plurality of blades are classified according to the blade weight value of each blade and the number of remaining blades to obtain a first blade set and a second blade set, including: According to the blade weight value of each blade, the plurality of blades are sorted in descending order to obtain a blade weight sequence; Determining a median blade weight in the blade weight sequence, the median blade weight corresponding to a median blade; Calculate the weight difference between the blade weight value of each third blade in the blade weight sequence and the median weight of the blade, respectively, wherein the third blade is a blade other than the median blade in the blade weight sequence; Sorting the weight differences in ascending order to obtain a blade weight difference sequence; Selecting the first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the remaining number of blades to form the first blade set; It is determined that second leaves among the plurality of leaves that are not included in the first set of leaves constitute the second set of leaves.

3. The method according to claim 2, characterized in that Selecting a first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form the first blade set includes: In the case where the number of remaining blades is equal to 2K, the blade in the first interval is determined to be the first blade, the starting point of the first interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the K+1th blade weight value in the blade weight sequence, where K is a positive integer; When the number of remaining leaves is equal to 2K, the leaves in the second interval are determined to be the first leaves, the starting point of the second interval is the leaf corresponding to the first leaf weight difference in the leaf weight difference sequence, and the end point of the second interval is the leaf corresponding to the K-1th leaf weight difference in the leaf weight difference sequence; Determining the median leaf as the first leaf; The first blade corresponding to the median blade, the first blade in the first interval, and the first blade in the second interval are sequentially and alternately combined to obtain the first blade set.

4. The method according to claim 2, characterized in that Selecting a first blade from the blade weight sequence and the blade weight difference sequence according to the parity of the number of remaining blades to form the first blade set includes: In the case where the number of remaining blades is equal to 2K-1, the blade in the third interval is determined to be the first blade, the starting point of the third interval is the blade corresponding to the second blade weight value in the blade weight sequence, and the end point of the first interval is the blade corresponding to the Kth blade weight value in the blade weight sequence, where K is a positive integer; In the case where the number of remaining blades is equal to 2K-1, the blade in the fourth interval is determined to be the first blade, the starting point of the fourth interval is the blade corresponding to the first blade weight difference in the blade weight difference sequence, and the end point of the fourth interval is the blade corresponding to the K-1th blade weight difference in the blade weight difference sequence; Determining the median leaf as the first leaf; The first blade corresponding to the median blade, the first blade in the third interval, and the first blade in the fourth interval are sequentially combined in an alternating manner to obtain the first blade set.

5. The method according to claim 1, characterized in that The step of dividing the turbine disk into regions according to the number of remaining blades to form a first region and a second region comprises: determining a first region from the turbine disk based on the parity of the number of remaining blades; An area consisting of the assembly grooves on the turbine disk except the first area is determined as a second area.

6. The method according to claim 5, characterized in that The first region includes a first sub-region and a second sub-region, and the first sub-region and the second sub-region are arranged opposite to each other on the turbine disk; Determining a first region from the turbine disk based on the parity of the number of remaining blades includes: When the number of remaining blades is equal to 2K, K adjacent assembly slots of the turbine disk are determined as the first sub-region, and K assembly slots opposite to the first sub-region are determined as the second sub-region, where K is a positive integer; When the number of remaining blades is equal to 2K-1, the adjacent K-1 assembly slots of the turbine disk are determined as the first sub-region, and the K assembly slots opposite to the first sub-region are determined as the second sub-region.

7. The method according to claim 1, characterized in that The method of respectively assembling each first blade in the first blade set to the first region and assembling each second blade in the second blade set to the second region comprises: sequentially assembling each of the first blades in the first blade set to the first region in a first clockwise order; Each of the second blades in the second blade set is assembled to the second area in sequence according to a second clockwise order, and the first clockwise order is opposite to the second clockwise order.

8. The method according to claim 7, characterized in that The step of sequentially assembling each of the second blades in the second blade set to the second region in a second clockwise order includes: According to the blade weight value of each second blade, the second blades are arranged in order from large to small according to the blade weight value to obtain a second blade sequence; Filling each second blade in the second blade sequence into the preset blade distribution array in order from top to bottom and from left to right to obtain a first blade distribution array; Performing a row change on each row of the first blade distribution array to obtain a second blade distribution array; Arranging the number of columns satisfying a preset condition in the second blade distribution array in reverse order to obtain a third blade distribution array; Performing row transformation on each row of the third blade distribution array to obtain a fourth blade distribution array; From left to right and from top to bottom, each of the second blades in the fourth blade distribution array is assembled to the second area in a second clockwise order.

9. A blade assembly device, characterized in that: The device comprises: An acquisition module, used for acquiring blade information of a blade, where the number of the blades is multiple, and the blade information includes a blade weight value; A first determination module, configured to determine the number of remaining blades not existing in the preset blade distribution array according to the number of blades of the blade and the preset number of blades in the preset blade distribution array; A classification module, used for classifying the plurality of leaves according to the leaf weight value of each leaf and the number of remaining leaves to obtain a first leaf set and a second leaf set; A region division module, used for dividing the turbine disk into regions according to the number of remaining blades to form a first region and a second region; An assembly module is used to assemble each first blade in the first blade set to the first area, and to assemble each second blade in the second blade set to the second area.

10. A blade assembly device, characterized in that: The device comprises: a processor and a memory storing computer program instructions; When the processor executes the computer program instructions, the blade assembly method according to any one of claims 1 to 8 is implemented.

Images