CN111259487A - Machining method for changing machining allowance of blisk - Google Patents
Machining method for changing machining allowance of blisk Download PDFInfo
- Publication number
- CN111259487A CN111259487A CN201911423853.5A CN201911423853A CN111259487A CN 111259487 A CN111259487 A CN 111259487A CN 201911423853 A CN201911423853 A CN 201911423853A CN 111259487 A CN111259487 A CN 111259487A
- Authority
- CN
- China
- Prior art keywords
- point
- margin
- blisk
- parameter
- points
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Numerical Control (AREA)
Abstract
The application provides a machining method for changing machining allowance of a blisk, which comprises the following steps of (1) detecting a blisk blade profile, and finding out a position exceeding a preset tolerance range and an allowance value corresponding to the position; (2) adjusting the blade profile of the whole leaf disc by using a residue variation method; (3) carrying out secondary processing on the blisk blade profile; (4) and (4) detecting the blade profile of the blisk again, finishing machining if the blade profile of the blisk reaches the preset tolerance range, and repeating the steps (1) to (3) if the blade profile of the blisk exceeds the preset tolerance range. The machining method for changing the machining allowance of the blisk can independently set different blade profile sections, the allowance of specific point positions of the sections can be modified according to the positions corresponding to detection results on the specific sections, meanwhile, the allowance can be specifically set aiming at the front edge and the rear edge, and the efficiency of parts in a trial-manufacturing stage and the qualified rate of formal parts are greatly improved.
Description
Technical Field
The application relates to the field of blisk machining, in particular to a machining method for changing machining allowance of a blisk.
Background
The blisk part is called as a pearl on the crown of an aircraft engine, and besides playing an irreplaceable role in the aircraft engine, the blisk is high in processing difficulty and low in percent of pass and is an important reason. The blisk consists of three parts, namely a web plate, a hub and blades, wherein the length of each blade in suspension is different from 20 mm to 300mm, the radius of the front edge and the rear edge is only R0.02-R0.04 at the minimum, the tolerance of the blade profile is +/-0.05 mm, and the tolerance of the front edge and the rear edge is only +/-0.04 mm. The traditional machining method has the condition that the blade profile and the front and rear parts are out of tolerance due to cutter abrasion, machine tool precision and the like, although the machining result of the blade profile can be improved by modifying the whole machining allowance, the design requirements of all detected sections cannot be met.
Aiming at the processing of the blade part of the integral blade disc, the currently adopted method is to modify the integral processing allowance of the blade to improve the processing result, but the method cannot meet the aim of modifying the allowance of a certain section or a certain point of the blade profile and cannot specially adjust the allowance aiming at the front edge and the rear edge which have more strict requirements.
In the existing blisk processing method, the allowance setting only can ensure the allowance of the blade back part of the blade profile basin, and the allowance of the front edge and the rear edge cannot be independently modified and adjusted, so that the blade profile trial cutting and measurement need to be repeatedly carried out in the trial production stage, and the scientific research trial production cost is increased. In the processing of the formal part, the failure rate of the part is low or the part is scrapped due to the failure of the front edge and the rear edge, so that the processing period and the processing cost of the whole machine are increased.
Disclosure of Invention
The technical problem to be solved by the application is to provide a machining method for changing the machining allowance of a blisk.
In order to solve the above technical problem, the present application provides a machining method for changing a machining allowance of a blisk, the machining method including the steps of,
(1) detecting the blade profile of the blisk, and finding out the position which exceeds a preset tolerance range and the residue value corresponding to the position;
(2) adjusting the blade profile of the whole leaf disc by using a residue variation method;
(3) carrying out secondary processing on the blisk blade profile;
(4) and (4) detecting the blade profile of the blisk again, finishing machining if the blade profile of the blisk reaches the preset tolerance range, and repeating the steps (1) to (3) if the blade profile of the blisk exceeds the preset tolerance range.
Preferably, the margin varying method in step (2) is specifically that (2.1) based on a plurality of points located at different positions on the leaf disc and the margin values of the points, an initial margin control point is obtained, and an initial margin control point grid is constructed; and (2.2) preprocessing the initial margin control point, and obtaining the margin of any non-margin control point on the leaf disc by adopting a fairing transition method.
Preferably, said step (2.1) is specifically,
(2.1.1) defining the combination of the position of any point on the curved surface of the leaf disc and the margin value of the point as a margin control point, and realizing the non-constant margin compensation of any point on the leaf disc by arranging a limited number of margin control points on the leaf disc and smoothly changing the margin among the control points;
(2.1.2) defining two parameter directions of the leaf disk as U, V respectively, defining a parameter definition domain as u belongs to [0,1], v belongs to [0,1], defining a margin control point as Q (u, v, C), wherein u and v represent the position of the control point, and C represents the margin of the control point;
(2.1.3) in the parameter space, solving convex hulls of all margin control points to obtain a convex polygon, and defining the convex polygon as L (P)0，P1，…,Pn-1) Wherein (P)0,P1,…,Pn-1) Representing n vertices of a convex polygon, dividing a triangle inside the convex polygon with all margin control points as vertices, defining the triangleThe grid area is a, which is a sub-area of the rectangular parameter domain.
Preferably, said step (2.2) is in particular,
(2.2.1) for each triangular plate obtained in the step (1), defining a residue value function of any point in the triangle as S ═ f (u, v), wherein S represents a free curved surface, a parameter domain of the curved surface is a parameter range where the triangle is located, and the curved surface is defined as a variable residue curved surface;
(2.2.2) solving the residual value of each point in the triangle by adopting the following steps, setting any point P (u, v), and judging the position of the point P in the parameter domain:
a. when the point is exactly positioned at the vertex of a certain triangle, the margin value of the point P is the same as that of the vertex;
b. when the point P is just positioned on one side of the triangle, two vertexes of the side are set as T1,T2The corresponding residue values are respectively C1,C2Defining the position parameter of the point P on the side as
Wherein | T1P | represents the side length, then the margin value C of the P point is definedPCalculated by the following formula:
c. when point P is located on triangle T (T)1，T2，T3) Internal, wherein T1，T2，T3Three vertexes of the triangle respectively, and the allowance values corresponding to the three points are respectively (C)1，C2，C3) Making a straight line perpendicular to the coordinate axis U to pass through the point (U,0), assuming that the straight line and the side T of the triangle are1T3Intersect with point E and edge T1T2Intersect with point D at edge T1T3Calculating the position parameter of the point E as
Determining the residual value C of the E point according to the formula in the step (2)E(ii) a Likewise at edge T1T2Calculating the position parameter of the D point
Determining the residual value C of the point D according to the formula in the step (2)D(ii) a Then, on the edge ED, the position parameters of the point P are determined
Determining P point residue value as C according to the formula in the step bP；
d. When the point P is positioned outside the convex polygon area, one edge with the minimum distance P is found by calculating the distance between the point P and each edge of the convex polygon, and the nearest edge is set as T1T2The two vertexes correspond to a margin value of C1C2Calculating the point P at T1T2Upper nearest point P ', when P' and T1When they are superposed, the balance of P' is C1(ii) a When P' and T2When they are superposed, the balance of P' is C2(ii) a When P' is located between two end points of the line segment, calculating the position parameter of P
Then calculating the allowance of P' according to the formula in the step b to obtain CP’And making the two-point balance of P and P' identical, i.e. P point balance is CP＝CP’。
Preferably, when the V direction of the leaf disk is the period, the variable margin method further includes, step (2.3), when the V direction of the leaf disk is the period, on the basis of the initial finite margin control points, automatically generating a plurality of additional control points located on the line V ═ 1, and copying a parameter domain and all the control points therein directly above the original parameter space.
Preferably, the generating of the additional control point comprises:
a. finding convex polygon vertex in U directionU maximum point P of1And u minimum point P2Two points satisfy the following relationship:
b. from two maximum points P1，P2The convex polygon is divided into an upper part and a lower part which are respectively marked as Lup，Ldown；
c. Mixing L withdownTranslating the positive direction of the V axis by a distance of 1 to obtain L'down；
d. From LupAnd L'downA new non-convex polygonal area is obtained;
e. additional control points are added, and the algorithm steps are as follows:
e.1. the upper and lower dot orders are respectively marked as U (U)1，U2，…，Un)，D(D1，D2，…，Dm) Wherein n and m are the number of points in the upper and lower point sequences respectively;
e.2. respectively sorting the upper and lower point orders U and D according to the component U parameters from small to large so as to meet the requirement of Ui.u<Ui+1.u，Dj.u<Dj+1U, where i, j are indices;
e.3. initializing i-1, j-1;
e.4.IF i > n And j > m, THEN jumps e.13, ELSE jumps e.5;
e.5.IF Ui.u<Diu, THEN jump e.6; ELSE jump e.8;
e.6. invoking LinkAndInsert sub-process, connect UiDj-1And inserting a new point;
e.7.i ═ i +1, jump e.4;
e.8.IF Ui.u>Diu, THEN jump e.9; ELSE jump e.11;
e.9. invoking LinkAndInsert sub-process, connect Ui-1DjAnd inserting a new point;
e.10.j +1, jump e.4;
e.11. quadrilateral U is dissected based on Delaunay subdivision criterioni-1UiDjDj-1；
e.12.i ═ i +1, j ═ j +1, jump e.4;
e.13. finishing;
f. in step e.6, let L be the two points to be connected1L2The corresponding margin value is C1C2Calculating the line segment and L1L2The intersection point with the straight line V-1 is L0Calculating L0On line segment L1L2Position parameter of
Then according to the formula in step (2)
Calculate the residual value of the intersection as
Thereby obtaining new additional control points
And (3) combining the initial control point and the additional control point to obtain a new control point, repeating the steps (2.1) and (2.2), and determining the residue value of any point in the whole parameter domain.
The machining method for changing the machining allowance of the blisk can independently set different blade profile sections, the allowance of specific point positions of the sections can be modified according to the positions corresponding to detection results on the specific sections, meanwhile, the allowance can be specifically set aiming at the front edge and the rear edge, and the efficiency of parts in a trial-manufacturing stage and the qualified rate of formal parts are greatly improved.
Drawings
FIG. 1 is a schematic view of the blade camber and its UV orientation of the present invention;
FIG. 2 is a diagram of a control point convex polygon L and a control point triangular area A in a parameter domain according to the present invention;
FIG. 3 is a diagram of the triangle T of the present invention1T2T3A margin value diagram of an inner point P;
FIG. 4 is a flow chart of an algorithm for adding additional control points according to the present invention;
FIG. 5 is a schematic diagram of a triangle-shaped variable-allowance curved surface according to the present invention;
FIG. 6 illustrates the control point area periodicity of the present invention.
Detailed Description
The present application is further described below in conjunction with the following figures and specific examples to enable those skilled in the art to better understand the present application and to practice it, but the examples are not intended to limit the present application.
The application provides a processing method for changing the machining allowance of a blisk,
(1) detecting the blade profile of the blisk, and finding out the position which exceeds a preset tolerance range and the residue value corresponding to the position;
(2) adjusting the blade profile of the whole leaf disc by using a residue variation method;
(3) carrying out secondary processing on the blisk blade profile;
(4) and (4) detecting the blade profile of the blisk again, finishing machining if the blade profile of the blisk reaches the preset tolerance range, and repeating the steps (1) to (3) if the blade profile of the blisk exceeds the preset tolerance range.
The method for changing the allowance in the step (2) is specifically,
(2.1) obtaining initial margin control points based on a plurality of points located at different positions on the leaf disc and margin values of the points, and constructing an initial margin control point grid;
and (2.2) preprocessing the initial margin control point, and obtaining the margin of any non-margin control point on the leaf disc by adopting a fairing transition method.
The step (2.1) is specifically that,
(2.1.1) defining the combination of the position of any point on the curved surface of the leaf disc and the margin value of the point as a margin control point, and realizing the non-constant margin compensation of any point on the leaf disc by arranging a limited number of margin control points on the leaf disc and smoothly changing the margin among the control points;
(2.1.2) defining two parameter directions of the leaf disk as U, V respectively, defining a parameter definition domain as u belongs to [0,1], v belongs to [0,1], defining a margin control point as Q (u, v, C), wherein u and v represent the position of the control point, and C represents the margin of the control point;
(2.1.3) in the parameter space, solving convex hulls of all margin control points to obtain a convex polygon, and defining the convex polygon as L (P)0，P1，…，Pn-1) Wherein (P)0，P1，…，Pn-1) And representing n vertexes of the convex polygon, dividing a triangle by taking all margin control points as vertexes inside the convex polygon, and defining the triangular mesh area as A, wherein the area A is a sub-area of the rectangular parameter domain.
The step (2.2) is specifically that,
(2.2.1) for each triangular plate obtained in the step (1), defining a residue value function of any point in the triangle as S ═ f (u, v), wherein S represents a free curved surface, a parameter domain of the curved surface is a parameter range where the triangle is located, and the curved surface is defined as a variable residue curved surface;
(2.2.2) solving the residual value of each point in the triangle by adopting the following steps, setting any point P (u, v), and judging the position of the point P in the parameter domain:
a. when the point is exactly positioned at the vertex of a certain triangle, the margin value of the point P is the same as that of the vertex;
b. when the point P is just positioned on one side of the triangle, two vertexes of the side are set as T1，T2The corresponding residue values are respectively C1，C2Defining the position parameter of the point P on the side as
Wherein | T1P | represents the side length, then the margin value C of the P point is definedPCalculated by the following formula:
c. when point P is located on triangle T (T)1，T2，T3) Internal, wherein T1,T2,T3Three vertexes of the triangle respectively, and the allowance values corresponding to the three points are respectively (C)1,C2,C3) Making a straight line perpendicular to the coordinate axis U to pass through the point (U,0), assuming that the straight line and the side T of the triangle are1T3Intersect with point E and edge T1T2Intersect with point D at edge T1T3Calculating the position parameter of the point E as
Determining the residual value C of the E point according to the formula in the step (2)E(ii) a Likewise at edge T1T2Calculating the position parameter of the D point
Determining the residual value C of the point D according to the formula in the step (2)D(ii) a Then, on the edge ED, the position parameters of the point P are determined
Determining P point residue value as C according to the formula in the step bP；
d. When the point P is positioned outside the convex polygon area, one edge with the minimum distance P is found by calculating the distance between the point P and each edge of the convex polygon, and the nearest edge is set as T1T2The two vertexes correspond to a margin value of C1C2Calculating the point P at T1T2Upper nearest point P ', when P' and T1When they are superposed, the balance of P' is C1(ii) a When P' and T2When they are superposed, the balance of P' is C2(ii) a When P' is located between two end points of the line segment, calculating the position parameter of P
Then calculating the allowance of P' according to the formula in the step b to obtain CP’And making the two-point balance of P and P' identical, i.e. P point balance is CP＝CP’。
When the V direction of the leaf disc is the period, the variable margin method further includes a step (2.3), when the V direction of the leaf disc is the period, on the basis of the initial limited margin control points, a plurality of additional control points located on the V ═ 1 straight line are automatically generated, and a parameter domain and all the control points therein are copied above the original parameter space as they are.
The generating of the additional control point comprises:
a. finding the maximum point P of U of the convex polygon vertex in the U direction1And u minimum point P2Two points satisfy the following relationship:
b. from two maximum points P1,P2The convex polygon is divided into an upper part and a lower part which are respectively marked as Lup,Ldown；
c. Mixing L withdownTranslating the positive direction of the V axis by a distance of 1 to obtain L'down；
d. From LupAnd L'downA new non-convex polygonal area is obtained;
e. additional control points are added, and the algorithm steps are as follows:
e.1. the upper and lower dot orders are respectively marked as U (U)1,U2,…,Un),D(D1,D2,…,Dm) Wherein n and m are the number of points in the upper and lower point sequences respectively;
e.2. respectively sorting the upper and lower point orders U and D according to the component U parameters from small to large so as to meet the requirement of Ui.u<Ui+1.u,Dj.u<Dj+1U, where i, j are indices;
e.3. initializing i-1, j-1;
e.4.IF i > n And j > m, THEN jumps e.13, ELSE jumps e.5;
e.5.IF Ui.u<Diu, THEN jump e.6; ELSE jump e.8;
e.6. invoking LinkAndInsert sub-process, connect UiDj-1And inserting a new point;
e.7.i ═ i +1, jump e.4;
e.8.IF Ui.u>Diu, THEN jump e.9; ELSE jump e.11;
e.9. invoking LinkAndInsert sub-process, connect Ui-1DjAnd inserting a new point;
e.10.j +1, jump e.4;
e.11. quadrilateral U is dissected based on Delaunay subdivision criterioni-1UiDjDj-1；
e.12.i ═ i +1, j ═ j +1, jump e.4;
e.13. finishing;
f. in step e.6, let L be the two points to be connected1L2The corresponding margin value is C1C2Calculating the line segment and L1L2The intersection point with the straight line V-1 is L0Calculating L0On line segment L1L2Position parameter of
Then according to the formula in step (2)
Calculate the residual value of the intersection as
Thereby obtaining new additional control points
And (3) combining the initial control point and the additional control point to obtain a new control point, repeating the steps (2.1) and (2.2), and determining the residue value of any point in the whole parameter domain.
The specific implementation process of the machining method for changing the allowance of the blisk is as follows:
the allowance is set to be 0 when the integral blade disc blade profile is subjected to finish machining, detection is carried out after machining, positions exceeding the design tolerance requirement are arranged at the front edge and the rear edge of the blade disc blade profile, the height of the cross section of the blade disc blade profile is respectively 98mm and 101mm, the tolerance requirement at the front edge of the 98mm cross section is +/-0.04, the detection result shows that the detection result of the maximum point of the cross section at the position close to the arc of the front edge is +0.066 and exceeds 0.026, the detection value of the maximum point at the position close to the arc of the rear edge is +0.050 and exceeds the tolerance 0.01, the maximum value of the point position of the blade disc and the blade back exceeding the tolerance requirement is +0.052 and; the height of the section of the blade profile of the blade disc is 101mm, the maximum detection point of the front edge close to the circular arc is +0.053, the tolerance exceeding requirement is 0.013, the maximum detection point of the rear edge close to the circular arc is +0.045, the tolerance exceeding is 0.005, although the maximum detection point of the blade basin and the blade back does not exceed the tolerance point, the value of the maximum detection point is +0.049, the maximum detection point is very close to the upper limit, and the possibility of exceeding the tolerance is continuously generated.
Aiming at the out-of-tolerance problem of the sections of 98mm and 101mm, a variable margin function is selected, the position corresponding to the front edge out-of-tolerance point is input, and a margin offset value of the position is given at the same time. By giving a margin offset value of-0.015 at the 0.53 position, a margin offset value of-0.02 at the 0.578 position, etc., a right-hand modified margin distribution diagram is finally obtained.
Similarly, inputting the position corresponding to the over-tolerance point of the trailing edge and simultaneously giving the margin offset value of the position to obtain a modified margin distribution schematic diagram at the trailing edge;
and (4) modifying the margin offset values of different point positions of the section according to the result of the detection report on the section of 101mm, and finally obtaining the margin distribution of the section of 101mm in different unknowns.
And (4) performing secondary trial cutting after finishing modifying the allowance of the sections of 98mm and 101mm, performing program calculation and post-processing, and detecting the results of the sections of 98mm and 101mm again after finishing the program calculation, wherein the results reach the tolerance range required by the design drawing and meet the requirements of the design drawing.
The machining method for changing the machining allowance of the blisk can independently set different blade profile sections, the allowance of specific point positions of the sections can be modified according to the positions corresponding to detection results on the specific sections, meanwhile, the allowance can be specifically set aiming at the front edge and the rear edge, and the efficiency of parts in a trial-manufacturing stage and the qualified rate of formal parts are greatly improved.
The above-described embodiments are merely preferred embodiments for fully illustrating the present application, and the scope of the present application is not limited thereto. The equivalent substitution or change made by the person skilled in the art on the basis of the present application is within the protection scope of the present application. The protection scope of this application is subject to the claims.
Claims (6)
1. A machining method for changing the machining allowance of a blisk is characterized by comprising the following steps of,
(1) detecting the blade profile of the blisk, and finding out the position which exceeds a preset tolerance range and the residue value corresponding to the position;
(2) adjusting the blade profile of the whole leaf disc by using a residue variation method;
(3) carrying out secondary processing on the blisk blade profile;
(4) and (4) detecting the blade profile of the blisk again, finishing machining if the blade profile of the blisk reaches the preset tolerance range, and repeating the steps (1) to (3) if the blade profile of the blisk exceeds the preset tolerance range.
2. The processing method according to claim 1, wherein the margin varying method in step (2) is embodied as (2.1) obtaining an initial margin control point based on a plurality of points located at different positions on the blisk and the margin value of each point, and constructing an initial margin control point grid; and (2.2) preprocessing the initial margin control point, and obtaining the margin of any non-margin control point on the leaf disc by adopting a fairing transition method.
3. The process according to claim 2, characterized in that step (2.1) is embodied as,
(2.1.1) defining the combination of the position of any point on the curved surface of the leaf disc and the margin value of the point as a margin control point, and realizing the non-constant margin compensation of any point on the leaf disc by arranging a limited number of margin control points on the leaf disc and smoothly changing the margin among the control points;
(2.1.2) defining two parameter directions of the leaf disk as U, V respectively, defining a parameter definition domain as u belongs to [0,1], v belongs to [0,1], defining a margin control point as Q (u, v, C), wherein u and v represent the position of the control point, and C represents the margin of the control point;
(2.1.3) in the parameter space, solving convex hulls of all margin control points to obtain a convex polygon, and defining the convex polygon as L (P)0，P1，…,Pn-1) Wherein (P)0,P1,…,Pn-1) And representing n vertexes of the convex polygon, dividing a triangle by taking all margin control points as vertexes inside the convex polygon, and defining the triangular mesh area as A, wherein the area A is a sub-area of the rectangular parameter domain.
4. A method as claimed in claim 3, wherein step (2.2) is carried out in particular,
(2.2.1) for each triangular plate obtained in the step (1), defining a residue value function of any point in the triangle as S ═ f (u, v), wherein S represents a free curved surface, a parameter domain of the curved surface is a parameter range where the triangle is located, and the curved surface is defined as a variable residue curved surface;
(2.2.2) solving the residual value of each point in the triangle by adopting the following steps, setting any point P (u, v), and judging the position of the point P in the parameter domain:
a. when the point is exactly positioned at the vertex of a certain triangle, the margin value of the point P is the same as that of the vertex;
b. when the point P is just positioned on one side of the triangle, two vertexes of the side are set as T1，T2The corresponding residue values are respectively C1，C2Defining the position parameter of the point P on the side as
Wherein | T1P | represents the side length, then the margin value C of the P point is definedPCalculated by the following formula:
c. when point P is located on triangle T (T)1，T2，T3) Internal, wherein T1，T2，T3Three vertexes of the triangle respectively, and the allowance values corresponding to the three points are respectively (C)1，C2，C3) Making a straight line perpendicular to the coordinate axis U to pass through the point (U,0), assuming that the straight line and the side T of the triangle are1T3Intersect with point E and edge T1T2Intersect with point D at edge T1T3Calculating the position parameter of the point E as
Determining the residual value C of the E point according to the formula in the step (2)E(ii) a Likewise at edge T1T2Calculating the position parameter of the D point
Determining the residual value C of the point D according to the formula in the step (2)D(ii) a Then, on the edge ED, the position parameters of the point P are determined
Determining P point residue value as C according to the formula in the step bP；
d. When the point P is positioned outside the convex polygon area, one edge with the minimum distance P is found by calculating the distance between the point P and each edge of the convex polygon, and the nearest edge is set as T1T2The two vertexes correspond to a margin value of C1C2Calculating the point P at T1T2Upper nearest point P ', when P' and T1When they are superposed, the balance of P' is C1(ii) a When P' and T2When they are superposed, the balance of P' is C2(ii) a When P' is located between two end points of the line segment, calculating the position parameter of P
Then calculating the allowance of P' according to the formula in the step b to obtain CP’And making the two-point balance of P and P' identical, i.e. P point balance is CP＝CP’。
5. The machining method according to claim 4, wherein when the V direction of the blade disc is the period, the variable margin method further comprises the step (2.3) of automatically generating a plurality of additional control points on the V-1 straight line on the basis of the initial finite margin control points when the V direction of the blade disc is the period, and copying a parameter domain and all the control points above the original parameter space as is.
6. The process of claim 5 wherein the step of generating additional control points comprises:
a. finding the maximum point P of U of the convex polygon vertex in the U direction1And u minimum point P2Two points satisfy the following relationship:
b. from two maximum points P1，P2Dividing the convex polygon into an upper part and a lower part, which are respectively recordedIs Lup，Ldown；
c. Mixing L withdownTranslating the positive direction of the V axis by a distance of 1 to obtain L'down；
d. From LupAnd L'downA new non-convex polygonal area is obtained;
e. additional control points are added, and the algorithm steps are as follows:
e.1. the upper and lower dot orders are respectively marked as U (U)1，U2，…，Un)，D(D1，D2，…，Dm) Wherein n and m are the number of points in the upper and lower point sequences respectively;
e.2. respectively sorting the upper and lower point orders U and D according to the component U parameters from small to large so as to meet the requirement of Ui.u<Ui+1.u，Dj.u<Dj+ 1U, where i, j are indices;
e.3. initializing i-1, j-1;
e.4.IFi > n And j > m, THEN jumps e.13, ELSE jumps e.5;
e.5.IF Ui.u<Diu, THEN jump e.6; ELSE jump e.8;
e.6. invoking LinkAndInsert sub-process, connect UiDj-1And inserting a new point;
e.7.i ═ i +1, jump e.4;
e.8.IF Ui.u>Diu, THEN jump e.9; ELSE jump e.11;
e.9. invoking LinkAndInsert sub-process, connect Ui-1DjAnd inserting a new point;
e.10.j +1, jump e.4;
e.11. quadrilateral U is dissected based on Delaunay subdivision criterioni-1UiDjDj-1；
e.12.i ═ i +1, j ═ j +1, jump e.4;
e.13. finishing;
f. in step e.6, let L be the two points to be connected1L2The corresponding margin value is C1C2Calculating the line segment and L1L2The intersection point with the straight line V-1 is L0Calculating L0On line segment L1L2Position parameter of
Then according to the formula in step (2)
Calculate the residual value of the intersection as
Thereby obtaining new additional control points
And (3) combining the initial control point and the additional control point to obtain a new control point, repeating the steps (2.1) and (2.2), and determining the residue value of any point in the whole parameter domain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911423853.5A CN111259487B (en) | 2019-12-31 | 2019-12-31 | Processing method for changing machining allowance of blisk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911423853.5A CN111259487B (en) | 2019-12-31 | 2019-12-31 | Processing method for changing machining allowance of blisk |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111259487A true CN111259487A (en) | 2020-06-09 |
| CN111259487B CN111259487B (en) | 2023-10-13 |
Family
ID=70946775
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911423853.5A Active CN111259487B (en) | 2019-12-31 | 2019-12-31 | Processing method for changing machining allowance of blisk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111259487B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113977007A (en) * | 2021-11-26 | 2022-01-28 | 重庆齿轮箱有限责任公司 | Gear grinding allowance adjusting method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105261065A (en) * | 2015-11-02 | 2016-01-20 | 南京航空航天大学 | Front and rear edge profile redesign method for adaptive processing |
| CN105290471A (en) * | 2015-11-20 | 2016-02-03 | 沈阳黎明航空发动机(集团)有限责任公司 | Adaptive milling method for integral impeller blade |
| CN106599406A (en) * | 2016-11-29 | 2017-04-26 | 沈阳黎明航空发动机(集团)有限责任公司 | Blade edge mechanical forming process method |
| CN106897501A (en) * | 2017-01-23 | 2017-06-27 | 西北工业大学 | The positioning and optimizing method based on blade parts deformation towards in adaptive machining |
-
2019
- 2019-12-31 CN CN201911423853.5A patent/CN111259487B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105261065A (en) * | 2015-11-02 | 2016-01-20 | 南京航空航天大学 | Front and rear edge profile redesign method for adaptive processing |
| CN105290471A (en) * | 2015-11-20 | 2016-02-03 | 沈阳黎明航空发动机(集团)有限责任公司 | Adaptive milling method for integral impeller blade |
| CN106599406A (en) * | 2016-11-29 | 2017-04-26 | 沈阳黎明航空发动机(集团)有限责任公司 | Blade edge mechanical forming process method |
| CN106897501A (en) * | 2017-01-23 | 2017-06-27 | 西北工业大学 | The positioning and optimizing method based on blade parts deformation towards in adaptive machining |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113977007A (en) * | 2021-11-26 | 2022-01-28 | 重庆齿轮箱有限责任公司 | Gear grinding allowance adjusting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111259487B (en) | 2023-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yasa et al. | A study on the stair stepping effect in direct metal laser sintering of a nickel-based superalloy | |
| CN108628247B (en) | Curved surface subregion Toolpath Generation method based on the residual high constraint in boundary | |
| JP6708995B2 (en) | Blade design method and blade for axial flow fluid machine | |
| CN105261065B (en) | A kind of blade part front and rear edge profile towards adaptability processing redesigns method | |
| CN109343468B (en) | Projection offset-based blade multi-axis track generation method | |
| CN106125666A (en) | The Machining of Curved Surface cutter path planing method being constraint with cutting force fluctuation | |
| CN110727995A (en) | Blade shape construction method, blade, and computer device | |
| CN111259487A (en) | Machining method for changing machining allowance of blisk | |
| CN106897501A (en) | The positioning and optimizing method based on blade parts deformation towards in adaptive machining | |
| Foeth | Propeller optimization using an unsteady Boundary-Element Method | |
| DE112013005198T5 (en) | Methods, systems and devices for designing and manufacturing flank millable components | |
| CN110222454A (en) | The process design method of Milling Process precision consistency | |
| CN113094964B (en) | Method and device for generating blade machining coordinates | |
| CN108038259A (en) | Method based on curvature generation Pneumatic component shape | |
| CN110109415B (en) | Multi-grid cutter shaft optimization method based on density clustering | |
| RU2607867C2 (en) | Adaptive treatment of cast blades | |
| CN110928326A (en) | Measuring point difference planning method for aircraft appearance | |
| CN109597355B (en) | Design method of curved surface micro-texture numerical control machining cutter shaft vector | |
| CN110908333B (en) | Blade allowance-variable cutter position compensation method for integral blade disc type part | |
| CN111474899B (en) | Triangular-based complex cavity high-speed numerical control milling spiral path generation method | |
| CN103136426A (en) | Aviation blade circular arc leading-trailing edge process model generation method | |
| CN112231836A (en) | Wing profile optimization method based on genetic algorithm and numerical simulation | |
| CN106156409B (en) | Two-parameter special-shaped bolt hole robust design method based on minimum contour change | |
| Wang et al. | A new multiobjective optimization adaptive layering algorithm for 3D printing based on demand-oriented | |
| JP2014520334A5 (en) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20201117 Address after: 215000 South Building 4, Xinghua Industrial Park, No. 2 Shuangma Street, Suzhou Industrial Park, Jiangsu Province Applicant after: SUZHOU QIANJI INTELLIGENT TECHNOLOGY CO.,LTD. Applicant after: AIR CHINA FA GUIZHOU LIYANG AVIATION POWER Co.,Ltd. Address before: 215000 South Building 4, Xinghua Industrial Park, No. 2 Shuangma Street, Suzhou Industrial Park, Jiangsu Province Applicant before: SUZHOU QIANJI INTELLIGENT TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |