Open type blisk hub machining tool path planning method based on parameter mapping

Abstract

The invention relates to an open type blisk hub machining tool path planning method based on parameter mapping. The open type blisk hub machining tool path planning method comprises the following steps that S1, NURBS curved surfaces of a hub and a fillet are obtained; s2, solving a curve after geodesic offset of the annular boundary; s3, splitting the curve after geodesic offset to obtain a curve C1 and a curve C2; s4, discretizing the curve C2 to take points, and shifting the curve C1 to obtain a curve C1 '; s5, making an isoparametric line towards the curve C1'by taking the discrete point as a starting point, determining the number of cutter paths according to the longest isoparametric line corresponding to the Euclidean space, taking points of the isoparametric line at equal intervals according to the number of cutter paths, and sequentially connecting the points along the axial direction of the hub to obtain a plurality of cutter paths; s6, extending the two ends of each cutter path in the runner to obtain cutter path extending paths on the outer sides of the blades; and S7, converting the path into a cutter location point. According to the method, the annular boundary serves as the boundary of hub machining, complex geometrical characteristics are relatively simplified, sampling is carried out according to chord height constraint, and smooth transition of a path is ensured.

Description

Technical Field

[0001] The invention relates to the technical field of numerical control machining, and in particular to a tool path planning method for machining an open integral blade disk hub based on parameter mapping. Background Art

[0002] With the continuous development of my country's aviation industry, the processing importance of blisks has become increasingly prominent. Blisks are widely used in the aviation field. They are usually used in the turbine parts of aircraft engines, such as compressors and turbines in turbojets and turboprop engines. Blisks have the characteristics of high strength, high temperature resistance and light weight, which can improve the performance and efficiency of the engine, while reducing the weight of the aircraft and reducing fuel consumption. This makes blisks one of the indispensable key components in the aviation field.

[0003] Tool path planning for blisk hub finishing is an important part of blisk CNC machining, affecting the machining efficiency and quality of blisk. Traditional machining methods are often not suitable for blisks with complex surface features, and are prone to problems such as uneven paths, which will affect the machining efficiency and quality of blisks. Summary of the invention

[0004] Based on this, it is necessary to provide a tool path planning method for open integral blisk hub machining based on parameter mapping in order to address the problem of uneven paths that easily occur when machining integral blisks using traditional machining methods.

[0005] The present invention proposes a tool path planning method for machining an open integral blade hub based on parameter mapping, which comprises the following steps: S1: obtaining the NURBS surfaces of the hub and the fillets between the blades and the hub in the three-dimensional model of the blade; S2: solving the curve of the annular boundary of the fillet close to the hub side after geodesic offset in the parameter domain, and the specific steps are: S21: extracting the two-dimensional B-spline curve of the annular boundary of the fillet close to the hub side in the parameter domain from the NURBS surface; S22: finding the position of the corresponding point of each point on the two-dimensional B-spline curve in the Euclidean space along The tangent vector of the annular boundary curve and the normal vector on the corresponding hub surface; S23: cross-multiply the obtained tangent vector and the normal vector to obtain the geodesic offset direction of the annular boundary in the parameter domain; S24: preset an offset distance, and iterate the points on the two-dimensional B-spline curve according to the offset distance to obtain the geodesic offset curve of the annular boundary in the parameter domain; S3: use the golden section method to iteratively calculate the extreme points of the leading edge and the trailing edge of the geodesic offset curve of the annular boundary in the parameter domain in the axial direction of the hub, and use the extreme points of the leading edge and the trailing edge to the annular boundary. The curve after geodesic migration of the wheel hub boundary in the parameter domain is split to obtain curve C1 and curve C2; ​​S4: discretize the curve C2 according to the chord height constraint to obtain multiple discrete points, and use the multiple discrete points to obtain isoparametric lines along the rotation direction of the hub surface, and offset the curve C1 in the parameter domain to obtain curve C1′; S5: use the multiple discrete points as the starting points of the isoparametric lines to make intersection lines with the curve C1′, and use the intersection point of the isoparametric line and the curve C1′ as the end point of the isoparametric line, and select the isoparametric line with the longest length in the Euclidean space according to the multiple isoparametric lines. The number of tool paths is determined by the isoparametric lines, and points are taken at equal distances on the isoparametric lines between the discrete points and the curve C1′ according to the number of tool paths, and are connected in sequence along the axial direction of the hub to obtain multiple tool paths in the flow channel between two adjacent blades; S6: the two ends of each tool path in the flow channel are extended respectively to obtain the tool path extension path on the outside of the blade; S7: the tool path in the flow channel and the points on the tool path extension path are mapped to the Euclidean space, and the points corresponding to the Euclidean space are offset by a hub margin along the normal direction of the hub surface to obtain the required tool position position.

