CN106971087A - A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain - Google Patents
A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain Download PDFInfo
- Publication number
- CN106971087A CN106971087A CN201710387361.XA CN201710387361A CN106971087A CN 106971087 A CN106971087 A CN 106971087A CN 201710387361 A CN201710387361 A CN 201710387361A CN 106971087 A CN106971087 A CN 106971087A
- Authority
- CN
- China
- Prior art keywords
- student
- algorithm
- achievement
- formula
- flatness error
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Z—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR
- G16Z99/00—Subject matter not provided for in other main groups of this subclass
Abstract
Involved in the present invention is a kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain, and first, according to lowest area principal, sets up the solution mathematical modeling of Flatness error evaluation;Secondly, by obtaining the measurement data of tested flat elemental, and set up mathematical modeling is combined, sets up the object function of problem;Finally, object function is solved using secondary learning aid algorithm of climbing the mountain, key step includes the Parameter Initialization procedure of algorithm, the mutually step such as study, and not high for standard learning aid algorithmic procedure solving precision between the teaching phase of student performance, student, the problems such as convergence rate is slower, simultaneously using the local optimal searching ability and quickening convergence rate of two benches hill-climbing algorithm enhancing algorithm, so as to sufficiently improve computational accuracy, finally solved.Parameter is less needed for this method, algorithm stability is good, surveyed data can be sufficiently applied to, it is more novel in algorithm application, test function is more accurate relative to other algorithms most in use, faster, solution procedure complies fully with the Minimum Area principle in international standard to iteration speed, therefore computational solution precision is higher.
Description
Technical field
It is more particularly to a kind of based on secondary learning aid calculation of climbing the mountain the invention belongs to the digital measuring field of machine components
The Flatness error evaluation method of method.
Background technology
Flatness error is one of basic Form and position error of machine components, affects the assembly precision of part and uses the longevity
Life.Therefore, how further to improve the evaluating precision of part flatness, it is ensured that the designing quality of engineering goods, be heavy at this stage
One of research direction wanted.
The national Specification error evaluation method of four kinds of flatnesses, including line-of-sight course, diagonal method, least square method
And minimum area method, wherein least square method and minimum area method is most widely used.For machine components flatness error
Evaluation algorithm, Wang Zhijian etc. is in its document《Flatness error is solved with least square method》In employ least square method to flat
Face degree error is evaluated, and Wen Xiulan etc. is in its document《Flatness error evaluation based on evolution strategy》In employ evolution
Algorithm is evaluated to flatness error, and Yue Wuling et al. is in its document《Rapid evaluation-increasing of flatness and straightness error
Quantity algorithm》Middle use delta algorithm is evaluated to flatness error.
In summary, continuing to develop with computer technology and artificial intelligence technology, Flatness error evaluation method
It is more and more perfect, precision also more and more higher, and wherein topmost method is exactly to minimum area method with reference to all kinds of optimized algorithms
Constantly studied.Learning aid optimized algorithm is a kind of new global intelligent optimization algorithm proposed in 2012, its algorithm ginseng
Number is seldom, and algorithm robustness very well, can further improve arithmetic accuracy, due to learning aid by introducing local searching strategy
The calculating performance of optimized algorithm well, has been widely used in all kinds of engineering fields at this stage.
The present invention is that on the basis of basic learning aid algorithm, search by hill climbing strategy is introduced twice, further improves and calculates
The search capability of method, to improve the evaluating precision of part flatness.
The content of the invention
It is an object of the invention to provide a kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain, to carry
The evaluating precision and computational stability of high flatness error.
A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain, mainly including herein below:
Step one:The tested flat elemental of tested part is determined, the plane survey of part is obtained by three coordinate measuring machine
Data point is Pi(xi, yi, zi) (i=1,2 ..., n);
Step 2:According to the lowest area principal of flatness error, with reference to any datum plane equation Z in space, such as formula
(1) shown in;Spatial point to plane range formula, such as shown in formula (2);Set up the mathematical modeling of flatness error, such as formula
(3) shown in.Wherein A, B are respectively the directioin parameter of datum plane, and C is the location parameter of plane, (xi, yi, zi) it is measuring point Pi's
Coordinate parameters, diFor measuring point PiTo datum plane equation Z distance, f is required flatness error, and obtains A, B, C tri- simultaneously
The value of parameter;
Z=Ax+By+C (1)
F=min (max (di)-min(di)) (3)
Step 3:Read measurement data Pi(xi, yi, zi) (i=1,2 ..., n), are brought into formula (3), and learning aid is calculated
The parameter of method is initialized, main to include initialization student X=(x1, x2..., xi), i=1,2 ..., N, wherein xiRepresent
Student i, N in class are student's quantity.For some student xi, there is x againi=(xi1, xi2..., xij), j=1,2 ..., D,
xijThe subject j, D for representing student's i are total subject, and optimal solution is xt, i.e. fitness value is optimal for class's teacher's achievement, religion
Iterations W, ramping constraint iterations w, into step 4 with learning optimized algorithm;
Step 4:The fitness function value of each student is calculated, and according to achievement of the formula (4), (5) and (6) to student
It is updated, in formula:X (i, j) ' is the achievement after student i subject j renewals;Before x (i, j) updates for student i subject j
Achievement;Rand is the random number between [0,1];xt(j) it is the subject j achievements of teacher;T is the teaching factor;X (j) is student section
Mesh j achievement;M (j) is j-th of section's purpose average achievement in class;Round is the bracket function rounded up.Teaching phase
After the completion of, by contrasting the quality of fitness value, the renewal of solution is completed, into step 5;
X (i, j) '=x (i, j)+rand × (xt(j)-tM(j)) (4)
T=round [1+rand (0,1)] (5)
Step 5:Using hill climbing, search by hill climbing is carried out again to each student, concrete mode is to exchange any two
Section's purpose achievement, then contrast exchanges the fitness before and after subject, selects smaller as after hill climbing maneuver of fitness value
Achievement is generated, this time iteration is needed w times, after the completion of iteration, and the replacement of student performance is carried out again, and records globally optimal solution
xt, into step 6;
Step 6:Student performance is carried out again " to learn ", concrete mode is by randomly selecting two students, contrasting it
Fitness value obtains size, the carry out study renewal small to fitness value for making fitness value big, and more new formula is such as shown in (7), formula
In:x′aAchievement after learning for student a;xaAchievement before learning for student a;xbAchievement before learning for student b.When learning
After the completion of journey, further with the achievement x of teachertContrasted, the renewal of solution is completed, into step 7;
x′a=xb+rand×|xa-xb| (7)
Step 7:It is the achievement x of teacher to globally optimal solution againtHill climbing maneuver is carried out, as shown in step 5, is entered again
The renewal of row globally optimal solution.Evaluation algorithm whether when iteration complete, after W iteration is met, algorithm terminate, now the overall situation most
Excellent solution xtFitness function value be required flatness error value, if algorithm fails to complete W iteration, this iteration is obtained
The globally optimal solution arrived brings next iteration process into as class teacher.
Compared with prior art, the present invention has the advantage that:
By setting up the minimum area method parametric equation of Flatness error evaluation, asking for flatness is more intuitively reflected
Mathematical modeling is solved, is a kind of general mathematical modeling, without the coordinate transformation process in computational geometry and measuring point preprocessing process
Etc. cumbersome modeling process, surveyed data can be sufficiently applied to, and be can apply among substantial amounts of measuring point data,
In algorithm application, the algorithm mutually introduces search by hill climbing strategy twice, entered on the basis of standard learning aid optimized algorithm
One step improves the precision of algorithm, and faster, solution procedure complies fully with the Minimum Area principle in international standard to convergence rate, because
This computational solution precision is higher.
Brief description of the drawings
Fig. 1 is the algorithm flow chart of the present invention;
Fig. 2 is the flatness error iterative curve map of the present invention.
Embodiment
In order to become apparent from the design and advantage of the specific expression present invention, following processes will be with reference to accompanying drawing to whole
The protocol procedures of evaluation are described in detail.
The invention provides a kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain, it is main include with
Lower content:
Step one:The tested flat elemental of tested part is determined, the plane survey of part is obtained by three coordinate measuring machine
Data point is Pi(xi, yi, zi) (i=1,2 ..., n);
Step 2:According to the lowest area principal of flatness error, with reference to any datum plane equation Z in space, such as formula
(1) shown in;Spatial point to plane range formula, such as shown in formula (2);Set up the mathematical modeling of flatness error, such as formula
(3) shown in.Wherein A, B are respectively the directioin parameter of datum plane, and C is the location parameter of plane, (xi, yi, zi) it is measuring point Pi's
Coordinate parameters, diFor measuring point PiTo datum plane equation Z distance, f is required flatness error, and obtains A, B, C tri- simultaneously
The value of parameter;
Z=Ax+By+C (1)
F=min (max (di)-min(di)) (3)
Step 3:Read measurement data Pi(xi, yi, zi) (i=1,2 ..., n), are brought into formula (3), and learning aid is calculated
The parameter of method is initialized, main to include initialization student X=(x1, x2..., xi), i=1,2 ..., N, wherein xiRepresent
Student i, N in class are student's quantity.For some student xi, there is x againi=(xi1, xi2..., xij), j=1,2 ..., D,
xijThe subject j, D for representing student's i are total subject, and optimal solution is xt, i.e. fitness value is optimal for class's teacher's achievement, religion
Iterations W, ramping constraint iterations w, into step 4 with learning optimized algorithm;
Step 4:The fitness function value of each student is calculated, and according to achievement of the formula (4), (5) and (6) to student
It is updated, in formula:X (i, j) ' is the achievement after student i subject j renewals;Before x (i, j) updates for student i subject j
Achievement;Rand is the random number between [0,1];xt(j) it is the subject j achievements of teacher;T is the teaching factor;X (j) is student section
Mesh j achievement;M (j) is j-th of section's purpose average achievement in class;Round is the bracket function rounded up.Teaching phase
After the completion of, by contrasting the quality of fitness value, the renewal of solution is completed, into step 5;
X (i, j) '=x (i, j)+rand × (xt(j)-tM(j)) (4)
T=round [1+rand (0,1)] (5)
Step 5:Using hill climbing, search by hill climbing is carried out again to each student, concrete mode is to exchange any two
Section's purpose achievement, then contrast exchanges the fitness before and after subject, selects smaller as after hill climbing maneuver of fitness value
Achievement is generated, this time iteration is needed w times, after the completion of iteration, and the replacement of student performance is carried out again, and records globally optimal solution
xt, into step 6;
Step 6:Student performance is carried out again " to learn ", concrete mode is by randomly selecting two students, contrasting it
Fitness value obtains size, the carry out study renewal small to fitness value for making fitness value big, and more new formula is such as shown in (7), formula
In:x′aAchievement after learning for student a;xaAchievement before learning for student a;xbAchievement before learning for student b.When learning
After the completion of journey, further with the achievement x of teachertContrasted, the renewal of solution is completed, into step 7;
x′a=xb+rand×|xa-xb| (7)
Step 7:It is the achievement x of teacher to globally optimal solution againtHill climbing maneuver is carried out, as shown in step 5, is entered again
The renewal of row globally optimal solution.Evaluation algorithm whether when iteration complete, after W iteration is met, algorithm terminate, now the overall situation most
Excellent solution xtFitness function value be required flatness error value, if algorithm fails to complete W iteration, this iteration is obtained
The globally optimal solution arrived brings next iteration process into as class teacher.Algorithm whole flow process is as shown in figure 1, algorithm iteration
Curve is as shown in Figure 2.
It is described above, it is only that the present invention teaches good embodiment, but protection scope of the present invention is not limited thereto,
Any one skilled in the art the invention discloses technical scope in, the variations and alternatives that can be readily occurred in,
It should all be included within the scope of the present invention, therefore, protection scope of the present invention should be with scope of the claims
It is defined.
Claims (1)
1. a kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain, it is characterised in that use following steps:
Step one:The tested flat elemental of tested part is determined, the plane survey data of part are obtained by three coordinate measuring machine
Point is Pi(xi, yi, zi) (i=1,2 ..., n);
Step 2:According to the lowest area principal of flatness error, with reference to any datum plane equation Z in space, such as formula (1) institute
Show;Spatial point to plane range formula, such as shown in formula (2);The mathematical modeling of flatness error is set up, such as formula (3) institute
Show.Wherein A, B are respectively the directioin parameter of datum plane, and C is the location parameter of plane, (xi, yi, zi) it is measuring point PiCoordinate
Parameter, diFor measuring point PiTo datum plane equation Z distance, f is required flatness error, and obtains A, B, tri- parameters of C simultaneously
Value;
Z=Ax+By+C (1)
F=min (max (di)-min(di)) (3)
Step 3:Read measurement data Pi(xi, yi, zi) (i=1,2 ..., n), bring into formula (3), to learning aid algorithm
Parameter is initialized, main to include initialization student X=(x1, x2..., xi), i=1, wherein 2 ..., N, xiRepresent class
In student i, N is student's quantity.For some student xi, there is x againi=(xi1, xi2..., xij), j=1,2 ..., D, xij
The subject j, D for representing student's i are total subject, and optimal solution is xt, i.e. fitness value is optimal for class's teacher's achievement, religion with
Learn the iterations W, ramping constraint iterations w, into step 4 of optimized algorithm;
Step 4:The fitness function value of each student is calculated, and the achievement of student is carried out according to formula (4), (5) and (6)
Update, in formula:X (i, j) ' is the achievement after student i subject j renewals;X (i, j) is the achievement before student i subject j renewals;
Rand is the random number between [0,1];xt(j) it is the subject j achievements of teacher;T is the teaching factor;X (j) is student's subject j's
Achievement;M (j) is j-th of section's purpose average achievement in class;Round is the bracket function rounded up.Teaching phase is completed
Afterwards, by contrasting the quality of fitness value, the renewal of solution is completed, into step 5;
X (i, j) '=x (i, j)+rand × (xt(j)-tM(j)) (4)
T=round [1+rand (0,1)] (5)
Step 5:Using hill climbing, search by hill climbing is carried out again to each student, concrete mode is to exchange any two subject
Achievement, then contrast exchange subject before and after fitness, selection the smaller student as after hill climbing maneuver of fitness value into
Achievement, this iteration is needed w times, after the completion of iteration, and the replacement of student performance is carried out again, and records globally optimal solution xt, enter
Enter step 6;
Step 6:Student performance is carried out again " to learn ", concrete mode is by randomly selecting two students, contrasting its adaptation
Angle value obtains size, the carry out study renewal small to fitness value for making fitness value big, and more new formula is such as shown in (7), in formula:
x′aAchievement after learning for student a;xaAchievement before learning for student a;xbAchievement before learning for student b.Work as learning process
After the completion of, further with the achievement x of teachertContrasted, the renewal of solution is completed, into step 7;
x′a=xb+rand×|xa-xb| (7)
Step 7:It is the achievement x of teacher to globally optimal solution againtHill climbing maneuver is carried out, as shown in step 5, is carried out again complete
The renewal of office's optimal solution.Whether evaluation algorithm is when iteration completion, and after W iteration is met, algorithm is terminated, now globally optimal solution
xtFitness function value be required flatness error value, if algorithm fails to complete W iteration, this iteration is obtained
Globally optimal solution brings next iteration process into as class teacher.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710387361.XA CN106971087A (en) | 2017-05-26 | 2017-05-26 | A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710387361.XA CN106971087A (en) | 2017-05-26 | 2017-05-26 | A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain |
Publications (1)
Publication Number | Publication Date |
---|---|
CN106971087A true CN106971087A (en) | 2017-07-21 |
Family
ID=59326767
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710387361.XA Pending CN106971087A (en) | 2017-05-26 | 2017-05-26 | A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106971087A (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108267106A (en) * | 2017-12-30 | 2018-07-10 | 唐哲敏 | A kind of Cylindricity error evaluation of fast steady letter |
CN108286957A (en) * | 2017-12-30 | 2018-07-17 | 唐哲敏 | A kind of Flatness error evaluation method of fast steady letter |
CN108319764A (en) * | 2018-01-15 | 2018-07-24 | 湖北汽车工业学院 | Evaluation method for spatial straightness errors method based on longicorn palpus searching algorithm |
CN108562258A (en) * | 2017-12-30 | 2018-09-21 | 唐哲敏 | A kind of maximum inscribed circle column diameter assessment method of fast steady letter |
CN111177645A (en) * | 2019-12-26 | 2020-05-19 | 哈尔滨工业大学 | Large-scale high-speed rotation equipment error mixed evaluation method based on large-scale point cloud data |
CN112665535A (en) * | 2020-12-04 | 2021-04-16 | 中冶天工集团有限公司 | Method for measuring wall surface flatness |
-
2017
- 2017-05-26 CN CN201710387361.XA patent/CN106971087A/en active Pending
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108267106A (en) * | 2017-12-30 | 2018-07-10 | 唐哲敏 | A kind of Cylindricity error evaluation of fast steady letter |
CN108286957A (en) * | 2017-12-30 | 2018-07-17 | 唐哲敏 | A kind of Flatness error evaluation method of fast steady letter |
CN108562258A (en) * | 2017-12-30 | 2018-09-21 | 唐哲敏 | A kind of maximum inscribed circle column diameter assessment method of fast steady letter |
CN108319764A (en) * | 2018-01-15 | 2018-07-24 | 湖北汽车工业学院 | Evaluation method for spatial straightness errors method based on longicorn palpus searching algorithm |
CN111177645A (en) * | 2019-12-26 | 2020-05-19 | 哈尔滨工业大学 | Large-scale high-speed rotation equipment error mixed evaluation method based on large-scale point cloud data |
CN111177645B (en) * | 2019-12-26 | 2023-08-29 | 哈尔滨工业大学 | Large-scale high-speed rotation equipment error hybrid assessment method based on large-scale point cloud data |
CN112665535A (en) * | 2020-12-04 | 2021-04-16 | 中冶天工集团有限公司 | Method for measuring wall surface flatness |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106971087A (en) | A kind of Flatness error evaluation method based on secondary learning aid algorithm of climbing the mountain | |
CN103247041B (en) | A kind of dividing method of the cloud data of the many geometric properties based on local sampling | |
CN105550199A (en) | Point position clustering method and point position clustering apparatus based on multi-source map | |
CN106289257A (en) | Indoor orientation method and alignment system | |
US20100063784A1 (en) | System and method for fitting feature elements using a point-cloud of an object | |
CN104007479B (en) | A kind of Ionospheric Tomography based on multiple dimensioned subdivision and Ionospheric delay correcting method | |
US8942172B2 (en) | Method for positioning mobile device in wireless wide area network | |
CN109948002A (en) | The nearest wall surface of unstrctured grid based on balance KD tree is apart from method for solving | |
US11887254B2 (en) | Methods for correcting and encrypting space coordinates of three-dimensional model | |
US9749873B1 (en) | Estimation devices and methods for estimating communication quality of wireless network and method for installing meters thereof | |
CN104573393A (en) | Soil moisture site data upscaling method based on Bayesian theory | |
CN107220497A (en) | A kind of Circularity error evaluation method based on packet learning aid algorithm | |
CN106960102A (en) | A kind of space linearity assessment method based on secondary glowworm swarm algorithm of climbing the mountain | |
CN105389469A (en) | Automatic calibration method of storm water management model parameters | |
CN107492120A (en) | Point cloud registration method | |
CN107919983A (en) | A kind of space information network Effectiveness Evaluation System and method based on data mining | |
CN105825430A (en) | Heterogeneous social network-based detection method | |
Agarwal et al. | Survey of geodetic mapping methods: Geodetic approaches to mapping and the relationship to graph-based slam | |
CN104363649A (en) | UKF (unscented Kalman filter)-based WSN (wireless sensor network) node location method with constraint conditions | |
CN111190211A (en) | GPS failure position prediction positioning method | |
CN105225272A (en) | A kind of tri-dimensional entity modelling method based on the reconstruct of many outline lines triangulation network | |
CN115688607A (en) | Band-shaped cross-sea quasi-geoid refinement method based on multi-channel spectrum combination | |
CN110110406B (en) | Slope stability prediction method for achieving LS-SVM model based on Excel computing platform | |
CN104424276A (en) | Method and device for self-updating fingerprint database based on manifold learning | |
CN103678899B (en) | A kind of oil-gas reservoir multi-point statistic modeling method based on variable effect ratio and equipment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
DD01 | Delivery of document by public notice |
Addressee: Yang Yang Document name: Notification of before Expiration of Request of Examination as to Substance |
|
DD01 | Delivery of document by public notice | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170721 |
|
WD01 | Invention patent application deemed withdrawn after publication |