CN101957611A - Spline real-time interpolation method - Google Patents

Spline real-time interpolation method Download PDF

Info

Publication number
CN101957611A
CN101957611A CN 200910012583 CN200910012583A CN101957611A CN 101957611 A CN101957611 A CN 101957611A CN 200910012583 CN200910012583 CN 200910012583 CN 200910012583 A CN200910012583 A CN 200910012583A CN 101957611 A CN101957611 A CN 101957611A
Authority
CN
China
Prior art keywords
speed
constraint
point
acceleration
catastrophe
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN 200910012583
Other languages
Chinese (zh)
Other versions
CN101957611B (en
Inventor
林浒
于东
孙玉娥
李建伟
张晓辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenyang Institute of Computing Technology of CAS
Original Assignee
SHENYANG HIGH-END COMPUTER NUMERICAL CONTROL TECHNOLOGY Co Ltd
Shenyang Institute of Computing Technology of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SHENYANG HIGH-END COMPUTER NUMERICAL CONTROL TECHNOLOGY Co Ltd, Shenyang Institute of Computing Technology of CAS filed Critical SHENYANG HIGH-END COMPUTER NUMERICAL CONTROL TECHNOLOGY Co Ltd
Priority to CN 200910012583 priority Critical patent/CN101957611B/en
Publication of CN101957611A publication Critical patent/CN101957611A/en
Application granted granted Critical
Publication of CN101957611B publication Critical patent/CN101957611B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Numerical Control (AREA)

Abstract

The invention relates to a spline real-time interpolation method which comprises the following steps: carrying out the spline segment preprocessing on a processing program to obtain the curve length and catastrophe point information; carrying out speed planning according to the curve length and the catastrophe point information to obtain the processing speed; according to the obtained processing speed to calculate the coordinates of the next point, and outputting the coordinates to a servo control device, wherein the spline segment preprocessing is as follows: an input processing program: setting the initial speed of the current curve segment; according to the error restraining, accelerated speed restraining and jerk restraining, planning the current speed; if the planned current speed is a catastrophe point, adding the catastrophe point into a catastrophe group; working out the coordinates of the next interpolation point; if the program is ended, outputting the processed result to a real-time interpolation module, and reading in the next segment of the processing program; and returning to the step of setting the initial speed of the current program segment. The invention can ensure that each interpolation period can output one reliable interpolation point in real time, and can obtain a speed-down point with high precision, has good interactivity and can response the trimming operation in real time.

Description

SPL real-time interpolation method
Technical field
The present invention relates to the velocity process technology of digital control system, specifically a kind of SPL real-time interpolation method.
Background technology
In commercial CAD/CAM (computer-aided design/computer-aidedmanufacturing, CAD (computer aided design) and computer are auxiliary to be made) software, the free type curve and surface is represented by batten.But the development of CNC (Computer numerical control, computer numerical control (CNC)) system will lag behind CAD/CAM system, and traditional CNC system only possesses circular arc and linear interpolation function, has limited the further raising of numerical control (NC) Machining Accuracy and efficient.In order to overcome the drawback that traditional straight line, circular interpolation bring, need in numerical control device, directly carry out interpolation and calculate the SPL of CAD/CAM device output.
Compare with little line segment, the shape of SPL is more complicated, and its curvature is constantly to change, and has the curvature point of discontinuity, and this has just brought a lot of problems to speed planning.At first, deceleration point is difficult to accurate Calculation.When little line segment was carried out speed planning, we generally obtained the total length when preplanning section path earlier, carry out speed planning according to residual paths length then, obtain deceleration point.When SPL is carried out real-time interpolation, be to go to approach original SPL with actual step size, the path that different approach methods calculates is also different, and concrete approach method is relevant with speed planning, therefore is difficult to accurately obtain the deceleration point position.In the speed planning process, at first obtain the maximum speed value that allows under the current curvature simultaneously, adjust according to the acceleration and deceleration ability of lathe then according to machining precision at each interpolated point.But have the catastrophe point (curvature discrete point) of curvature in the SPL, this has also just caused the speed of being asked to undergo mutation.Adopt pretreated method can obtain the catastrophe point of speed and acceleration in advance, and cook up rate curve.But repair in process when transferring operation, the rate curve that can cause cooking up lost efficacy, and need recomputate, demand that can not the real-time response user.Adopt the method for real time forward looking real-time response to repair operations such as accent, but because the SPL calculated amount is big, the speed planning complexity, all calculating are finished by real time forward looking fully, are difficult to requirement of real time.
In recent years, existing both at home and abroad a large amount of relevant theoretical researches and obtained bigger progress.The real-time interpolation technology of SPL has experienced constant speed of feed, has regulated this several stages of speed of feed and pre-service automatically.The problem of being considered also expands to the actual acceleration and deceleration ability of lathe from initial working (machining) efficiency, precision.But these algorithms exist calculated amount big, are difficult to requirement of real time, and deceleration point calculates the problem such as accent of repairing not accurate enough and that occur in the processing process in real time, therefore can not be grafted directly to have now in the digital control system.
Summary of the invention
At above shortcomings part in the prior art, the technical problem to be solved in the present invention provides a kind of SPL real-time interpolation algorithm that can realize speed smooth transition, guaranteeing the even running of each kinematic axis, thereby satisfies the requirement of flexibility processing.
For solving the problems of the technologies described above, the technical solution used in the present invention is:
A kind of SPL real-time interpolation of the present invention method may further comprise the steps:
SPL section pre-service: job sequence is carried out the pre-service of SPL section, obtain length of curve and catastrophe point information;
Real time forward looking: carry out speed planning according to above-mentioned length of curve and catastrophe point information, obtain process velocity;
Interpolation is calculated: calculate next point coordinate according to the process velocity that obtains, export Servocontrol device to.
Describedly job sequence is carried out the pre-service of SPL section may further comprise the steps:
Import job sequence, the initial velocity of current curves section is set;
According to error constraint, acceleration constraint and acceleration constraint planning present speed;
Is the present speed of judging planning a catastrophe point?
If catastrophe point then adds the catastrophe point array with this catastrophe point;
Obtain next interpolated point coordinate;
Judge whether the current curves section finishes;
As finishing, export result to the real-time interpolation module, and read in next section of job sequence;
Return the initial velocity step that the present procedure section is set.
Described real time forward looking may further comprise the steps:
The initial velocity of processing is set;
According to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed to constraint of velocity condition calculating processing;
Ask down some positions according to constraint speed;
According to being programmed into to Velocity Updating catastrophe point array;
Whether the residual paths length under judging between some positions and all catastrophe points is all greater than required deceleration distance;
, then reduce speed now, and recomputate present speed for not as above-mentioned judged result from current point;
Export present speed to the interpolation calculation procedure, and go to according to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed step to constraint of velocity condition calculating processing.
Whether the residual paths length under judging between some positions and all catastrophe points all may further comprise the steps greater than required deceleration distance:
From the catastrophe point array, take out catastrophe point successively;
The length of curve information calculations that obtains according to pre-service from some positions down to the distance of this catastrophe point;
Judge successively that according to following any acceleration and the acceleration of speed, catastrophe point and speed whether the residual paths length between some positions and catastrophe point is greater than required deceleration distance down.
If the residual paths length between some positions and all catastrophe points is all greater than required deceleration distance, then continuing exports present speed to the interpolation calculation procedure, and goes to according to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed step to constraint of velocity condition calculating processing.
If the current curves section does not finish, then go to according to error constraint, acceleration constraint and acceleration constraint planning present speed step.
If not catastrophe point, then directly enter and obtain next interpolated point coordinate step.
The present invention has following beneficial effect and advantage:
1. real-time is good.In conjunction with prediction and pretreated advantage, adopt the implementation of pre-service+prediction, calculated amount is repaiied the work of transferring operating influence greatly and not to be placed on pre-service and to finish, thereby reduced the calculated amount of real time forward looking, make the prediction hop count long enough in each cycle, can guarantee each interpolation cycle reliable interpolated point of output in real time.
2. ask deceleration point precision height.Employing avoids technology such as deviation accumulation and real time forward looking to make the position of the deceleration point of asking more accurate, can not occur not satisfying the phenomenon of machining precision because of deceleration distance causes part point inadequately.
3. interaction is good, can real-time response repair the accent operation.
Description of drawings
Fig. 1 is the inventive method process flow diagram;
Curvature point of discontinuity example in Fig. 2 SPL;
Fig. 3 is a batten pretreatment module process flow diagram;
Fig. 4 real-time interpolation module process flow diagram;
Fig. 5 curve exemplary plot to be processed;
The accelerating curve of Fig. 6 expectation;
Fig. 7 (a)~7 (d) is for to decelerate to the speed of catastrophe point, possible transient mode ()~(four) of acceleration from present speed, acceleration;
Fig. 8 processes the exemplar diagrammatic sketch;
The graph of errors design sketch of Fig. 9 the inventive method;
The rate curve design sketch of Figure 10 the inventive method;
The acceleration plots of Figure 11 the inventive method;
The accelerating curve part amplification effect figure of Figure 12 the inventive method.
Embodiment
Below in conjunction with accompanying drawing the present invention is described in further detail.
The inventive method may further comprise the steps:
SPL section pre-service: job sequence is carried out the pre-service of SPL section, obtain length of curve and catastrophe point information;
Real time forward looking: carry out speed planning according to above-mentioned length of curve and catastrophe point information, obtain process velocity;
Interpolation is calculated: calculate next point coordinate according to the process velocity that obtains, export Servocontrol device to.
As shown in Figure 1, in the present embodiment, the job sequence of exporting from the CAD/CAM device at first enters the interpreter of numerical control device, interpreter is divided into job sequence to be explained and SPL section pre-service two parts, it makes an explanation and pre-service to job sequence, and will handle data well and issue motion controller by shared buffer memory.Motion controller is real-time, and it carries out each interpolation cycle speed planning and calculate next interpolated point coordinate by real time forward looking and interpolation calculating, at last this coordinate is sent to servomechanism installation, the drive motor motion.
With reference to shown in Figure 2, there be the curvature discrete point in the SPL, and when curved transition is too fast, the point of lathe slowing down power(SDP) also can occur exceeding.In order to guarantee that actual to add man-hour be continuous at these acceleration, need these points be noted at SPL section pretreatment stage.
The pretreated system flowchart of SPL section describedly carries out the pre-service of SPL section to job sequence and may further comprise the steps as shown in Figure 3:
S1: import job sequence, the initial velocity of current curves section is set;
S2: according to error constraint, acceleration constraint and acceleration constraint planning present speed;
Is S3: the present speed of judging planning a catastrophe point? if catastrophe point then adds the catastrophe point array with this catastrophe point;
S4: obtain next interpolated point coordinate;
S5: judge whether the current curves section finishes;
S6: as finishing, export result to the real-time interpolation module, and read in next section of job sequence, return the initial velocity step that the present procedure section is set.
Because SPL is segmentation, and the catastrophe point of curvature is present in segmentation link place mostly, and for fear of owing to repair pre-service that operation such as accent causes Problem of Failure as a result, we regard SPL as segmentation independently when pre-service.
In each segmentation starting point, step S1 thinks that initial velocity is the maximal rate that a last segmentation last point error allows.If ER is (u i), ρ (u i) and V (u i) be respectively interpolated point u iBow high level error, radius-of-curvature and the speed at place, T sBe the interpolation cycle of lathe, the bow high level error maximal value of ER for allowing, J MaxBe the maximum acceleration that allows, A MaxBe the peak acceleration that allows.u iThe maximal rate V that place's error, peak acceleration, acceleration allow e(u i), V a(u i) and V j(u i) be respectively:
The error constraint formulations: V e ( u i ) = 2 T s 2 ρ ( u i ) ER - ER 2 - - - ( 1 )
Acceleration constraint formulations: V a(u i)=V (u I-1)+A MaxT s(2)
Acceleration constraint formulations: V j(u i)=V (u I-1)+(a (u I-1)+J MaxT s) T s(3)
When step S2 asks constraint speed according to above-mentioned each formula, not consider to be programmed into to constraint of velocity, present speed is V (u i)=min (V e(u i), V a(u i), V j(u i)).Note the knot vector of this point simultaneously, acceleration, speed and starting point are to the cumulative path length of this point.Step S3 is judged to be catastrophe point with the point that meets the following conditions simultaneously: 1) speed of obtaining according to constraint conditions such as machining precision, peak acceleration, accelerations is got minimum value as current spot speed, and this speed is compared the lathe acceleration and deceleration ability that exceeds with last spot speed; 2) current spot speed needs to slow down less than last spot speed.If current interpolated point is catastrophe point, the nodal information that will put then, information such as speed, acceleration record in another array, press the interpolation successively in the catastrophe point array of interpolation order.
Described real time forward looking may further comprise the steps:
P1: the initial velocity that processing is set; According to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed to constraint of velocity condition calculating processing;
P2: ask down some positions according to constraint speed;
P3: according to being programmed into to Velocity Updating catastrophe point array;
P4: whether the residual paths length under judging between some positions and all catastrophe points is all greater than required deceleration distance;
P5: for not, then reduce speed now, and recomputate present speed from current point as above-mentioned judged result;
P6: export present speed to the interpolation calculation procedure, and go to according to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed step to constraint of velocity condition calculating processing.
Real time forward looking carries out accurate speed planning according to the information that pre-service is noted, as shown in Figure 4, it is 0 that initial velocity is set, and supposes that the programming speed of feed is F, and each cycle is at first calculated constraint speed V (u according to constraint conditions such as error, programming speed of feed, peak acceleration, accelerations i)=min (F, V e(u i), V a(u i), V j(u i)), and obtain down some position P according to this speed I+1
Owing in real time forward looking, will limit real-time interpolation speed according to the programming speed of feed, can produce new catastrophe point, therefore need in step P3, upgrade the catastrophe point array, promptly increase new catastrophe point.Because this catastrophe point only may be near the maximum point of speed can be occurred, so the specific implementation method is: remember first point that surpasses the speed of feed of programme for going into a little, last surpasses the point of the speed of feed of programming for going out a little.The acceleration of going into a little and going out a little is made as zero, and speed is made as the programming speed of feed.If the acceleration change amount absolute value of going into a little or go out next one point a little is greater than J MaxT then joins it in catastrophe point array.
Step P4 judges P I+1Whether the residual paths length between all catastrophe points on point and the prediction segment of curve satisfies required deceleration distance, and concrete decision method is as follows:
At first calculate required deceleration distance, suppose that Fig. 5 is one section SPL to be processed, wherein u iA catastrophe point that obtains when being the pre-service of SPL section, its next interpolated point acceleration is a I+1, u jBe sampled point u iDeceleration point, its previous interpolated point acceleration is a J-1Realize the continuity of whole process acceleration, as shown in Figure 6, need to guarantee that braking section starting point and terminal point acceleration all are continuous.Therefore be to judge whether what needs slowed down at step P2 according to the speed and required minimum process path and the relation between the residual paths length between them of acceleration that carry out the transition to catastrophe point from current speed and acceleration.The computing method of required minimum process path are as follows:
Suppose that present speed is V i, acceleration is a i, the required speed of catastrophe point is V j, acceleration is a jMay there be four kinds of transient modes shown in Fig. 7 (a)~(d) in the speed and the acceleration that carry out the transition to catastrophe point from current speed and acceleration.If catastrophe point is the acceleration catastrophe point shown in Fig. 7 (a), from V iCarry out the transition to V jRequired apart from S and time t is:
S = V i t + 1 2 a i t 2 - 1 6 J max t 3 - - - ( 4 )
t = a i - a j J max - - - ( 5 )
If carry out the transition to the catastrophe point accelerating curve shown in Fig. 7 (b), from V from current point iCarry out the transition to V jRequired apart from S and time t is:
S = V i t + 1 2 a i t 2 + 1 6 J max t 3 - - - ( 6 )
t = a j - a i J max - - - ( 7 )
If bigger, there are Fig. 7 (c) and two kinds of situations of Fig. 7 (d) when then slowing down from the velocity variations of this catastrophe point and current point.At first existence is with acceleration-A MaxEven situation of slowing down, in order to guarantee the continuity of acceleration, whole moderating process is divided into acceleration and is-J MaxChange acceleration, acceleration be-A MaxEven acceleration and acceleration are J MaxThe change accelerator.Wherein acceleration is-J MaxThe displacement S1 of change boost phase, terminal velocity V 1With time t 1Be respectively:
S 1 = V i t 1 + 1 2 a i t 1 2 - 1 6 J max t 1 3 - - - ( 8 )
V 1 = V i + a i t 1 - 1 2 J max t 1 2 - - - ( 9 )
t 1 = a i + A max J max - - - ( 10 )
Acceleration is-A MaxThe displacement S of even boost phase 2With terminal velocity V 2Be respectively:
S 2 = V 1 t 2 - 1 2 A max t 2 2 - - - ( 11 )
V 2=V 1-A maxt 2 (12)
Acceleration is J MaxThe displacement S of change boost phase 3With this duration in stage t 3For:
S 3 = V 2 t 3 - 1 2 A max t 3 2 + 1 6 J max t 3 3 - - - ( 13 )
t 3 = a j + A max J max - - - ( 14 )
The speed increment sum in each stage satisfies following relational expression:
a i t 1 - 1 2 J max t 1 2 - A max t 2 - A max t 3 + 1 2 J max t 3 2 = V j - V i - - - ( 15 )
Therefore can get the time t of subordinate phase 2:
t 2 = ( a i t 1 - 1 2 J max t 1 2 - A max t 3 + 1 2 J max t 3 2 - V j + V i ) / A max - - - ( 13 )
The required total displacement S that slows down equals:
S=S 1+S 2+S 3 (16)
Shown in Fig. 7 (d), when there not being acceleration-A MaxWhen sparing braking section, suppose that it is a that the phase one finishes the brief acceleration value p, then above-mentioned formula should be rewritten as:
t 1 = a i - a p J max - - - ( 17 )
S 2 = V 1 t 2 + 1 2 a p t 2 2 + 1 6 J max t 2 3 - - - ( 18 )
t 2 = a j - a p J max - - - ( 19 )
a p = a i 2 + a j 2 - 2 J max ( V j - V i ) 2 ± - - - ( 20 )
S=S 1+S 2 (21)
After obtaining the required minimum process path of the speed that carries out the transition to all catastrophe points from the speed and the acceleration of current point and acceleration respectively, if find to exist current point to the residual paths length between any catastrophe point less than required deceleration distance, then proof need reduce speed now from the i cycle; Otherwise, according to the speed operation of step P1 planning.The speed well of will planning is at last issued the interpolation computing module, calculates the position of next interpolated point, issues servomechanism installation, the drive motor motion.
The inventive method is in conjunction with the advantage of pre-service and real time forward looking, adopt pre-service to add the method for prediction, with calculated amount greatly but do not repaiied and transfer the data influence to be placed in the pre-service to calculate, real time forward looking carries out accurate speed planning according to the data that pre-service calculates, and repaiies the requirement of transferring operation to satisfy real-time and real-time response simultaneously.The path information of each interpolated point of noting when real time forward looking is according to pre-service is simultaneously dynamically revised the residual paths length between current point and the catastrophe point, can effectively avoid the generation of cumulative errors, improves the precision of the deceleration point of asking.
Because SPL is segmentation, and the catastrophe point of curvature is present in segmentation link place mostly, for fear of owing to repair and transfer pre-service that operation causes Problem of Failure as a result, when pre-service, regard SPL as segmentation independently, and think that the initial velocity of each section is the maximal rate that a last segmentation last point error allows.When needing deceleration like this and exceeding lathe acceleration and deceleration ability, this point is noted as the velocity jump point; If need to quicken, then upwards quicken according to the actual acceleration and deceleration ability of lathe.The path of obtaining is so neither repaiied the accent operating influence, again closing to reality machining path length as much as possible.
As can be seen from the above, pretreated purpose is not to cook up actual rate curve, and required catastrophe point information of knowing and comparatively accurate path are convenient to carry out speed planning when just calculating real-time interpolation in real time forward looking.At each interpolation cycle of real time forward looking module, retrain the speed V that obtains current interpolation cycle according to machining precision and acceleration, acceleration i, to guarantee the continuity of acceleration.
Suppose prediction k section SPL, think that then the terminal velocity of k section curve is 0.Judgement is from location point P I+1And whether the residual paths length between all catastrophe points and the k section End of Curve satisfies required deceleration distance, needs i cycle to reduce speed now if the residual paths length that has any point-to-point transmission less than required deceleration distance, then proves; Otherwise the speed operation according to obtaining above enters next interpolation cycle.
Because path that pre-service is asked less than actual path length, though can guarantee can not occur the not enough problem of deceleration distance, may enter deceleration area too early.In order to reduce the negative effect of slowing down in advance and bringing to working (machining) efficiency, the accumulative total routing information of each interpolated point that the prediction stage preserves during according to pre-service calculates the residual paths of current point, can eliminate the cumulative errors of machining path.Like this in the actual problem and of just can in time finding man-hour to slow down too early that adds to its dynamic correction.
The test of the inventive method is at the three-axis numerical control milling machine, and representative workpiece test procedure finishes by processing.Equipment therefor adopts encoder feedback, forms closed-loop control system, drives AC servo motor.The major parameter of device is as follows:
Digital control system: CPU Pentium M-1.6GHz, RAM-512M, HD-40G, I/O-32/24, scrambler input-4, D/A output-4, demonstration-10.4 " Color Liquid Crystal Display; Servo and the motor of peace river ∑-2;
Feed rate F=24m/min; Peak acceleration A Max=5000m/s 2Maximum acceleration J Max=500m/s 3Interpolation cycle T=1ms; Profile errors E Max=0.000001m.
The inventive method and implement device Evaluation on effect serve as the evaluation and test foundation to process curve shown in Figure 8.And adopt the inventive method and implement device, graph of errors as shown in Figure 9, the speed planning curve as shown in figure 10, accelerating curve and part enlarged drawing are as shown in figure 11.From above-mentioned processing effect figure, can see:
1. described spline interpolation method can satisfy the requirement of machining precision, has handled the velocity jump point preferably, has solved because the part point machining precision that deceleration distance causes inadequately exceeds the problem of permissible value;
2. promptly shown in Figure 12 as the part enlarged drawing of accelerating curve among Figure 11, described method adopts the method for eliminating cumulative errors to improve the deceleration point precision of asking, and when finding to enter deceleration area in advance, can constantly in time revise present speed;
3. the accelerating curve that described method obtains is continuous substantially, and rate curve is level and smooth.