[0006] As a further improvement of the present invention, in step S1, the NURBS surface equations of the fillet and the hub are:

[0007] S(u,v)=P·N u (u)·N v (v) T ·W

[0008] Among them, P is the matrix storing control points, W is the matrix storing weights, and N u is the matrix storing the B-spline basis function in direction u, N v is the matrix storing the B-spline basis functions for direction v.

[0009] As a further improvement of the present invention, in step S21, given the parameter m and the node sequence M = {m0, m1, ..., m n+z+1}, and a set of control points P = {P0, P1, ..., P n}, the function of the two-dimensional B-spline curve is: C(m)=∑N i,z (m)P i , where N i,z (m) is the i-th basis function, defined as:

[0010] For z = 0,

[0011] For z>0,

[0012] Wherein: n is the number of control points, z is the order of the two-dimensional B-spline curve, and i=0,1,...n.

[0013] As a further improvement of the present invention, the curve parameter equation c(t) of the annular boundary is assumed to be:

[0014] c(t)=(x(t),y(t),z(t))

[0015] Then the tangent vector T(t) is:

[0016]

[0017] Assume the parametric equation of the hub surface r(u,v) is:

[0018] r(u,v)=(x(u,v),y(u,v),z(u,v))

[0019] Then the normal vector N(u,v) is:

[0020]

[0021] Then the iteration direction δ of the geodesic migration is n for:

[0022] δ n =T(t)×N(u,v)

[0023] Where t is the parameter of the annular boundary curve equation, x(t), y(t) and z(t) represent the position of the annular boundary curve in the x-axis, y-axis and z-axis directions as the parameter t changes, respectively; x(u,v), y(u,v) and z(u,v) represent the position of the hub surface in the x-axis, y-axis and z-axis directions as the parameters u and v change, respectively. and are the partial derivative vectors of the hub surface with respect to parameters u and v respectively.

[0024] As a further improvement of the present invention, in step S24, the update equation used in the coordinate iteration process is as follows:

[0025]

[0026] Where p, q are the u and v coordinates of the offset point, ds is the offset distance, It is an expression composed of the first basic quantity, the second basic quantity and their derivatives expressed by Christoffel symbols. k represents the direction of the result, i and j represent the two parameter directions of the derivative, corresponding to the rates of change of the two local coordinates respectively.

[0027] As a further improvement of the present invention, in step S4, discrete points are selected for the curve C2 according to the chord height constraint, and the chord height error formula L s for:

[0028]

[0029] Among them, L s represents the distance between two adjacent points, ε s is the chord height constraint error, ρ A is the normal radius of curvature of curve C2 at that point; and / or

[0030] In step S4, the parameter domain range of curve C1 is [a2, b2], and the offset distance L of curve C1 is c for:

[0031]

[0032] Wherein, B is the number of blades.

[0033] As a further improvement of the present invention, in step S5, the isoparametric line with the longest length in the Euclidean space is selected from the multiple isoparametric lines, and its length is set to L. Then the number of tool paths N is:

[0034]

[0035] Among them, s is the maximum line spacing between the set isoparametric lines.

[0036] As a further improvement of the present invention, step S6 specifically comprises the following steps:

[0037] S61: Obtain the tangent direction at the first and last endpoints of each tool path, extend the specified tangent distance, obtain the end point after the tangent extension, and take it as the first control point of the quadratic Bezier curve;

[0038] S62: Extend the end point obtained in S61 further along the tangent direction by a specified radial distance to obtain the end point after tangent extension, and take it as the second control point of the quadratic Bezier curve;

