Optimal Design Method for Hole Making Sequence in Multi-intersection Finishing of Wing Parts

By applying a binary tree search algorithm to optimize the finishing order of multi-intersection holes in aircraft wing components, the problem of large error accumulation in traditional methods is solved, the hole making accuracy and coordination are improved, and the finishing requirements of aircraft assembly are met.

CN115453977BActive Publication Date: 2024-11-22SHENYANG AIRCRAFT CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211169074.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-26
Publication Date
2024-11-22
Estimated Expiration
2042-09-26

AI Technical Summary

Technical Problem

Traditional methods accumulate large errors during the multi-intersection hole finishing process of aircraft wing components, which affects assembly accuracy and coordination.

Method used

A binary tree model with multiple intersection points of the wing components is constructed using a binary tree search algorithm. The optimized hole making sequence is obtained through the optimal binary tree search algorithm, which reduces error accumulation, and verifies the hole position deviation through the robot photogrammetry system.

Benefits of technology

The hole making accuracy is improved by about 10%-15%, and the coordination of multi-intersection holes is improved by about 20%, meeting the finishing requirements of fork ears and intersection holes for large components of the wing body.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115453977B_ABST
    Figure CN115453977B_ABST
Patent Text Reader

Abstract

The present invention proposes an optimization design method for the hole-making sequence of multi-intersection finishing of wing components, which belongs to the field of aviation manufacturing engineering and aircraft assembly technology. The method establishes a binary tree model for the multi-intersection of wing components based on a binary tree search algorithm, and applies the optimal binary tree search algorithm to obtain the hole-making sequence of multi-intersection holes, thereby reducing the influence of error accumulation on the coordination of multiple holes. Through the present invention, the hole-making accuracy is improved by 10%-15%, and the coordination of multi-intersection holes is improved by 20%, which meets the requirements for the finishing of intersection holes of large wing-body components.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of aviation manufacturing engineering and aircraft assembly technology, and relates to an optimization design method for the multi-intersection finishing hole making sequence of a wing component, which is used for optimizing the multi-intersection finishing hole making sequence of an aircraft wing-body docking part. Background Art

[0002] There are some key connection feature holes distributed on the aircraft body structure, such as wing-body connection holes, landing gear mounting holes, horizontal vertical tail and fuselage docking holes, etc., collectively referred to as aircraft intersection holes. These intersection holes play a vital role in the quality of the aircraft. In aircraft assembly, after the assembly of large parts such as the fuselage and wings is completed, the intersection holes on the fuselage and wings need to be fine-machined in order to reduce component assembly errors and ensure assembly coordination.

[0003] The intersection holes that connect the fuselage and the wing of the aircraft are in the form of flange multi-holes, with the axial direction of the wingspan as the direction. Traditional methods usually have two sequences for finishing multi-intersection holes. One is to drill from front to back or from back to front along the heading, and the other is to select the middle hole as the starting hole to start drilling, and extend alternately to the left and right sides to complete the finishing of all intersection holes in sequence. Although the second method is better than the first method and reduces the accumulation of errors in the same direction, it accumulates the stress of the finishing process and the elastic deformation of the components from the center to both sides to a certain extent, and the deviation of the end holes of the porous structure is relatively large.

[0004] In order to further reduce the error accumulation in the finishing process of multiple intersection holes and improve the assembly accuracy, the present invention relates to an optimization design method for the multi-intersection finishing hole making sequence of wing components based on a binary tree search algorithm. A binary tree model is constructed for multiple intersection holes of the wing components, and the optimal binary tree search algorithm is applied to obtain the hole making sequence to meet the finishing requirements of the intersection holes of the fork ears of the large wing-body components and improve the product assembly accuracy. Summary of the invention

[0005] In order to solve the above problems in the prior art, the present invention proposes an optimization design method for the finishing hole making sequence of multiple intersections of wing components, establishes a binary tree model for multiple intersections of wing components based on a binary tree search algorithm, and applies the optimal binary tree search algorithm to obtain the finishing hole making sequence of multiple intersection holes, thereby reducing the influence of error accumulation on the coordination of multiple holes.