Claims (7)

1. SPL real-time interpolation method is characterized in that may further comprise the steps:
SPL section pre-service: job sequence is carried out the pre-service of SPL section, obtain length of curve and catastrophe point information;
Real time forward looking: carry out speed planning according to above-mentioned length of curve and catastrophe point information, obtain process velocity;
Interpolation is calculated: calculate next point coordinate according to the process velocity that obtains, export Servocontrol device to.
2. by the described SPL real-time interpolation of claim 1 method, it is characterized in that: describedly job sequence is carried out the pre-service of SPL section may further comprise the steps:
Import job sequence, the initial velocity of current curves section is set;
According to error constraint, acceleration constraint and acceleration constraint planning present speed;
Is the present speed of judging planning a catastrophe point?
If catastrophe point then adds the catastrophe point array with this catastrophe point;
Obtain next interpolated point coordinate;
Judge whether the current curves section finishes;
As finishing, export result to the real-time interpolation module, and read in next section of job sequence;
Return the initial velocity step that the present procedure section is set.
3. by the described SPL real-time interpolation of claim 2 method, it is characterized in that: described real time forward looking may further comprise the steps:
The initial velocity of processing is set;
According to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed to constraint of velocity condition calculating processing;
Ask down some positions according to constraint speed;
According to being programmed into to Velocity Updating catastrophe point array;
Whether the residual paths length under judging between some positions and all catastrophe points is all greater than required deceleration distance;
, then reduce speed now, and recomputate present speed for not as above-mentioned judged result from current point;
Export present speed to the interpolation calculation procedure, and go to according to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed step to constraint of velocity condition calculating processing.
4. by the described SPL real-time interpolation of claim 3 method, it is characterized in that: whether the residual paths length under judging between some positions and all catastrophe points all may further comprise the steps greater than required deceleration distance:
From the catastrophe point array, take out catastrophe point successively;
The length of curve information calculations that obtains according to pre-service from some positions down to the distance of this catastrophe point;
Judge successively that according to following any acceleration and the acceleration of speed, catastrophe point and speed whether the residual paths length between some positions and catastrophe point is greater than required deceleration distance down.
5. by the described SPL real-time interpolation of claim 3 method, it is characterized in that: if the residual paths length between some positions and all catastrophe points is all greater than required deceleration distance, then continuing exports present speed to the interpolation calculation procedure, and goes to according to error constraint, acceleration constraint, acceleration constraint and be programmed into constraint speed step to constraint of velocity condition calculating processing.
6. by the described SPL real-time interpolation of claim 2 method, it is characterized in that:, then go to according to error constraint, acceleration constraint and acceleration constraint planning present speed step if the current curves section does not finish.
7. by the described SPL real-time interpolation of claim 2 method, it is characterized in that:, then directly enter and obtain next interpolated point coordinate step if not catastrophe point.
CN 200910012583 2009-07-16 2009-07-16 Spline real-time interpolation method Active CN101957611B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200910012583 CN101957611B (en) 2009-07-16 2009-07-16 Spline real-time interpolation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910012583 CN101957611B (en) 2009-07-16 2009-07-16 Spline real-time interpolation method