[0039] S63: Extend the end point obtained in S62 by a specified radial distance along the axial direction of the hub to obtain the end point after axial extension, and take it as the third control point of the quadratic Bezier curve;

[0040] S64: constructing a quadratic Bezier curve using the obtained first control point, second control point and third control point, and then obtaining a tool path extension path according to the quadratic Bezier curve.

[0041] As a further improvement of the present invention, in step S7, the tool position calculation formula is:

[0042] P L =P c +(r 球 +δ)n s

[0043] Among them, P L is the knife point, P c is the knife contact point, r 球 is the radius of the ball end cutter, δ is the set hub allowance, n s is the normal vector of the hub surface.

[0044] The present invention also proposes a tool path generation module, which includes a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the above-mentioned open integral blade disk hub processing tool path planning method based on parameter mapping is adopted to generate the processing path of the blade disk hub according to the three-dimensional model of the blade disk to be processed; and send it to the corresponding machining center.

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

[0046] The present invention extracts the NURBS surfaces of the fillet and the hub based on the three-dimensional model of the blade disk, and extracts the B-spline curve of the annular boundary from the NURBS surface. Planning the path based on this can reflect the characteristics of the part itself and achieve a high-precision processing effect. The annular boundary of the intersection of the hub and the fillet is used as the boundary for hub processing to relatively simplify the complex geometric features, and sampling is performed according to the chord height constraint to ensure a smooth transition of the path. By using the fillet margin control method of geodesically offsetting the intersection of the hub and the fillet, the margin can be flexibly adjusted according to actual conditions, thereby improving the accuracy. In combination with the hub margin control through the hub normal vector, a universal processing path can be generated. The entire method makes the path smoother through precise geometric control and error adjustment. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 A flowchart of the steps of a method for tool path planning for an open blisk hub machining based on parameter mapping according to an embodiment of the present invention;

[0048] Figure 2 A three-dimensional model diagram of a blade disk in an embodiment of the present invention;

[0049] Figure 3 Schematic diagram of a curve after geodesic migration of an annular boundary in an embodiment of the present invention;

[0050] Figure 4 It is a schematic diagram of splitting a curve after geodesic migration of an annular boundary in an embodiment of the present invention;

[0051] Figure 5 Schematic diagram of sampling points after discrete sampling of surface C2 in an embodiment of the present invention;

[0052] Figure 6 is a schematic diagram of a curve after the curved surface C1 is offset in an embodiment of the present invention;

[0053] Figure 7 It is a graph of sampling points of the surface C2 after discrete sampling and the curve after C1 offset corresponding to the Euclidean space in the embodiment of the present invention;

[0054] Figure 8 It is a schematic diagram of the isoparametric lines drawn through discrete points intersecting with the curve C1′ corresponding to the Euclidean space in an embodiment of the present invention;

[0055] Fig. 9 It is a schematic diagram of the Euclidean space corresponding to uniformly sampling points on all isoparametric lines according to the number of tool paths in an embodiment of the present invention;

[0056] Fig.10 A schematic diagram of a strategy for extending a tool path in an embodiment of the present invention;

[0057] Fig.11 A schematic diagram of a path after the tool path is extended in an embodiment of the present invention;

[0058] Fig.12 It is a schematic diagram of the final complete cutting tool path in an embodiment of the present invention. DETAILED DESCRIPTION

[0059] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0060] It should be noted that when a component is referred to as being "mounted on" another component, it may be directly on the other component or there may be a central component. When a component is considered to be "set on" another component, it may be directly set on the other component or there may be a central component at the same time. When a component is considered to be "fixed to" another component, it may be directly fixed on the other component or there may be a central component at the same time.

[0061] like Figure 1-Figure 12 As shown, the embodiment of the present invention proposes a tool path planning method for machining an open blisk hub based on parameter mapping, which is mainly used to determine the planning of the finishing tool path of the blisk hub according to the fillet allowance of the blisk. The specific steps are as follows:

[0062] S1: Obtain the three-dimensional model of the blade disk, and read the NURBS surfaces of the hub and the fillet between the blades and the hub in the three-dimensional model of the blade disk. It should be noted that the three-dimensional model of the blade disk is a known existing model, and the NURBS surface expressions corresponding to the faces of the fillet between the hub and the blades and the hub in the three-dimensional model of the blade disk are also known. The information of the NURBS surfaces of the fillet between the hub and the blades and the hub can be directly obtained from the three-dimensional model of the blade disk. A total of five NURBS surfaces are obtained, namely one face of the hub and four faces of the fillet.

[0063] The expressions of the NURBS surface equations of the fillet and the hub are:

[0064] S(u,v)=P·N u (u)·N v (v) T ·W

[0065] Among them, P is the matrix storing control points, W is the matrix storing weights, and the matrix N u is the matrix storing the B-spline basis function in direction u, the matrix N v is a matrix storing the B-spline basis functions of direction v. In this embodiment, direction v may be the axial direction of the hub, and direction u may be the circumferential direction along the hub.

[0066] S2: Solve the geodesic offset of the annular boundary of the fillet close to the hub side. The annular boundary here is the annular intersection line of the fillet and the hub surface.

[0067] The specific steps are:

[0068] S21: Extract the two-dimensional B-spline curve of the annular boundary of the fillet close to the hub side in the parameter domain from the NURBS surface obtained above. The recursive definition of the two-dimensional B-spline curve function is as follows:

[0069] Given parameter m and node sequence M = {m0,m1,…,mn+z+1}, and a set of control points P = {P0, P1, ..., P n}, the two-dimensional B-spline curve can be expressed as C(m)=∑N i,z (m)P i , where N i,z (m) is the i-th basis function, defined as follows:

[0070] For z = 0,

[0071] For z>0,

[0072] Wherein: n is the number of control points, z is the order of the two-dimensional B-spline curve, and i=0,1,...n.

[0073] S22: Solve the position of the corresponding point of each point on the two-dimensional B-spline curve in the Euclidean space along the tangent vector of the annular boundary curve and the normal vector on the corresponding hub surface.

[0074] Among them, the tangent vector of the position of the corresponding point of each point on the two-dimensional B-spline curve in the Euclidean space along the annular boundary curve can be calculated by the derivative of the parameter equation of the annular boundary with respect to the parameter. Specifically, the curve equation of the annular boundary is assumed to be:

[0075] c(t)=(x(t),y(t),z(t))

[0076] Where t is the parameter of the annular boundary curve equation, and x(t), y(t) and z(t) respectively represent the changes of the position of the annular boundary curve in the x-axis, y-axis and z-axis directions with the parameter t.

[0077] Then the tangent vector T(t) of the corresponding point of each point on the two-dimensional B-spline curve in the Euclidean space along the annular boundary curve is:

[0078]

[0079] Assume the parametric equation of the hub surface r(u,v) is:

[0080] r(u,v)=(x(u,v),y(u,v),z(u,v))

[0081] Then the normal vector N(u,v) on the hub surface corresponding to the position of the corresponding point in Euclidean space at each point on the two-dimensional B-spline curve is:

[0082]

[0083] S23: Cross-multiply the obtained tangent vector T(t) and the normal vector N(u,v) to obtain the direction δ of the geodesic offset of the annular boundary curven ;

[0084] δ n =T(t)×N(u,v)

[0085] Among them, x(u,v), y(u,v) and z(u,v) represent the changes of the position of the hub surface in the x-axis, y-axis and z-axis directions with the parameters u and v respectively. and are the partial derivative vectors of the hub surface with respect to the parameters u and v. Since the annular boundary curve is the offset curve obtained through continuous iteration, the above geodesic offset direction is also called the geodesic iteration direction.

[0086] S24: Preset an offset distance, and iterate the points on the two-dimensional B-spline curve according to the offset distance to obtain the curve after the geodesic offset of the annular boundary. It should be noted that the offset distance is also called the fillet allowance, which is usually determined according to the previous process. The operator can set the offset distance according to the actual working conditions. Then, the coordinates of the points on the two-dimensional B-spline curve can be updated and iterated according to the preset offset distance. Among them, the update equation used in the coordinate iteration process is as follows:

[0087]

[0088] Where p, q are the u and v coordinates of the offset point, ds is the offset distance, It is an expression composed of the first basic quantity, the second basic quantity and their derivatives expressed by Christoffel symbols. k represents the direction of the result, i and j represent the two parameter directions of the derivative, corresponding to the rates of change of the two local coordinates respectively.