[0006] The technical solution of the present invention is:

[0007] An optimization design method for the multi-intersection finishing hole making sequence of a wing component comprises the following steps:

[0008] S1, code and mark the wing intersection holes along the heading, in order of k 1 ,k 2 ,k3 ,…,k n ,like Figure 1 shown.

[0009] S2. Construct a binary tree model. Each node in a binary tree has at most two subtrees, that is, the degree of the node is no more than 2, the left side is the left subtree, the right side is the right subtree, and any nodes in the tree are not equal.

[0010] When n is an odd number, a complete binary tree can be constructed. (n+1) / 2 is the root node, which is the first layer; k (n-1) / 2 and k (n+3) / 2 It is the child node of the root node, which is the second layer; and so on, until it is decomposed to the leaf node, which is assumed to be the Lth layer.

[0011] When n is an even number, k n / 2 is the root node, which is the first layer; k (n-2) / 2 and k (n+2) / 2 It is the child node of the root node, which is the second layer; and so on, until it is decomposed to the leaf node, which is assumed to be the Lth layer.

[0012] S3. Obtain the hierarchical traversal sequence of the binary tree model, that is, convert each node on the binary tree into a linear sequence as the hole making sequence for fine machining.

[0013] According to the in-order traversal method, first extract the left node, then extract the root node, and then extract the right node until the last node is encoded. For example, assuming △ i is the L-1th layer node, i is the number of L-1th layer nodes, then: when n is an odd number, the sequence is...k 2 ,△ 1 , k n-1 …k 1 ,△ 2 , k n …k (n+1) / 2 …k (n-5) / 2 …k (n+3) / 2 …k (n+7) / 2 ...; when n is an even number, the sequence is ...k 1 ,△ 1 , k n-1 …k (n-2) / 2 …△ 2 …k n / 2 …k (n-6) / 2 …k (n+2) / 2 …k (n+6) / 2 …. Then the hole making order of multiple intersection points is…k 2 →△ 1 →k n-1 …k 1 →△ 2 →k n …k (n+1) / 2…k (n-5) / 2 …k (n+3) / 2 …k (n+7) / 2 ...and...k 1 →△ 1 →k n-1 …k (n-2) / 2 …△ 2 …k n / 2 …k (n-6) / 2 …k (n+2) / 2 …k (n+6) / 2 ….

[0014] S4, start the robot photogrammetry system, and measure the three-dimensional coordinates and axis angles (x′) of the intersection holes in the whole machine coordinate system one by one according to the optimized hole making sequence. 1 , y′ 1 , z′ 1 , α 1 '),(x′ 2 , y′ 2 , z′ 2 , α 2 '),(x′ 3 , y′ 3 , z′ 3 , α 3 ')…(x′ n , y′ n , z′ n , α n '), assuming the theoretical coordinates and axis angle of the intersection hole are (x 1 ,y 1 , z 1 , α 1 )、(x 2 ,y 2 , z 2 , α 2 )、(x 3 ,y 3 , z 3 , α 3 )…(x n ,y n , z n , α n ), solve the hole position deviation:

[0015] Hole 1:

[0016] Hole 2:

[0017] Hole 3:

[0018] …

[0019] Hole:

[0020] Assume that the diameter of the hole to be processed is d, the diameter of the hole after fine processing is D, and the depth of the intersection hole is δ. Then verify the reliability of hole making according to the following requirements:

[0021] △ m ≤(Dd) / 2; m=1,2,3,…,n;

[0022] α m ≤arctan(Dd) / 2δ; m=1,2,3,…,n.

[0023] Beneficial effects of the invention: The invention proposes an optimized design method for the multi-intersection finishing hole making sequence of wing components. By applying the invention, the hole making accuracy is improved by about 10%-15%, and the coordination of multi-intersection holes is improved by about 20%, meeting the finishing requirements of the intersection holes of the fork ears of large wing-body components. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 It is a schematic diagram of the intersection hole coding mark.

