CN113884059A - Single-datum plane shaft hole part gradient evaluation method based on rank analysis - Google Patents

Single-datum plane shaft hole part gradient evaluation method based on rank analysis Download PDF

Info

Publication number
CN113884059A
CN113884059A CN202010630172.2A CN202010630172A CN113884059A CN 113884059 A CN113884059 A CN 113884059A CN 202010630172 A CN202010630172 A CN 202010630172A CN 113884059 A CN113884059 A CN 113884059A
Authority
CN
China
Prior art keywords
point
analysis
matrix
key
rank
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.)
Pending
Application number
CN202010630172.2A
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 CN202010630172.2A priority Critical patent/CN113884059A/en
Publication of CN113884059A publication Critical patent/CN113884059A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C9/00Measuring inclination, e.g. by clinometers, by levels

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Complex Calculations (AREA)

Abstract

The invention belongs to the field of precision metering and computer application, and relates to a method for evaluating hole shaft parts by combining rank analysis and measurement data, in particular to a method for quickly evaluating the inclination of a single reference plane based on rank analysis, which comprises the following steps of: 1: acquiring a reference plane measuring point set and a measured element point set, and establishing a characteristic row vector set and a state element set: 2: obtaining an initial key sequence number set; 3: establishing an analysis matrix and an analysis column vector; 4: performing rank analysis; 5: determining an optimizing direction; 6: solving new key points and updating coordinates of the measuring point set; 7: judging whether the evaluation of the reference elements meets the qualification conditions; 8: pre-positioning the point set of the measured elements; 9: updating the set of real-time state elements: 10: updating the key sequence number set of the measured elements; 11: establishing an analysis matrix and an analysis column vector; 12: performing rank analysis; 13: determining an optimizing direction; 14: solving new key points and updating coordinates of the measuring point set; 15: and (5) judging the qualification.

Description