[0089] In this way, the allowance control near the fillet can be achieved, so that different tool paths can be generated according to different allowances, which facilitates multiple cutting processes on the fillet, thereby improving the quality and accuracy of the processing.

[0090] S3: The extreme points of the leading edge and the trailing edge of the two-dimensional B-spline curve in the axial direction of the wheel hub are iteratively calculated using the golden section method, and the two-dimensional B-spline curve is split using the extreme points of the leading edge and the trailing edge to obtain curve C1 and curve C2.

[0091] Since the first-order derivative functions of the leading and trailing edge curves of the two-dimensional B-spline curve in the axial direction of the hub are continuous and monotonic, when the first-order derivative function of the leading edge curve is 0, it is at the extreme point of the corresponding leading edge curve. When the first-order derivative function of the trailing edge curve is 0, it is at the extreme point of the corresponding trailing edge curve. The first-order derivative function can be obtained to be 0 using the golden section method.

[0092] For example, the specific steps for solving the minimum value are:

[0093] S31: Given an initial interval [a,b], and an accuracy requirement∈.

[0094] S32: Calculate two segmentation points t1, t2, so that Where φ is the golden ratio, usually taken as

[0095] S33: Calculate the values ​​f(t1) and f(t2) of the function f(t) of the two-dimensional B-spline curve at two segmentation points,

[0096] Compare f(t1) and f(t2) to determine the interval that should be searched in the next iteration.

[0097] If f(t1)>f(t2), there can be no extreme point in [a,t1], and the update interval is [t1,b];

[0098] If f(t1)≤f(t2), there can be no extreme points in [t2,b], and the update interval is [a,t2].

[0099] S34: Repeat steps S32 to S33 until the interval length is less than or equal to the given precision ∈, and the midpoint of the remaining interval is the minimum point of the function.

[0100] The specific steps for finding the maximum value are:

[0101] S35: Given an initial interval [a1,b1], and an accuracy requirement∈.

[0102] S36: Calculate two segmentation points t3, t4, so that Where φ is the golden ratio, usually taken as

[0103] S37: Calculate the values ​​f(t3) and f(t4) of the function f(t) of the two-dimensional B-spline curve at two segmentation points,

[0104] Compare f(t3) and f(t4) to determine the interval that should be searched in the next iteration.

[0105] If f(t3)>f(t4), there can be no extreme point in [t4,b1], and the update interval is [a1,t4];

[0106] If f(t3)≤f(t4), there can be no extreme points in [a1,t3], and the update interval is [t3,b1].

[0107] S38: Repeat steps S36 to S37 until the interval length is less than or equal to the given precision ∈, and the midpoint of the remaining interval is the maximum point of the function.

[0108] After obtaining the minimum point and the maximum point, the two-dimensional B-spline curve is split into curve C1 and curve C2 by the minimum point and the maximum point.

[0109] S4: Discretize the curve C2 according to the chord height constraint to obtain multiple discrete points, and use the multiple discrete points to obtain isoparametric lines along the rotation direction of the hub surface, and offset the curve C1 in the parameter domain to obtain the curve C1′.

[0110] Specifically, the curve equation of the curve C2 is assumed to be: C2(t)=(u(t), v(t)), where t is a parameter.

[0111] Chord height error formula L s for:

[0112]

[0113] Among them, L s represents the distance between two adjacent points, ε s is the chord height constraint error, ρ A is the normal radius of curvature of curve C2 at this point.

[0114] First, select the first point P1. The first point P1 can be the first or last endpoint of the curve C2. In this way, we can use the position of the first point P1 and the chord height error formula L s P2 is calculated along the length direction of curve C2. n In this way, multiple discrete points in the curve C2 can be obtained.

[0115] Assume that the parameter domain of curve C1 is [a2, b2], and the offset distance L of curve C1 is c for:

[0116]

[0117] Wherein, B is the number of blades.