Publications (2)

Publication Number Publication Date
CN101957611A true CN101957611A (en) 2011-01-26
CN101957611B CN101957611B (en) 2012-05-23

Family

ID=43484989

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910012583 Active CN101957611B (en) 2009-07-16 2009-07-16 Spline real-time interpolation method

Country Status (1)

Country Link
CN (1) CN101957611B (en)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102419570A (en) * 2011-09-29 2012-04-18 上海大学 Acceleration and deceleration look-ahead control method for high-speed machining of numerical control machine tool
CN102707671A (en) * 2012-05-29 2012-10-03 苏州新代数控设备有限公司 Processing path optimization method applied to machine tool
CN102749888A (en) * 2012-06-29 2012-10-24 上海三一精机有限公司 Real-time trimming method of feeding speed
CN103699056A (en) * 2013-12-02 2014-04-02 嘉兴学院 Real-time smooth transition interpolation method of small high-speed and high-accuracy numerical control machining line segment
CN103760827A (en) * 2014-01-10 2014-04-30 大连理工大学 Saltus constrained off-line planning method for numerical control machining feed rate
CN103809521A (en) * 2012-11-14 2014-05-21 中国科学院沈阳计算技术研究所有限公司 Spline curve interpolation method based on secant method
CN103984285A (en) * 2014-05-27 2014-08-13 大连理工大学 Multi-constraint five-shaft machining feeding rate setting method
TWI493305B (en) * 2013-12-27 2015-07-21 Metal Ind Res & Dev Ct Machining Curve Setting and Displaying Method of Graphic Interface of Servo Punch
CN105785909A (en) * 2014-12-25 2016-07-20 沈阳高精数控智能技术股份有限公司 High-speed high-precision path dynamic forward-looking planning method
CN106681275A (en) * 2015-11-05 2017-05-17 中国科学院沈阳计算技术研究所有限公司 Prospective prefetching method of numerical control processing program segment
CN106695787A (en) * 2016-12-17 2017-05-24 上海新时达电气股份有限公司 Speed planning method
CN108279644A (en) * 2018-02-02 2018-07-13 上海维宏电子科技股份有限公司 Linear interpolation control method based on superposition instruction
WO2018205248A1 (en) * 2017-05-12 2018-11-15 深圳配天智能技术研究院有限公司 Spline path interpolation method and relevant device
CN109416529A (en) * 2017-12-19 2019-03-01 深圳配天智能技术研究院有限公司 Digital control system, the device with store function and nurbs curve interpolating method
CN109623820A (en) * 2018-12-25 2019-04-16 哈工大机器人(合肥)国际创新研究院 A kind of robot space tracking transition method
CN109765851A (en) * 2019-02-15 2019-05-17 大族激光科技产业集团股份有限公司 Speed calculation method, device, storage medium and the computer equipment of track movement
CN109976253A (en) * 2017-12-27 2019-07-05 核动力运行研究所 A kind of multi-spindle machining motion trail planning method based on the control of prompt degree
CN110703696A (en) * 2019-10-14 2020-01-17 杭州电子科技大学 High-speed feeding acceleration and deceleration method of seven-segment jump linear continuous numerical control device
CN111687838A (en) * 2020-05-29 2020-09-22 深圳科瑞技术股份有限公司 Online compensation method and system for manipulator track following error and storage medium
CN112379638A (en) * 2020-10-22 2021-02-19 哈尔滨工程大学 Spline curve interpolation method based on finite impulse response filtering