Single-datum plane shaft hole part gradient evaluation method based on rank analysis
Technical Field
The invention belongs to the field of precision measurement and computer application, and particularly relates to a single-datum plane shaft hole part gradient evaluation method which is stable, rapid and simple in form and based on rank analysis.
Background
The size error and the shape and position error (short for shape error and position error) directly influence the product quality, the assembly and the service life of the product, and the method has important significance for quickly and accurately calculating the part error. The inclination error of the single-datum-plane shaft part refers to the diameter of the minimum circumscribed cylinder which forms a theoretical correct angle with a datum plane and contains the axis of the measured shaft part.
First, a specialized geometric assessment method. The diameter of the minimum circumscribed cylinder which meets the definition and/or discrimination conditions of national standard and ISO standard is gradually searched 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 form of the mathematical model is complex and is not easy to popularize.
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 diameter of the minimum circumscribed cylinder 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. Even when the data size is large, the data size can still be reduced by constructing the convex hull. However, the efficiency of such methods for direct assessment has been inadequate.
And in the third category, a linear or nonlinear target optimization function is constructed, optimization solution is carried out by adopting a common optimization method, and the optimization value of the target optimization function is taken as the diameter of the minimum circumscribed cylinder. The method is simple and easy to understand, and realizes a standard solution method in a plurality of software, so the method is easy to popularize. However, this type of method is generally inefficient because the geometric features of diameter assessment of the smallest circumscribing cylinder are not incorporated and the larger scale of data in the assessment 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 standard solutions in a plurality of software at present, so the method is easy to popularize. Although these methods are relatively hot at present, they are not suitable for use in the diameter evaluation of the smallest circumscribed cylinder. This is because the gradient of the objective function for the diameter assessment of the minimum circumscribing cylinder is the sum of a large number of simple analytical expressions, and part errors are typically small. Therefore, the "local optimal value" of the objective function can be considered as the "global optimal value", and the fourth method has no obvious advantages over the third 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 diameter evaluation of the minimum circumscribed cylinder, 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 relatively quick and simple method for evaluating the diameter of the minimum inscribed cylinder at present. However, this method is very sensitive to initial values and does not always perform the geometric assessment task stably.
In summary, when the existing geometric evaluation method is applied to the inclination of the single-datum-plane axial hole type part, stability, quickness and simple form cannot be simultaneously considered.
Disclosure of Invention
The purpose of the invention is:
aiming at the problems in the prior art, the invention provides a single-datum plane axis hole part gradient error assessment method which is stable, quick and simple in form and is based on rank analysis of a hole axis part, and the assessment result can also provide guidance for improvement of a machining process.
The method can be used for evaluating the inclination of the gas jet hole on the pre-combustion chamber of the diesel engine.
The scheme adopted by the invention is as follows:
the method is used for evaluating the inclination of the single-datum-plane axial hole type part based on rank analysis on the basis that the datum plane is evaluated and qualified.
The single-datum-plane axial hole part gradient evaluation method based on rank analysis is realized through the following steps:
step 1: firstly, measuring points of a measured axis are obtained and are used to form a measuring point set p j }; obtaining measuring points of a reference plane, and using the measuring points to form a reference measuring point set p i }; wherein:
i=1, 2, 3, …, Nithe serial numbers of the measuring points are shown,Nthe total number of measuring points as a benchmark;
p i ={x i , y i , z i is the measurement pointiThe reference plane is close to the XOY plane of the coordinate system;
j=1, 2, 3, …, Mithe serial numbers of the measuring points are shown,Mthe total number of the measured points of the measured axis;
p j ={x j , y j , z j is the fitted axis measurement pointjThe axis of the space rectangular coordinate is close to form a theoretical correct angle theta with the XOY plane of the coordinate system;
then, obtain the initial key sequence numberl 1Andl 2will bel 1Andl 2adding key serial number setl};
l 1Is composed ofp i Inz j Point of maximum valuep l1 The serial number of (a) is included,l 2is composed ofp i Inz i Point of minimum valuep l2 The serial number of (2);
then, the boundary position is setUAndB
U=z l1 z l1 is composed ofp l1 Z-coordinate value of (a);Uthe upper boundary position, which is the crossing point [0,U]and parallel to the XOY plane;
B=z l2 z l2 is composed ofp l2 Z-coordinate value of (a);Bthe lower boundary position, the lower boundary being the crossing point [0,B]and parallel to the XOY plane;
then, obtaining a boundary middle position aver; aver = (a =)U+B)/2;
Finally, according to p i Establishing a feature line vector set{A i }; wherein:
for allz i >Point of aver, whichA i =[-1, -y i , x i ]; A i Is a feature row vector, all feature row vectorsA i Is a set of characteristic line vectors A i };
After step 1, step 2 is performed.
Step 2: according to p i Establishing a reference state element setu i And i };
u i = U z i u i The distance from the reference measuring point to the upper boundary;
d i =z i - Bd i the distance from the reference measuring point to the lower boundary;
step 3 is carried out after step 2 is finished;
and step 3: according to the key sequence numberlEstablishment of an analysis matrixAAnd analyzing the column vectorsbWherein:
A=[…, A p T, …, A q T, …]Tis aeA matrix of rows and 4 columns,eis a critical sequence number setlThe number of the elements in the (C),p, qis a critical sequence number setlThe elements in (1);
b=[…, b p , …, b q , …]Tis aeA column vector of rows;
after step 3, step 4 is performed.
And 4, step 4: for analysis matrixAAnd an augmented analysis matrixA, b]Performing rank analysis;
computing an analysis matrixARank ofr A =rank(A) Extended analysis matrix [ alpha ], [ beta ] anA, b]Rank ofr Ab =rank([A, b]) And comparer A Andr Ab there are only two cases:
the first condition is as follows: if it is notr A =r Ab Then, the optimization should be continued, jumping to step 5;
case two: if it is notr A < r Ab Then, initializing the calculatorr=1, and step 4.1 is performed;
step 4.1: making key serial number collect lastlGet rid of the firstrAn elementl r Then obtain l s According to l s Establishment of a reduction matrixA s And reducing the column vectorb s Wherein:
iis 1;
A s =[…, A p T, …, A q T, …]Tis a matrix of S rows and 4 columns, and S is a l s The number of the elements in the (C),p, qis al s The elements in (1);
b=[…, b p , …, b q , …]Tis a column vector of S rows;
step 4.2: solving linear equationsA s v s = b s Solution of (2)v s =v s0 Then calculateb i =A s v s (ii) a If it is notb i >b s Then the matrix will be reducedA s And reducing the column vectorb s Respectively asAMatrix and analysis column vectorbAn element k i Movable key serial number setkAnd jumping to the step 5; if it is notb i <=b s Then step 4.3 is performed;
step 4.3: judgment ofiWhether the number is equal to S +1, ifiThe number is less thanS+1, jumping to step 4; if it is notiThe number is equal toS+1, should finish the optimization, jump to step 7;
and 5: motion vector of measuring point is solvedv 0I.e. linear equationsAv= bA solution ofv=v 0Wherein, in the step (A),v=[v 1, v 2, v 3]Tv 0=[v 0,1, v 0,2, v 0,3]T
after step 5, step 6 is performed.
Step 6: finding new key point by tracing problemp j Anp i Updating is carried out;
first, a relative velocity of each reference point and a boundary is calculatedv i }:v i = A i v 0
Then, the time of pursuit is calculatedτ i
τ i 1= u i / v i | i N=1, 2, …τ’ i Catch up points for upper boundariesp i The time of (d);
τ i 2= d i / v i | i N=1, 2, …τ’’ i catch up a point for the lower boundaryp i The time of (d);
τ i getτ i1τ i2The smaller of these;
then, the decision key point: to catch up timeτ i Minimum value in the part of greater than zeroτ minThe corresponding measuring points are key pointsp l3The serial number corresponding to the pointl 2Adding key serial number setl};
Then, according top i =τ min v 1p i +τ minv 2Updating reference measuring point setp i },
Figure 100002_DEST_PATH_IMAGE001
v 2=[0, 0, v 0,1]T
Then, according top , j =τ min v 1 p , j +τ min v 2Updating measured axis point set p , j };
Finally, according toU= U-τ minbUpdating upper boundary positionsU(ii) a According toB= B+τ minbUpdating upper boundary positionsB
And 6, finishing one-time optimization after the step 6 is finished, and performing the step 2.
And 7: the effective size of the reference plane isU-BIf, ifU-B<t1Then the reference plane meets the flatness requirements. Wherein, t1Is a flatness tolerance value;
step 7 is over, ifU-B<t1Then step 8 is performed to evaluate the inclination of the measured axis.
And 8: first, the corresponding measured axis measuring point set is evaluated by the fitting standard p j }={x j , y j , z j Determining the position w and direction vector of the fitted straight lineL(ii) a Wherein:
then calculating the position coordinate w of the minimum circumscribed cylindrical axis; wherein:
w=[ x w , y w , 0]Twfitting the intersection point of the straight line and the XOY plane for the measured point set by a least square method;
the direction vector isL=[x L ,y L ,z L ]T, x L 、y L 、z L Satisfy the requirement of
Figure 100002_DEST_PATH_IMAGE002
Then, establishing a parameter describing the position of the minimum circumscribed cylinder axisa wj And direction parametera LWherein:
a wj =L Tp j -w),a L,=L T L
then according to p j Anda wj a Lestablishing a feature line vector setA j Great Chinese character and state element sett j }; wherein:
Figure 100002_DEST_PATH_IMAGE003
all state elementst j Is a set of state elements t j }; catching pocket for state elementt j Maximum value of }t jmax =D’,D' is the distance dimension from the minimum circumscribed cylinder boundary to the minimum circumscribed cylinder axis;
establishingA j A feature row vector, wherein
Figure 100002_DEST_PATH_IMAGE004
All feature row vectorsA j Set as a set of feature line vectors{ A j };
After step 8, step 9 is performed.
And step 9: not performing step 14, taking a set of state elementst j Maximum value of }t jmax Corresponding measuring pointp j Is a key point, and adds the measuring point serial number j to a key point set l' in, a set of key points l’}={j};
If step 14 is performed, a keypoint is generatedp l2 Then, the key pointp l2 Will replace the measuring pointp j Number of its measuring pointl2Last page added to key serial number set l' } in;
after step 9, performing step 10;
step 10: according to the key sequence number l' } establishing analysis matrixA' sum analysis column vectorb', wherein:
A’=[…, A p T, …, A q T, …]Tis a matrix with f rows and 6 columns, and f is a key sequence number set lThe number of the elements in the' },p, qis a critical sequence number set l' } elements;
b’=[…, b p , …, b q , …]Tis a column vector of f rows;
after step 10, step 11 is performed.
Step 11: for analysis matrixA' and extended analysis matrixA’, b’]Performing rank analysis;
computing an analysis matrixARank of `r A =rank(A ) Extended analysis matrix [ alpha ], [ beta ] anA’, b’]Rank ofr Ab =rank([A’,b’]) And comparer A Andr Ab there are only two cases:
the first condition is as follows: if it is notr A =r Ab Then, the optimization should be continued, jumping to step 12;
case two: if it is notr A < r Ab Then, initializing the calculatorr=1, perform step 11.1;
step 11.1: making key serial number collect last l' take turns to remove the elements in the key sequence number setl r Then obtain l s According to l s Establishment of a reduction matrixA s And reducing the column vectorb s Wherein:
jis 1;
A s =[…, A p T, …, A q T, …]Tis a matrix of S rows and 6 columns, and S is a l s The number of the elements in the (C),p, qis a l s The elements in (1);
b’=[…, b p , …, b q , …]Tthis is the column vector for S rows, and step 11.2 is performed.
Step 11.2: solving linear equationsA s v s =b s Solution of (2)v s = v s0 Then calculateb j = A s v s
If it is notb j > b s Then the matrix will be reducedA s And reducing the column vectorb s Respectively asA' matrix and analysis column vectorb', will elementl j Movable key serial number set l' }, and jump to step 11; if it is notb j <= b s Then step 11.3 is performed.
Step 11.3: judgment ofjWhether or not the number ofEqual to S +1, ifjIs not equal toS+1, jumping to step 11; if it is notjIs equal toS+1, the seek should be ended, jumping to step 15.
Step 12: motion vector of measuring point and boundary is solvedv0I.e. linear equationsAv’= bA solution ofv’= v0Wherein, in the step (A),v’=[v1, v2, v3, v4, v5, v6]T v0=[ v0,1, v 0,2, v 0,3, v 0,4, v 0,5, v0,6]T
after step 12, step 13 is performed.
Step 13: finding new key point by tracing problemt j }、D’,{A j Updating is carried out;
first, calculating the relative speed between each measuring point and the boundaryv i }:v i = A j v 0
Then, the time of pursuit of each measurement point is calculatedτ j τ j =(D’–t j )÷(b i v i ) | i N=1, 2, …
Then, the decision key point: to catch up timeτ i Minimum value in the part of greater than zeroτ minCorresponding measuring pointp j Is a key point;
then, according top j = p j +τminv m Updating measuring point setp j }, wherein:
Figure 100002_DEST_PATH_IMAGE005
finally, according to w = w +τminv g Updating w, wherein:
Figure 100002_DEST_PATH_IMAGE006
at updated measuring point setp i Updating said leaf on the basis oft j }、D’,{A j };
And finishing one optimization after the step 14 is finished, and performing the step 9.
Step 15: at this time, the effective size of the measured axis isD', ifD’<t', the measured axis meets the requirement of gradient, and the measured axis is qualified; otherwise, the product is not qualified. Wherein t' is a gradient tolerance value.
Conveniently obtaining the measuring point set in step 1p j A general measurement data can be preparedp j A set of measuring points whose axes meet at a theoretically correct angle θ to the XOY plane of the coordinate system and whose intersection points are close to the origin of the coordinate system, is obtained by processingp j }: firstly, moving according to the average value of coordinates; moving according to the extreme value of the coordinate; thirdly, moving according to the root-mean-square minimum principle of coordinates; and fourthly, obtaining data after the first measured element is evaluated as the data obtained after pre-positioning.
In step 14, ifτmin v i Single order value ofτmin v i Or accumulated value sigma of past iterationsτmin v i Greater than a given thresholdQThen, measuring point of the measured segmentp j Is updated top j | j N= 1, 2, … +∑τ minv m And reassessed from step 9.
To facilitate numerical calculation, can makebAndb' takes a specific value greater than 0, and may be, but is not limited to, 1.
The invention has the beneficial effects that:
1. the geometrical characteristics of the inclination of the single-datum-plane shaft hole type part 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 inclination of the single-datum plane shaft hole type part are fully considered, a better value is obtained through mature linear operation in each iteration, and the minimum limit equivalent size 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 evaluation of the inclination of the single-datum-plane axial hole type part 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. Calculating the optimizing direction by considering only the keypoint 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 single datum plane shaft hole part gradient evaluation method based on rank analysis, which is stable, rapid and simple in form, can be used for evaluating a shaft hole part with a single datum plane gradient, and provides guidance for improvement of a machining process of the shaft hole part, so that the method has industrial possibility.
Drawings
FIG. 1 is a benchmarking flowchart A of the present invention.
FIG. 2 is a measured axis evaluation flow chart B 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 scheme of the present invention will be further described with reference to fig. 1 and 2, but the present invention is not limited to these examples.
The inclination of a hole shaft part based on a single datum plane is evaluated, and the tolerance design specification is shown in figure 2.
Step 1: measuring point set for obtaining reference planep i Great square and measuring point set for obtaining measured axisp j The method comprises the following steps:
Figure DEST_PATH_IMAGE007
the initial key serial numbers at this time are 2 and 4;
upper boundary position at this timeUIs z2=0.01617, lower boundBIs z4=-0.02328;
Obtaining a boundary middle position aver = -0.0036;
establishing a feature line vector setA i The method comprises the following steps:
Figure DEST_PATH_IMAGE008
after step 1, step 2 is performed.
Step 2: according top i Establishing a reference state element setu i }:
Figure DEST_PATH_IMAGE009
According top i Establishing a reference state element setd i }:
Figure DEST_PATH_IMAGE010
After step 2, step 3 is performed.
And step 3:
Figure DEST_PATH_IMAGE011
b=[1,1] T
after step 3, step 4 is performed.
And 4, step 4:r A =rank(A) =2,r Ab =rank([A, b])=2,r A =r Ab and jumping to the step 5.
And 5: linear equation of equationsAv= bIs thatv=v 0 =[0, -0.1449, -0.0110]T
After step 5, step 6 is performed.
Step 6: firstly, calculating the normal linear velocity of the measuring pointv i v i =A i v 0The results are as follows:
Figure DEST_PATH_IMAGE012
then, the minimum tracking time of each measuring point is calculatedτ i And deciding a key point: to catch up timeτ i Minimum value in the part of greater than zeroτ minMeasured point corresponding to =0.000368 as key pointp 1
Finally, updating measuring point set p i Anp j As follows:
Figure DEST_PATH_IMAGE013
updating upper boundary positionsU= 0.0158, update lower bound locationB=0.0229。
And 6, finishing the first optimization of the benchmark evaluation after the step 6 is finished, and performing the step 2.
By analogy, after the sixth optimization of benchmark evaluation is completed according to the invention, the critical sequence number set is a final pagel} = {2, 1,14, 6}, step 6 gets the new key point asp’ 6
Measuring point set updated after sixth optimization p i Anp j As follows:
Figure DEST_PATH_IMAGE014
starting to perform 7 th optimization and updating the upper boundary positionU= 0.0148, updating the lower boundary positionB=-0.0219;
Step 6, ending and carrying out step 2;
step 2: according top i Establishing a reference state element setu i }:
Figure DEST_PATH_IMAGE015
According top i Establishing a reference state element setd i }:
Figure DEST_PATH_IMAGE016
After step 2, step 3 is performed.
And step 3:
Figure DEST_PATH_IMAGE017
b=[1, 1, 1, 1] T
after step 3, step 4 is performed.
And 4, step 4:r A =rank(A) =3,r Ab =rank([A, b])=4,r A r Ab step 4.1 is performed.
Step 4.1: the key sequence number set {2, 1,14, 6} is made to get {2, 1,14, 6} after the 1 st element 2 is removed, and a reduced matrix is established according to {1, 14,6}A 3 And reducing the column vectorb 3 Respectively is as follows:
A 3=[ A 1 T, A 14 T, A 6 T]T =
Figure DEST_PATH_IMAGE018
b 3=[1,1,1] T
step 4.2: linear equation of equationsA 3 v 3 = b 3 Solution of (2)v 3 =[-0.6916,-0.3378,-0.1283]Then calculateb 2 =A 2 v 3 = -2.1001<1;
Then, the 2 nd element 1 is removed to obtain {2, 14,6}, and a reduced matrix is built according to {2, 14,6}A s And reducing the column vectorb s Respectively is as follows:
A s=[ A 2 T, A 14 T, A 6 T]T =
Figure DEST_PATH_IMAGE019
b s=[1,1,1] T
step 4.2: linear equation of equationsA 3 v 3 = b s Solution of (2)v 3 =[-0.2094,-0.0824,-0.2203]Then calculateb 1 =A 1 v 3 = -1.4573<1;
Then, the 3 rd element 14 is removed to obtain {2, 1,6}, and a reduced matrix is built according to {2, 1,6}A 3 And reducing the column vectorb 3 Respectively is as follows:
A 3=[ A 2 T, A 1 T, A 6 T]T =
Figure DEST_PATH_IMAGE020
b 3=[1,1,1] T
step 4.2: linear equation of equationsA 3 v 3 = b 3 Solution of (2)v 3 =[-0.2094,-0.0824,-0.2203]Then calculateb 14 =A 14 v 3 = -9.7465<1;
Then, the 4 th element 6 is removed to obtain {2, 1,14}, and a reduced matrix is built according to {2, 1,14}A 3 And reducing the column vectorb 3 Respectively is as follows:
A 3=[ A 2 T, A 1 T, A 14 T]T =
Figure DEST_PATH_IMAGE021
b 3=[1,1,1] T
step 4.2: linear equation of equationsA s v s = b s Solution of (2)v s =[-0.2094,-0.0824,-0.2203]Then calculateb 14 =A 14 v 3 = -4.6362<1;
And 4.2, ending the step and carrying out a step 4.3.
Step 4.3:b i <the number of i in 1 is 4= S +1=3+1, and the optimization end jumps to step 7.
And 7: the effective size of the reference plane isU-B=0.0367< t1And (5) the flatness requirement is met by = 0.05.
After step 7, step 8 is performed.
And 8:
primary evaluated measured element p j And after pre-positioning:
Figure DEST_PATH_IMAGE022
the direction vector is L = [0,1 ]]T, w=[0.0074,-0.0152, 0]TInitial state collectiont j The method comprises the following steps:
Figure DEST_PATH_IMAGE023
D=0.0314;
establishing a feature line vector setA j The method comprises the following steps:
Figure DEST_PATH_IMAGE024
after step 8, step 9 is performed.
And step 9: not performing step 14, taking a set of state elementst j Maximum value of }t jmax =0.0314 corresponding measuring pointp5Is a key point, and adds the measuring point serial number 5 to the key point set l' in, a set of key points l’}={5};
After step 9, step 10 is performed.
Step 10: according to the key sequence number l' } establishing analysis matrixA' sum analysis column vectorb', wherein:
A’==[ A5 T]T =[-0.06251,-0.2535,2.5136,0.6251, 0.2535, -2.5136], b’=[1];
after step 10, step 11 is performed.
Step 11:r A =rank(A’) =1,r Ab =rank([A’, b’])=1,r A =r Ab and a jump is made to step 12.
Step 12: linear equation of equationsAv’= bOne solution to' isv’=v0 =[-0.0461,-0.0187,0.1856,0.0461,0.0187,-0.1856]T
After step 12, step 13 is performed.
Step 13: finding new key point by tracing problemt j }、D’,{A j Updating is carried out;
first, each measurement is calculatedRelative velocity between a point and a boundaryv i }:v i
Figure DEST_PATH_IMAGE025
Then, calculateτ j =(D’–t j )÷(b i v i ) = (0.0314–t j )÷(1– v j ) | j=1, 2, …15
Then, the decision key point: to catch time τ'iMinimum value τ in the portion of greater than zero minCorresponding measurement point p'11Is a key point; after that, there are no conditions to change the key points:
then, all oft’ j The updating is as follows:
Figure DEST_PATH_IMAGE026
Dupdate to 0.0276;
updating leafA j The method is as follows:
Figure DEST_PATH_IMAGE027
and finishing the first optimization after the step 14 is finished, and performing the step 9.
And step 9: after the first optimization is completed according to the invention, the key point setl' } = {5,11}, step 10 is performed.
Step 10:
A’=[ A5 T, A11 T]T=
Figure DEST_PATH_IMAGE028
b=[1,1] T
after step 10, step 11 is performed.
Step 11:r A =rank(A’) =2,r Ab =rank([A’, b’])=2,r A =r Ab and a jump is made to step 12.
Step 12: linear equation of equationsAv’= bOne solution to' isv’=v0 =[-0.6035,-1.3086,-0.0783,0.6035,1.3086,-0.0783]T
After step 12, step 13 is performed.
Step 13: updating the last page by finding new key pointst j }、D’,{A j };
Firstly, calculating the normal linear velocity of the measuring pointv j
Figure DEST_PATH_IMAGE029
Then, calculateτ’ j =(D’–t’ j )÷(b’ i – v’ i )= (0.0276––t’ j )÷(1– v’ i ) | j=1, 2, …15
Then, the decision key point: to catch up timeτ i Minimum value in the part of greater than zeroτ minCorresponding measuring pointp 3 Is a key point;
finally, all thet’ j The updating is as follows:
Figure DEST_PATH_IMAGE030
Dupdate to 0.0271;
{A j the' update is:
Figure DEST_PATH_IMAGE031
and finishing one optimization after the step 14 is finished, and performing the step 9.
And step 9: after the third optimization is completed according to the invention, the key point setl' } = {5,11,3}, step 10 is performed.
Step 10:
A’=[ A5 T, A11 T,A3 T]T=
Figure DEST_PATH_IMAGE032
b=[1,1,1] T
after step 10, step 11 is performed.
Step 11:r A =rank(A) =3,r Ab =rank([A, b])=3,r A =r Ab and a jump is made to step 12.
Step 12: linear equation of equationsAv’= bThe solution of isv’=v0 =[-1.0968,-1.0439,-0.1698,1.0968,1.0439,0.1698]T
After step 12, step 13 is performed.
Step 13: finding new key point by tracing problemt j }、D’,{A j Updating is carried out;
firstly, calculating the normal linear velocity of the measuring pointv j
Figure DEST_PATH_IMAGE033
Then, calculateτ j =(D’–t j )÷(b i v i )= (0.0271–t j )÷(b i v i ) | j=1, 2, …15
Then, the decision key point: time of optional pursuitτ j Minimum value in the part of greater than zeroτ miCorresponding measuring pointp 6Is a key point;
finally, all thet’ j The updating is as follows:
Figure DEST_PATH_IMAGE034
D' update to 0.0248;
{A j the update is:
Figure DEST_PATH_IMAGE035
and finishing the third optimization after the step 14 is finished, and performing the step 9.
And step 9: after the third optimization is completed according to the invention, the key point set l' } = {5,11,3,6 }; step 10 is performed.
Step 10:
A’=[A5 T, A11 T, A3 T, A6 T]T
Figure DEST_PATH_IMAGE036
b’=[1,1,1,1] T
after step 10, step 11 is performed.
Step 11:r A =rank(A’) =3,r Ab =rank([A’, b’])=4,r A <r Ab jump to step 11.1.
Step 11.1: the key sequence number set {5,11,3,6} is obtained by removing the elements 5,11,3,6 in the key sequence number set in turnTol s According to l s Establishment of a reduction matrixA 3 And reducing the column vectorb 3
Remove 5 to get the reduced matrixA 3 And reducing the column vectorb 3 The following were used:
A3=[ A11 T, A3 T, A6 T]T
Figure DEST_PATH_IMAGE037
b3=[1,1,1] Tand (6) performing step 11.2;
step 11.2: solving linear equationsA3 v3=b3Solution of (2)v3=
Figure DEST_PATH_IMAGE038
Then calculateb5= A5 v3=-2.5174<1;
Removing 11 yields a reduced matrixA 3 And reducing the column vectorb 3 The following were used:
A3=[ A5 T, A3 T, A6 T]T=
Figure DEST_PATH_IMAGE039
b3=[1,1,1] Tand (6) performing step 11.2;
step 11.2: solving linear equationsA3 v3=b3Solution of (2)v 3 =
Figure DEST_PATH_IMAGE040
Then calculateb11= A11 v3=-6.2648<1;
Remove 3 to get the reduced matrixA 3 And reducing the column vectorb 3 The following were used:
A3=[ A5 T, A11 T, A6 T]T=
Figure DEST_PATH_IMAGE041
b3=[1,1,1] Tand (6) performing step 11.2;
step 11.2: solving linear equationsA3 v3=b3Solution of (2)v 3 =
Figure DEST_PATH_IMAGE042
Then calculateb11= A11 v3=-2.1085<1;
Remove 6 to get the reduced matrixA 3 And reducing the column vectorb 3 The following were used:
A3=[ A5 T, A11 T, A3 T]T=
Figure DEST_PATH_IMAGE043
b3=[1,1,1] Tand (6) performing step 11.2;
step 11.2: solving linear equationsA3 v3=b3Solution of (2)v 3 =
Figure DEST_PATH_IMAGE044
Then calculateb11= A11 v3=0.0470<1;
Step 11.3: satisfy the requirement ofb j | j=5,11,3,6<= b 3 The number of j is 4= s +1=3+1, jump to step 15.
Step 15: at this time, the effective size of the measured axis isD’=0.0248,D’=0.0248<t' =0.03, the measured axis meets the inclination requirement, and the measured axis is qualified.

Claims (5)

1. A rank analysis-based fast and steady simple gradient assessment method is characterized by comprising the following steps of:
the method comprises the steps of evaluating the inclination of an axis on the basis of the evaluation of a reference plane and the qualification;
step 1: firstly, measuring points of a measured axis are obtained and are used to form a measuring point set p’ j }; obtaining measuring points of a reference plane, and using the measuring points to form a reference measuring point set p i }; wherein:
i=1, 2, 3, …, Nithe serial numbers of the measuring points are shown,Nthe total number of measuring points as a benchmark;
p i ={x i , y i , z i is the measurement pointiThe reference plane is close to the XOY plane of the coordinate system;
j=1, 2, 3, …, Mithe serial numbers of the measuring points are shown,Mthe total number of the measured points of the measured axis;
p j ={x j , y j , z j is the fitted axis measurement pointjThe axis of the space rectangular coordinate is close to form a theoretical correct angle theta with the XOY plane of the coordinate system;
then, obtain the initial key sequence numberl 1Andl 2will bel 1Andl 2adding key serial number setl};
l 1Is composed ofp i Inz j Point of maximum valuep l1 The serial number of (a) is included,l 2is composed ofp i Inz i Point of minimum valuep l2 The serial number of (2);
then, the boundary position is setUAndB
U=z l1 z l1 is composed ofp l1 Z-coordinate value of (a);Uthe upper boundary position, which is the crossing point [0,U]and parallel to the XOY plane;
B=z l2 z l2 is composed ofp l2 Z-coordinate value of (a);Bthe lower boundary position, the lower boundary being the crossing point [0,B]and parallel to the XOY plane;
then, obtaining a boundary middle position aver; aver = (a =)U+B)/2;
Finally, according top i Establishing a characteristic line vector setA i }; wherein:
for allz i >Point of aver, whichA i =[-1, -y i , x i ]For allz i <Point of aver, whichA i =[1, y i , -x i ];A i Is a feature row vector, all feature row vectorsA i Is a set of characteristic line vectors A i };
After the step 1 is finished, performing a step 2;
step 2: according top i Establishing a reference state element setu i And i };
u i = U z i u i The distance from the reference measuring point to the upper boundary;
d i =z i - Bd i the distance from the reference measuring point to the lower boundary;
step 3 is carried out after step 2 is finished;
and step 3: according to the key sequence numberlEstablishment of an analysis matrixAAnd analyzing the column vectorsbWherein:
A=[…, A p T, …, A q T, …]Tis aeA matrix of rows and 4 columns,eis a critical sequence number setlThe number of the elements in the (C),p, qis a critical sequence number setlThe elements in (1);
b=[…, b p , …, b q , …]Tis aeA column vector of rows;
step 4 is carried out after step 3 is finished;
and 4, step 4: for analysis matrixAAnd an augmented analysis matrixA, b]Performing rank analysis;
computing an analysis matrixARank ofr A =rank(A) Extended analysis matrix [ alpha ], [ beta ] anA, b]Rank ofr Ab =rank([A, b]) And comparer A Andr Ab there are only two cases:
the first condition is as follows: if it is notr A =r Ab Then, the optimization should be continued, jumping to step 5;
case two: if it is notr A < r Ab Then, initializing the calculatorr=1, and step 4.1 is performed;
step 4.1: making key serial number collect lastlGet rid of the firstrAn elementl r Then obtain l s According to l s Establishment of a reduction matrixA s And reducing the column vectorb s Wherein:
iis 1;
A s =[…, A p T, …, A q T, …]Tis a matrix of S rows and 4 columns, and S is a l s The number of the elements in the (C),p, qis al s The elements in (1);
b=[…, b p , …, b q , …]Tis a column vector of S rows;
step 4.2: solving linear equationsA s v s = b s Solution of (2)v s =v s0 Then calculateb i =A s v s (ii) a If it is notb i >b s Then the matrix will be reducedA s And reducing the column vectorb s Respectively asAMatrix and analysis column vectorbAn element k i Movable key serial number setkAnd jumping to the step 5; if it is notb i <=b s Then step 4.3 is performed;
step 4.3: judgment ofiWhether the number is equal to S +1, ifiThe number is less thanS+1, jumping to step 4; if it is notiThe number is equal toS+1, should finish the optimization, jump to step 7;
and 5: motion vector of measuring point is solvedv 0I.e. linear equationsAv= bA solution ofv=v 0Wherein, in the step (A),v=[v 1, v 2, v 3]Tv 0=[v 0,1, v 0,2, v 0,3]T
step 6 is carried out after step 5 is finished;
step 6: finding new key point by tracing problemp j Anp i Updating is carried out;
first, each reference point and edge are calculatedRelative speed of boundv i }:v i = A i v 0
Then, the time of pursuit is calculatedτ i
τ i 1= u i / v i | i N=1, 2, …τ’ i Catch up points for upper boundariesp i The time of (d);
τ i 2= d i / v i | i N=1, 2, …τ’’ i catch up a point for the lower boundaryp i The time of (d);
τ i getτ i1τ i2The smaller of these;
then, the decision key point: to catch up timeτ i Minimum value in the part of greater than zeroτ minThe corresponding measuring points are key pointsp l3The serial number corresponding to the pointl 2Adding key serial number setl};
Then, according top i =τ min v 1p i +τ minv 2Updating reference measuring point setp i Therein of
Figure DEST_PATH_IMAGE001
v 2=[0, 0, v 0,1]T
Then, according top , j =τ min v 1 p , j +τ min v 2Updating measured axis point set p , j };
Finally, according toU= U-τ min ∙bUpdating upper boundary positionsU(ii) a According toB= B+τ min ∙bUpdating upper boundary positionsB
Finishing one-time optimization after the step 6 is finished, and performing the step 2;
and 7: the effective size of the reference plane isU-BIf, ifU-B<t1Then the reference plane meets the flatness requirement;
wherein, t1Is a flatness tolerance value;
step 7 is over, ifU-B<t1Then go to step 8;
and 8: first, the corresponding measured axis measuring point set is evaluated by the fitting standard p’ j }={x j , y j , z j Determining the position w and direction vector of the fitted straight lineL(ii) a Wherein:
then calculating the position coordinate w of the minimum circumscribed cylindrical axis; wherein:
w=[ x w , y w , 0]Twfitting the intersection point of the straight line and the XOY plane for the measured point set by a least square method;
the direction vector isL=[x L ,y L ,z L ]T, x L 、y L 、z L Satisfy the requirement of
Figure DEST_PATH_IMAGE002
;
Then, establishing a parameter describing the position of the minimum circumscribed cylinder axisa swj And direction parametera LWherein:
a wj =L Tp j -w),a L,=L T L
then according to p’ j Anda wj a Lestablishing a feature line vector setA j Great Chinese character and state element sett j }; wherein:
Figure DEST_PATH_IMAGE003
all state elementst j Is a set of state elements t’ j }; catching pocket for state elementt j Maximum value of }t jmax =D’,D' is the distance dimension from the minimum circumscribed cylinder boundary to the minimum circumscribed cylinder axis;
establishingA j A feature row vector, wherein
Figure DEST_PATH_IMAGE004
All feature row vectorsA j Set as characteristic line vector set A’ j };
Step 9 is performed after step 8 is completed;
and step 9: not performing step 14, taking a set of state elementst j Maximum value of }t jmax Corresponding measuring pointp j Is a key point, and adds the measuring point serial number j to a key point set l' in, a set of key points l’}={j};
If step 14 is performed, a keypoint is generatedp l2 Then, the key pointp l2 Will replace the measuring pointp j Number of its measuring pointl2Last page added to key serial number set l' } in;
after step 9, performing step 10;
step 10: root of herbaceous plantAccording to the key sequence number set l' } establishing analysis matrixA' sum analysis column vectorb', wherein:
A’=[…, A p T, …, A q T, …]Tis a matrix with f rows and 6 columns, and f is a key sequence number set lThe number of the elements in the' },p, qis a critical sequence number set l' } elements;
b’=[…, b p , …, b q , …]Tis a column vector of f rows;
after step 10, step 11 is performed;
step 11: for analysis matrixA' and extended analysis matrixA’, b’]Performing rank analysis;
computing an analysis matrixARank of `r A =rank(A ) Extended analysis matrix [ alpha ], [ beta ] anA’, b’]Rank ofr Ab =rank([A’,b’]) And comparer A Andr Ab there are only two cases:
the first condition is as follows: if it is notr A =r Ab Then, the optimization should be continued, jumping to step 12;
case two: if it is notr A < r Ab Then, initializing the calculatorr=1, perform step 11.1;
step 11.1: making key serial number collect last l' take turns to remove the elements in the key sequence number setl r Then obtain l s According tol s Establishment of a reduction matrixA s And reducing the column vectorb s Wherein:
jis 1;
A s =[…, A p T, …, A q T, …]Tis a matrix of S rows and 6 columns, and S is a l s The number of the elements in the (C),p, qis a l s The elements in (1);
b’=[…, b p , …, b q , …]Tif it is a column vector of S rows, go to step 11.2;
step 11.2: solving linear equationsA s v s =b s Solution of (2)v s = v s0 Then calculateb j = A s v s
If it is notb j > b s Then the matrix will be reducedA s And reducing the column vectorb s Respectively asA' matrix and analysis column vectorb', will elementl j Movable key serial number set l' }, and jump to step 11; if it is notb j <= b s Then step 11.3 is performed;
step 11.3: judgment ofjIs equal to S +1, ifjIs not equal toS+1, jumping to step 11; if it is notjIs equal toS+1, should finish the optimization, jump to step 15;
step 12: motion vector of measuring point and boundary is solvedv0I.e. linear equationsAv’= bA solution ofv’= v0Wherein, in the step (A),v’=[v1, v2, v3, v4, v5, v6]T v0=[ v0,1, v 0,2, v 0,3, v 0,4, v 0,5, v0,6]T
step 12, after the end, step 13 is performed;
step 13: finding new key point by tracing problemt j }、D’,{A j Updating is carried out;
first, calculating the relative speed between each measuring point and the boundaryv i }:v i = A’ j v 0
Then, the time of pursuit of each measurement point is calculatedτ j τ j =(D’–t j )÷(b i v’ i ) | i N=1, 2, …
Then, the decision key point: to catch up timeτ i Minimum value in the part of greater than zeroτ minCorresponding measuring pointp j Is a key point
Then, according top j = p’ j +τ’ min ∙v’ m Updating measuring point setp j }, wherein:
Figure DEST_PATH_IMAGE005
finally, according to w = w +τminv g Updating w, wherein:
Figure DEST_PATH_IMAGE006
at updated measuring point setp i Updating said leaf on the basis oft j }、D’,{A j };
Finishing one-time optimization after the step 14 is finished, and performing the step 9;
step 15: at this timeThe effective size of the measured axis isD', ifD’<t', the measured axis meets the requirement of gradient, and the measured axis is qualified; otherwise, the product is unqualified; wherein t' is a gradient tolerance value.
2. The rank analysis-based method for assessing the inclination of a single-datum-plane axial hole type part as claimed in claim 1, wherein the measurement data of a general segment to be measured is mapped p j Great moment through coordinate transformation to obtain a measuring point set with axis approaching the theoretical correct angle theta to the XOY plane of the coordinate system and the intersection point of the cylinder axis and the plane approaching the origin of the coordinate system p j }。
3. The method for evaluating the inclination of a single-datum-plane axial hole part according to claim 2, wherein the coordinate transformation is one, moving according to the average value of the coordinates, or two, moving according to the extreme value of the coordinates, or three, moving according to the root-mean-square minimum principle of the coordinates, or four, obtaining data after the first evaluation of the measured element as data obtained after pre-positioning.
4. The method for assessing the inclination of a single-datum-plane axial hole part based on rank analysis as claimed in claim 1, wherein in step 13, if yes, the stepτ min v i Single order value ofτ min v i Or accumulated value sigma of past iterationsτ min v i Greater than a given thresholdQThen, measuring point of the measured segmentp j Is updated top j +∑τ minv0| j N= 1, 2, …And re-rated from step 1.
5. The method for assessing the inclination of a single-datum-plane axial hole part based on rank analysis as claimed in claim 1,b=1 andb’=1。
CN202010630172.2A 2020-07-03 2020-07-03 Single-datum plane shaft hole part gradient evaluation method based on rank analysis Pending CN113884059A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010630172.2A CN113884059A (en) 2020-07-03 2020-07-03 Single-datum plane shaft hole part gradient evaluation method based on rank analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010630172.2A CN113884059A (en) 2020-07-03 2020-07-03 Single-datum plane shaft hole part gradient evaluation method based on rank analysis