[0118] As shown in the figure, it should be noted that when processing the fillet, the flow channel between two adjacent blades is mainly processed, |b2-a2| is the circumference of the hub surface, the curve C2 is the left boundary of one of the flow channels, and the offset C1′ is the right boundary of the flow channel. Finally, the tool path is designed in the flow channel between the corresponding curve C2 and the offset C1′.

[0119] S5: Using the multiple discrete points sampled from the curve C2 as the starting point of the isoparametric line to make an intersection line with the curve C1′, and using the intersection point of the isoparametric line and the curve C1′ as the end point of the isoparametric line, the number of tool paths is determined according to the isoparametric line with the longest length in the Euclidean space among the multiple isoparametric lines.

[0120] Assume that the length of the longest isoparametric line corresponding to the Euclidean space is L, then the number of tool paths N is:

[0121]

[0122] Among them, s is the maximum line spacing between the set isoparametric lines.

[0123] And according to the number of tool paths, the isoparametric lines between the discrete points and the curve C1′ are equidistantly sampled. The number of points can be determined according to the actual working conditions, and they are connected in sequence along the axial direction of the hub to obtain the paths of multiple tool paths in the flow channel. For example: if the number of tool paths obtained is 10, 10 points are sampled at equal distances on each isoparametric line, and the first point on each isoparametric line is connected in sequence along the axial direction of the hub to obtain the first tool path. The second point on each isoparametric line is connected in sequence along the axial direction of the hub to obtain the second tool path. And so on, ten tool paths can be obtained. Among them, the flow channel is the space between two adjacent blades.

[0124] S6: As shown in the figure, the two ends of each tool path in the flow channel are extended respectively to obtain the tool path extension path outside the blade. The specific steps are:

[0125] S61: Obtain the tangent direction at the first and last endpoints of each tool path, extend the specified tangent distance, obtain the end point after the tangent extension, and take it as the first control point of the quadratic Bezier curve. The tangent distance here refers to the difference in V value between two points. The extension distance in this step can be determined according to the actual working conditions.

[0126] S62: Extend the end point obtained in S61 tangentially for a specified radial distance, obtain the end point after tangential extension, and take it as the second control point of the quadratic Bezier curve. The tangential distance here refers to the difference in V values ​​between the two points, and the extension length can be 1 / 4 of the radial distance.

[0127] S63: Extend the end point obtained in S62 by a specified radial distance along the axial direction of the hub to obtain the end point after axial extension, and take it as the third control point of the quadratic Bezier curve. The axial distance here also refers to the difference in V values ​​between the two points, and the extension length can be 1 / 4 of the radial distance.

[0128] S64: A quadratic Bezier curve is constructed as a transition curve using the first control point, the second control point and the third control point. A specified radial distance is extended from the end point of the transition curve along the axial direction of the hub, and the two extended curves in the previous steps S62 and S63 constitute the final tool path extension path. The tool path extension path plus the previous tool path constitute a complete tool processing path. The extension distance in this step can be determined according to the actual working conditions.

[0129] Among them, the general expression of Bezier curve is:

[0130]

[0131] Where P(t) is a point on the curve; t is a parameter, usually in the range of 0≤t≤1; n is the number of control points, P i are the coordinates of the control points. is the Bessel basis function, defined as follows:

[0132]

[0133] in, is the binomial coefficient, i.e. the number of combinations:

[0134]

[0135] S7: The tool path in the flow channel and the points on the tool path extension path are mapped to the Euclidean space, and the points corresponding to the Euclidean space are offset along the normal direction of the hub surface by a hub margin to obtain the required tool position points.

[0136] The calculation formula of the knife position point is:

[0137] P L =P c +(r 球 +δ)n s

[0138] Among them, P L is the knife point, P c is the knife contact point, r 球 is the radius of the ball end cutter, δ is the set hub allowance, n s is the normal vector of the hub surface.

[0139] The embodiment of the present invention also proposes a tool path generation module, which includes a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the above-mentioned parameter-based mapping-based open integral blade hub machining tool path planning method is adopted to generate the machining path of the blade hub according to the three-dimensional model of the blade to be machined, the machining path here and the path of the tool position point obtained in the above method; and send them to the corresponding machining center. After the machine tool of the machining center receives the corresponding information, it controls the tool axis to move according to the preset tool machining path, thereby completing the fine machining of the workpiece.