[0025] Figure 2 This is a schematic diagram of constructing the intersection hole binary tree model when n is an odd number.

[0026] Figure 3 This is a schematic diagram of constructing the intersection hole binary tree model when n is an even number.

[0027] Figure 4 Schematic diagram of a binary tree model in the embodiment. DETAILED DESCRIPTION

[0028] The specific implementation of the present invention is further explained below in conjunction with the examples and drawings, but is not intended to limit the present invention.

[0029] The present invention proposes an optimization design method for the hole-making sequence of multiple intersections of wing components. Based on the binary tree search algorithm, a binary tree model is first established for the multiple intersections of the wing components, and then the optimal binary tree search algorithm is applied to obtain the hole-making sequence of multiple intersection holes. The specific implementation steps are as follows:

[0030] 1) Digital positioning of wing components

[0031] The wing components are digitally positioned on the finishing table, connected with a positioner, and the reference points on the wing components are measured with high precision using a laser tracker. The measurement results are fitted with theoretical data to determine whether the positioning accuracy of the components meets the technical requirements. If not, the components need to be adjusted until the actual attitude is adjusted to the target attitude. The coordinate system of the wing components is determined to be the aircraft design coordinate system.

[0032] 2) Clamp and fix the wing parts and install the finishing jig

[0033] Use the clamping device to clamp and fix the wing parts after attitude adjustment to ensure their stability during the finishing process. Position the jig assembly on the finishing table to check whether the machining allowance meets the process design requirements.

[0034] 3) Code and mark the wing intersection holes

[0035] In the product digital model, from before the flight to after the flight, it is marked as k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , k 8 , k 9 , k 10 .

[0036] 4) Construct a binary tree model

[0037] like Figure 4 As shown, k 5 is the root node, which is the first layer; k 4 and k 6 The child node of the root node is the second layer; and so on, until it is decomposed to the leaf node, which is the fourth layer.

[0038] 5) Solve the hole making sequence

[0039] According to the constructed binary tree model and traversal rules, the first layer is k 5 , the second layer is k 4 , k 6 , the third layer is k 3 , k 7 , k 2 , k 8 , the fourth layer is k 1 , k 9 , k 10 According to the in-order traversal method, the linear sequence extracted from each node is k 1 , k 3 , k 9 , k 4 , k 7 , k 10 , k 5 , k 2 , k 6 , k 8 , thus determining the hole making order as k 1 →k 3 →k 9 →k 4 →k 7 →k 10 →k5 →k 2 →k 6 →k 8 .

[0040] 6) Hole position accuracy detection and reliability verification

[0041] Start the robot photogrammetry system and measure the three-dimensional coordinates and axis angles (x′) of the intersection holes in the whole machine coordinate system one by one according to the optimized hole making sequence. 1 , y′ 1 , z′ 1 , α 1 '),(x′ 2 , y′ 2 , z′ 2 , α 2 '),(x′ 3 , y′ 3 , z′ 3 , α 3 ')…(x′ 10 , y′ 10 , z′ 10 , α 10 '), assuming the theoretical coordinates and axis angle of the intersection hole are (x 1 ,y 1 , z 1 , α 1 )、(x 2 ,y 2 , z 2 , α 2 )、(x 3 ,y 3 , z 3 , α 3 )…(x 10 ,y 10 , z 10 , α 10 ), solve the hole position deviation:

[0042] Hole 1:

[0043] Hole 2:

[0044] Hole 3:

[0045] …

[0046] Hole 10:

[0047] Assume that the diameter d of the hole to be processed is 45mm, the diameter D of the hole after fine processing is 50mm, and the depth δ of the intersection hole is 20mm. Verify the reliability of hole making according to the following requirements:

[0048] ①(50-45) / 2=2.5mm

[0049] ②arctan(50-45) / 40=7.1°

