CN112212758A - Method for evaluating digitalized common reference radial total run-out error - Google Patents

Method for evaluating digitalized common reference radial total run-out error Download PDF

Info

Publication number
CN112212758A
CN112212758A CN202011087310.3A CN202011087310A CN112212758A CN 112212758 A CN112212758 A CN 112212758A CN 202011087310 A CN202011087310 A CN 202011087310A CN 112212758 A CN112212758 A CN 112212758A
Authority
CN
China
Prior art keywords
section
measured
measuring point
segment
shaft
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.)
Withdrawn
Application number
CN202011087310.3A
Other languages
Chinese (zh)
Inventor
黄美发
王家浩
唐哲敏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guilin University of Electronic Technology
Original Assignee
Guilin University of Electronic Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guilin University of Electronic Technology filed Critical Guilin University of Electronic Technology
Priority to CN202011087310.3A priority Critical patent/CN112212758A/en
Publication of CN112212758A publication Critical patent/CN112212758A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01BMEASURING LENGTH, THICKNESS OR SIMILAR LINEAR DIMENSIONS; MEASURING ANGLES; MEASURING AREAS; MEASURING IRREGULARITIES OF SURFACES OR CONTOURS
    • G01B5/00Measuring arrangements characterised by the use of mechanical techniques

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Complex Calculations (AREA)

Abstract

The invention belongs to the field of precision metering and computer application, and relates to a quick, stable, simple and digital method for evaluating a common reference radial total run-out error. The invention comprises the following steps: acquiring an initial measuring point set of a measured section and a reference section; pre-positioning is carried out, and a pre-positioned reference section measuring point set, a measured section measuring point set and a reference section initial circle center coordinate set are obtained; constructing a parameter matrix according to measuring points of each section of the reference section, constructing an analysis matrix by the key point set for analysis, and determining an optimization strategy; updating a coordinate set of the center of the circle of the section of the reference section according to the optimizing result; constructing a parameter matrix by a reference section circle center coordinate set, constructing an analysis matrix by a key point set for analysis, and determining an optimization strategy; updating the measuring point sets and related parameters of the reference segment and the measured segment according to the optimizing result; judging whether the reference section and the tested section meet the design size requirement or not; and calculating and judging whether the radial total run-out error of the measured section of the measured shaft is qualified or not.

Description

Method for evaluating digitalized common reference radial total run-out error
Technical Field
The invention belongs to the field of precision metering and computer application, and relates to a quick, stable, simple and digital evaluation method for common-reference radial total run-out errors, which can be used for evaluating the radial total run-out errors of shaft parts taking the axes of specified shaft sections at two sides of a shaft section to be measured as common reference axes, and provides guidance for the improvement of the processing technology of the shaft parts.
Background
The shaft part is one of common parts in machining, the size error and the form and position error (short for shape error and position error) generated in the machining process directly influence the product quality, the assembly and the service life of the assembly, the part error is calculated quickly and accurately, and the method has important significance.
The total radial run-out is one of important indexes of geometric tolerance of shaft parts, and a definition and detection method of the total radial run-out error is given in national standards GBT 1182-2008 and ISO 1101:2012 (E), but a method for calculating the total radial run-out error value from specific measurement data of the parts is not given. Moreover, the five currently popular evaluation methods are difficult to be directly used for evaluating the radial full run-out error of the shaft parts.
First, a specialized geometric assessment method. And gradually searching the radial total run-out error meeting the definition and/or judgment conditions of the national standard and the ISO standard by utilizing the geometric properties of the cylinder and according to the translation and deformation strategies of the circumscribed cylinder. The method has high speed, but the mathematical modeling is complex, and the method is not easy to popularize and use.
Second, convex hull or convex hull-like evaluation methods. And constructing a convex hull or a similar convex hull by using the properties of the convex hull, acquiring effective measurement data, reducing the scale of the data to be evaluated, and finally acquiring the radial total run-out error meeting the definition and/or judgment conditions of the national standard and the ISO standard by using an enumeration method. This type of approach has significant advantages when dealing with medium scale station data. For larger data sizes, the data size can also be reduced by constructing convex hulls, but when such methods are used for direct evaluation, the efficiency is insufficient.
And in the third category, a linear or nonlinear target optimization function is constructed, optimization solution is carried out by adopting a general optimization method, and the optimization value of the target optimization function is used as a radial total run-out error. The method is simple and easy to understand, realizes a standard solution method in a plurality of software, and is easy to popularize. However, the efficiency of this type of method is generally not high, since no geometric features for the evaluation of the full radial run-out error are added, and the situation of large data scale in the evaluation task is not considered.
The fourth category, artificial intelligence/biological intelligence algorithms. The advantage of this type of method over the third type of method is to analyze the "objective function with complex gradient or no apparent analytic expression" and to find the "global optimum". The method also realizes a standard solution in a plurality of software at present, and is easy to popularize. Although this type of method is popular at present, it is not suitable for the evaluation of full radial run-out error. This is because the gradient of the objective function for full run-out error assessment is the sum of a large number of simple analytical expressions, and the "local optimum" of the objective function is the "global optimum". Therefore, this type of method does not have significant advantages over the third type of method.
The fifth category, active set methods. The active set method is a method specially used for processing large-scale planning problems and is characterized in that the processing of 'invalid constraint' is reduced as much as possible in the optimization process. When the method is applied to the evaluation of the common reference radial total run-out error, the efficiency is equivalent to that of the first method, the algorithm maturity and the software integration are equivalent to that of the third method and the fourth method, and the method is a rapid and simple radial total run-out error evaluation method at present. However, this method is very sensitive to initial values and does not always perform the geometric assessment task stably.
In summary, the existing geometric evaluation method is applied to evaluation of the common reference radial total run-out error of the shaft parts, and cannot simultaneously give consideration to rapidness, stability and simple form.
Disclosure of Invention
The purpose of the invention is:
aiming at the problems and the defects in the prior art, the invention provides the method for evaluating the radial total run-out error of the shaft part, which is rapid, stable, simple in form and digital and takes the axes of the designated shaft sections at the two sides of the shaft section to be measured as the common reference axis, and the evaluation result can provide guidance for the improvement of the processing technology of the shaft part.
The method is suitable for evaluating the radial total run-out error of the shaft parts which have higher requirements on the processing precision of the cylindrical surfaces of the shaft parts such as a high-precision linear guide shaft and the like and use the axes of the designated shaft sections at the two sides of the shaft section to be measured as the common reference axis.
The invention takes a high-precision linear guide shaft as an example, and verifies an evaluation method of common reference radial total run-out errors of shaft parts.
The scheme adopted by the invention is as follows:
the method for evaluating the common reference radial total run-out error of the shaft comprises the following steps:
step 1: obtaining initial measuring point set of measured segmentQ k *}: taking the cylindrical surface of the shaft section to be measured as the section to be measured, and intercepting the section on the cylinder at equal intervals along the axial directionkEach section is perpendicular to the axis of the cylinder, and a single measuring point is selected on each section circle, so that the measuring points are approximately spirally arranged along the axis direction of the cylinder, and the measuring points are arranged in a spiral manneriInitial measuring point set for a segment to be measured consisting of measuring pointsQ k }; wherein:
k=1, 2, 3, …, Kkthe serial number of the cross section is shown,Kis the total number of the sections;
Q k *={x k *,y k *,z k and the original space rectangular coordinate of the measured segment is marked.
After step 1, step 2 is performed.
Step 2: obtaining initial measuring point set of reference sectionP i,j *}: the cylindrical surfaces of the designated shaft sections on the two sides of the shaft section to be detected are respectively used as a reference section 1 and a reference section 2, and the cylindrical surfaces of the reference section 1 are cut at equal intervals along the axial directionMA cross section equally spaced in the axial direction on the cylinder of the reference section 2NEach cross section being uniformly selected over the circumference of each cross-sectional circlejA measuring point, each cross section being perpendicular to the axis, thei×jInitial measuring point set for forming reference section by measuring pointsP i,j }; wherein:
i=1, 2, 3, … , 2Miis a section number, 2MThe total number of the sections of the reference section;
j=1, 2, 3, … , Njthe serial numbers of the measuring points on the single cross section,Nthe total number of the measuring points of a single section is;
P i,j *={x i,j *,y i,j *,z i,j and the original space rectangular coordinate of the measuring points of the reference segment.
After step 2, step 3 is performed.
And step 3: the shaft is pre-positioned as follows: selecting coordinates of measuring points of all reference segmentsx i,j *maxAndx i,j *mincalculating the average valuex o* =(x i,j *max+ x i,j *min) Selecting coordinates of measuring points of all reference segmentsy i,j *maxAndy i,j *mincalculating the average valuey o*=(y i,j *max+ y i,j *min) 2; obtaining a pre-positioned measured section measuring pointQ k And using it to form a measuring point set of the segment to be measuredQ k }; obtaining a pre-positioned reference segment measuring pointP i,j And using it to form a reference segment measuring point setP i,j }; obtaining the initial circle center coordinates of each section circle of the pre-positioned reference sectionO i And using it to form a reference section with a preset circle center coordinate setO i }; wherein:
Q k ={x k y k z k and the space rectangular coordinate of the measured point of the measured section after pre-positioning, wherein:x k = x k *- x o*,y k = y k *-y o*,z k = z k and the cylinder axis of the measured segment approaches the coordinate systemzOf the shaft, both side end faces of the section to be measuredThe central plane is approximately parallel to the XOY plane of the coordinate system;
P i,j ={x i,j y i,j z i,j and the space rectangular coordinate of the measuring point of the pre-positioned reference segment is shown, wherein:x i,j = x i,j *- x o*,y i,j = y i,j *- y o*,z i,j = z i,j and the cylindrical axis of the reference segment approximates the coordinate systemzThe central planes of the end surfaces on the two sides of the reference section are approximately parallel to the XOY plane of the coordinate system;
O i ={x i y i z i the preset center of each cross-section circle of the pre-positioned reference section is a spatial rectangular coordinate, wherein:x i = y i =0,z i = z i,j *。
after step 3, step 3.1 is performed.
Step 3.1: in each section, a great deal is made from a set of reference segment measuring pointsP i,j Respectively establishing a characteristic line vector setW i,j Great, set of boundary elementsb i,j Great Chinese character and state element sett i,j }; obtaining the center coordinates of each section circleO i ' and using it to form coordinate set of centre of circle of section of reference segmentO i ' }; wherein:
W i,j =([x i,j /t i,j y i,j /t i,j ]) Is a feature row vector, all feature row vectorsW i,j Is a set of characteristic line vectorsW i,j };
b i,j =bIs a real number greater than 0, all boundary elementsb i,j Is a set of boundary elementsb i,j };
O i ’={x i ’,y i ’,z i ' is the space rectangular coordinate of the center of each section of the reference section, and initially,x i ’= x i y i ’= y i z i ’= z i
Figure 793305DEST_PATH_IMAGE001
status elements of all measurement points in the reference segmentt i,j The set of (1) is a state element set of a reference segment measuring pointt i,j }。
After step 3.1, step 3.2 is performed.
Step 3.2: in each cross section, the cross section is taken ont i,j Maximum value oft maxCorresponding serial numbere 1Is a key serial number, and wille 1The key serial number sets respectively added to respective sectionseIn (c) }.
Step 3.3 is performed after step 3.2 is completed.
Step 3.3: according to the key sequence number set of each sectioneRespectively establishing analysis matrixesWAnd analyzing the column vectorsbWherein:
W= […,W m T,…,W n T,…]Tis aEA matrix of rows and 2 columns of,Eis a critical sequence number seteThe number of the elements in the (C),mnis a critical sequence number seteThe elements in (1);
b= […,b m ,…,b n ,…]Tis aEA column vector of rows.
Step 3.4 is performed after step 3.3 is completed.
Step 3.4: for analysis matrixWAnd an augmented analysis matrixWb]Rank analysis was performed.
Computingr W =rank(W),r Wb =rank([Wb]) And comparer W Andr Wb there are two cases:
the first condition is as follows: if it is notr W =r Wb If the optimization is to be continued, step 3.5 is executed;
case two: if it is notr W <r Wb Attempting to derive a secondary analysis matrixWAnd analyzing the column vectorsbMiddle removed key serial number seteSome element offCorresponding rows, resulting in a reduced matrixW f- And reducing the column vectorb f- According toW f- U f- = b f- Solved to obtainU f- =U f-0Then calculateb f- =W f U f-0(ii) a If the key sequence number seteAll the elements in the Chinese character have been tried, and none of them is obtainedb f- >bThen the optimization should be ended, jumping to step 3.7; if the critical sequence number set is triedeElements in (b) }fWhen it is obtainedb f- >bThen the matrix will be reducedW f- And reducing the column vectorb f- Respectively as analysis matrixWAnd analyzing the column vectorsbWill elementfMovable key serial number seteAnd jumping to step 3.5; wherein:U f- =[w f-,1w f-,2]TU f-0= [w f- ,01w f- ,02]T
step 3.5: to findSystem of linear equationsWU=bSolution of (2)U=U 0WhereinU=[U 1U 2]TU 0=[U ,01U ,02]T
After step 3.5, step 3.6 is performed.
Step 3.6: in each section, calculate separatelyu i,j = W i,j U 0Then calculateτ g = (t max-t i,j )/(b-u i,j ) (ii) a Respectively takeτ g Minimum value of the part ofτ minCorresponding serial numbere 2Is a new key serial number and wille 2Key serial number set added to each sectioneIn (1) };
according to the cross sectionτ minAndU 0the center coordinates of each cross-sectional circleO i Is updated toO i ’+τ min∙[U 1U 2,0]T
In each section, the center coordinates of the section circle after updating are respectively used as the basisO i ' and coordinates of each measuring point on the sectionP i,j Updating state element sett i,j },t maxIs updated tot i,j Is measured.
And 3.6, finishing one-time optimization after the step 3.6 is finished, and performing the step 3.3.
Step 3.7: extracting the center coordinates of the section circle of each section which is finally updatedO i ' and using it to update coordinate set of center of circle of section of reference segmentO i ’}。
Step 4 is performed after step 3.7 is completed.
And 4, step 4: obtaining a final updated reference segment section circle center coordinate setO i ' }, according toO i ' } set up feature lineVector setA i Great, set of boundary elementsb i Great, state element sets i }; extracting measured section measuring point set of the step 3Q k According toQ k Establishing state element setT k }; extracting the reference segment measuring point set in the step 3P i,j According toP i,j Re-establishing a set of state elementst i,j }; wherein:
O i ’={x i ’,y i ’,z i ' } is the space rectangular coordinate of the center of each section of the reference section;
A i =([-x i ’/s i ,- y i ’/s i y i z i ’/s i ,- x i z i ’/s i ]) Is a feature row vector, all feature row vectorsA i Is a characteristic row vectorA i };
b i =bIs a real number greater than 0, all boundary elementsb i Is a set of boundary elementsb i };
Figure 579996DEST_PATH_IMAGE002
State elements of the centers of all cross-sections in the reference sections i The set of the state elements is the center of the circle of the section of the reference segments i };
Figure 439498DEST_PATH_IMAGE003
In the section to be measuredAll state elementsT k The set of (a) is a state element set of a measured segment measuring pointT k };
Figure 424772DEST_PATH_IMAGE004
All state elements in the reference segmentt i,j The set of (1) is a state element set of a reference segment measuring pointt i,j }。
After step 4, step 4.1 is performed.
Step 4.1: gets i Maximum values maxCorresponding serial numberl 1Is a key serial number, and willl 1Last page added to key serial number setlIn (c) }.
After step 4.1, step 4.2 is performed.
Step 4.2: according to the key sequence numberlEstablishment of an analysis matrixAAnd analyzing the column vectorsb', wherein:
A=[…,A p T,…,A q T,…]Tis aLA matrix of rows and 4 columns,Lis a critical sequence number setlThe number of the elements in the (C),pqis a critical sequence number setlThe elements in (1);
b’=[…,b p ,…,b q ,…]Tis aLA column vector of rows.
After step 4.2, step 4.3 is performed.
Step 4.3: for analysis matrixAAnd the broadening matrix [ alpha ]Ab’]Rank analysis was performed.
Computingr A = rank(A),r Ab’ = rank([Ab’]) And comparer A Andr Abthere are two cases:
the first condition is as follows: if it is notr A = r AbShould, shouldContinuing optimizing and executing the step 4.4;
case two: if it is notr A <r Ab Attempting to derive a secondary analysis matrixAAnd analyzing the column vectorsb' middle removing key serial number setlSome element oflCorresponding rows, resulting in a reduced matrixA l- And reducing the column vectorb l- According toA l- Ψ l- = b l- Solved to obtainΨ l- =Ψ l-0Then calculate b l- =A l Ψ l-0(ii) a If the key sequence number setlAll the elements in the Chinese character have been tried, and none of them is obtainedb l- >bThen the optimization should be ended, jumping to step 5; if the critical sequence number set is triedlElements in (b) }lWhen it is obtainedb l- >bThen the matrix will be reducedA l- And reducing the column vectorb l- Respectively as analysis matrixAAnd analyzing the column vectorsb', will elementlMovable key serial number setlAnd jumping to step 4.4; whereinΨ l- =[v l-,1v l-,2v l-,3v l-,4]TΨ l-0=[v l- ,01v l- ,02v l- ,03v l- ,04]T
Step 4.4: solving a system of linear equations=b' solution ofΨ=Ψ 0WhereinΨ=[Ψ 1Ψ 2Ψ 3Ψ 4]TΨ 0=[Ψ 0,1Ψ 0,2Ψ 0,3Ψ 0,4]T
After step 4.4, step 4.5 is performed.
Step 4.5: computingv i =A i Ψ 0Then calculateτ g =(s max-s i )/(b-v i ) (ii) a Getτ g Minimum value of the part ofτminCorresponding serial numberl 2Is a new key serial number and willl 2Last page added to key serial number setlIn (1) };
the coordinate set of the center of a circle of the section of the reference segmentO i ' }is updated toO i ’ +τminV 1Wherein:
Figure 203372DEST_PATH_IMAGE005
according to the updatedO i ' update state element sets i },s maxIs updated tos i Maximum value of (d);
set of measured segment measuring pointsQ k Is updated toQ k +τminV 2Wherein:
Figure 8517DEST_PATH_IMAGE006
according to the updatedQ k Updating state element setT k };
Set the reference segment measuring pointP i,j Is updated toP i,j +τminV 3Wherein:
Figure 655399DEST_PATH_IMAGE007
according to the updatedP i,j Update status elementCollection checkt i,j }。
And 4.5, finishing one-time optimization after the step 4.5 is finished, and performing the step 4.2.
And 5: obtaining the final reference segment measuring point state element sett i,j Comparing all the reference section measuring pointst i,j Maximum value thereoft i,j maxAnd minimum valuet i,j minAnd (6) judging whether the reference shaft section meets the design size requirement of the measured shaft, if so, performing the step 6, otherwise, judging that the reference section of the measured shaft does not meet the design size requirement, and directly ending.
Step 6: obtaining the final state element set of the measured segment measuring pointT k Comparing the measured points of all the measured segmentsT k Maximum value thereofT k maxAnd minimum valueT k minNamely the minimum circumscribed cylinder radius and the maximum inscribed cylinder radius of the measured shaft section, judging whether the measured shaft section meets the design size requirement of the measured shaft, if so, performing the step 7, otherwise, judging that the measured section of the measured shaft does not meet the design size requirement, and directly ending.
And 7: comparing all points of the section to be measuredT k CalculatingT=T k max-T k minNamely the radial total run-out error of the measured section; and judging whether the measured shaft meets the requirement of the radial full run-out tolerance.
To get a more accurate solution, the following optimization can be done:
in step 4.5, ifτ minV i Of single or several iterationsτ min V i Greater than a given thresholdaThen, according to the updated coordinate set of the circle center of the section of the reference segmentO i ' } jump to step 4 to update characteristic line vector setA i }, set of boundary elements{b i Great, state element sets i }. To facilitate numerical calculation, can makebTaking a specific value greater than 0, but not limited to 1.
The invention has the beneficial effects that:
1. the geometric characteristics of the radial total run-out are fully considered, and the evaluation form is simplified, so that the method is easier to popularize than the first type of evaluation method. 2. The geometric characteristics of the radial total run-out are fully considered, a better value is obtained through mature linear operation in each iteration, and the minimum radial total run-out error can be finally obtained, so that the algorithm is stable, and the problem of initial value sensitivity of the fifth method does not exist. 3. The fact that most of the measuring points are invalid measuring points in the radial total run-out error evaluation is implied, and the invalid measuring points are not added with iteration, so that the iteration times of the method are fewer and are equivalent to the first type evaluation method and the fifth type evaluation method. 4. When calculating optimizing direction, only considering key sequence number setlAnd (4) corresponding measuring points, so that the operation amount of each iteration is small, and the method is equivalent to the fifth type evaluation method. 5. Because the iteration times are less and the operation amount of each iteration is less, the total operation speed is equivalent to the first type evaluation method and the fifth type evaluation method.
The invention provides a rapid, stable, simple and digital evaluation method for the full run-out error in the radial direction, which can be used for evaluating the full run-out error in the radial direction of shaft parts taking the axes of the designated shaft sections at the two sides of the shaft section to be measured as a common reference axis and providing guidance for the improvement of the processing technology of the shaft parts, thereby having industrial possibility.
Drawings
FIG. 1 is a flow chart of the present invention.
FIG. 2 is a flow chart of the present invention.
FIG. 3 is a tolerance layout for parts in an exemplary embodiment.
Detailed Description
The following are specific embodiments of the present invention, and the embodiments of the present invention will be further described with reference to the drawings, but the present invention is not limited to these embodiments.
The common reference full radial run-out error for one axis is evaluated and its tolerance design specification is shown in figure 3.
Step 1: obtaining initial measuring point set of measured segmentQ k The following:
Figure 495179DEST_PATH_IMAGE008
after step 1, step 2 is performed.
Step 2: obtaining initial measuring point set of reference sectionP i,j The following:
Figure 444681DEST_PATH_IMAGE009
Figure 2701DEST_PATH_IMAGE010
after step 2, step 3 is performed.
And step 3: obtaining a predetermined measured segment measuring point setQ k The method comprises the following steps:
Figure 938427DEST_PATH_IMAGE011
obtaining pre-positioned reference segment measuring point setP i,j The method comprises the following steps:
Figure 898293DEST_PATH_IMAGE012
Figure 18695DEST_PATH_IMAGE013
obtaining pre-positioned reference section initial circle center coordinate setO i The method comprises the following steps:
Figure 798433DEST_PATH_IMAGE014
after step 3, step 3.1 is performed.
Step 3.1: taking the section 1 as an example, according to the reference segment measuring point set corresponding to each measuring point on the section 1P i,j Great atP ,j1Construction of characteristic line vector setW ,j1The method comprises the following steps:
Figure 787117DEST_PATH_IMAGE015
establishing a set of boundary elementsb ,j1The method comprises the following steps:
{b ,j1}=[1,1,1,1,1,1]T
establishing a set of state elementst ,j1The method comprises the following steps:
Figure 601489DEST_PATH_IMAGE016
obtaining the center coordinates of the section 1 of the reference sectionO 1' the following:
O 1’={0,0,15}。
after step 3.1, step 3.2 is performed.
Step 3.2: in section 1, taket ,j1Maximum value oft maxCorresponding serial number 2 is a key serial number, and 2 is added to the key serial number set of the section 1eChinese, a large aperturee}={2}。
Step 3.3 is performed after step 3.2 is completed.
Step 3.3: according to the key sequence number set of section 1eEstablishment of an analysis matrixWAnd analyzing the column vectorsbWherein:
W= W 2=[-0.49999,0.86603]T
Wis a matrix with 1 row and 2 columns, and a key sequence number seteElement ofThe number is 1, the element is 2;
b=1。
step 3.4 is performed after step 3.3 is completed.
Step 3.4: for analysis matrixWAnd an augmented analysis matrixWb]Rank analysis was performed.
Computingr W =rank(W)=1,r Wb =rank([Wb]) =1, and comparingr W Andr Wb . Because of the fact thatr W =r Wb So the optimization should continue, step 3.5 is performed.
Step 3.5: solving a system of linear equationsWU=bSolution of (2)U=U 0=[-0.49999,0.86603]T
After step 3.5, step 3.6 is performed.
Step 3.6: in section 1, calculateu ,j1= W ,j1 U 0The results are as follows:
Figure 892794DEST_PATH_IMAGE017
then calculateτ g = (t max-t i,j )/(b-u i,j ) Get itτ g The results for the portion of the series greater than zero are as follows:
Figure 159827DEST_PATH_IMAGE018
minimum value thereofτ minThe corresponding serial number 5 is a new key serial number, and 5 is added to the key serial number set of the section 1eAt this time, a retaining openinge}={2,5}。
According to section 1τ minAndU 0coordinates of the center of a circle in the cross section 1O 1Is updated toO 1’+τ min∙[U 1U 2,0]TThe results are as follows:
O 1’={-0.00086,0.00150,15};
according to the updated center coordinates of the cross-section circleO 1' and coordinates of each measuring point on the sectionP ,j1Updating state element sett ,j1},t maxIs updated tot ,j1The results are as follows:
Figure 624306DEST_PATH_IMAGE019
and 3.6, finishing one-time optimization after the step 3.6 is finished, and performing the step 3.3.
By analogy, after the second optimization, the key sequence number sete}={2,5,4},O 1’={0.00211,0.00321 , 15}。
At this time, step 3.3 is performed first: according to the key sequence number set of section 1e} = {2, 5, 4} establishing analysis matrixWAnd analyzing the column vectorsbWherein:
Figure 293185DEST_PATH_IMAGE020
b=[1,1,1]T
step 3.4 is performed after step 3.3 is completed.
Step 3.4: for analysis matrixWAnd an augmented analysis matrixWb]Rank analysis was performed.
Is calculated tor W =rank(W)=2,r Wb =rank([Wb])=3,r W < r Wb (ii) a First, an attempt is made to analyze the matrix fromWAnd analyzing the column vectorsbMiddle deleted key serial number seteRow corresponding to the first element 2 in = {2, 5, 4}, resulting in a reduced matrixW -2
Figure 842808DEST_PATH_IMAGE021
Andb 2-column vector:
b 2-=[1,1]T
according toW 2- U -2= b 2-Solved to obtainU -2= U -20=[-0.00002,-1.15472]TThen calculate to obtainb 2-=W 2 U -20=
-1.00002 <1=b
Similarly, respectively obtainb 5-= -1.00005 <1=bb 4-= 0.99997<1=bNone is obtainedb f- >bSo the seek should be ended, jumping to step 3.7.
Step 3.7: extracting the center coordinates of the finally updated section circle of the section 1O 1’={-0.00211,-0.00321,15}。
By parity of reasoning, the center coordinates of the finally updated section circles of the other sections are obtainedO i ' and using it to update coordinate set of center of circle of section of reference segmentO i ' } as follows:
Figure 597137DEST_PATH_IMAGE022
step 4 is performed after step 3.7 is completed.
And 4, step 4: extracting the finally updated reference segment section circle center coordinate setO i ' }, according toO i ' establishing a characteristic line vector setA i The method comprises the following steps:
Figure 193204DEST_PATH_IMAGE023
build formForm element sets i The method comprises the following steps:
Figure 716589DEST_PATH_IMAGE024
establishing a set of boundary elementsb i The method comprises the following steps:
{b i }=[1,1,1,1,1,1,1,1,1,1]T
extracting measured section measuring point set of the step 3Q k According toQ k Establishing state element setT k The method comprises the following steps:
Figure 349696DEST_PATH_IMAGE025
extracting the reference segment measuring point set in the step 3P i,j According toP i,j Re-establishing a set of state elementst i,j The method comprises the following steps:
Figure 591321DEST_PATH_IMAGE026
Figure 476232DEST_PATH_IMAGE027
after step 4, step 4.1 is performed.
Step 4.1: gets i Maximum values maxThe corresponding serial number 8 is the key serial number, and 8 is added into the key serial number setlChinese, a large aperturel}=8。
After step 4.1, step 4.2 is performed.
Step 4.2: according to the key sequence numberlEstablishment of an analysis matrixAAnd analyzing the column vectorsb', wherein:
A= A 8=[0.72885,-0.68468,143.78185,153.05810]T
b’=1。
after step 4.2, step 4.3 is performed.
Step 4.3: for analysis matrixAAnd the broadening matrix [ alpha ]Ab’]Rank analysis was performed.
Computingr A = rank(A)=1,r Ab= rank([Ab’]) =1, comparisonr A Andr Ab(ii) a Because of the fact thatr A = r AbSo the optimization should continue, step 4.4 is performed.
Step 4.4: solving a system of linear equations=b' solution to getΨ=Ψ 0=[0.00002,-0.00002,0.00326,0.00347]T
After step 4.4, step 4.5 is performed.
Step 4.5: computingv i =A i Ψ 0The results are as follows:
Figure 119703DEST_PATH_IMAGE028
then calculateτ g =(s max-s i )/(b-v i ) Get itτ g The results for the portion of the series greater than zero are as follows:
Figure 720448DEST_PATH_IMAGE029
minimum value thereofτminThe corresponding serial number 7 is a new key serial number, and 7 is added into the key serial number setlIn (c) }. At this moment, the openingl}={8,7}。
The coordinate set of the center of a circle of the section of the reference segmentO i ' }is updated toO i ’ +τminV 1Wherein:
Figure 980528DEST_PATH_IMAGE030
obtaining updatedO i ' } as follows:
Figure 324922DEST_PATH_IMAGE031
according to the updatedO i ' update state element sets i },s maxIs updated tos i The results are as follows:
Figure 26162DEST_PATH_IMAGE032
set of measured segment measuring pointsQ k Is updated toQ k +τmin V 2Wherein:
Figure 797809DEST_PATH_IMAGE033
obtaining updatedQ k The method comprises the following steps:
Figure 14026DEST_PATH_IMAGE034
according to the updatedQ k Updating state element setT k Results are as follows:
Figure 896532DEST_PATH_IMAGE035
set the reference segment measuring pointP i,j Is updated toP i,j +τmin V 3Wherein:
Figure 796486DEST_PATH_IMAGE036
obtaining updatedP i,j The method comprises the following steps:
Figure 739034DEST_PATH_IMAGE037
Figure 176968DEST_PATH_IMAGE038
according to the updatedP i,j Updating state element set t i,j Results are as follows:
Figure 128744DEST_PATH_IMAGE039
Figure 335734DEST_PATH_IMAGE040
and 4.5, finishing one-time optimization after the step 4.5 is finished, and performing the step 4.2.
By analogy, after the 4 th optimization, the key sequence number is collectedl}={8,7,6,4,1}。
At this time, step 4.2 is performed first: establishing an analysis matrix according to the key sequence number set {8, 7, 6, 4, 1}AAnd analyzing the column vectorsb', wherein:
Figure 245921DEST_PATH_IMAGE041
b’=[1,1,1,1,1]T
step 4.3: for analysis matrixAAnd the broadening matrix [ alpha ]Ab’]Rank analysis was performed.
Computingr A = rank(A)=4,r Ab= rank([Ab’])=5, r A < r Ab. First, an attempt is made to analyze the matrix fromAAnd analyzing the column vectorsb' middle removing key serial number setlRow corresponding to the first element 8 in = {8, 7, 6, 4, 1}, resulting in a reduced matrixA -8
Figure 171152DEST_PATH_IMAGE042
And reducing the column vectorb -8
b -8=[1,1,1,1]T
According toA -8 Ψ -8= b -8Solved to obtainΨ -8=Ψ 8-0=[3.15016,-2.14150,-0.03632,-0.16944] TThen calculate to obtainb8-= A 8 Ψ 8-0= -27.39477<1=b
Similarly, respectively obtainb7-=-1.18356 <1=bb6-=-1.03268 <1=bb4-=-79.63369 <1=bb1-=0.99459 <1=bNone is obtainedb l- >bSo the seek should be ended, jumping to step 5.
And 5: obtaining the final reference segment measuring point state element set t i,j The method comprises the following steps:
Figure 739668DEST_PATH_IMAGE043
Figure 66744DEST_PATH_IMAGE044
comparing measured points of all reference sectionst i,j Which isMaximum value oft i,j maxAnd minimum valuet i,j minNamely the minimum circumscribed cylindrical radius and the maximum inscribed cylindrical radius of the reference shaft segment,t i,j min=35.00268>35.000,t i,j max=35.02443 <35.025, the measured shaft reference section meets the design size requirement of 35.000-35.025, and step 6 is performed.
Step 6: obtaining the final state element set of the measured segment measuring pointT k The method comprises the following steps:
Figure 351095DEST_PATH_IMAGE045
comparing measured points of all measured sectionsT k Maximum value thereofT k maxAnd minimum valueT k minNamely the minimum circumscribed cylinder radius and the maximum inscribed cylinder radius of the measured shaft section,T k max=49.99059<50.000,T k min=49.96790>49.961, the section to be measured of the measured shaft meets the design size requirement 49.961-50.000, and step 7 is performed.
And 7: comparing all points of the section to be measuredT k CalculatingT=T k max-T k min=0.02269 radial full run-out error of the measured section of the measured shaft, 0.02269<0.030, so the measured shaft meets its full radial runout tolerance requirements.
In the above description, the present invention has been described by way of specific embodiments, but those skilled in the art will appreciate that various modifications and variations can be made within the spirit and scope of the invention as hereinafter claimed.
The results obtained by the measurement are in accordance with GBT 1182-.

Claims (7)

1. The invention takes a high-precision linear guide shaft as an example, and verifies an evaluation method of common reference radial total run-out errors of shaft parts.
2. The method for evaluating the common reference radial total run-out error of the shaft comprises the following steps:
step 1: obtaining initial measuring point set of measured segmentQ k *}: taking the cylindrical surface of the shaft section to be measured as the section to be measured, and intercepting the section on the cylinder at equal intervals along the axial directionkEach section is perpendicular to the axis of the cylinder, and a single measuring point is selected on each section circle, so that the measuring points are approximately spirally arranged along the axis direction of the cylinder, and the measuring points are arranged in a spiral manneriInitial measuring point set for a segment to be measured consisting of measuring pointsQ k }; wherein:
k=1, 2, 3, …, Kkthe serial number of the cross section is shown,Kis the total number of the sections;
Q k *={x k *,y k *,z k the coordinate is the initial space rectangular coordinate of the measured point of the measured segment;
after the step 1 is finished, performing a step 2;
step 2: obtaining initial measuring point set of reference sectionP i,j *}: the cylindrical surfaces of the designated shaft sections on the two sides of the shaft section to be detected are respectively used as a reference section 1 and a reference section 2, and the cylindrical surfaces of the reference section 1 are cut at equal intervals along the axial directionMA cross section equally spaced in the axial direction on the cylinder of the reference section 2NEach cross section being uniformly selected over the circumference of each cross-sectional circlejA measuring point, each cross section being perpendicular to the axis, thei×jInitial measuring point set for forming reference section by measuring pointsP i,j }; wherein:
i=1, 2, 3, … , 2Miis a section number, 2MThe total number of the sections of the reference section;
j=1, 2, 3, … , Njis a single cross sectionThe serial number of the measuring point on the measuring point,Nthe total number of the measuring points of a single section is;
P i,j *={x i,j *,y i,j *,z i,j the original space rectangular coordinate of the measuring point of the reference segment is marked;
step 3 is carried out after step 2 is finished;
and step 3: the shaft is pre-positioned as follows: selecting coordinates of measuring points of all reference segmentsx i,j *maxAndx i,j *mincalculating the average valuex o* =(x i,j *max+ x i,j *min) Selecting coordinates of measuring points of all reference segmentsy i,j *maxAndy i,j *mincalculating the average valuey o*=(y i,j *max+ y i,j *min) 2; obtaining a pre-positioned measured section measuring pointQ k And using it to form a measuring point set of the segment to be measuredQ k }; obtaining a pre-positioned reference segment measuring pointP i,j And using it to form a reference segment measuring point setP i,j }; obtaining the initial circle center coordinates of each section circle of the pre-positioned reference sectionO i And using it to form a reference section with a preset circle center coordinate setO i }; wherein:
Q k ={x k y k z k and the space rectangular coordinate of the measured point of the measured section after pre-positioning, wherein:x k = x k *- x o*,y k = y k *-y o*,z k = z k and the cylinder axis of the measured segment approaches the coordinate systemzThe center of the end faces of both sides of the shaft and the measured sectionThe plane is approximately parallel to the XOY plane of the coordinate system;
P i,j ={x i,j y i,j z i,j and the space rectangular coordinate of the measuring point of the pre-positioned reference segment is shown, wherein:x i,j = x i,j *- x o*,y i,j = y i,j *- y o*,z i,j = z i,j and the cylindrical axis of the reference segment approximates the coordinate systemzThe central planes of the end surfaces on the two sides of the reference section are approximately parallel to the XOY plane of the coordinate system;
O i ={x i y i z i the preset center of each cross-section circle of the pre-positioned reference section is a spatial rectangular coordinate, wherein:x i = y i =0,z i = z i,j *;
step 3.1 is carried out after step 3 is finished;
step 3.1: in each section, a great deal is made from a set of reference segment measuring pointsP i,j Respectively establishing a characteristic line vector setW i,j Great, set of boundary elementsb i,j Great Chinese character and state element sett i,j }; obtaining the center coordinates of each section circleO i ' and using it to form coordinate set of centre of circle of section of reference segmentO i ' }; wherein:
W i,j =([x i,j /t i,j y i,j /t i,j ]) Is a feature row vector, all feature row vectorsW i,j Is a set of characteristic line vectorsW i,j };
b i,j =bIs a real number greater than 0, all boundary elementsb i,j Is a set of boundary elementsb i,j };
O i ’={x i ’,y i ’,z i ' is the space rectangular coordinate of the center of each section of the reference section, and initially,x i ’= x i y i ’= y i z i ’= z i
Figure 93501DEST_PATH_IMAGE001
status elements of all measurement points in the reference segmentt i,j The set of (1) is a state element set of a reference segment measuring pointt i,j };
Step 3.2 is carried out after step 3.1 is finished;
step 3.2: in each cross section, the cross section is taken ont i,j Maximum value oft maxCorresponding serial numbere 1Is a key serial number, and wille 1The key serial number sets respectively added to respective sectionseIn (1) };
step 3.3 is carried out after step 3.2 is finished;
step 3.3: according to the key sequence number set of each sectioneRespectively establishing analysis matrixesWAnd analyzing the column vectorsbWherein:
W= […,W m T,…,W n T,…]Tis aEA matrix of rows and 2 columns of,Eis a critical sequence number seteThe number of the elements in the (C),mnis a critical sequence number seteThe elements in (1);
b= […,b m ,…,b n ,…]Tis aEA column vector of rows;
step 3.4 is performed after step 3.3 is finished;
step 3.4: for analysis matrixWAnd an augmented analysis matrixWb]Performing rank analysis;
computingr W =rank(W),r Wb =rank([Wb]) And comparer W Andr Wb there are two cases:
the first condition is as follows: if it is notr W =r Wb If the optimization is to be continued, step 3.5 is executed;
case two: if it is notr W <r Wb Attempting to derive a secondary analysis matrixWAnd analyzing the column vectorsbMiddle removed key serial number seteSome element offCorresponding rows, resulting in a reduced matrixW f- And reducing the column vectorb f- According toW f- U f- = b f- Solved to obtainU f- =U f-0Then calculateb f- =W f U f-0(ii) a If the key sequence number seteAll the elements in the Chinese character have been tried, and none of them is obtainedb f- >bThen the optimization should be ended, jumping to step 3.7; if the critical sequence number set is triedeElements in (b) }fWhen it is obtainedb f- >bThen the matrix will be reducedW f- And reducing the column vectorb f- Respectively as analysis matrixWAnd analyzing the column vectorsbWill elementfMovable key serial number seteAnd jumping to step 3.5; wherein:U f- =[w f-,1w f-,2]TU f-0= [w f- ,01w f- ,02]T
step 3.5: solving a system of linear equationsWU=bSolution of (2)U=U 0WhereinU=[U 1U 2]TU 0=[U ,01U ,02]T
Step 3.6 is performed after step 3.5 is finished;
step 3.6: in each section, calculate separatelyu i,j = W i,j U 0Then calculateτ g = (t max-t i,j )/(b-u i,j ) (ii) a Respectively takeτ g Minimum value of the part ofτ minCorresponding serial numbere 2Is a new key serial number and wille 2Key serial number set added to each sectioneIn (1) };
according to the cross sectionτ minAndU 0the center coordinates of each cross-sectional circleO i Is updated toO i ’+τ min∙[U 1U 2,0]T
In each section, the center coordinates of the section circle after updating are respectively used as the basisO i ' and coordinates of each measuring point on the sectionP i,j Updating state element sett i,j },t maxIs updated tot i,j Maximum value of (d);
completing one optimization after the step 3.6 is finished, and performing the step 3.3;
step 3.7: extracting the center coordinates of the section circle of each section which is finally updatedO i ' and using it to update coordinate set of center of circle of section of reference segmentO i ’};
Step 4 is carried out after step 3.7 is finished;
and 4, step 4: obtaining a final updated reference segment section circle center coordinate setO i ' }, according toO i ' establish characteristic line directionVolume setA i Great, set of boundary elementsb i Great, state element sets i }; extracting measured section measuring point set of the step 3Q k According toQ k Establishing state element setT k }; extracting the reference segment measuring point set in the step 3P i,j According toP i,j Re-establishing a set of state elementst i,j }; wherein:
O i ’={x i ’,y i ’,z i ' } is the space rectangular coordinate of the center of each section of the reference section;
A i =([-x i ’/s i ,- y i ’/s i y i z i ’/s i ,- x i z i ’/s i ]) Is a feature row vector, all feature row vectorsA i Is a characteristic row vectorA i };
b i =bIs a real number greater than 0, all boundary elementsb i Is a set of boundary elementsb i };
Figure 590342DEST_PATH_IMAGE002
State elements of the centers of all cross-sections in the reference sections i The set of the state elements is the center of the circle of the section of the reference segments i };
Figure 771924DEST_PATH_IMAGE003
All state elements in the segment under testT k The set of (a) is a state element set of a measured segment measuring pointT k };
Figure 820652DEST_PATH_IMAGE004
All state elements in the reference segmentt i,j The set of (1) is a state element set of a reference segment measuring pointt i,j };
Step 4.1 is carried out after step 4 is finished;
step 4.1: gets i Maximum values maxCorresponding serial numberl 1Is a key serial number, and willl 1Last page added to key serial number setlIn (1) };
step 4.2 is carried out after step 4.1 is finished;
step 4.2: according to the key sequence numberlEstablishment of an analysis matrixAAnd analyzing the column vectorsb', wherein:
A=[…,A p T,…,A q T,…]Tis aLA matrix of rows and 4 columns,Lis a critical sequence number setlThe number of the elements in the (C),pqis a critical sequence number setlThe elements in (1);
b’=[…,b p ,…,b q ,…]Tis aLA column vector of rows;
step 4.3 is carried out after step 4.2 is finished;
step 4.3: for analysis matrixAAnd the broadening matrix [ alpha ]Ab’]Performing rank analysis;
computingr A = rank(A),r Ab’ = rank([Ab’]) And comparer A Andr Abthere are two cases:
the first condition is as follows: if it is notr A = r AbIf the optimization is to be continued, step 4.4 is executed;
case two: if it is notr A <r Ab Attempting to derive a secondary analysis matrixAAnd analyzing the column vectorsb' middle removing key serial number setlSome element oflCorresponding rows, resulting in a reduced matrixA l- And reducing the column vectorb l- According toA l- Ψ l- = b l- Solved to obtainΨ l- =Ψ l-0Then calculate b l- =A l Ψ l-0(ii) a If the key sequence number setlAll the elements in the Chinese character have been tried, and none of them is obtainedb l- >bThen the optimization should be ended, jumping to step 5; if the critical sequence number set is triedlElements in (b) }lWhen it is obtainedb l- >bThen the matrix will be reducedA l- And reducing the column vectorb l- Respectively as analysis matrixAAnd analyzing the column vectorsb', will elementlMovable key serial number setlAnd jumping to step 4.4; whereinΨ l- =[v l-,1v l-,2v l-,3v l-,4]TΨ l-0=[v l- ,01v l- ,02v l- ,03v l- ,04]T
Step 4.4: solving a system of linear equations=b' solution ofΨ=Ψ 0WhereinΨ=[Ψ 1Ψ 2Ψ 3Ψ 4]TΨ 0=[Ψ 0,1Ψ 0,2Ψ 0,3Ψ 0,4]T
Step 4.5 is carried out after step 4.4 is finished;
step 4.5: computingv i =A i Ψ 0Then calculateτ g =(s max-s i )/(b-v i ) (ii) a Getτ g Minimum value of the part ofτminCorresponding serial numberl 2Is a new key serial number and willl 2Last page added to key serial number setlIn (1) };
the coordinate set of the center of a circle of the section of the reference segmentO i ' }is updated toO i ’ +τminV 1Wherein:
Figure 454896DEST_PATH_IMAGE005
according to the updatedO i ' update state element sets i },s maxIs updated tos i Maximum value of (d);
set of measured segment measuring pointsQ k Is updated toQ k +τminV 2Wherein:
Figure 489848DEST_PATH_IMAGE006
according to the updatedQ k Updating state element setT k };
Set the reference segment measuring pointP i,j Is updated toP i,j +τminV 3Wherein:
Figure 135724DEST_PATH_IMAGE007
according to the updatedP i,j Updating state element sett i,j };
Completing one optimization after the step 4.5 is finished, and performing the step 4.2;
and 5: obtaining the final reference segment measuring point state element sett i,j Comparing all the reference section measuring pointst i,j Maximum value thereoft i,j maxAnd minimum valuet i,j minJudging whether the reference shaft section meets the design size requirement of the measured shaft or not, if so, performing the step 6, otherwise, judging that the reference section of the measured shaft does not meet the design size requirement, and directly ending;
step 6: obtaining the final state element set of the measured segment measuring pointT k Comparing the measured points of all the measured segmentsT k Maximum value thereofT k maxAnd minimum valueT k minJudging whether the measured shaft section meets the design size requirement of the measured shaft or not, if so, performing step 7, otherwise, judging that the measured section of the measured shaft does not meet the design size requirement, and directly ending;
and 7: comparing all points of the section to be measuredT k CalculatingT=T k max-T k minNamely the radial total run-out error of the measured section; and judging whether the measured shaft meets the requirement of the radial full run-out tolerance.
3. The method of claim 2, wherein said coordinate transformation moves by an average of coordinates.
4. A method of assessing the common reference radial run out error of a shaft as claimed in claim 2, wherein in step 3.6, if soτ min∙[U 1U 2,0]TOf single or several iterationsτ min∙[U 1U 2,0]TGreater than a given thresholdaThen, based on the updated center coordinates of the cross-sectional circle of the reference sectionO i ' jump to step 3.1 to update feature row vector setW i,j Great, set of boundary elementsb i,j Great Chinese character and state element sett i,j }。
5. A method of assessing the common reference radial run out error of a shaft as claimed in claim 2, wherein in step 4.5, if soτminV i Of single or several iterationsτ min V i Greater than a given thresholdbThen, according to the updated coordinate set of the circle center of the section of the reference segmentO i ' } jump to step 4 to update characteristic line vector setA i Great, set of boundary elementsb i Great, state element sets i }。
6. The method of assessing common reference full radial runout error of a shaft of claim 2,b=1。
7. the measured result conforms to GBT 1182 + 2008 and ISO 1101:2012 (E); the method is suitable for evaluating the radial total run-out error of the shaft parts which have higher requirements on the processing precision of the cylindrical surfaces of the shaft parts such as a high-precision linear guide shaft and the like and use the axes of the designated shaft sections at the two sides of the shaft section to be measured as the common reference axis.
CN202011087310.3A 2020-10-13 2020-10-13 Method for evaluating digitalized common reference radial total run-out error Withdrawn CN112212758A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011087310.3A CN112212758A (en) 2020-10-13 2020-10-13 Method for evaluating digitalized common reference radial total run-out error

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011087310.3A CN112212758A (en) 2020-10-13 2020-10-13 Method for evaluating digitalized common reference radial total run-out error