[0140] The tool path generation module provided in this embodiment is essentially a computer device for implementing data processing and instruction generation, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor.

[0141] The computer device provided in this embodiment may be an embedded device installed on a CNC machine tool, or may be an intelligent terminal, tablet computer, laptop computer, desktop computer, rack server, blade server, tower server or cabinet server (including an independent server or a server cluster composed of multiple servers) that can execute computer programs and is independent of the machine tool. The computer device of this embodiment includes at least but is not limited to: a memory, a processor, a memory device, a processor ...

[0142] In this embodiment, the memory (i.e., readable storage medium) includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disk, optical disk, etc.

[0143] In some embodiments, the memory may be an internal storage unit of a computer device, such as a hard disk or a memory of the computer device.

[0144] In other embodiments, the memory may also be an external storage device of the computer device, such as a plug-in hard disk, a smart memory card (SmartMediaCard, SMC), a secure digital (SecureDigital, SD) card, a flash card (FlashCard), etc. equipped on the computer device. Of course, the memory may also include both the internal storage unit of the computer device and its external storage device. In this embodiment, the memory is generally used to store the operating system and various application software installed on the computer device. In addition, the memory may also be used to temporarily store various data that have been output or are to be output.

[0145] The processor may be a central processing unit (CPU), a graphics processing unit (GPU), a controller, a microcontroller, a microprocessor, or other data processing chips in some embodiments. The processor is generally used to control the overall operation of a computer device. In this embodiment, the processor is used to run program codes stored in a memory or process data.

[0146] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which the present invention belongs. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "or / and" used herein includes any and all combinations of one or more of the related listed items.

[0147] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0148] The above-mentioned embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the patent of the present invention shall be subject to the attached claims.

Claims

1. A tool path planning method for machining an open blisk hub based on parameter mapping, characterized in that: It includes the following steps: S1: Obtain the NURBS surfaces of the hub and the fillet between the blade and the hub in the three-dimensional model of the blade disk; S2: Solve the curve of the annular boundary of the fillet close to the hub side after geodesic offset in the parameter domain. The specific steps are as follows: S21: extracting the two-dimensional B-spline curve of the annular boundary of the fillet close to the hub side in the parameter domain from the NURBS surface; S22: Find the tangent vector of the position of the corresponding point of each point on the two-dimensional B-spline curve in the Euclidean space along the annular boundary curve and the normal vector on the corresponding hub surface; S23: cross-multiplying the obtained tangent vector and the normal vector to obtain the geodesic offset direction of the annular boundary in the parameter domain; S24: presetting an offset distance, and iterating the points on the two-dimensional B-spline curve according to the offset distance to obtain a curve of the annular boundary after geodesic offset in the parameter domain; S3: using the golden section method to iteratively calculate the extreme points of the leading edge and the trailing edge of the curve after the geodesic shift of the annular boundary in the parameter domain in the axial direction of the hub, and using the extreme points of the leading edge and the trailing edge to split the curve after the geodesic shift of the annular boundary in the parameter domain, to obtain curve C1 and curve C2; S4: discretizing the curve C2 according to the chord height constraint to obtain a plurality of discrete points, and using the plurality of discrete points to obtain isoparametric lines along the rotation direction of the hub surface, and offsetting the curve C1 in the parameter domain to obtain the curve C1′; S5: using the plurality of discrete points as the starting points of the isoparametric lines to make intersection lines with the curve C1′, and using the intersection points of the isoparametric lines and the curve C1′ as the end points of the isoparametric lines, determining the number of tool paths according to the isoparametric line with the longest length in the Euclidean space corresponding to the plurality of isoparametric lines, and taking points of the isoparametric lines between the discrete points and the curve C1′ at equal distances according to the number of tool paths, and sequentially connecting them along the axial direction of the hub to obtain a plurality of tool paths in the flow channel between two adjacent blades; S6: Extending the two ends of each tool path in the flow channel respectively to obtain a tool path extension path outside the blade; S7: Correspond the tool path in the flow channel and the points on the tool path extension path to the Euclidean space, and offset the points corresponding to the Euclidean space along the normal direction of the hub surface by a hub margin to obtain the required tool position points.