Publications (1)

Publication Number Publication Date
CN113884059A true CN113884059A (en) 2022-01-04

Family

ID=79013064

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010630172.2A Pending CN113884059A (en) 2020-07-03 2020-07-03 Single-datum plane shaft hole part gradient evaluation method based on rank analysis

Country Status (1)

Country Link
CN (1) CN113884059A (en)

Similar Documents

Publication Publication Date Title
Li et al. Review of design optimization methods for turbomachinery aerodynamics
CN110285781A (en) A kind of plane parallelism rapid method for assessment relative to datum level
Cao et al. Querying similar process models based on the Hungarian algorithm
CN102693452A (en) Multiple-model soft-measuring method based on semi-supervised regression learning
CN112597610B (en) Optimization method, device and equipment for lightweight design of mechanical arm structure
Luo et al. A method for axis straightness error evaluation based on improved artificial bee colony algorithm
Sun et al. Toward axial accuracy prediction and optimization of metal tube bending forming: A novel GRU-integrated Pb-NSGA-III optimization framework
CN113053457B (en) Drug target prediction method based on multi-pass graph convolution neural network
CN113884059A (en) Single-datum plane shaft hole part gradient evaluation method based on rank analysis
CN108267106B (en) Quick, stable and simple cylindricity error evaluation method
Xin et al. A tool path optimization approach based on blend feature simplification for multi-cavity machining of complex parts
Wu et al. Surrogate-adjoint refine based global optimization method combining with multi-stage fuzzy clustering space reduction strategy for expensive problems
CN112212758A (en) Method for evaluating digitalized common reference radial total run-out error
CN113483660A (en) Method for evaluating radial circular run-out error of optical axis
CN113483721A (en) Method for rapidly evaluating straightness in any direction by applying maximum entity requirement
CN113239545A (en) Efficient method for multi-objective optimization design of parallel robot
CN113945130A (en) Method for evaluating radial circular run-out error of stepped shaft
Wang et al. Spline interpolation method based on arc length parameterization and its application in stress field interpolation for flexible plates
CN110619139A (en) Rapid position degree evaluation method based on single-datum hole shaft part
CN113932754A (en) Method for quickly evaluating verticality of error measurement workpiece based on single reference plane
CN110296677A (en) A kind of axis hole part verticality rapid method for assessment based on single datum plane
CN110595424A (en) Method for evaluating straightness in any direction based on digital gauge
WO2019209571A1 (en) Proactive data modeling
CN112613251B (en) Medium type step-by-step marking method
CN109034021A (en) A kind of recognition methods again for easily obscuring digital handwriting body

Legal Events

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

Application publication date: 20220104

WD01 Invention patent application deemed withdrawn after publication