CN106202709B - A kind of concentricity assessment method based on maximum solid state - Google Patents
A kind of concentricity assessment method based on maximum solid state Download PDFInfo
- Publication number
- CN106202709B CN106202709B CN201610535177.0A CN201610535177A CN106202709B CN 106202709 B CN106202709 B CN 106202709B CN 201610535177 A CN201610535177 A CN 201610535177A CN 106202709 B CN106202709 B CN 106202709B
- Authority
- CN
- China
- Prior art keywords
- pso
- measure
- cylindrical body
- under
- value
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/17—Mechanical parametric or variational design
Abstract
The present invention relates to a kind of concentricity assessment methods based on maximum solid state, this method obtains the geometry design parameter of tested part first and judges whether its concentricity tolerance can be evaluated with this method, then the qualification of the measurement data of practical tested part and preliminary assessment tested cylindrical body and reference cylinder is obtained, then the measurement data of reference cylindrical body is fitted and coordinate conversion is carried out to the measurement data for calculating reference cylindrical body and practical tested cylindrical body, then practical tested cylindrical body is calculated for the limit equivalent diameter of reference cylinder the maximum material boundary, it is last to judge whether practical tested part is qualified according to the tolerance for being tested cylindrical body.
Description
Technical field
The invention belongs to delicate meterings and computer application field, a kind of based on the coaxial of maximum solid state with being related to
Rapid method for assessment is spent, can be used for being tested cylindrical body has the concentricity tolerance of size requirement, its axis to have maximum material requirement simultaneously
And its reference element have size require and maximum material requirement cylindrical geometric product coaxiality error qualification detection and
Evaluation, and guidance is provided for the improvement of processing technology.
Background technique
Scale error, Form and position error (abbreviation of form error and location error) directly affect product quality, assembly and its
Service life quickly and accurately calculates part error, has great importance.Dimensional tolerance (tolerance, that is, error permission model
Enclose) and geometric tolerance between relationship be known as Tolerance Principle, wherein maximum material requirement be embody part assembling capacity one kind
Tolerance Principle.
Standard GB/T/T16671-2009, which defines tested cylindrical body, has the concentricity tolerance of size requirement, its axis to have
Maximum material requirement and its reference element have the case where size requirement and maximum material requirement, which defines: 1, being tested
The maximum solid state of cylindrical body;2, it is tested the range of the local size of cylindrical body;3, it is tested the maximum solid state of cylindrical body
Position relation between the maximum solid state of reference cylinder;4, the maximum solid state of reference cylinder and its local ruler
Very little range, the axis and benchmark cylinder under least material condition of the tested cylindrical body under additional explanation least material condition
Possible coaxiality error between the axis of body, but do not provide specific calculation formula.
Therefore, in order to judge that between maximum material size and least material size, (qualification of scale error detects
Method has regulation in standard GB/T/T3177, GB/T1958, GB/T18779.1, GB/T18779.2, is not belonging to the present invention
Scope) part above-mentioned concentricity qualification, standard GB/T/T1958-2004 gives using high-precision, ruler
Very little constant drift, no-go gage come detection cylinder body above-mentioned concentricity whether He Ge method.However, it is high-precision, size is permanent
The manufacturing cost of fixed drift, no-go gage is higher, and measures various sizes of cylindrical part and need using different drifts, only
Rule, further increase measurement cost.
Tested cylindrical body has size to require, the concentricity of its axis has maximum material requirement and its reference element is without most
In the case where big entity inquiry, cylinder can be tested by three coordinate measuring engine measurement in delicate metering and computer application field
Measuring point on body and reference cylinder calculates tested concentricity of the cylindrical body relative to reference cylinder, and judges tested cylinder
Whether the concentricity of body is qualified.But there are no mathematical method come come evaluate tested cylindrical body have size require, its axis it is same
Axis degree tolerance has maximum material requirement and its reference element has size to require the qualification with the part of maximum material requirement.
Summary of the invention
Technical problem to be solved by the invention is to provide a kind of concentricity rapid evaluation sides based on maximum solid state
Method, not only realizing tested cylindrical body has the concentricity tolerance of size requirement, its axis to have maximum material requirement and its base
Standard will be known as size and require to detect and evaluate with the qualification of the part of maximum material requirement, and algorithm stability is good, calculates
It is high-efficient, can be applied to other element to be measured have size require, its direction and location tolerance have maximum material requirement and
Its reference element has in the qualification detection and evaluation of the part of size requirement and maximum material requirement.
To solve the above problems, the present invention is achieved by the following scheme:
Step 1: obtaining tested cylindrical bodyCb, reference cylinderCAGeometry design parameter;If tested cylindrical bodyCb's
Concentricity tolerance and reference cylinderCAThere are maximum material requirement, and reference cylinderCAOnly dimensional tolerance --- it can be with
Using envelope principle, then jumping to step 2, otherwise terminate this rapid method for assessment, and provides conclusion and " be tested the same of cylindrical body
Axis degree tolerance cannot be evaluated with this method ".
The tested cylindrical bodyCbGeometry design parameter include: hole element or axial element, nominal diameterD b , name
Adopted lengthL b , axis the upper deviationes b Or the upper deviation in holeES b , axis lower deviationei b Or the lower deviation in holeEI b , concentricity toleranceT b, AM, coa , concentricity tolerance whether mark the reference cylinder of maximum material requirement, concentricity toleranceCAWhether maximum is marked
Entity state.
The reference cylinderCAGeometry design parameter include: hole element or axial element, nominal diameterD A , name
Adopted lengthL A , axis the upper deviationes A Or the upper deviation in holeES A , axis lower deviationei A Or the lower deviation in holeEI A , dimensional tolerance whether
Using envelope principle, other geometric tolerances.
Step 2: obtaining practical tested cylindrical bodyC b , reference cylindrical bodyC A Measurement data;Evaluate reference cylinder
BodyC A Scale error and practical tested cylindrical bodyC b Scale error jump to step 3, otherwise if above-mentioned error is all qualified
Terminate this rapid method for assessment, and provides conclusion " reference cylindrical bodyC A And/or practical tested cylindrical bodyC b Other errors
It is unqualified ".
Step 3: by reference cylindrical bodyC A Measure data fitting be cylindrical bodyCC A , in the fitting circle of tested cylindrical body
Local coordinate system is established on cylinder, and calculates practical tested cylindrical bodyC b , reference cylindrical bodyC A Measurement data in the part
Coordinate in coordinate system.
Step 4: with reference cylindrical bodyC A Relative to cylindrical bodyCC AM Three-dimensional attitudev A For variable, with reality
Tested cylindrical bodyC b Relative to cylindrical bodyCC AM Equivalent diameterd b, AM, coa =f(v A ) it is objective function, objective optimization is carried out, is obtained
To practical tested cylindrical bodyC b Relative to cylindrical bodyCC AM Limit equivalent diameterd b, AM, coa, mM 。
Wherein,v A It is constrained as follows: for arbitrarily without departing from reference cylinderCAThe maximum material boundary cylindrical bodyCC AM 's
Cylindrical bodyCC A , relative to cylindrical bodyCC AM Three-dimensional attitude can be expressed asv A ;For anyv A , cylindrical bodyCC A Do not surpass
Reference cylinder outCAThe maximum material boundary cylindrical bodyCC A 。
Step 5: according to tested cylindrical bodyCbMaximum solid virtual sizeD bMV And cylindrical bodyCC b Diameterd b , most equivalent
Diameterd b, AM, min , judge practical tested cylindrical bodyC b Coaxiality error it is whether qualified.
For the ease of actual parts are mapped with design configuration, following steps can be embodied as by the present invention:
Cylindrical body is actually tested described in step 2b, reference cylindrical bodyAMeasurement data be measurement space right-angle
It is measured in coordinate system, and including following four measuring point data collection:
Reference cylindrical bodyABottom surface on measuring pointP measure, A, under, i Measuring point datap measure, A, under, i
(x measure, A, under, i , y measure, A, under, i , z measure, A, under, i ),i=1, 2 … I,IFor measure-point amount and it is
Positive integer, all measuring point datasp measure, A, under, i (x measure, A, under, under, i , y measure, A, under, i ,z measure, A, under, i ) formation measuring point data collectionp measure, A, under, i }。
Reference cylindrical bodyASide on measuring pointP measure, A, n Measuring point datap measure, A, n
(x measure, A, n , y measure, A, n , z measure, A, n ),n=1, 2 … N,NIt for measure-point amount and is positive integer, it is all
Measuring point datap measure, A, n (x measure, A, n , y measure, A, n , z measure, A, n ) form measuring point data collection
{p measure, A, n }。
Practical tested cylindrical bodybBottom surface on measuring pointP measure, b, under, j Measuring point datap measure, b, under, j
(x measure, b, under, j , y measure, b, under, j , z measure, b, under, j ),j=1, 2 … J,JFor measure-point amount and it is
Positive integer, all measuring point datasp measure, b, under, j (x measure, b, under, under, j , y measure, b, under, j ,z measure, b, under, j ) formation measuring point data collectionp measure, b, under, j }。
Practical tested cylindrical bodybSide on measuring pointP measure, b, m Measuring point datap measure, b, m
(x measure, b, m , y measure, b, m , z measure, b, m ),m=1, 2 … M,MIt for measure-point amount and is positive integer, it is all
Measuring point datap measure, b, m (x measure, b, m , y measure, b, m , z measure, b, m ) form measuring point data collection
{p measure, b, m }。
In order to simplify the corresponding process of actual parts and design configuration, practical tested cylindrical body and reality can be reduced to the greatest extent
The bottom surface measuring point of reference cylinder, at this point, following steps of the invention can be embodied as:
In step 2, reference cylindrical bodyABottom surface on measuring point numberI=2, and two measuring pointsP measure, A, under, 1、P measure,A,under,2Respectively in reference cylindrical bodyATwo bottom surfaces on.
Practical tested cylindrical bodybBottom surface on measuring point numberJ=2, and two measuring pointsP measure, b, under, 1、P measure,b,under,2Respectively in actually tested cylindrical bodybTwo bottom surfaces on.
In step 3, by reference cylindrical bodyC A Measuring point data collectionp measure, A, n It is fitted to cylindrical bodyCC A Side
Face,P measure, A, under, 1、P measure,A,under,2The midpoint of lineP measure, A, under, 1/2In cylindrical bodyCC A Two bottom surfaces
Symmetrical planePL A, 1/2On, cylindrical bodyCC A Length be equal to reference cylinderCANominal lengthL A 。
In cylindrical bodyCC A On establish local rectangular coordinate systemO xyz, A , coordinate systemO xyz, A Origin and cylindrical bodyCC A It is several
What centerO A It is overlapped, coordinate systemO xyz, A A reference axis and cylindrical bodyCC A Axis be overlapped, the positive direction vector of the reference axis
With vectorO A P measure, b, under, 1/2Dot product be not less than zero, whereinP measure, b, under, 1/2It isP measure, b, under, 1、P measure,b,under,2The midpoint of line;Define cylindrical bodyCC A Unit direction vectorn CCA Length be 1, positive direction and the coordinate
The positive direction vector of axis is identical.
By reference cylindrical bodyC A Measuring point data collectionp measure, A, n And practical tested cylindrical bodyC b Measuring point data
Collectionp measure, b, m Coordinate conversion is carried out, obtain reference cylindrical bodyC A With practical tested cylindrical bodyC b Measuring point in coordinate
SystemO xyz, A In coordinate setp A, n Andp b, m }。
In order to reduce use difficulty of the invention, and consider contribution of the form error in overall error, the present invention can be with
It is embodied as:
Step 1: obtaining tested cylindrical bodyCb, reference cylinderCAGeometry design parameter;If tested cylindrical bodyCb's
Concentricity tolerance and reference cylinderCAThere are maximum material requirement, and reference cylinderCAOnly dimensional tolerance --- it can be with
Using envelope principle, then jumping to step 2, otherwise terminate this rapid method for assessment, and provides conclusion and " be tested the same of cylindrical body
Axis degree tolerance cannot be evaluated with this method ".
The tested cylindrical bodyCbGeometry design parameter include be hole element or axial element, nominal diameterD b , name
Adopted lengthL b , axis the upper deviationes b Or the upper deviation in holeES b , axis lower deviationei b Or the lower deviation in holeEI b , concentricity toleranceT b, AM, coa , concentricity tolerance whether mark the reference cylinder of maximum material requirement, concentricity toleranceCAWhether maximum is marked
Entity state.
The reference cylinderCAGeometry design parameter include: hole element or axial element, nominal diameterD A , name
Adopted lengthL A , axis the upper deviationes A Or the upper deviation in holeES A , axis lower deviationei A Or the lower deviation in holeEI A , dimensional tolerance whether
Using envelope principle, other geometric tolerances.
Step 2: obtaining practical tested cylindrical bodyC b , reference cylindrical bodyC A Measurement data, including following four measuring point
Data set:
Reference cylindrical bodyC A Two measuring pointsP measure, A, under, 1、P measure,A,under,2Respectively in reference circle
CylinderC A Two bottom surfaces on, the measuring point data of two measuring pointsp measure, A, under, 1 (x measure, A, under, 1,y measure, A, under, 1, z measure, A, under, 1)、p measure, A, under, 2 (x measure, A, under, 2,y measure, A, under, 2, z measure, A, under, 2) formation measuring point data collectionp measure, A, under, i ,i=1, 2;Practical base
Director circle cylinderC A Side on measuring pointP measure, A, n Measuring point datap measure, A, n (x measure, A, n , y measure, A, n ,z measure, A, n ),n=1, 2 … N,NIt for measure-point amount and is positive integer, all measuring point datasp measure, A, n
(x measure, A, n , y measure, A, n , z measure, A, n ) formation measuring point data collectionp measure, A, n };Practical tested cylindrical bodyC b
Two measuring pointsP measure, b, under, 1、P measure,b,under,2Respectively in actually tested cylindrical bodyC b Two bottom surfaces on, two
The measuring point data of measuring pointp measure, b, under, 1 (x measure, b, under, 1, y measure, b, under, 1,z measure, b, under, 1)、p measure, b, under, 2 (x measure, b, under, 2, y measure, b, under, 2,z measure, b, under, 2) formation measuring point data collectionp measure, b, under, j ,j=1, 2;Practical tested cylindrical bodyC b Side on
Measuring pointP measure, b, m Measuring point datap measure, b, m (x measure, b, m , y measure, b, m , z measure, b, m ),m=1, 2
… M,MIt for measure-point amount and is positive integer, all measuring point datasp measure, b, m (x measure, b, m , y measure, b, m ,z measure, b, m ) formation measuring point data collectionp measure, b, m }。
Evaluate reference cylindrical bodyC A With practical tested cylindrical bodyC b Scale error it is whether qualified, if above-mentioned error
It is all qualified, step 3 is jumped to, this rapid method for assessment is otherwise terminated, and provides conclusion " reference cylindrical bodyC A And/or it is real
Border is tested cylindrical bodyC b Other errors it is unqualified ".
Step 3: calculatingp measure, A, under, 1/2=( p measure, A, under, 1+ p measure, A, under, 2)/2。
Obtain in step 2 four measuring point data collection are coordinately transformed, four rough translation data sets are obtained
{p 0, A, under, i (x 0, A, under, i , y 0, A, under, i , z 0, A, under, i )| p 0, A, under, i =p measure, A, under, i -p measure, A, under, 1/2,i=1, 2}、{p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n )|p 0, A, n = p measure, A, n -p measure, A, under, 1/2,n=1, 2 … N }、{ p 0, b, under, j (x 0, b, under, j ,y 0, b, under, j , z 0, b, under, j )| p 0, b, under, j = p measure, b, under, j -p measure, A, under, 1/2,j=1,
2}、{ p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m )| p 0, b, m = p measure, b, m -p measure, A, under, 1/2,m=1,
2 … M }。
It calculatesp 0, b, under, 1/2(x 0, b, under, 1/2, y 0, b, under, 1/2, z 0, b, under, 1/2)=(p 0, b, under, 1+ p 0, b, under, 2)/2。
Solve objective optimisation problems 1:
s.t.
Solve optimal solution (x 0,min, y 0,min, α 0,min, β 0,min), i.e. reference cylindrical bodyC A Fitting cylindrical bodyCC A
Corresponding (x 0, y 0, α 0, β 0) value.
To translate roughly data set p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n ) following coordinate transform is carried out,n=1,
2 … N:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p A, n ( A, n , y A, n ,z A, n )}。
To translate roughly data set p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m ) following coordinate transform is carried out,m=1,
2 … M:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p b, m ( b, m , y b, m ,z b, m )}。
Step 4: calculating benchmark cylindrical bodyCAThe maximum material boundary cylindrical bodyCC AM DiameterD AM , work as reference cylinderCAIt is
When axis,D AM = D A + es A ;Work as reference cylinderCAWhen being hole,D AM = D A + EI A ;
Solve objective optimisation problems 2:
s.t.
Solve cylindrical bodyCC b Relative to cylindrical bodyCC AM Limit equivalent diameterd b, AM, coa, mM =|min d b, AM, coa |。
Step 5: calculating tested cylindrical bodyCbMaximum solid virtual size: when tested cylindrical bodyCbWhen being axis,D bMV =D b + es b +T b, AM, coa ;When tested cylindrical bodyCbWhen being hole,D bMV = D b + EI b -T b, AM, coa 。
When tested cylindrical bodyCbWhen being axis, if limit equivalent diameterd b, AM, coa, mM ≤ D bMV , then providing conclusion
" practical tested cylindrical bodyC b Coaxiality error it is qualified ", otherwise provide conclusion " practical tested cylindrical bodyC b Coaxiality error not
It is qualified ".
When tested cylindrical bodyCbWhen being hole, ifD bMV ≤d b, AM, coa, mM , then providing conclusion " practical tested cylindrical bodyC b Coaxiality error it is qualified ", otherwise provide conclusion " practical tested cylindrical bodyC b Coaxiality error it is unqualified ".
In part error problem analysis, need to solve some objective optimisation problems, feature includes: to need while considering
Error amount and nominal parameter, and the several orders of magnitude of the usual difference of size of these two types of numerical value;Functional value near optimal solution becomes
Change and relatively mitigates;Equality constraint usually has determining solution;At least one feasible solution can usually be provided.For these features, this hair
It is bright to provide a kind of multilayered particles group algorithm to solve both of the aforesaid objective optimisation problems, it is characterized in that steps are as follows:
Step 01: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P
(N P >=2), internal layer maximum number of iterationsN i,rd (N i,rd >=1), outer layer maximum number of iterationsN o,rd , outer layer minimum iteration time
Numbern o,rd , quality weight factorW, local weight factorC 1, global weight factorC 2。
Step 02: definitionN P A particlep PSO,k (p PSO, k,1, p PSO, k,2, …, p PSO, k,Q ), it is excellent that value corresponds to target
In change problem independent variable (x 1, x 2, …, x Q ),p PSO, k, q Value interval respectively withx q Value interval it is identical;k=1,
2 … N P ;q=1, 2 … Q;All particle constituent particle collectionp PSO,k };One particle is setp PSO,1Initial value or use its
Default value.
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 03: existing respectivelyp PSO, k, q Value interval taken at random by being evenly distributed (N P - 1) a value, building (N P -1)
A particlep PSO,k ;k=2, 3 … N P ;q=1, 2 … Q。
Exist respectivelyp PSO, k, q Value interval taken at random by being evenly distributedN P A value, buildingN P A particlep PSO,k It is initial
Speedv PSO, k (v PSO, k,1, v PSO, k,2, …, v PSO, k,q );All particles speed composition speed collectionv PSO,k };k=1,
2 … N P ;q=1, 2 … Q。
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … N P 。
It willp PSO, k, q Value substitute into the variable in objective optimisation problems respectivelyx q And its equality constraint, and calculate corresponding
Objective optimization functional valuef k =f(x 1, x 2, …, x Q );k=1, 2 … N P ;q=1, 2 … Q。
Record particlep PSO,k Corresponding local optimumf k,min =f k ,k=1, 2 … N P 。
Record global optimumf min =min f k,min , and record and minf k,min The value of corresponding particle is global optimum
Solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 04: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … N P 。
Enable (x 1, x 2, …, x Q )=p PSO,k , and substitute into the inequality constraints of objective optimisation problems;If inequality constraints
It sets up, then will (x 1, x 2, …, x Q ) equality constraint in objective optimisation problems is substituted into, and calculate and update corresponding target
Majorized function valuef k ;Iff k ≤ f k,min , then more new particlep PSO,k Local optimumf k,min =f k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Iff k ≤ f min , then updating global optimumf min =f k , and update
Globally optimal solution isp PSO,min=p PSO,k ;k=1, 2 … N P ;q=1, 2 … Q。
If the local optimum and locally optimal solution of each particle are very close, that is, (| maxf k,min – min f k,min |
≤ T POS ) and (|p PSO,k,min, mean – p PSO,k,min| ≤ T POS ), whereinp PSO,k,min, meanForp PSO,k,minArithmetic average
Value,k=1, 2 … N P ;So, step 07 is gone to, step 05 is otherwise gone to.
Step 05: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min -p PSO,k ) + C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is in section [0,1] independently of each other by flat
It is distributed two values randomly selected; k=1, 2 … N P 。
Step 06: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
It is greater thanN i,rd , then jumping to step 07, otherwise jump to step 04.
Step 07: recording the global optimum for the internal layer particle swarm algorithm that each iteration obtainsf min,s = f min , whereinsIt is
The number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge multilayered particles group's algorithm
Convergence;If |f min,s – min f min, g | ≤ T POS , then, terminate multilayered particles group algorithm and export objective optimization to ask
The optimal solution of topicp PSO,minAnd optimal valuef min , otherwise, accumulate the number of iterations of an outer layer particle swarm algorithm.
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting target
Optimization problem optimal solution (x 1, x 2, …, x Q )=p PSO,minWith optimal value minf=f min , otherwise, more new particlep PSO,1Just
Initial value isp PSO,minJump to step 03.
For the ease of the use of this method, the default parameters of aforenoted multi-layer particle swarm algorithm can be set as follows:
Resolution ratioT POS Default value is 0.00005, populationN P Default value is 20, internal layer maximum number of iterationsN i,rd Default value
It is 100, outer layer maximum number of iterationsN o,rd Default value is 100, outer layer minimum the number of iterationsn o,rd Default value be 50, quality power because
SonWDefault value is 0.5, local weight factorC 1Default value is 2, global weight factorC 2Default value is 2;p PSO,1Initial value be defaulted as
Null vector.
In order to improve computational efficiency of the invention, the objective optimisation problems 1 in the present invention can be solved with following methods:
The multilayered particles group's algorithm for solving objective optimisation problems 1 is as follows:
Step 11: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P
(N P >=2), internal layer maximum number of iterationsN i,rd (N i,rd >=1), outer layer maximum number of iterationsN o,rd , outer layer minimum iteration time
Numbern o,rd , quality weight factorW, local weight factorC 1, global weight factorC 2。
Step 12: definitionN P A particlep PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4), value corresponds to mesh
Mark optimization problem 1 in variable (x 0, y 0, α 0, β 0),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval point
Not withx 0、y 0、α 0、β 0Value interval it is identical, it may be assumed thatp PSO, k,1、p PSO, k,2∈[-D A , D A ],p PSO, k,3、p PSO, k,4∈[-π,π];k=1, 2 … N P ;All particle constituent particle collectionp PSO,k };One particle is setp PSO,1(p PSO,1,1, p PSO,1,2,p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0).
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 13: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval taken at random by being evenly distributed
(N P - 1) a value, building (N P - 1) a particlep PSO,k ;k=2, 3 … N P 。
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval taken at random by being evenly distributedN P A value,
BuildingN P A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);All particles
Speed composition speed collectionv PSO,k };k=1, 2 … N P 。
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … N P 。
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into the variable in objective optimisation problems 1 respectivelyx 0、y 0、α 0、β 0And its equality constraint, and calculate corresponding objective optimization functional valued 1,A,k ,k=1, 2 … N P ;That is,
where
Record particlep PSO,k Corresponding local optimumd 1,A,k,min =d 1,A,k ,k=1, 2 … N P 。
Record global optimumd 1,A,min =min d 1,A,k,min , and record and mind 1,A,k,min The value of corresponding particle is
Globally optimal solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 14: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … N P 。
Enable (x 0, y 0, α 0, β 0)=p PSO,k , and substitute into the inequality constraints of objective optimisation problems 1, i.e., 0≤-x 0,b,under,1/2 cosα 0sinβ 0+ y 0,b,under,1/2 sinα 0+ z 0,b,under,1/2 cosα 0cosβ 0,x 0、y 0∈[-D A , D A ],α 0、β 0
∈[-π, π];If inequality constraints is set up, will (x 0, y 0, α 0, β 0) substitute into objective optimisation problems 1 in equation about
Beam calculates and updates corresponding objective optimization functional valued 1,A,k ;Ifd 1,A,k ≤ d 1,A,k,min , then more new particlep PSO,k 's
Local optimumd 1,A,k,min =d 1,A,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd 1,A,k ≤d 1,A,min , then updating global optimumd 1,A,min =d 1,A,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 …N P 。
If the local optimum and locally optimal solution of each particle are very close, that is, (| maxd 1,A,k,min – mind 1,A,k,min | ≤ T POS ) and (|p PSO,k,min, mean – p PSO,k,min| ≤ T POS ), whereinp PSO,k,min, meanForp PSO,k,min
Arithmetic mean of instantaneous value,k=1, 2 … N P ;So, step 17 is gone to, step 15 is otherwise gone to.
Step 15: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min -p PSO,k ) + C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is in section [0,1] independently of each other by flat
It is distributed two values randomly selected; k=1, 2 … N P ;
Step 16: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
It is greater thanN i,rd , then jumping to step 17, otherwise jump to step 14.
Step 17: recording the global optimum for the internal layer particle swarm algorithm that each iteration obtainsd 1,A,min,s = d 1,A,min ,
In,sIt is the number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge multilayered particles group's algorithm
Convergence;If |d 1,A,min,s – min d 1,A,min, g | ≤ T POS , then, terminate multilayered particles group algorithm and exports target
The optimal solution of optimization problem 1p PSO,minAnd optimal valued 1,A,min , otherwise, accumulate the number of iterations of an outer layer particle swarm algorithm.
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting target
Optimization problem 1 optimal solution (x 0, y 0, α 0, β 0)=p PSO,minWith optimal value mind 1, A =d 1,A,min , otherwise, more new particlep PSO,1Initial value bep PSO,minJump to step 13.
In order to improve computational efficiency of the invention, the objective optimisation problems 2 in the present invention can be solved with following methods:
The multilayered particles group's algorithm for solving objective optimisation problems 2 is as follows:
Step 21: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P
(N P >=2), internal layer maximum number of iterationsN i,rd (N i,rd >=1), outer layer maximum number of iterationsN o,rd , outer layer minimum iteration time
Numbern o,rd , quality weight factorW, local weight factorC 1, global weight factorC 2。
Step 22: defining particlep PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4) value correspond to objective optimization
In problem 2 variable (dx A , dy A , drx A , dry A ),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval point
Not withdx A 、dy A 、drx A 、dry A Value interval it is identical,k=1, 2 … N P ;All particle constituent particle collectionp PSO,k };Setting
One particlep PSO,1(p PSO,1,1, p PSO,1,2, p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0).
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 23: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in it is random by being evenly distributed
Take (N P - 1) a value, building (N P - 1) a particlep PSO,k ;k=2, 3 … N P 。
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in taken at random by being evenly distributedN P It is a
Value, buildingN P A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);All grains
Son speed composition speed collectionv PSO,k };k=1, 2 … N P 。
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … N P 。
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into objective optimisation problems 2 in variabledx A 、dy A 、drx A 、dry A And its equality constraint, and calculate corresponding objective optimization functional valued b,AM,coa,k ,k=1, 2 … N P 。
Record particlep PSO,k Local optimumd b,AM,coa,k,min =d b,AM,coa,k ,k=1, 2 … N P 。
Record global optimumd b,AM,coa,min =min d b,AM,coa,k,min , and record and mind b,AM,coa,k,min It is corresponding
The value of particle is globally optimal solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 24: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … N P 。
Enable (dx A , dy A , drx A , dry A )=p PSO,k , and the inequality constraints of objective optimisation problems 2 is substituted into, if differed
Formula constraint is set up, then will (dx A , dy A , drx A , dry A ) substitute into objective optimisation problems 2 equality constraint, calculate and update
Corresponding objective optimization functional valued b,AM,coa,k ;Ifd b,AM,coa,k ≤ d b,AM,coa,k,min , then more new particlep PSO,k Office
Portion's optimal valued b,AM,coa,k,min =d b,AM,coa,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd b,AM,coa,k ≤ d b,AM,coa,min , then updating global optimumd b,AM,coa,min =d b,AM,coa,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 … N P 。
If the local optimum and locally optimal solution of each particle are very close, that is, (| maxd b,AM,coa,k,min – mind b,AM,coa,k,min | ≤ T POS ) and (|p PSO,k,min, mean – p PSO,k,min| ≤ T POS ), whereinp PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=1, 2 … N P ;So, step 27 is gone to, step 25 is otherwise gone to.
Step 25: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min -p PSO,k ) + C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is in section [0,1] independently of each other by flat
It is distributed two values randomly selected; k=1, 2 … N P 。
Step 26: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
It is greater thanN i,rd , then stopping internal layer particle swarm algorithm and jumping to step 27, otherwise jump to step 24.
Step 27: recording the global optimum for the outer layer particle swarm algorithm that each iteration obtainsd b,AM,coa,min,s =d b,AM,coa,min , whereinsIt is the number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge multilayered particles group's algorithm
Convergence;If |d b,AM,coa,min,s – min d b,AM,coa,min, g | ≤ T POS , then, end multilayered particles group algorithm is simultaneously defeated
The optimal solution of objective optimisation problems 2 outp PSO,minAnd optimal valued b,AM,coa,min , otherwise, accumulate an outer layer particle swarm algorithm
The number of iterations.
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting target
Optimization problem 2 optimal solution (dx A , dy A , drx A , dry A ) =p PSO,minWith optimal value mind b,AM,coa =d b,AM,coa,min , no
Then, more new particlep PSO,1Initial value bep PSO,minAnd jump to step 23.
Detailed description of the invention
Fig. 1, the flow chart of basic skills of the invention.
Fig. 2, the present invention in solve objective optimisation problems multilayered particles group's algorithm basic skills flow chart.
Fig. 3, movement of the axial workpiece relative to the maximum material boundary in step 4.
Fig. 4, the geometry designs figure of experimental subjects.
Specific embodiment
EXPERIMENTAL EXAMPLE:
Step 1: obtaining tested cylindrical bodyb, reference cylinderAGeometry design parameter;Judge tested cylindrical bodybIt is coaxial
Whether degree tolerance can be evaluated with this method, if tested cylindrical bodybConcentricity tolerance and reference cylinderAThere is maximum solid
It is required that and reference cylinderAOnly size tolerance requirements --- the size tolerance requirements can apply envelope principle, then jumping
Step 2 is gone to, this rapid method for assessment is otherwise terminated, and provides conclusion " concentricity tolerance of tested cylindrical body cannot use we
Method evaluation ".
The tested cylindrical bodybGeometry design parameter include: hole element or axial element, nominal diameterD b , name
Adopted lengthL b , axis the upper deviationes b Or the upper deviation in holeES b , axis lower deviationei b Or the lower deviation in holeEI b , concentricity toleranceT b, AM, coa , concentricity tolerance whether mark the reference cylinder of maximum material requirement, concentricity toleranceAWhether mark maximum real
Body state.
The reference cylinderAGeometry design parameter include: hole element or axial element, nominal diameterD A , name
Adopted lengthL A , axis the upper deviationes A Or the upper deviation in holeES A , axis lower deviationei A Or the lower deviation in holeEI A , dimensional tolerance whether
Using envelope principle, other geometric tolerances.
Step 2: obtaining practical tested cylindrical bodyb, reference cylindrical bodyAMeasurement data, including following four measuring point
Data set:
Reference cylindrical bodyATwo measuring pointsP measure, A, under, 1、P measure,A,under,2Respectively in reference circle
CylinderATwo bottom surfaces on, the measuring point data of two measuring pointsp measure, A, under, 1 (x measure, A, under, 1,y measure, A, under, 1, z measure, A, under, 1)、p measure, A, under, 2 (x measure, A, under, 2,y measure, A, under, 2, z measure, A, under, 2) formation measuring point data collectionp measure, A, under, i ,i=1, 2;Practical base
Director circle cylinderASide on measuring pointP measure, A, n Measuring point datap measure, A, n (x measure, A, n , y measure, A, n ,z measure, A, n ),n=1, 2 … N,NIt for measure-point amount and is positive integer, all measuring point datasp measure, A, n
(x measure, A, n , y measure, A, n , z measure, A, n ) formation measuring point data collectionp measure, A, n };Practical tested cylindrical bodyb
Two measuring pointsP measure, b, under, 1、P measure,b,under,2Respectively in actually tested cylindrical bodybTwo bottom surfaces on, two
The measuring point data of measuring pointp measure, b, under, 1 (x measure, b, under, 1, y measure, b, under, 1,z measure, b, under, 1)、p measure, b, under, 2 (x measure, b, under, 2, y measure, b, under, 2,z measure, b, under, 2) formation measuring point data collectionp measure, b, under, j ,j=1, 2;Practical tested cylindrical bodybSide on
Measuring pointP measure, b, m Measuring point datap measure, b, m (x measure, b, m , y measure, b, m , z measure, b, m ),m=1, 2
… M,MIt for measure-point amount and is positive integer, all measuring point datasp measure, b, m (x measure, b, m , y measure, b, m ,z measure, b, m ) formation measuring point data collectionp measure, b, m }。
Evaluate reference cylindrical bodyAWith practical tested cylindrical bodybScale error it is whether qualified, if above-mentioned error is all
Qualification jumps to step 3, otherwise terminates this rapid method for assessment, and provides conclusion " reference cylindrical bodyAAnd/or practical quilt
Survey cylindrical bodybOther errors it is unqualified ".
Step 3: calculatingp measure, A, under, 1/2=( p measure, A, under, 1+ p measure, A, under, 2)/2。
Obtain in step 2 four measuring point data collection are coordinately transformed, four rough translation data sets are obtained
{p 0, A, under, i (x 0, A, under, i , y 0, A, under, i , z 0, A, under, i )| p 0, A, under, i =p measure, A, under, i -p measure, A, under, 1/2,i=1, 2}、{p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n )|p 0, A, n = p measure, A, n -p measure, A, under, 1/2,n=1, 2 … N }、{ p 0, b, under, j (x 0, b, under, j ,y 0, b, under, j , z 0, b, under, j )| p 0, b, under, j = p measure, b, under, j -p measure, A, under, 1/2,j=1,
2}、{ p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m )| p 0, b, m = p measure, b, m -p measure, A, under, 1/2,m=1,
2 … M }。
It calculatesp 0, b, under, 1/2(x 0, b, under, 1/2, y 0, b, under, 1/2, z 0, b, under, 1/2)=(p 0, b, under, 1+ p 0, b, under, 2)/2。
Solve objective optimisation problems 1:
s.t.
Step 11: using the default parameters of multilayered particles group's algorithm, including resolution ratioT POS =0.00005, populationN P =
20, internal layer maximum number of iterationsN i,rd =100, outer layer maximum number of iterationsN o,rd =100, outer layer minimum the number of iterationsn o,rd =50、
Quality weight factorW=0.5, local weight factorC 1=2, global weight factorC 2=2。
Step 12: defining 20 particlesp PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4), value corresponds to mesh
Mark optimization problem 1 in variable (x 0, y 0, α 0, β 0),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval point
Not withx 0、y 0、α 0、β 0Value interval it is identical, it may be assumed thatp PSO, k,1、p PSO, k,2∈[-D A , D A ],p PSO, k,3、p PSO, k,4∈[-π,π];k=1, 2 … 20;All particle constituent particle collectionp PSO,k };One particle is setp PSO,1(p PSO,1,1, p PSO,1,2,p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0).
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 13: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval taken at random by being evenly distributed
19 values, construct 19 particlesp PSO,k ;k=2, 3 … 20。
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval take 20 values at random by being evenly distributed,
Construct 20 particlesp PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);All particles
Speed composition speed collectionv PSO,k };k=1, 2 … 20。
Define 20 particlesp PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … 20。
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into the variable in objective optimisation problems 1 respectivelyx 0、y 0、α 0、β 0And its equality constraint, and calculate corresponding objective optimization functional valued 1,A,k ,k=1, 2 … 20;That is,
where
Record particlep PSO,k Corresponding local optimumd 1,A,k,min =d 1,A,k ,k=1, 2 … 20。
Record global optimumd 1,A,min =min d 1,A,k,min , and record and mind 1,A,k,min The value of corresponding particle is
Globally optimal solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 14: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … 20。
Enable (x 0, y 0, α 0, β 0)=p PSO,k , and substitute into the inequality constraints of objective optimisation problems 1, i.e., 0≤-x 0,b,under,1/2 cosα 0sinβ 0+ y 0,b,under,1/2 sinα 0+ z 0,b,under,1/2 cosα 0cosβ 0,x 0、y 0∈[-D A , D A ],α 0、β 0
∈[-π, π];If inequality constraints is set up, will (x 0, y 0, α 0, β 0) substitute into objective optimisation problems 1 in equation about
Beam calculates and updates corresponding objective optimization functional valued 1,A,k ;Ifd 1,A,k ≤ d 1,A,k,min , then more new particlep PSO,k 's
Local optimumd 1,A,k,min =d 1,A,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd 1,A,k ≤d 1,A,min , then updating global optimumd 1,A,min =d 1,A,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 …
20。
If the local optimum and locally optimal solution of each particle are very close, that is, (| maxd 1,A,k,min – mind 1,A,k,min |≤0.00005) and (|p PSO,k,min, mean – p PSO,k,min|≤0.00005), then, step 17 is gone to, it is no
Then go to step 15;Wherein,p PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=1, 2 … 20。
Step 15: by particlep PSO,k Speedv PSO,k Value be updated to 0.5v PSO,k +2C rand1 (p PSO,k,min - p PSO,k )
+ 2C rand2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2Be in section [0,1] independently of each other by be evenly distributed with
Two values that machine is chosen; k=1, 2 … 20;
Step 16: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
Greater than 100, then jumping to step 17, step 14 is otherwise jumped to.
Step 17: recording the global optimum for the internal layer particle swarm algorithm that each iteration obtainsd 1,A,min,s = d 1,A,min ,
In,sIt is the number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithmsWhen > 50, enableg =s -50, judge the receipts of multilayered particles group's algorithm
Holding back property;If |d 1,A,min,s – min d 1,A,min, g |≤0.00005, then, terminate multilayered particles group algorithm and exports mesh
Mark the optimal solution of optimization problem 1p PSO,minAnd optimal valued 1,A,min , otherwise, accumulate the number of iterations of an outer layer particle swarm algorithm.
If the number of iterations of outer layer particle swarm algorithm is greater than 100, stops outer layer particle swarm algorithm and export target
Optimization problem 1 optimal solution (x 0, y 0, α 0, β 0)=p PSO,minWith optimal value mind 1, A =d 1,A,min , otherwise, more new particlep PSO,1Initial value bep PSO,minJump to step 13.
Solve reference cylindrical bodyAFitting cylindrical bodyCC A Diameterd A =|min d 1, A | and it is correspondingp PSO,min's
Value (x 0,min, y 0,min, α 0,min, β 0,min)。
To translate roughly data set p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n ) following coordinate transform is carried out,n=1,
2 … N:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p A, n (x A, n , y A, n ,z A, n )}。
To translate roughly data set p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m ) following coordinate transform is carried out,m=1,
2 … M:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p b, m (x b, m , y b, m ,z b, m )}。
Step 4: calculating benchmark cylindrical bodyAThe maximum material boundary cylindrical bodyCC AM DiameterD AM , work as reference cylinderAIt is axis
When,D AM = D A + es A ;Work as reference cylinderAWhen being hole,D AM = D A + EI A 。
Solve objective optimisation problems 2:
s.t.
Step 21: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P
(N P >=2), internal layer maximum number of iterationsN i,rd (N i,rd >=1), outer layer maximum number of iterationsN o,rd , outer layer minimum iteration time
Numbern o,rd , quality weight factorW, local weight factorC 1, global weight factorC 2。
Step 22: defining particlep PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4) value correspond to objective optimization
In problem 2 variable (dx A , dy A , drx A , dry A ),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval point
Not withdx A 、dy A 、drx A 、dry A Value interval it is identical,k=1, 2 … N P ;All particle constituent particle collectionp PSO,k };Setting
One particlep PSO,1(p PSO,1,1, p PSO,1,2, p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0).
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 23: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in it is random by being evenly distributed
Take (N P - 1) a value, building (N P - 1) a particlep PSO,k ;k=2, 3 … N P 。
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in taken at random by being evenly distributedN P It is a
Value, buildingN P A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);All grains
Son speed composition speed collectionv PSO,k };k=1, 2 … N P 。
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … N P 。
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into objective optimisation problems 2 in variabledx A 、dy A 、drx A 、dry A And its equality constraint, and calculate corresponding objective optimization functional valued b,AM,coa,k ,k=1, 2 … N P 。
Record particlep PSO,k Local optimumd b,AM,coa,k,min =d b,AM,coa,k ,k=1, 2 … N P 。
Record global optimumd b,AM,coa,min =min d b,AM,coa,k,min , and record and mind b,AM,coa,k,min It is corresponding
The value of particle is globally optimal solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 24: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … N P 。
Enable (dx A , dy A , drx A , dry A )=p PSO,k , and the inequality constraints of objective optimisation problems 2 is substituted into, if differed
Formula constraint is set up, then will (dx A , dy A , drx A , dry A ) substitute into objective optimisation problems 2 equality constraint, calculate and update
Corresponding objective optimization functional valued b,AM,coa,k ;Ifd b,AM,coa,k ≤ d b,AM,coa,k,min , then more new particlep PSO,k Office
Portion's optimal valued b,AM,coa,k,min =d b,AM,coa,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd b,AM,coa,k ≤ d b,AM,coa,min , then updating global optimumd b,AM,coa,min =d b,AM,coa,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 … N P 。
If the local optimum and locally optimal solution of each particle are very close, that is, (| maxd b,AM,coa,k,min – mind b,AM,coa,k,min | ≤ T POS ) and (|p PSO,k,min, mean – p PSO,k,min| ≤ T POS ), whereinp PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=1, 2 … N P ;So, step 27 is gone to, step 25 is otherwise gone to.
Step 25: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min -p PSO,k ) + C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is in section [0,1] independently of each other by flat
It is distributed two values randomly selected; k=1, 2 … N P 。
Step 26: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
It is greater thanN i,rd , then stopping internal layer particle swarm algorithm and jumping to step 27, otherwise jump to step 24.
Step 27: recording the global optimum for the outer layer particle swarm algorithm that each iteration obtainsd b,AM,coa,min,s =d b,AM,coa,min , whereinsIt is the number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge multilayered particles group's algorithm
Convergence;If |d b,AM,coa,min,s – min d b,AM,coa,min, g | ≤ T POS , then, end multilayered particles group algorithm is simultaneously defeated
The optimal solution of objective optimisation problems 2 outp PSO,minAnd optimal valued b,AM,coa,min , otherwise, accumulate an outer layer particle swarm algorithm
The number of iterations.
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting target
Optimization problem 2 optimal solution (dx A , dy A , drx A , dry A ) =p PSO,minWith optimal value mind b,AM,coa =d b,AM,coa,min , no
Then, more new particlep PSO,1Initial value bep PSO,minAnd jump to step 23.
Solve cylindrical bodyCC b Relative to cylindrical bodyCC AM Limit equivalent diameterd b, AM, coa, mM =|min d b, AM, coa |。
Step 5: calculating tested cylindrical bodybMaximum solid virtual size: when tested cylindrical bodybWhen being axis,D bMV = D b +es b +T b, AM, coa ;When tested cylindrical bodybWhen being hole,D bMV = D b + EI b -T b, AM, coa 。
When tested cylindrical bodyCbWhen being axis, if limit equivalent diameterd b, AM, coa, mM ≤ D bMV , then it is " real to provide conclusion
Border is tested cylindrical bodyC b Coaxiality error it is qualified ", otherwise provide conclusion " practical tested cylindrical bodyC b Coaxiality error do not conform to
Lattice ".
When tested cylindrical bodyCbWhen being hole, ifD bMV ≤d b, AM, coa, mM , then providing conclusion " practical tested cylindrical bodyC b Coaxiality error it is qualified ", otherwise provide conclusion " practical tested cylindrical bodyC b Coaxiality error it is unqualified ".
Experimental subjects:
Measured hole has size to require, the same cell size tolerance of its hole line has maximum material requirement and its datum hole has size to want
The detection of same cell size error qualification and evaluation of the stepped hole part of summation maximum material requirement:
Step 1: obtaining tested cylindrical body as shown in Figure 4b, reference cylinderAGeometry design parameter (length unit is
Millimeter, angular unit are degree, radian 1).
The tested cylindrical bodybGeometry design parameter include: be Kong Yaosu, nominal diameterD b =24, nominal lengthL b =
15, the upper deviation in holeES b =0.4, the lower deviation in holeEI b =0, with cell size toleranceT b, AM, coa =0.2, maximum with cell size tolerances marking
Entity inquiry, with the reference cylinder of cell size toleranceAMark maximum solid state.
The reference cylinderAGeometry design parameter include: be Kong Yaosu, nominal diameterD A =39, nominal lengthL A =
22, the upper deviation in holeES A =0.1, the lower deviation in holeEI A =0.07, dimensional tolerance application envelope principle, without geometric tolerances requirement.
Tested cylindrical bodybSame cell size tolerance and reference cylinderAThere are maximum material requirement, and reference cylinderA
Only size tolerance requirements and apply envelope principle, jump to step 2.
Step 2: obtaining practical tested cylindrical bodyb, reference cylindrical bodyAMeasurement data, including following four measuring point
Data set, as shown in table 1:
Reference cylindrical bodyATwo measuring pointsP measure, A, under, 1、P measure,A,under,2Respectively in reference circle
CylinderATwo bottom surfaces on, the measuring point data of two measuring points formed measuring point data collectionp measure, A, under, i ,i=1, 2;It is real
Border reference cylinderASide on measuring pointP measure, A, n It is distributed on 3 layers of circumference, 3 points of every layer of circumference, measuring point data
Formation measuring point data collectionp measure, A, n ,n=1, 2 … 9;Practical tested cylindrical bodybTwo measuring pointsP measure, b, under, 1、P measure,b,under,2Respectively in actually tested cylindrical bodybTwo bottom surfaces on, the measuring point of two measuring points
Data formation measuring point data collectionp measure, b, under, j ,j=1, 2;Practical tested cylindrical bodybSide on measuring pointP measure, b, m It is distributed on 3 layers of circumference, 3 points of every layer of circumference, measuring point data formation measuring point data collectionp measure, b, m ,m=
1, 2 … 9}。
By the measuring point on 3 layers of circumferenceP measure, A, n Be fitted to 3 circles respectively, diameter is respectively 39.086,39.083,
39.099 determining reference cylindrical bodyAScale error it is qualified;By the measuring point on 3 layers of circumferencep measure, b, m It is fitted respectively
For 3 circles, diameter is respectively 24.013,24.017,24.021, determines practical tested cylindrical bodybScale error it is qualified;It jumps
Go to step 3.
Step 3: calculatingp measure, A, under, 1/2=( p measure, A, under, 1+ p measure, A, under, 2)/2=
(261.1905, 229.524, -584.6165)。
Obtain in step 2 four measuring point data collection are coordinately transformed, four rough translation data sets are obtained
{p 0, A, under, i (x 0, A, under, i , y 0, A, under, i , z 0, A, under, i )| p 0, A, under, i =p measure, A, under, i -p measure, A, under, 1/2,i=1,2 }, as shown in table 1;{p 0, A, n (x 0, A, n , y 0, A, n ,z 0, A, n )| p 0, A, n = p measure, A, n -p measure, A, under, 1/2,n=1, 2 … N, as shown in table 1;{p 0, b, under, j (x 0, b, under, j , y 0, b, under, j , z 0, b, under, j )| p 0, b, under, j =p measure, b, under, j -p measure, A, under, 1/2,j=1,2 }, as shown in table 1;{ p 0, b, m (x 0, b, m , y 0, b, m ,z 0, b, m )| p 0, b, m = p measure, b, m -p measure, A, under, 1/2,m=1, 2 … M, as shown in table 1.
It calculatesp 0, b, under, 1/2=( p 0, b, under, 1+ p 0, b, under, 2)/2=(-23.8675, 3.699, -
18.67)。
Solve objective optimisation problems 1:
s.t.
Step 11: using the default parameters of multilayered particles group's algorithm, including resolution ratioT POS =0.00005, populationN P =
20, internal layer maximum number of iterationsN i,rd =100, outer layer maximum number of iterationsN o,rd =100, outer layer minimum the number of iterationsn o,rd =50、
Quality weight factorW=0.5, local weight factorC 1=2, global weight factorC 2=2。
Step 12: defining 20 particlesp PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4), value corresponds to mesh
Mark optimization problem 1 in variable (x 0, y 0, α 0, β 0),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval point
Not withx 0、y 0、α 0、β 0Value interval it is identical, it may be assumed thatp PSO, k,1、p PSO, k,2∈ [- 39,39],p PSO, k,3、p PSO, k,4∈[-π, π];k=1, 2 … 20;All particle constituent particle collectionp PSO,k };One particle is setp PSO,1(p PSO,1,1, p PSO,1,2,p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0).
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 13: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval taken at random by being evenly distributed
19 values, construct 19 particlesp PSO,k ;k=2, 3 … 20。
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval take 20 values at random by being evenly distributed,
Construct 20 particlesp PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);All particles
Speed composition speed collectionv PSO,k };k=1, 2 … 20。
Define 20 particlesp PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … 20。
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into the variable in objective optimisation problems 1 respectivelyx 0、y 0、α 0、β 0And its equality constraint, and calculate corresponding objective optimization functional valued 1,A,k ,k=1, 2 … 20;That is,
where
Record particlep PSO,k Corresponding local optimumd 1,A,k,min =d 1,A,k ,k=1, 2 … 20。
Record global optimumd 1,A,min =min d 1,A,k,min , and record and mind 1,A,k,min The value of corresponding particle is
Globally optimal solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 14: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … 20。
Enable (x 0, y 0, α 0, β 0)=p PSO,k , and substitute into the inequality constraints of objective optimisation problems 1, i.e., 0≤-x 0,b,under,1/2 cosα 0 sinβ 0 + y 0,b,under,1/2 sinα 0 + z 0,b,under,1/2 cosα 0 cosβ 0,x 0、y 0∈[-39,
39],α 0、β 0∈[-π, π];If inequality constraints is set up, will (x 0, y 0, α 0, β 0) substitute into objective optimisation problems 1
Equality constraint, calculate and update corresponding objective optimization functional valued 1,A,k ;Ifd 1,A,k ≤ d 1,A,k,min , then updating grain
Sonp PSO,k Local optimumd 1,A,k,min =d 1,A,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd 1,A,k ≤ d 1,A,min , then updating global optimumd 1,A,min =d 1,A,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=
1, 2 … 20.If the local optimum and locally optimal solution of each particle are very close, that is, (| maxd 1,A,k,min – mind 1,A,k,min |≤0.00005) and (|p PSO,k,min, mean – p PSO,k,min|≤0.00005), whereinp PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=1, 2 … 20;So, step 17 is gone to, step 15 is otherwise gone to.
Step 15: by particlep PSO,k Speedv PSO,k Value be updated to 0.5v PSO,k +2C rand1 (p PSO,k,min - p PSO,k )
+ 2C rand2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2Be in section [0,1] independently of each other by be evenly distributed with
Two values that machine is chosen; k=1, 2 … 20;
Step 16: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
Greater than 100, then jumping to step 17, step 14 is otherwise jumped to.
Step 17: recording the global optimum for the internal layer particle swarm algorithm that each iteration obtainsd 1,A,min,s = d 1,A,min ,
In,sIt is the number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithmsWhen > 50, enableg =s -50, judge the receipts of multilayered particles group's algorithm
Holding back property;If |d 1,A,min,s – min d 1,A,min, g |≤0.00005, then, terminate multilayered particles group algorithm and exports mesh
Mark the optimal solution of optimization problem 1p PSO,minAnd optimal valued 1,A,min , otherwise, accumulate the number of iterations of an outer layer particle swarm algorithm.
If the number of iterations of outer layer particle swarm algorithm is greater than 100, stops outer layer particle swarm algorithm and export target
Optimization problem 1 optimal solution (x 0, y 0, α 0, β 0)=p PSO,minWith optimal value mind 1, A =d 1,A,min , otherwise, more new particlep PSO,1Initial value bep PSO,minJump to step 13.
Solve reference cylindrical bodyAFitting cylindrical bodyCC A Diameterd A =|min d 1, A |=39.099 and correspondingp PSO,minValue (x 0,min, y 0,min, α 0,min, β 0,min)= (13.9257, 6.4138, 0.012, 0.0149)。
To translate roughly data set p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n ) following coordinate transform is carried out,n=1,
2 … N:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p A, n (x A, n , y A, n ,z A, n ), as shown in table 1.
To translate roughly data set p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m ) following coordinate transform is carried out,m=1,
2 … M:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p b, m (x b, m , y b, m ,z b, m ), as shown in table 1.
Step 4: calculating benchmark cylindrical bodyCAThe maximum material boundary cylindrical bodyCC AM DiameterD AM , reference cylinderCAIt is
Hole,D AM = D A + EI A =39+0.07=39.07;
Solve objective optimisation problems 2:
s.t.
Step 21: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P
(N P >=2), internal layer maximum number of iterationsN i,rd (N i,rd >=1), outer layer maximum number of iterationsN o,rd , outer layer minimum iteration time
Numbern o,rd , quality weight factorW, local weight factorC 1, global weight factorC 2。
Step 22: defining particlep PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4) value correspond to objective optimization
In problem 2 variable (dx A , dy A , drx A , dry A ),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval point
Not withdx A 、dy A 、drx A 、dry A Value interval it is identical,k=1, 2 … N P ;All particle constituent particle collectionp PSO,k };Setting
One particlep PSO,1(p PSO,1,1, p PSO,1,2, p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0).
0 is set by the number of iterations of outer layer particle swarm algorithm.
Step 23: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in it is random by being evenly distributed
Take (N P - 1) a value, building (N P - 1) a particlep PSO,k ;k=2, 3 … N P 。
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in taken at random by being evenly distributedN P It is a
Value, buildingN P A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);All grains
Son speed composition speed collectionv PSO,k };k=1, 2 … N P 。
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 … N P 。
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into objective optimisation problems 2 in variabledx A 、dy A 、drx A 、dry A And its equality constraint, and calculate corresponding objective optimization functional valued b,AM,coa,k ,k=1, 2 … N P 。
Record particlep PSO,k Local optimumd b,AM,coa,k,min =d b,AM,coa,k ,k=1, 2 … N P 。
Record global optimumd b,AM,coa,min =min d b,AM,coa,k,min , and record and mind b,AM,coa,k,min It is corresponding
The value of particle is globally optimal solutionp PSO,min。
0 is set by the number of iterations of internal layer particle swarm algorithm.
Step 24: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 … N P 。
Enable (dx A , dy A , drx A , dry A )=p PSO,k , and the inequality constraints of objective optimisation problems 2 is substituted into, if differed
Formula constraint is set up, then will (dx A , dy A , drx A , dry A ) substitute into objective optimisation problems 2 equality constraint, calculate and update
Corresponding objective optimization functional valued b,AM,coa,k ;Ifd b,AM,coa,k ≤ d b,AM,coa,k,min , then more new particlep PSO,k Office
Portion's optimal valued b,AM,coa,k,min =d b,AM,coa,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd b,AM,coa,k ≤ d b,AM,coa,min , then updating global optimumd b,AM,coa,min =d b,AM,coa,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 … N P 。
If the local optimum and locally optimal solution of each particle are very close, that is, (| maxd b,AM,coa,k,min – mind b,AM,coa,k,min | ≤ T POS ) and (|p PSO,k,min, mean – p PSO,k,min| ≤ T POS ), whereinp PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=1, 2 … N P ;So, step 27 is gone to, step 25 is otherwise gone to.
Step 25: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min -p PSO,k ) + C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is in section [0,1] independently of each other by flat
It is distributed two values randomly selected; k=1, 2 … N P 。
Step 26: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm
It is greater thanN i,rd , then stopping internal layer particle swarm algorithm and jumping to step 27, otherwise jump to step 24.
Step 27: recording the global optimum for the outer layer particle swarm algorithm that each iteration obtainsd b,AM,coa,min,s =d b,AM,coa,min , whereinsIt is the number of iterations of outer layer particle swarm algorithm.
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min。
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge multilayered particles group's algorithm
Convergence;If |d b,AM,coa,min,s – min d b,AM,coa,min, g | ≤ T POS , then, end multilayered particles group algorithm is simultaneously defeated
The optimal solution of objective optimisation problems 2 outp PSO,minAnd optimal valued b,AM,coa,min , otherwise, accumulate an outer layer particle swarm algorithm
The number of iterations.
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting target
Optimization problem 2 optimal solution (dx A , dy A , drx A , dry A ) =p PSO,minWith optimal value mind b,AM,coa =d b,AM,coa,min , no
Then, more new particlep PSO,1Initial value bep PSO,minAnd jump to step 23.
Solve cylindrical bodyCC b Relative to cylindrical bodyCC AM Limit equivalent diameterd b, AM, coa, mM =|min d b, AM, coa |=
23.792。
Step 5: calculating tested cylindrical bodybMaximum solid virtual size: tested cylindrical bodybIt is hole,D bMV = D b +EI b -T b, AM, coa =24+0-0.3=23.7。
Tested cylindrical bodybIt is hole, 23.7=D bMV ≤d b, AM, coa, mM =23.792, provide conclusion " practical tested cylindrical bodyb
Coaxiality error it is qualified ".
1 data set of table and coordinate set
Claims (8)
1. a kind of concentricity assessment method based on maximum solid state, which is characterized in that specific step is as follows:
Step 1: obtaining tested cylindrical bodyCb, reference cylinderCAAnd the geometry design parameter between them;If tested cylinder
BodyCbConcentricity tolerance and reference cylinderCAThere are maximum material requirement, and reference cylinderCAOnly dimensional tolerance does not have
There are geometric tolerances, then jumping to step 2, otherwise terminate this rapid method for assessment, and provides conclusion and " be tested the coaxial of cylindrical body
Degree tolerance cannot be evaluated with this method ";
The tested cylindrical bodyCbGeometry design parameter include: hole element or axial element, nominal diameterD b , name it is long
DegreeL b , axis the upper deviationes b Or the upper deviation in holeES b , axis lower deviationei b Or the lower deviation in holeEI b , concentricity toleranceT b, AM, coa , concentricity tolerance whether mark the reference cylinder of maximum material requirement, concentricity toleranceCAWhether maximum is marked
Entity state;
The reference cylinderCAGeometry design parameter include: hole element or axial element, nominal diameterD A , name it is long
DegreeL A , axis the upper deviationes A Or the upper deviation in holeES A , axis lower deviationei A Or the lower deviation in holeEI A , whether dimensional tolerance apply
Envelope principle, form tolerance, orientation of related features, position of related features, run-out tolerance;
The tested cylindrical bodyCbWith reference cylinderCABetween geometry design parameter be tested cylindrical bodyCbGeometry in
The heart and reference cylinderCAGeometric center between nominal distanceL Ab ;
Step 2: obtaining practical tested cylindrical bodyC b , reference cylindrical bodyC A Measurement data;Evaluate reference cylindrical bodyC A
Scale error and practical tested cylindrical bodyC b Scale error jump to step 3 if above-mentioned error is all qualified, otherwise tie
This rapid method for assessment of beam, and provide conclusion " reference cylindrical bodyC A And/or practical tested cylindrical bodyC b Other errors not
It is qualified ";
Step 3: by reference cylindrical bodyC A Measure data fitting be cylindrical bodyCC A , in the fitting cylindrical body of tested cylindrical body
On establish local coordinate system, and calculate practical tested cylindrical bodyC b , reference cylindrical bodyC A Measurement data in the local coordinate
Coordinate in system;
Step 4: with reference cylindrical bodyC A Relative to cylindrical bodyCC AM Three-dimensional attitudev A For variable, with practical measured circle
CylinderC b Relative to cylindrical bodyCC AM Equivalent diameterd b, AM, coa, mM =f(v A ) it is objective function, objective optimization is carried out, reality is obtained
Border is tested cylindrical bodyC b Relative to cylindrical bodyCC AM Limit equivalent diameterd b, AM, coa, mM ;
Wherein,v A It is constrained as follows: for arbitrarily without departing from reference cylinderCAThe maximum material boundary cylindrical bodyCC AM Cylinder
BodyCC A , relative to cylindrical bodyCC AM Three-dimensional attitude can be expressed asv A ;For anyv A , cylindrical bodyCC A Without departing from base
Director circle cylinderCAThe maximum material boundary cylindrical bodyCC AM ;
Step 5: according to tested cylindrical bodyCbMaximum solid virtual sizeD bMV With practical tested cylindrical bodyC b Limit equivalent it is straight
Diameterd b, AM, coa, mM , judge practical tested cylindrical bodyC b Coaxiality error it is whether qualified.
2. a kind of concentricity assessment method based on maximum solid state according to claim 1, it is characterized in that:
Cylindrical body is actually tested described in step 2C b , reference cylindrical bodyC A Measurement data be measurement rectangular space coordinate
It is measured in system, and including following four measuring point data collection:
Reference cylindrical bodyC A Bottom surface on measuring pointP measure, A, under, i Measuring point datap measure, A, under, i
(x measure, A, under, i , y measure, A, under, i , z measure, A, under, i ),i=1, 2 …I,IFor measure-point amount and it is
Positive integer, all measuring point datasp measure, A, under, i (x measure, A, under, under, i , y measure, A, under, i ,z measure, A, under, i ) formation measuring point data collectionp measure, A, under, i };
Reference cylindrical bodyC A Side on measuring pointP measure, A, n Measuring point datap measure, A, n (x measure, A, n ,y measure, A, n , z measure, A, n ),n=1, 2 …N,NIt for measure-point amount and is positive integer, all measuring point datasp measure, A, n (x measure, A, n , y measure, A, n , z measure, A, n ) formation measuring point data collectionp measure, A, n };
Practical tested cylindrical bodyC b Bottom surface on measuring pointP measure, b, under, j Measuring point datap measure, b, under, j
(x measure, b, under, j , y measure, b, under, j , z measure, b, under, j ),j=1, 2 …J,JFor measure-point amount and it is
Positive integer, all measuring point datasp measure, b, under, j (x measure, b, under, under, j , y measure, b, under, j ,z measure, b, under, j ) formation measuring point data collectionp measure, b, under, j };
Practical tested cylindrical bodyC b Side on measuring pointP measure, b, m Measuring point datap measure, b, m (x measure, b, m ,y measure, b, m , z measure, b, m ),m=1, 2 …M,MIt for measure-point amount and is positive integer, all measuring point datasp measure, b, m (x measure, b, m , y measure, b, m , z measure, b, m ) formation measuring point data collectionp measure, b, m }。
3. a kind of concentricity assessment method based on maximum solid state according to claim 2, it is characterized in that:
In step 2, reference cylindrical bodyC A Bottom surface on measuring point numberI=2, and two measuring pointsP measure, A, under, 1、P measure,A,under,2Respectively in reference cylindrical bodyC A Two bottom surfaces on;
Practical tested cylindrical bodyC b Bottom surface on measuring point numberJ=2, and two measuring pointsP measure, b, under, 1、P measure,b,under,2Respectively in actually tested cylindrical bodyC b Two bottom surfaces on;
In step 3, by reference cylindrical bodyC A Measuring point data collectionp measure, A, n It is fitted to cylindrical bodyCC A Side,P measure, A, under, 1、P measure,A,under,2The midpoint of lineP measure, A, under, 1/2In cylindrical bodyCC A Two bottom surfaces
Symmetrical planePL A, 1/2On, cylindrical bodyCC A Length be equal to reference cylinderCANominal lengthL A ;
In cylindrical bodyCC A On establish local rectangular coordinate systemO xyz, A , coordinate systemO xyz, A Origin and cylindrical bodyCC A Geometry in
The heartO A It is overlapped, coordinate systemO xyz, A A reference axis and cylindrical bodyCC A Axis be overlapped, the positive direction vector of the reference axis with to
AmountO A P measure, b, under, 1/2Dot product be not less than zero, whereinP measure, b, under, 1/2It isP measure, b, under, 1、P measure,b,under,2The midpoint of line;Define cylindrical bodyCC A Unit direction vectorn CCA Length be 1, positive direction and the coordinate
The positive direction vector of axis is identical;
By reference cylindrical bodyC A Measuring point data collectionp measure, A, n And practical tested cylindrical bodyC b Measuring point data collection
{p measure, b, m Coordinate conversion is carried out, obtain reference cylindrical bodyC A With practical tested cylindrical bodyC b Measuring point in coordinate systemO xyz, A In coordinate setp A, n Andp b, m }。
4. a kind of concentricity assessment method based on maximum solid state according to claim 3, it is characterized in that:
Step 1: obtaining tested cylindrical bodyCb, reference cylinderCAAnd the geometry design parameter between them;If tested cylinder
BodyCbConcentricity tolerance and reference cylinderCAThere are maximum material requirement, and reference cylinderCAOnly dimensional tolerance,
Or otherwise only dimensional tolerance and envelope principle then jumping to step 2 terminates this rapid method for assessment, and provide conclusion
" concentricity tolerance of tested cylindrical body cannot be evaluated with this method ";
The tested cylindrical bodyCbGeometry design parameter include be hole element or axial element, nominal diameterD b , nominal lengthL b , axis the upper deviationes b Or the upper deviation in holeES b , axis lower deviationei b Or the lower deviation in holeEI b , concentricity toleranceT b, AM, coa , concentricity tolerance whether mark the reference cylinder of maximum material requirement, concentricity toleranceCAWhether maximum is marked
Entity state;
The reference cylinderCAGeometry design parameter include: hole element or axial element, nominal diameterD A , name it is long
DegreeL A , axis the upper deviationes A Or the upper deviation in holeES A , axis lower deviationei A Or the lower deviation in holeEI A , whether dimensional tolerance apply
Envelope principle, form tolerance, orientation of related features, position of related features, run-out tolerance;
The tested cylindrical bodyCbWith reference cylinderCABetween geometry design parameter be tested cylindrical bodyCbGeometry in
The heart and reference cylinderCAGeometric center between nominal distanceL Ab ;
Step 2: obtaining practical tested cylindrical bodyC b , reference cylindrical bodyC A Measurement data, including following four measuring point data
Collection:
Reference cylindrical bodyC A Two measuring pointsP measure, A, under, 1、P measure,A,under,2Respectively in reference cylindrical bodyC A Two bottom surfaces on, the measuring point data of two measuring pointsp measure, A, under, 1 (x measure, A, under, 1,y measure, A, under, 1, z measure, A, under, 1)、p measure, A, under, 2 (x measure, A, under, 2,y measure, A, under, 2, z measure, A, under, 2) formation measuring point data collectionp measure, A, under, i ,i=1, 2;Practical base
Director circle cylinderC A Side on measuring pointP measure, A, n Measuring point datap measure, A, n (x measure, A, n , y measure, A, n ,z measure, A, n ),n=1, 2 …N,NIt for measure-point amount and is positive integer, all measuring point datasp measure, A, n
(x measure, A, n , y measure, A, n , z measure, A, n ) formation measuring point data collectionp measure, A, n };Practical tested cylindrical bodyC b
Two measuring pointsP measure, b, under, 1、P measure,b,under,2Respectively in actually tested cylindrical bodyC b Two bottom surfaces on, two
The measuring point data of measuring pointp measure, b, under, 1 (x measure, b, under, 1, y measure, b, under, 1,z measure, b, under, 1)、p measure, b, under, 2 (x measure, b, under, 2, y measure, b, under, 2,z measure, b, under, 2) formation measuring point data collectionp measure, b, under, j ,j=1, 2;Practical tested cylindrical bodyC b Side on
Measuring pointP measure, b, m Measuring point datap measure, b, m (x measure, b, m , y measure, b, m , z measure, b, m ),m=1, 2
…M,MIt for measure-point amount and is positive integer, all measuring point datasp measure, b, m (x measure, b, m , y measure, b, m ,z measure, b, m ) formation measuring point data collectionp measure, b, m };
Evaluate reference cylindrical bodyC A With practical tested cylindrical bodyC b Scale error it is whether qualified, if above-mentioned error is all closed
Lattice jump to step 3, otherwise terminate this rapid method for assessment, and provide conclusion " reference cylindrical bodyC A And/or practical quilt
Survey cylindrical bodyC b Other errors it is unqualified ";
Step 3: calculatingp measure, A, under, 1/2=( p measure, A, under, 1+ p measure, A, under, 2)/2;
Obtain in step 2 four measuring point data collection are coordinately transformed, four rough translation data sets are obtained
{p 0, A, under, i (x 0, A, under, i , y 0, A, under, i , z 0, A, under, i )| p 0, A, under, i =p measure, A, under, i -p measure, A, under, 1/2,i=1, 2}、{p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n )|p 0, A, n = p measure, A, n -p measure, A, under, 1/2,n=1, 2 …N }、{ p 0, b, under, j (x 0, b, under, j ,y 0, b, under, j , z 0, b, under, j )| p 0, b, under, j = p measure, b, under, j -p measure, A, under, 1/2,j=1,
2}、{ p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m )| p 0, b, m = p measure, b, m -p measure, A, under, 1/2,m=1,
2 …M};
It calculatesp 0, b, under, 1/2(x 0, b, under, 1/2, y 0, b, under, 1/2, z 0, b, under, 1/2)=( p 0, b, under, 1+p 0, b, under, 2)/2;
Solve objective optimisation problems 1:
s.t.
Solve optimal solution (x 0,min, y 0,min, α 0,min, β 0,min), i.e. reference cylindrical bodyC A Fitting cylindrical bodyCC A It is corresponding
(x 0, y 0, α 0, β 0) value;
To translate roughly data set p 0, A, n (x 0, A, n , y 0, A, n , z 0, A, n ) following coordinate transform is carried out,n=1, 2 …N:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p A, n (x A, n , y A, n ,z A, n )};
To translate roughly data set p 0, b, m (x 0, b, m , y 0, b, m , z 0, b, m ) following coordinate transform is carried out,m=1, 2 …M:
Obtain practical tested all measuring points of cylinder relative to reference cylindrical body coordinate set p b, m (x b, m , y b, m ,z b, m )};
Step 4: calculating benchmark cylindrical bodyCAThe maximum material boundary cylindrical bodyCC AM DiameterD AM , work as reference cylinderCAWhen being axis,D AM = D A + es A ;Work as reference cylinderCAWhen being hole,D AM = D A + EI A ;
Solve objective optimisation problems 2:
s.t.
Solve practical tested cylindrical bodyC b Limit equivalent diameterd b, AM, coa, mM =|min d b, AM, coa |;
Step 5: calculating tested cylindrical bodyCbMaximum solid virtual size: when tested cylindrical bodyCbWhen being axis,D bMV = D b +es b +T b, AM, coa ;When tested cylindrical bodyCbWhen being hole,D bMV = D b + EI b -T b, AM, coa ;
When tested cylindrical bodyCbWhen being axis, if limit equivalent diameterd b, AM, coa, mM ≤D bMV , then providing conclusion " practical quilt
Survey cylindrical bodyC b Coaxiality error it is qualified ", otherwise provide conclusion " practical tested cylindrical bodyC b Coaxiality error it is unqualified ";
When tested cylindrical bodyCbWhen being hole, ifD bMV ≤ limit equivalent diameterd b, AM, coa, mM , then providing conclusion " practical quilt
Survey cylindrical bodyC b Coaxiality error it is qualified ", otherwise provide conclusion " practical tested cylindrical bodyC b Coaxiality error it is unqualified ".
5. a kind of concentricity assessment method based on maximum solid state according to claim 4, it is characterized in that:
The step of solution of the objective optimisation problems, is as follows:
Step 01: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P , internal layer
Maximum number of iterationsN i,rd , outer layer maximum number of iterationsN o,rd , outer layer minimum the number of iterationsn o,rd , quality weight factorW, part power
The factorC 1, global weight factorC 2;N P >=2,N i,rd ≥ 1;
Step 02: definitionN P A particlep PSO,k (p PSO, k,1, p PSO, k,2, …, p PSO, k,Q ), value corresponds to objective optimisation problems
In independent variable (x 1, x 2, …, x Q ),p PSO, k, q Value interval respectively withx q Value interval it is identical;k=1, 2 …N P ;q=1, 2 …Q;All particle constituent particle collectionp PSO,k };One particle is setp PSO,1Initial value or use its default value;
0 is set by the number of iterations of outer layer particle swarm algorithm;
Step 03: existing respectivelyp PSO, k, q Value interval taken at random by being evenly distributed (N P - 1) a value, building (N P - 1) a grain
Sonp PSO,k ;k=2, 3 …N P ;q=1, 2 …Q;
Exist respectivelyp PSO, k, q Value interval taken at random by being evenly distributedN P A value, buildingN P A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, …, v PSO, k,q );All particles speed composition speed collectionv PSO,k };k=1, 2 …N P ;q=1, 2 …Q;
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 …N P ;
It willp PSO, k, q Value substitute into the variable in objective optimisation problems respectivelyx q And its equality constraint, and calculate corresponding target
Majorized function valuef k =f(x 1, x 2, …, x Q );k=1, 2 …N P ;q=1, 2 …Q;
Record particlep PSO,k Corresponding local optimumf k,min =f k ,k=1, 2 …N P ;
Record global optimumf min =min f k,min , and record and minf k,min The value of corresponding particle is globally optimal solutionp PSO,min;
0 is set by the number of iterations of internal layer particle swarm algorithm;
Step 04: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 …N P ;
Enable (x 1, x 2, …, x Q )=p PSO,k , and substitute into the inequality constraints of objective optimisation problems;If inequality constraints is set up,
So incite somebody to action (x 1, x 2, …, x Q ) equality constraint in objective optimisation problems is substituted into, and calculate and update corresponding objective optimization
Functional valuef k ;Iff k ≤f k,min , then more new particlep PSO,k Local optimumf k,min =f k , and more new particlep PSO,k Office
Portion's optimal solution isp PSO,k,min=p PSO,k ;Iff k ≤f min , then updating global optimumf min =f k , and update globally optimal solution
Forp PSO,min=p PSO,k ;k=1, 2 …N P ;q=1, 2 …Q;
If the local optimum and locally optimal solution of each particle are very close, that is, | maxf k,min – min f k,min | ≤T POS
And |p PSO,k,min, mean –p PSO,k,min| ≤T POS , whereinp PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=1, 2
…N P ;So, step 07 is gone to, step 05 is otherwise gone to;
Step 05: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min - p PSO,k ) +C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is random by being evenly distributed independently of each other in section [0,1]
Two values chosen; k=1, 2 …N P ;
Step 06: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm is greater thanN i,rd , then jumping to step 07, otherwise jump to step 04;
Step 07: recording the global optimum for the internal layer particle swarm algorithm that each iteration obtainsf min,s = f min , whereinsIt is outer layer
The number of iterations of particle swarm algorithm;
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min;
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge the convergence of multilayered particles group's algorithm
Property;If |f min,s – min f min, g | ≤T POS , then, terminate multilayered particles group algorithm and exports objective optimisation problems most
Excellent solutionp PSO,minAnd optimal valuef min , otherwise, accumulate the number of iterations of an outer layer particle swarm algorithm;
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting objective optimization
Problem optimal solution (x 1, x 2, …, x Q )=p PSO,minWith optimal value minf=f min , otherwise, more new particlep PSO,1Initial value
Forp PSO,minJump to step 03.
6. a kind of concentricity assessment method based on maximum solid state according to claim 5, it is characterized in that:
The resolution ratio of the multilayered particles group algorithmT POS Default value is 0.00005, populationN P Default value is that 20, internal layer maximum changes
Generation numberN i,rd Default value is 100, outer layer maximum number of iterationsN o,rd Default value is 100, outer layer minimum the number of iterationsn o,rd Default
Value is 50, quality weight factorWDefault value is 0.5, local weight factorC 1Default value is 2, global weight factorC 2Default value is 2;p PSO,1Initial value be defaulted as null vector.
7. a kind of concentricity assessment method based on maximum solid state according to claim 5, it is characterized in that:
The multilayered particles group's algorithm for solving objective optimisation problems 1 is as follows:
Step 11: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P , internal layer
Maximum number of iterationsN i,rd , outer layer maximum number of iterationsN o,rd , outer layer minimum the number of iterationsn o,rd , quality weight factorW, part power
The factorC 1, global weight factorC 2;N P >=2,N i,rd ≥ 1;
Step 12: definitionN P A particlep PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4), it is excellent that value corresponds to target
In change problem 1 variable (x 0, y 0, α 0, β 0),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval respectively withx 0、y 0、α 0、β 0Value interval it is identical, it may be assumed thatp PSO, k,1、p PSO, k,2∈[-D A , D A ],p PSO, k,3、p PSO, k,4∈[-π, π];k=1, 2 …N P ;All particle constituent particle collectionp PSO,k };One particle is setp PSO,1(p PSO,1,1, p PSO,1,2,p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0);
0 is set by the number of iterations of outer layer particle swarm algorithm;
Step 13: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval taken at random by being evenly distributed (N P -
1) a value, building (N P - 1) a particlep PSO,k ;k=2, 3 …N P ;
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval taken at random by being evenly distributedN P A value, buildingN P
A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);The velocity group of all particles
At speed collectionv PSO,k };k=1, 2 …N P ;
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 …N P ;
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into the variable in objective optimisation problems 1 respectivelyx 0、y 0、α 0、β 0
And its equality constraint, and calculate corresponding objective optimization functional valued 1,A,k ,k=1, 2 …N P ;That is,
where
Record particlep PSO,k Corresponding local optimumd 1,A,k,min =d 1,A,k ,k=1, 2 …N P ;
Record global optimumd 1,A,min =min d 1,A,k,min , and record and mind 1,A,k,min The value of corresponding particle be it is global most
Excellent solutionp PSO,min;
0 is set by the number of iterations of internal layer particle swarm algorithm;
Step 14: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 …N P ;
Enable (x 0, y 0, α 0, β 0)=p PSO,k , and substitute into the inequality constraints of objective optimisation problems 1, i.e., 0≤-x 0,b,under,1/2 cosα 0sinβ 0+ y 0,b,under,1/2 sinα 0+ z 0,b,under,1/2 cosα 0cosβ 0,x 0、y 0∈[-D A , D A ],α 0、β 0∈[-π, π];Such as
Fruit inequality constraints is set up, then will (x 0, y 0, α 0, β 0) substitute into objective optimisation problems 1 in equality constraint, calculate and more
New corresponding objective optimization functional valued 1,A,k ;Ifd 1,A,k ≤d 1,A,k,min , then more new particlep PSO,k Local optimumd 1,A,k,min =d 1,A,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd 1,A,k ≤d 1,A,min , then
Update global optimumd 1,A,min =d 1,A,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 …N P ;
If the local optimum and locally optimal solution of each particle are very close, that is, | maxd 1,A,k,min – min d 1,A,k,min |
≤T POS And |p PSO,k,min, mean –p PSO,k,min| ≤T POS , whereinp PSO,k,min, meanForp PSO,k,minArithmetic mean of instantaneous value,k=
1, 2 …N P ;So, step 17 is gone to, step 15 is otherwise gone to;
Step 15: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min - p PSO,k ) +C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is random by being evenly distributed independently of each other in section [0,1]
Two values chosen; k=1, 2 …N P ;
Step 16: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm is greater thanN i,rd , then jumping to step 17, otherwise jump to step 14;
Step 17: recording the global optimum for the internal layer particle swarm algorithm that each iteration obtainsd 1,A,min,s = d 1,A,min , whereins
It is the number of iterations of outer layer particle swarm algorithm;
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min;
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge the convergence of multilayered particles group's algorithm
Property;If |d 1,A,min,s – min d 1,A,min, g | ≤T POS , then, terminate multilayered particles group algorithm and export objective optimization to ask
The optimal solution of topic 1p PSO,minAnd optimal valued 1,A,min , otherwise, accumulate the number of iterations of an outer layer particle swarm algorithm;
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting objective optimization
Problem 1 optimal solution (x 0, y 0, α 0, β 0)=p PSO,minWith optimal value mind 1, A =d 1,A,min , otherwise, more new particlep PSO,1's
Initial value isp PSO,minJump to step 13.
8. a kind of concentricity assessment method based on maximum solid state according to claim 5, it is characterized in that:
The multilayered particles group's algorithm for solving objective optimisation problems 2 is as follows:
Step 21: defining the parameter of multilayered particles group algorithm or use its default value, including resolution ratioT POS , populationN P , internal layer
Maximum number of iterationsN i,rd , outer layer maximum number of iterationsN o,rd , outer layer minimum the number of iterationsn o,rd , quality weight factorW, part power
The factorC 1, global weight factorC 2;N P >=2,N i,rd ≥ 1;
Step 22: defining particlep PSO,k (p PSO, k,1, p PSO, k,2, p PSO, k,3, p PSO, k,4) value correspond to objective optimisation problems
In 2 variable (dx A , dy A , drx A , dry A ),p PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval respectively withdx A 、dy A 、drx A 、dry A Value interval it is identical,k=1, 2 …N P ;All particle constituent particle collectionp PSO,k };Setting one
Particlep PSO,1(p PSO,1,1, p PSO,1,2, p PSO,1,3, p PSO,1,4) initial value be (0,0,0,0);
0 is set by the number of iterations of outer layer particle swarm algorithm;
Step 23: existing respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in taken at random by being evenly distributed (N P
- 1) a value, building (N P - 1) a particlep PSO,k ;k=2, 3 …N P ;
Exist respectivelyp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value interval in taken at random by being evenly distributedN P A value, buildingN P A particlep PSO,k Initial velocityv PSO, k (v PSO, k,1, v PSO, k,2, v PSO, k,3, v PSO, k,4);The speed of all particles
Composition speed collectionv PSO,k };k=1, 2 …N P ;
DefinitionN P A particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;k=1, 2 …N P ;
It willp PSO, k,1、p PSO, k,2、p PSO, k,3、p PSO, k,4Value substitute into objective optimisation problems 2 in variabledx A 、dy A 、drx A 、dry A And its equality constraint, and calculate corresponding objective optimization functional valued b,AM,coa,k ,k=1, 2 …N P ;
Record particlep PSO,k Local optimumd b,AM,coa,k,min =d b,AM,coa,k ,k=1, 2 …N P ;
Record global optimumd b,AM,coa,min =min d b,AM,coa,k,min , and record and mind b,AM,coa,k,min Corresponding particle
Value is globally optimal solutionp PSO,min;
0 is set by the number of iterations of internal layer particle swarm algorithm;
Step 24: by particlep PSO,k Value be updated top PSO,k +v PSO, k ,k=1, 2 …N P ;
Enable (dx A , dy A , drx A , dry A )=p PSO,k , and the inequality constraints of objective optimisation problems 2 is substituted into, if inequality is about
Shu Chengli, then will (dx A , dy A , drx A , dry A ) equality constraint that substitutes into objective optimisation problems 2, it calculates and updates corresponding
Objective optimization functional valued b,AM,coa,k ;Ifd b,AM,coa,k ≤d b,AM,coa,k,min , then more new particlep PSO,k Local optimum
Valued b,AM,coa,k,min =d b,AM,coa,k , and more new particlep PSO,k Locally optimal solution bep PSO,k,min=p PSO,k ;Ifd b,AM,coa,k ≤d b,AM,coa,min , then updating global optimumd b,AM,coa,min =d b,AM,coa,k , and update globally optimal solution and bep PSO,min=p PSO,k ;k=1, 2 …N P ;
If the local optimum and locally optimal solution of each particle are very close, that is, | maxd b,AM,coa,k,min – mind b,AM,coa,k,min | ≤T POS And |p PSO,k,min, mean –p PSO,k,min| ≤T POS , whereinp PSO,k,min, meanForp PSO,k,minCalculation
Art average value,k=1, 2 …N P ;So, step 27 is gone to, step 25 is otherwise gone to;
Step 25: by particlep PSO,k Speedv PSO,k Value be updated toW v PSO,k + C rand1 C 1 (p PSO,k,min - p PSO,k ) +C rand2 C 2 (p PSO,min - p PSO,k ), whereinC rand1、C rand2It is random by being evenly distributed independently of each other in section [0,1]
Two values chosen; k=1, 2 …N P ;
Step 26: the number of iterations of one secondary internal layer particle swarm algorithm of accumulation;If the number of iterations of internal layer particle swarm algorithm is greater thanN i,rd , then stopping internal layer particle swarm algorithm and jumping to step 27, otherwise jump to step 24;
Step 27: recording the global optimum for the outer layer particle swarm algorithm that each iteration obtainsd b,AM,coa,min,s = d b,AM,coa,min ,
Wherein,sIt is the number of iterations of outer layer particle swarm algorithm;
By particlep PSO,1Value be set as current globally optimal solutionp PSO,min;
When the number of iterations of outer layer particle swarm algorithms > n o,rd When, it enablesg =s -n o,rd , judge the convergence of multilayered particles group's algorithm
Property;If |d b,AM,coa,min,s – min d b,AM,coa,min, g | ≤T POS , then, terminate multilayered particles group algorithm and exports target
The optimal solution of optimization problem 2p PSO,minAnd optimal valued b,AM,coa,min , otherwise, accumulate the iteration time of an outer layer particle swarm algorithm
Number;
If the number of iterations of outer layer particle swarm algorithm is greater thanN o,rd , then stopping outer layer particle swarm algorithm and exporting objective optimization
Problem 2 optimal solution (dx A , dy A , drx A , dry A ) =p PSO,minWith optimal value mind b,AM,coa =d b,AM,coa,min , otherwise,
More new particlep PSO,1Initial value bep PSO,minAnd jump to step 23.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610535177.0A CN106202709B (en) | 2016-07-08 | 2016-07-08 | A kind of concentricity assessment method based on maximum solid state |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610535177.0A CN106202709B (en) | 2016-07-08 | 2016-07-08 | A kind of concentricity assessment method based on maximum solid state |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106202709A CN106202709A (en) | 2016-12-07 |
CN106202709B true CN106202709B (en) | 2019-09-10 |
Family
ID=57473819
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610535177.0A Expired - Fee Related CN106202709B (en) | 2016-07-08 | 2016-07-08 | A kind of concentricity assessment method based on maximum solid state |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106202709B (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108121876A (en) * | 2017-12-30 | 2018-06-05 | 唐哲敏 | A kind of square groove interaction in vitro width assessment method of fast steady letter |
CN108562259A (en) * | 2017-12-31 | 2018-09-21 | 唐哲敏 | A kind of maximum inscribed circle diameter assessment method of fast steady letter |
CN108168494A (en) * | 2017-12-31 | 2018-06-15 | 唐哲敏 | A kind of Circularity error evaluation method of fast steady letter |
CN108253918A (en) * | 2017-12-31 | 2018-07-06 | 唐哲敏 | A kind of circumscribed circular diameter assessment method of minimum of fast steady letter |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2013056717A (en) * | 2011-09-07 | 2013-03-28 | Toshiba Elevator Co Ltd | Assembly jig of sheave brake |
CN104316001A (en) * | 2014-10-08 | 2015-01-28 | 南京航空航天大学 | Non-reference hole coaxiality error measurement system and measurement method thereof |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104075647B (en) * | 2013-03-29 | 2017-02-08 | 富泰华工业(深圳)有限公司 | Detection device |
-
2016
- 2016-07-08 CN CN201610535177.0A patent/CN106202709B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2013056717A (en) * | 2011-09-07 | 2013-03-28 | Toshiba Elevator Co Ltd | Assembly jig of sheave brake |
CN104316001A (en) * | 2014-10-08 | 2015-01-28 | 南京航空航天大学 | Non-reference hole coaxiality error measurement system and measurement method thereof |
Non-Patent Citations (3)
Title |
---|
同轴度公差建模的规范模型生成方法;刘惠芬等;《2011年机械电子学学术会议论文集》;20110930;第232-236页 |
同轴度误差快速评定新算法;宋起等;《制造业自动化》;20150210;第37卷(第2期);第87-89页 |
基于改进粒子群算法的同轴度误差评定及其可视化;翟旭军等;《组合机床与自动化加工技术》;20121230(第12期);第55-59页 |
Also Published As
Publication number | Publication date |
---|---|
CN106202709A (en) | 2016-12-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106202709B (en) | A kind of concentricity assessment method based on maximum solid state | |
CN106202741B (en) | Coaxiality evaluation method based on minimum entity state | |
CN108563186B (en) | Five-axis ball head milling geometric error compensation method | |
CN101387494B (en) | Geometrical dimensional measurement apparatus and method for large-sized tunnel tunnel segment component | |
CN106248035A (en) | The method and system that a kind of surface profile based on point cloud model accurately detects | |
CN108908335B (en) | Robot calibration method based on improved differential evolution algorithm | |
CN108871256B (en) | Roundness error evaluation algorithm | |
CN101847262B (en) | Fast three-dimensional point cloud searching and matching method | |
CN103292773B (en) | A kind of symmetry error evaluation method based on Minimum Area | |
CN108344372A (en) | The method for making and monitoring the component with integral type strain indicator | |
CN103294920B (en) | A kind of part Cylindricity error evaluation based on Minimum Area | |
CN106682252B (en) | Coaxiality rapid evaluation method based on minimum entity state | |
Zeng et al. | An error similarity-based error-compensation method for measurement in the nonuniform temperature field | |
Zhang et al. | Precision measurement and evaluation of flatness error for the aero-engine rotor connection surface based on convex hull theory and an improved PSO algorithm | |
Mussatayev et al. | Thermal influences as an uncertainty contributor of the coordinate measuring machine (CMM) | |
CN106202917B (en) | A kind of concentricity rapid method for assessment based on maximum solid state | |
CN106767405B (en) | The method and device of the quick corresponding point matching of phase mapping assist three-dimensional imaging system | |
CN103674000B (en) | Electronic compass real time calibration algorithm | |
US10132623B2 (en) | Method for measuring slant wall thickness dimension of hub | |
Liu et al. | Measurement and evaluation of cylindricity deviation in Cartesian coordinates | |
CN115307547A (en) | Networking test method for laser tracker combined with vision system | |
Praniewicz et al. | An investigation into the definition and qualification of form of lattice structures | |
CN110020396A (en) | A kind of concentricity assessment method based on Tolerance Principle | |
CN103310106B (en) | The computing method of a kind of hole in piece part system acts | |
CN109522566A (en) | A kind of position error assessment method of three projection planes system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right | ||
TR01 | Transfer of patent right |
Effective date of registration: 20210114 Address after: 541004 1 Jinji Road, Qixing District, Guilin, the Guangxi Zhuang Autonomous Region Patentee after: GUILIN University OF ELECTRONIC TECHNOLOGY Address before: 541100 No. 1 unit 2, Wanhua District, Longshan lane, Lingui District, Guilin, the Guangxi Zhuang Autonomous Region, 11-1 Patentee before: Tang Zhemin |
|
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190910 Termination date: 20210708 |