2. The tool path planning method for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: In step S1, the NURBS surface equations of the fillet and the hub are: S(u,v)=P·N u (u)·N v (v) T ·W Among them, P is the matrix storing control points, W is the matrix storing weights, and N u is the matrix storing the B-spline basis function in direction u, N v is the matrix storing the B-spline basis functions for direction v.

3. The tool path planning method for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: In step S21, given the parameter m and the node sequence M = {m0,m1,…,m n+z+1 }, and a set of control points P = {P0, P1, ..., P n }, the function of the two-dimensional B-spline curve is: C(m)=∑N i,z (m)P i , where N i,z (m) is the i-th basis function, defined as: For z = 0, For z>0, Wherein: n is the number of control points, z is the order of the two-dimensional B-spline curve, and i=0,1,...n.

4. The tool path planning method for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: Assume the curve parameter equation c(t) of the annular boundary is: c(t)=(x(t),y(t),z(t)) Then the tangent vector T(t) is: Assume the parametric equation of the hub surface r(u,v) is: r(u,v)=(x(u,v),y(u,v),z(u,v)) Then the normal vector N(u,v) is: Then the iteration direction δ of the geodesic migration is n for: δ n =T(t)×N(u,v) Where t is the parameter of the annular boundary curve equation, x(t), y(t) and z(t) represent the position of the annular boundary curve in the x-axis, y-axis and z-axis directions as the parameter t changes, respectively; x(u,v), y(u,v) and z(u,v) represent the position of the hub surface in the x-axis, y-axis and z-axis directions as the parameters u and v change, respectively. and are the partial derivative vectors of the hub surface with respect to parameters u and v respectively.

5. The tool path planning method for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: In step S24, the update equation used in the coordinate iteration process is as follows: Where p, q are the u and v coordinates of the offset point, ds is the offset distance, It is an expression composed of the first basic quantity, the second basic quantity and their derivatives expressed by Christoffel symbols. k represents the direction of the result, i and j represent the two parameter directions of the derivative, corresponding to the rates of change of the two local coordinates respectively.

6. The method for tool path planning for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: In step S4, the curve C2 is discretely selected according to the chord height constraint, and the chord height error formula L s for: Among them, L s represents the distance between two adjacent points, ε s is the chord height constraint error, ρ A is the normal radius of curvature of curve C2 at that point; and / or In step S4, the parameter domain range of curve C1 is [a2, b2], and the offset distance L of curve C1 is c for: Wherein, B is the number of blades.

7. The tool path planning method for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: In step S5, the isoparametric line with the longest length in the Euclidean space is selected from the multiple isoparametric lines, and its length is set to L. Then the number of tool paths N is: Among them, s is the maximum line spacing between the set isoparametric lines.

8. The method for tool path planning for machining an open blisk hub based on parameter mapping according to claim 7, characterized in that: The specific steps of step S6 are: S61: Obtain the tangent direction at the first and last endpoints of each tool path, extend the specified tangent distance, obtain the end point after the tangent extension, and take it as the first control point of the quadratic Bezier curve; S62: Extend the end point obtained in S61 further along the tangent direction by a specified radial distance to obtain the end point after tangent extension, and take it as the second control point of the quadratic Bezier curve; S63: Extend the end point obtained in S62 by a specified radial distance along the axial direction of the hub to obtain the end point after axial extension, and take it as the third control point of the quadratic Bezier curve; S64: constructing a quadratic Bezier curve using the obtained first control point, second control point and third control point, and then obtaining a tool path extension path according to the quadratic Bezier curve.

9. The method for tool path planning for machining an open blisk hub based on parameter mapping according to claim 1, characterized in that: In step S7, the tool position calculation formula is: P L =P c +(r 球 +δ)n s Among them, P L is the knife point, P c is the knife contact point, r 球 is the radius of the ball end cutter, δ is the set hub allowance, n s is the normal vector of the hub surface.

10. A tool path generation module, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, it adopts the open integral blade disk hub processing tool path planning method based on parameter mapping as described in any one of claims 1 to 9, generates the processing path of the blade disk hub according to the three-dimensional model of the blade disk to be processed, and sends it to the corresponding machining center.

Images