Cited By (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102419570B (en) * 2011-09-29 2013-10-16 上海大学 Acceleration and deceleration look-ahead control method for high-speed machining of numerical control machine tool
CN102419570A (en) * 2011-09-29 2012-04-18 上海大学 Acceleration and deceleration look-ahead control method for high-speed machining of numerical control machine tool
CN102707671A (en) * 2012-05-29 2012-10-03 苏州新代数控设备有限公司 Processing path optimization method applied to machine tool
CN102749888A (en) * 2012-06-29 2012-10-24 上海三一精机有限公司 Real-time trimming method of feeding speed
CN103809521A (en) * 2012-11-14 2014-05-21 中国科学院沈阳计算技术研究所有限公司 Spline curve interpolation method based on secant method
CN103699056A (en) * 2013-12-02 2014-04-02 嘉兴学院 Real-time smooth transition interpolation method of small high-speed and high-accuracy numerical control machining line segment
CN103699056B (en) * 2013-12-02 2016-06-01 嘉兴学院 The little line segment real-time smooth transition interpolation method of high-speed, high precision digital control processing
TWI493305B (en) * 2013-12-27 2015-07-21 Metal Ind Res & Dev Ct Machining Curve Setting and Displaying Method of Graphic Interface of Servo Punch
CN103760827B (en) * 2014-01-10 2016-08-17 大连理工大学 The off-line planning method of the digital control processing feed rate of jerk constraint
CN103760827A (en) * 2014-01-10 2014-04-30 大连理工大学 Saltus constrained off-line planning method for numerical control machining feed rate
CN103984285A (en) * 2014-05-27 2014-08-13 大连理工大学 Multi-constraint five-shaft machining feeding rate setting method
CN105785909B (en) * 2014-12-25 2018-06-19 沈阳高精数控智能技术股份有限公司 A kind of path dynamic prediction planing method of high speed and super precision
CN105785909A (en) * 2014-12-25 2016-07-20 沈阳高精数控智能技术股份有限公司 High-speed high-precision path dynamic forward-looking planning method
CN106681275B (en) * 2015-11-05 2019-04-09 中国科学院沈阳计算技术研究所有限公司 A kind of prediction forecasting method of nc program section
CN106681275A (en) * 2015-11-05 2017-05-17 中国科学院沈阳计算技术研究所有限公司 Prospective prefetching method of numerical control processing program segment
CN106695787A (en) * 2016-12-17 2017-05-24 上海新时达电气股份有限公司 Speed planning method
WO2018205248A1 (en) * 2017-05-12 2018-11-15 深圳配天智能技术研究院有限公司 Spline path interpolation method and relevant device
CN109564417A (en) * 2017-05-12 2019-04-02 深圳配天智能技术研究院有限公司 The interpolating method and relevant device of Spline Path
CN109564417B (en) * 2017-05-12 2021-07-09 深圳配天智能技术研究院有限公司 Spline path interpolation method and related equipment
CN109416529A (en) * 2017-12-19 2019-03-01 深圳配天智能技术研究院有限公司 Digital control system, the device with store function and nurbs curve interpolating method
CN109976253A (en) * 2017-12-27 2019-07-05 核动力运行研究所 A kind of multi-spindle machining motion trail planning method based on the control of prompt degree
CN108279644A (en) * 2018-02-02 2018-07-13 上海维宏电子科技股份有限公司 Linear interpolation control method based on superposition instruction
CN109623820A (en) * 2018-12-25 2019-04-16 哈工大机器人(合肥)国际创新研究院 A kind of robot space tracking transition method
CN109623820B (en) * 2018-12-25 2021-09-14 哈工大机器人(合肥)国际创新研究院 Robot space trajectory transition method
CN109765851B (en) * 2019-02-15 2021-02-05 大族激光科技产业集团股份有限公司 Method and device for calculating speed of track motion, storage medium and computer equipment
CN109765851A (en) * 2019-02-15 2019-05-17 大族激光科技产业集团股份有限公司 Speed calculation method, device, storage medium and the computer equipment of track movement
CN110703696A (en) * 2019-10-14 2020-01-17 杭州电子科技大学 High-speed feeding acceleration and deceleration method of seven-segment jump linear continuous numerical control device
CN111687838A (en) * 2020-05-29 2020-09-22 深圳科瑞技术股份有限公司 Online compensation method and system for manipulator track following error and storage medium
CN111687838B (en) * 2020-05-29 2023-10-13 深圳科瑞技术股份有限公司 Online compensation method, system and storage medium for track following error of manipulator
CN112379638A (en) * 2020-10-22 2021-02-19 哈尔滨工程大学 Spline curve interpolation method based on finite impulse response filtering
CN112379638B (en) * 2020-10-22 2021-08-10 哈尔滨工程大学 Spline curve interpolation method based on finite impulse response filtering

Also Published As

Publication number Publication date
CN101957611B (en) 2012-05-23

Similar Documents

Publication Publication Date Title
CN101957611B (en) Spline real-time interpolation method
CN102147600B (en) Numerical control interpolation system for real-time generation of curvature-continuous path
CN103699056B (en) The little line segment real-time smooth transition interpolation method of high-speed, high precision digital control processing
CN104615084B (en) Machining feed speed optimized tool path curve contour error compensation method
CN103123477B (en) Shaft motion control method based on double feedbacks of motor and machine tool location
CN110471368A (en) A kind of prediction interpolating method that High Speed NC Machine Tools process velocity is adaptive
US5953233A (en) Process of generating discrete points defining cutter path, so as to meet selected workpiece machining requirements
CN107160394A (en) One kind linear motion module accuracy control method
KR20130071486A (en) Method and device for generating tool path
CN104281099A (en) NURBS direct interpolation method and device with processing characteristics considered
CN103801981A (en) Quartic polynomial speed planning algorithm for spline interpolation
CN105334805B (en) Numerical control device with the angle coordinates measurement function of considering interpolation speed controlling after interpolating
CN101025621A (en) Threading machine cycle processing method for turning hook-tooth thread
CN112486101B (en) NURBS curve self-adaptive look-ahead interpolation method
CN101563661B (en) Working control device
CN101634847A (en) Reconfigurable CNC system of intersection line cutting machine
CN105629882A (en) Trigonometric function speed planning method used for spline interpolation
CN106886197A (en) Control machine implements method and its device and the application of processing
CN106557072B (en) The aided programming method of numerically controlled processing equipment execution program
CN114839921A (en) Five-axis contour control method based on data driving
CN114019908B (en) Spiral bevel gear tooth profile cambered surface chamfering control method
CN108656244A (en) A kind of large size timber structure abnormity processing method
CN110286651B (en) High-dimensional track interpolation method
JP3543459B2 (en) Numerical control device for machining workpieces
Zhou et al. Research on an intelligent manufacturing system based on an information-localizing machining mode

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Free format text: FORMER OWNER: SHENYANG HIGH-END COMPUTER NUMERICAL CONTROL TECHNOLOGY CO., LTD.

Effective date: 20150807

C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20150807

Address after: 110171 Liaoning Province, Shenyang Hunnan New District Nanping Road No. 16

Patentee after: Shenyang Institute of computing technology, Chinese Academy of Sciences

Address before: 110171 Liaoning Province, Shenyang Hunnan New District Nanping Road No. 16

Patentee before: Shenyang Institute of computing technology, Chinese Academy of Sciences

Patentee before: Shenyang High-End Computer Numerical Control Technology Co., Ltd.