Publications (1)

Publication Number Publication Date
CN112212758A true CN112212758A (en) 2021-01-12

Family

ID=74053651

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011087310.3A Withdrawn CN112212758A (en) 2020-10-13 2020-10-13 Method for evaluating digitalized common reference radial total run-out error

Country Status (1)

Country Link
CN (1) CN112212758A (en)

Similar Documents

Publication Publication Date Title
CN110285781B (en) Rapid assessment method for plane parallelism relative to reference plane
CN109299462B (en) Short text similarity calculation method based on multi-dimensional convolution characteristics
CN111723440B (en) Thin-wall part machining precision prediction hybrid modeling method
CN112815849B (en) Nuclear power pipeline modeling method based on laser tracking
CN115618732B (en) Nuclear reactor digital twin key parameter autonomous optimization data inversion method
CN112051506B (en) Similar product transferable sample screening method, system and application
CN116618878A (en) Pre-welding process parameter determination method, welding quality online prediction method, device and storage medium
CN110703435B (en) Surface tolerance analysis method for free-form surface imaging system
Sun et al. Toward axial accuracy prediction and optimization of metal tube bending forming: A novel GRU-integrated Pb-NSGA-III optimization framework
CN114429090A (en) Gas compressor blade robustness design method based on data driving
CN109284574B (en) Non-probability reliability analysis method for series truss structure system
CN112212758A (en) Method for evaluating digitalized common reference radial total run-out error
CN113945130A (en) Method for evaluating radial circular run-out error of stepped shaft
CN108267106B (en) Quick, stable and simple cylindricity error evaluation method
CN113483660A (en) Method for evaluating radial circular run-out error of optical axis
CN115222114A (en) Automobile part assembly index value prediction method, terminal device and storage medium
CN110175357B (en) Gate-level sensitive circuit unit positioning method based on benchmarking analysis
CN113483721A (en) Method for rapidly evaluating straightness in any direction by applying maximum entity requirement
CN113884059A (en) Single-datum plane shaft hole part gradient evaluation method based on rank analysis
Liao et al. Obtaining more appropriate temperature sensor locations for thermal error modeling: reduction, classification, and selection
CN111210409A (en) Condition-based generation confrontation network structure damage identification method
CN111767518A (en) Method, device and equipment for determining parameter value of AWCC (active-vector configuration center) and computer storage medium
CN110619139A (en) Rapid position degree evaluation method based on single-datum hole shaft part
CN110631537A (en) Method for quickly evaluating parallelism of holes based on maximum entity requirement (MMR)
CN113483718A (en) Method for rapidly evaluating straightness in any direction based on minimum entity requirement

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20210112

WW01 Invention patent application withdrawn after publication