[0050] △ m ≤2.5mm; m=1,2,3,…,n;

[0051] α m ≤7.1°; m=1,2,3,…,n.

[0052] 7) Multi-intersection hole finishing

[0053] Combined with dynamic cutting equipment, each intersection hole is fine-machined in sequence according to the hole making order. After completion, the hole making accuracy is checked according to the process requirements.

Claims

1. An optimization design method for the multi-intersection finishing hole making sequence of wing components, characterized in that: The method comprises the following steps: S1. Code and mark the wing intersection holes The wing intersection holes are coded and marked along the heading, in order of k1, k2, k3, ..., k n ; S2. Construct a binary tree model Each node in a binary tree has at most two subtrees, that is, the degree of the node is no more than 2, the left side is the left subtree, the right side is the right subtree, and any node in the tree is not equal; When n is an odd number, a complete binary tree is constructed; (n+1) / 2 is the root node, the root node is the first layer; the root node k (n+1) / 2 The child node k (n-1) / 2 and k (n+3) / 2 , as the second layer; child node k (n-1) / 2 The child node k (n-3) / 2 and k (n+5) / 2 , child node k (n+3) / 2 The child node k (n-5) / 2 and k (n+7) / 2 , as the third layer, until it is decomposed to leaf nodes k2, k n-1 , k1, k n ; When n is an even number, k n / 2 is the root node, the root node is the first layer; the root node k n / 2 The child node k (n-2) / 2 and k (n+2) / 2 As the second layer; child node k (n-2) / 2 The child node k (n-4) / 2 and k (n+4) / 2 , child node k (n+2) / 2 The child node k (n-6) / 2 and k (n+6) / 2 As the third layer, until it is decomposed to leaf nodes k1, k n-1 , k n ; S3. Solving the hole making sequence Obtain the hierarchical traversal sequence of the binary tree model, that is, convert each node on the binary tree into a linear sequence as the hole-making sequence for fine machining; According to the in-order traversal method, first extract the left node, then extract the root node, and then extract the right node until the last node code is obtained to obtain the hole making order; S4. Hole position accuracy detection and reliability verification Start the robotic photogrammetry system and measure the three-dimensional coordinates and axis angles of the intersection holes in the whole machine coordinate system one by one according to the optimized hole-making sequence (x′1, y′1, z′1, α1'), (x′2, y′2, z′2, α2'), (x′3, y′3, z′3, α3')…(x′ n , y′ n , z′ n , α n '), assuming that the theoretical coordinates and axis angles of the intersection holes are (x1, y1, z1, α1), (x2, y2, z2, α2), (x3, y3, z3, α3)…(x n ,y n , z n , α n ), solve the hole position deviation: Hole 1: Hole 2: Hole 3: … Hole: Assume that the diameter of the hole to be processed is d, the diameter of the hole after fine processing is D, and the depth of the intersection hole is δ. Then verify the reliability of hole making according to the following requirements: △ m ≤(D-d) / 2;m=1,2,3,…,n; a m ≤arctan(Dd) / 2δ;m=1,2,3,…,n; In step S3, let △ i is the L-1th layer node, i is the number of L-1th layer nodes, then: when n is an odd number, the sequence is k2, △1, k n-1 …k1, △2, k n …k (n+1) / 2 …k (n-5) / 2 …k (n+3) / 2 …k (n+7) / 2 ...; when n is an even number, the sequence is k1, △1, k n-1 …k (n-2) / 2 …△2…k n / 2 …k (n-6) / 2 …k (n+2) / 2 …k (n+6) / 2 ...; then the order of making holes at multiple intersections is k2→△1→k n-1 …k1→△2→k n …k (n+1) / 2 …k (n-5) / 2 …k (n+3) / 2 …k (n+7) / 2 …and k1→△1→k n-1 …k (n-2) / 2 …△2…k n / 2 …k (n-6) / 2 …k (n+2) / 2 …k (n+6) / 2 ….