Patent Grant
8060239
The present invention relates to a method for the determination of a rough trajectory to be followed in a positionally guided manner, executed by a computer, wherein an initial trajectory to be followed in a positionally guided manner is input into the computer, said initial trajectory being described by an initial function so that a corresponding position on the initial trajectory is determined by substituting a scalar trajectory parameter into the initial function.
Such determination methods are generally known. By way of example, reference is made to EP 0 594 699 B1 and to DE 103 55 614.
In EP 0 594 699 B1, the initial trajectory is described as scalar trajectory parameter by means of time. In electronic filters, the trajectory components are determined which correspond to accelerations above and below a limit value, respectively. The above trajectory corresponds to the trajectory components which correspond to accelerations below the limit value. The rough trajectory is used for driving a slow-response drive. The trajectory components with accelerations above the limit value correspond to a fine trajectory. They are used for driving a quick-response drive.
In EP 0 594 699 B1, a special tuning of the possible deflection of the quick-response drive, of the possible acceleration of the slow-response drive and of the maximum permissible trajectory speed ensures that the distance of the rough trajectory from the initial trajectory remains at any time below the maximum possible deflection of the quick-response drive.
In DE 103 55 614 A1, the initial trajectory is also described as scalar trajectory parameter with time. In this document, the initial trajectory is divided into a high-frequency and a low-frequency trajectory component in electronic filters. The low-frequency trajectory component corresponds to the rough trajectory. In DE 103 55 614 A1, it is not guaranteed a priori that the distance of the rough trajectory from the initial trajectory is always below a predetermined threshold independently of the value of the scalar trajectory parameter.
To plan the movement of machines, for example processing machines, particularly machine tools, the following procedure is usually adopted in the prior art: a parts program is input into a computer. The parts program specifies, on the one hand, a contour to be followed in a positionally guided manner and, on the other hand, contains a desired (preferably constant) speed variation, also called trajectory speed in the text which follows. As a rule, the contour already corresponds to an initial trajectory to be followed in a positionally guided manner. If necessary, however, the computer can also determine the initial trajectory in advance by means of the desired contour.
As a rule, the initial trajectory is a two- or three-dimensional trajectory. However, it can also be only one-dimensional, or more than three-dimensional if both the translatory and rotatory movements are to be carried out. It is firstly given as a function of a scalar dimensionless trajectory parameter. Because it is dimensionless, this trajectory parameter is different from time, in particular. However, it is already characteristic of a path traveled along the initial trajectory, at least indirectly.
The dimensionless trajectory parameter is mapped by the computer onto a path traveled along the initial trajectory. Next, the trajectory parameter is mapped onto time by including the desired speed variation. The trajectory now determined is supplied to a test facility. The test facility is a component of the computer. It determines in a clocked manner the nominal position values—possibly also the nominal speed values—for axes to be controlled and outputs these nominal values. Furthermore, it checks the nominal position values and their time derivations (speeds, accelerations, jerks) for the maintenance of predetermined limit values. If at least one of the limit values is exceeded, the trajectory speed must be lowered at least locally and a new run through the test facility must be performed.
In the case of non-redundant kinematics, it to say if exactly one drive or one jointly driven group of drives is to be controlled for each controlled axis, this procedure is completely satisfactory. In the case of redundant kinematics, in contrast, if following the initial trajectory is divided into a rough trajectory for a low-response drive and a fine trajectory for a quick-response drive, wherein the rough trajectory and the fine trajectory complement one another to form the initial trajectory, this procedure only leads to unsatisfactory results. This applies independently of whether the test facility checks only the initial trajectory or the rough trajectory and the fine trajectory for maintenance of the limit values.
If the test facility only checks the initial trajectory for maintenance of the limit values, the limit values could—theoretically—by input in such a manner, naturally, that they can be maintained both by the slow-response drive and by the quick-response drive. Such an input of limit values would be meaningless, however, since any advantage which is to be achieved by the division into rough trajectory and fine trajectory would then be relinquished. If, however, the limit values are input in such a manner that they cannot always be met by both drives, particularly that the acceleration limit value would only be met by the quick-response drive but not by the slow-response drive, there is a risk that the traversing range of the quick-response drive is not maintained, the acceleration limit value of the slow-response drive is not maintained and/or the speed and jerk limit values of at least one of the two drives are not maintained. In addition to the initial trajectory, it must still be checked in both trajectories after the division of the initial trajectory into the rough trajectory and the fine trajectory whether their limit values are maintained. If these limit values are violated,
If necessary, this process must even be repeated several times before a reasonably acceptable speed variation can be determined in which the rough trajectory and the fine trajectory are determined in such a manner that all limit values are maintained for both drives. The reason for repeated iterations being required without being able to predict with reliability whether the newly found trajectories maintain the limit values is that a change in the speed variation results in a change in the division of initial trajectory into the rough trajectory and the fine trajectory.
It also may happen with this procedure that the trajectory speed must be lowered locally or globally only because the initial trajectory has been poorly divided into the rough trajectory and the fine trajectory. In other words: if the division of the initial trajectory into the rough trajectory and the fine trajectory had been determined differently, with the speed variation being unchanged, the limit values would have been maintained.
The same problems also occur if the initial trajectory is divided into the rough trajectory and the fine trajectory before the test. This is because, in this case, the test facility can immediately check all nominal position values and their time derivations for maintenance of the limit values but the repeated iteration which may be required and the problem of the possibly only poor division of the initial trajectory into the rough trajectory and the fine trajectory remain.
The abovementioned problems can also be bypassed to only a limited extent by the procedure according to EP 0 594 699 B1. Firstly, this procedure is very computationally intensive, on the one hand, since the variation of acceleration must be determined for the entire initial trajectory and the initial trajectory is divided into the rough trajectory and the fine trajectory by means of the acceleration components. Furthermore, this procedure mandatorily presupposes that the possible traverse path of the quick-response drive, the possible acceleration of the slow-response drive and the maximum trajectory speed are correspondingly matched to one another. If this matching is not guaranteed, the procedure of EP 0 594 699 B1 also exhibits the above problems. Furthermore, if the limit values of the quick-response drive are violated, rough trajectory and fine trajectory must also be redetermined in EP 0 594 699 B1 after the trajectory speed has been lowered, which can lead to other limit values being violated which have been previously maintained.
The object of the present invention consists in creating a determination method of the type initially mentioned by means of which the rough trajectory can be determined without repeated iteration of the division and testing process.
On the basis of a determination method of the type initially mentioned, the object is achieved in that
This is because this guarantees from the beginning, on the one hand, that the permissible traversing range of the quick-response drive (=the predetermined threshold) is maintained. But mainly the division of the initial trajectory into the rough trajectory and the fine trajectory is now independent of time. A change in trajectory speed (local or global) therefore no longer has any influence on the division of the initial trajectory into the rough trajectory and the fine trajectory. It is therefore possible
On the other hand, no further (i.e. multiple) iteration is required any longer.
The rough function can be determined by the computer in various manners. It is preferred that the computer, for determining the rough function
This is because it is then possible, by means of a gradually progressive coarsening or gradually progressive rounding-off of the initial trajectory, to determine bit by bit a rough function in which the condition that the distance of the rough trajectory from the initial trajectory is always below the predetermined threshold independently of the value of the trajectory parameter, is just met.
The formulation in the above feature e), that the rough function should be determined by means of the first characteristic intermediate values determined last, has been deliberately kept so wide. This is because, naturally, it is possible that the rough function should correspond to the first characteristic intermediate values determined last. But it should also be possible, for example, to coarsen the initial trajectory only in a first section until the rough trajectory has been determined for the section, then to coarsen it in a second section etc. until the rough function has been determined section by section. Such a procedure should also be comprised in the formulation of feature e).
For the testing in step c), it is naturally possible that the computer always directly checks the distance of the second intermediate trajectory from the initial trajectory for maintenance of the predetermined threshold. In some cases, however, it will be advantageous, particularly require less computer time, if the computer
It would be presumably optimal if the computer proceeds as described last and, in the case where the distance of the second intermediate trajectory from the first intermediate trajectory exceeds the auxiliary threshold,
The procedures described above are advantageous particularly if the first characteristic intermediate values form a first sequence of intermediate vectors which, among other things, contains space coordinates, the second characteristic intermediate values form a second sequence of intermediate vectors which, among other things, contain space coordinates, and the number of intermediate vectors of the second sequence is smaller than the number of intermediate vectors of the first sequence. This is because the coarsening and rounding-off of the initial trajectory or of the intermediate trajectories determined bit by bit can then be implemented in a particularly simple manner.
If the computer determines by means of the second sequence of intermediate vectors a third sequence of intermediate vectors which, among other things, contain space coordinates, the intermediate vectors of the third sequence are characteristic of the second intermediate trajectory and the number of intermediate vectors of the third sequence corresponds to the number of intermediate vectors of the first sequence, it is possible that the computer determines the distance of the second intermediate trajectory from the first intermediate trajectory by means of the space coordinates of the intermediate vectors of the first and third sequence. It is also possible that the computer determines the distance of the second intermediate trajectory from the first intermediate trajectory without determining the complete intermediate trajectories.
Analogously, it is possible that the computer determines the distance of the second intermediate trajectory from the initial trajectory by means of the space coordinates of intermediate vectors of a fourth sequence and the intermediate vectors of the initial trajectory. In this case, the computer determines, by means of the second sequence of second intermediate vectors, a fourth sequence of intermediate vectors, the intermediate vectors of the fourth sequence containing, among other things, space coordinates and being characteristic of the second intermediate trajectory, the number of intermediate vectors of the fourth sequence corresponding to the number of intermediate vectors of the initial trajectory.
As an alternative to determining the distance by means of characteristic intermediate values, the computer can also determine the rough function in that it determines for each predetermined value of the scalar trajectory parameter the corresponding position on the rough trajectory by a weighted or unweighted mean value of positions on the initial trajectory, the positions on the initial trajectory corresponding to an interval of the scalar trajectory parameter which contains the predetermined value of the scalar trajectory parameter.
The determination method according to the invention can be carried out in a particularly simple manner if the initial trajectory and the rough trajectory and any intermediate trajectories determined as part of the determination of the rough trajectory are splines. Suitable splines to be considered are, in particular, B splines.
As a rule, the computer also determines a fine trajectory, also to be followed in a positionally guided manner, in addition to the rough trajectory. In this arrangement, the computer can determine the fine trajectory, as an alternative, by forming the difference of initial trajectory and rough trajectory or by forming the difference of initial function and rough function and substituting the scalar trajectory parameter.
Due to the way in which the rough function is determined, the initial trajectory is sensitively divided into the rough trajectory and the fine trajectory. In particular, the rough trajectory is determined in such a manner that there is at least one value of the scalar trajectory parameter at which a derivation of the rough function with respect to the scalar trajectory parameter is different both from zero and from a corresponding derivation of the initial function with respect to the scalar trajectory parameter. In the case of such a value, both the corresponding slow-response drive and the corresponding quick-response drive are thus simultaneously driven with a traversing speed different from zero in the time domain.
It is possible that the determination method according to the invention is carried out online. In this case, the computer is integrated into a control device for a machine with redundant position-guided kinematics. As an alternative, it is also possible that the determination method according to the invention is carried out offline. In this case, at least two of the three nominal position values for the initial trajectory, the rough trajectory and the fine trajectory can be stored in a data medium. If the nominal position values of the trajectories are already referred to the operating cycle of the control device, their time derivations can also be stored in the data medium, if necessary. If this is done, no further interpolation is required in the control device but only the processing of the sequences of nominal position values.
Further advantages and details are found in the subsequent description of an exemplary embodiment, in conjunction with the drawings, in which, in a basic representation
In the text which follows, the present invention is described in conjunction with a processing machine for metal. However, this description is meant to be purely as an example. The present invention is also described by means of a two-dimensional traversing movement. This, too, is only purely by way of example. It is crucially not a matter of the actual application and the design of the machine or the number of dimensions of the traversing movement but only of the manner of the determination of a rough trajectory to be followed in a position-guided manner by means of an initial trajectory to be followed in a position-guided manner, described in the text which follows.
According to
As a rule, a workpiece 7 to be processed by the laser has considerably larger dimensions. For this reason, a further adjustment capability in the x direction and in the y direction is provided this further adjustment capability having a much greater travel, for example of 3 m×5 m. However, the further adjustment capability is much more inert. For example, two slow-response drives 8, 9 are provided which provide for a maximum acceleration of 1 m/s2 in the x direction and of 3 m/s2 in the y direction. For example, the adjusting element 3 can be moved in the y direction by means of the slow-response drive 9 on a carrier 10 and the carrier 10, in turn, can be moved in the x direction on rails 11, 12 by means of the slow-response drive 8.
To be able to travel the given initial trajectory 2 as quickly as possible, the traversing movements of the carrier 10, of the adjusting element 3 and of the laser 1 must be coordinated with one another in a suitable manner. Thus, a rough trajectory 13, which corresponds to a rough and rounded-off derivation of the initial trajectory 2 must be determined for moving carrier 10 and adjusting element 3. The possible travel 6 of the laser 1 relative to the adjusting element 3 must be considered in this arrangement. It must be possible, therefore, to equalize the derivation of the rough trajectory 13 from the initial trajectory 2 by means of a corresponding movement of the laser 1 relative to the adjusting element 3. Determining the rough trajectory 13—also drawn in
Furthermore, the speed, acceleration and possibly also jerk limits of all drives 4, 5, 8, 9 must be maintained. Although it is also a component part of the present invention in its developments, it is no longer the basic component of the present invention.
To implement the present invention, a computer program 14 is first generated for a computer 15. This computer program 14 is stored in an (exclusively) machine-readable form on a data medium 16. The data medium 16 can be, for example, an internal data medium of a further computer, not shown, or a portable data medium 16 such as, for example, a CD ROM 16, a memory card or a USB memory stick.
The computer program 14 is loaded into the computer 15 and stored there, for example on its hard disk. If it is called up due to corresponding call conditions (e.g. a user input), the computer 15 carries out a determination method which will be explained in greater detail in conjunction with
According to
As a rule, the scalar trajectory parameter u is first a universal trajectory parameter u. The universal trajectory parameter u is dimensionless and thus, in particular, different from time t. However, it can be recalculated into a travel s traveled along the initial trajectory 2, independently of the speed variation v. It is therefore already characteristic of the travel s.
As far as required, the computer 15 approximates, in a step S2, the initial trajectory 2 by a spline, for example by a B spline, particularly a third-order B spline, or a Bezier spline. For the sake of completeness, it should be mentioned that a third-order B spline is a smooth curve assembled section by section, where each section of the smooth curve can be described by a relation as3+bs2+cs+d. The letters a, b, c and d in each case stand for a vector in the position space. s is the travel s on the initial trajectory 2, already mentioned.
By approximating the initial trajectory 2 by means of a spline, the computer 15 has available as a result an initial function AF (namely the spline) which is directly a function of the distance s covered along the initial trajectory 2. If the speed variation v is also input, it, too, can be recalculated into a speed variation v as a function of the distance s covered along the initial trajectory 2 as part of the step S2.
The procedure according to steps S1 and S2 is generally known to the experts in the field. It is also adopted, in particular, when the initial trajectory 2 would only have to be approached by means of the slow-response drives 8, 9 for the x direction and the y direction, that is to say the laser 1 would be arranged rigidly relative to the adjusting element 3 according to the above example. Steps S1 and S2 do not, therefore, require more detailed explanations.
In a step S3, the computer 15 filters the initial function AF with low-pass characteristics. The crucial factor is here that the initial function AF, when it is filtered, is not predetermined as function of time t but as function of the universal trajectory parameter u or of the travel s. It is preferred that the initial function AF is directly a function of the distance s covered along the initial trajectory 2. In the text which follows, the travel s is therefore also always designated as scalar trajectory parameter. However, the dimensionless universal trajectory parameter u could also be used.
Corresponding to the circumstance that the initial function AF is not a function of time t but a function of the scalar trajectory parameter s, the low-pass characteristic is not related to time t but to the scalar trajectory parameter s.
In step S3, the computer 15 thus determines a rough function GF as function of the scalar trajectory parameter s. Substituting the scalar trajectory parameter s into the rough function GF thus determines a corresponding position pG on the rough trajectory 13 which corresponds to the position pA on the initial trajectory 2 which is determined by the same value of the scalar trajectory parameter s.
Naturally, the filtering of the initial function AF must not be too coarse. This is because it must be such that the distance of the rough trajectory 13 from the initial trajectory 2 always remains below a predetermined threshold S independently of the value of the scalar trajectory parameter s. It will be explained later in detail how this can be achieved.
After step S3, steps S4 and S5 can be carried out. In step S4, the computer 15 determines the rough trajectory 13 by means of the rough function GF. In step S5, the computer 15 determines a fine trajectory by forming the difference between initial trajectory 2 and rough trajectory 13. In this context, the fine trajectory must be followed in a position-guided manner just like the initial trajectory 2 and the rough trajectory 13.
As an alternative to steps S4 and S5, the computer 15 could also executes steps S6 and S7. In step S6, the computer 15 determines a fine function FF by forming a difference of initial function AF and rough function GF. In step S7, the computer 15 determines the rough trajectory 13 by means of the rough function GF and the fine trajectory by means of the fine function FF.
In a step S8, the computer 15 then carries out a determination, known per se, separately for the rough trajectory 13 and the fine trajectory. This is because it determines in step S8, in a manner known per se, the rough trajectory 13 and the fine trajectory as functions of time t. This determines by means of the rough trajectory 13 a sequence of nominal position values pG*(t) for the slow-response drives 8, 9 and, by means of the fine trajectory, a corresponding sequence of nominal position values pF*(t) for the quick-response drives 4, 5. In this context, immediately successive nominal position values pG*(t), pF*(t) must be executed offset by a predetermined timing cycle. The nominal position values pG*(t), pF*(t) determined are first stored internally by the computer 15. Depending on the number of axes to be driven, the nominal position values pG*(t), pF*(t) can be scalar quantities (one-dimensional case) or multi-dimensional quantities (multi-dimensional case).
As part of step S8, the computer 15 also determines at least the first and second derivations of the nominal position values pG*(t), pF*(t) with time t. It thus determines at least the speeds and the accelerations. It may also determine, as part of step S8, the third derivations of the nominal position values pG*(t), pF*(t) with time t, that is to say the jerks.
In a step S9, the computer 15 then determines the value of a logical variable OK. The logical variable OK assumes the value “TRUE” if the time derivations determined in step S8 are all below the limit values permissible for them. Otherwise, the logical variable OK assumes the value “UNTRUE” OR “FALSE”. The value of the logical variable OK is checked by the computer 15 in a step S10.
If the logical variable OK has assumed the value “TRUE”, the computer 15 changes directly to a step S11. In step S11, the computer 15 outputs the nominal position values pG*(t), pF*(t) determined. The computer 15 preferably also outputs the corresponding speed values (first time derivations). The computer 15 may also output the corresponding acceleration values (=second time derivations).
If the computer 15 executes the determination method described above online, it is integrated into a control device 17 for the processing machine. In this case, the computer 15 outputs the sequences of nominal position values pG*(t), pF*(t), the corresponding speed values and possibly also the corresponding acceleration values directly to control devices 18 for the corresponding drives 4, 5, 8, 9. If, in contrast, the computer 15 executes the determination method described above offline, the computer 15 stores the sequences of nominal position values pG*(t), pF*(t), the corresponding speed values and possibly also the corresponding acceleration values as a file 19 on a data medium 20. The data medium 20 can again be an internal data medium of the computer 15, for example a hard disk of the computer 15. However, it can also be a portable data medium 20 such as, for example, a CD ROM 20, a memory card or a USB memory stick.
Theoretically, the computer 15 could save the nominal position values pG*(t), pF*(t) (possibly including the derivations for the nominal position values) for any two trajectories of the initial trajectory 2, rough trajectory 13 and fine trajectory since it applies both to the nominal position values pG*(t), pF*(t) and to the derivations that the value for the initial trajectory 2 must be the result of the sum of the values for the rough trajectory 13 and the fine trajectory. If two of the values are given, the third value can thus also be determined immediately by forming the sum or difference. Independently of the actual design, that is to say independently of the trajectories of initial trajectory 2, rough trajectory 13 and fine trajectory for which the nominal position values pG*(t), pF*(t), are stored on the data medium 20, it applies that (at least) two sequences of nominal position values pG*(t), pF*(t) are stored on the data medium 20, each nominal position value pG*(t) of one sequence corresponding to a nominal position value pF*(t) of the other sequence and one each of the sequences corresponding to a sequence of nominal positions on the initial trajectory 2, the rough trajectory 13 or the fine trajectory.
If, in contrast, the test in step S10 has had the result that the logical variable OK has the value “UNTRUE” or “FALSE”, step S11 must not be executed directly.
Instead, steps S12 and S13 must first be carried out.
In step S12, the computer 15 lowers the speed variation v. In this context, the speed variation v can be lowered locally, that is to say only in the areas of the travel s at which one or more of the derivations of the nominal position values pG*(t), pF*(t) exceeds the permissible limit values. However, the lowering can also be done globally, that is to say over the entire distance s. The extent of the required lowering of speed can be easily determined by means of the extent by which the derivations of the nominal position values pG*(t), pF*(t) exceeds the permissible limit values. In step S13, therefore, the computer 15 can again perform a determination in the sense of step S8, the execution of step S13 ensuring, however, that all limit values are now maintained.
In practice, the execution of step S13 is preferably implemented in that, instead of executing step S13 as such, the program jumps back to step S8. The representation according to
In the text which follows, a preferred method for the determination of the rough trajectory 13 is explained in greater detail by way of example in conjunction with
According to
Using the first characteristic intermediate values, the computer 15 determines second characteristic intermediate values in a step S22. The second characteristic intermediate values form a second sequence of intermediate vectors. According to
The second intermediate trajectory 23 is thus also a spline of the same type as the initial trajectory 2, for example again a B spline. According to
In steps S23 and S24, the computer 15 checks whether the distance of the second intermediate trajectory 23 from the initial trajectory 2 is always below the predetermined threshold S independently of the value of the scalar trajectory parameter s. If this is so, the computer 15 replaces the first characteristic intermediate values by the second characteristic intermediate values in a step S25 and goes back to step S22. Otherwise, the computer 15 determines the rough function GF by means of the first intermediate values in a step S26. Since the rough function GF is thus determined either by means of the first characteristic intermediate values of the initial trajectory 2 or—because of step S25—by means of the second characteristic intermediate values of a second intermediate trajectory 23, the rough trajectory 13 determined by means of the rough function GF is also a spline.
The distance of the second intermediate trajectory 23 from the initial trajectory 2 is preferably determined by the computer 15 separately for the x direction and the y direction. However, it would also be possible to determine a geometric distance according to the formula a2=δx2+δy2 (where δx=distance in the x direction and δy=distance in the y direction).
In order to check, in accordance with step S23, whether distance of the second intermediate trajectory 23 from the initial trajectory 2 is always below the predetermined threshold S independently of the value of the scalar trajectory parameter s, it is naturally possible, in principle, to determine in each case the distance of the second intermediate trajectory 23 from the initial trajectory 2 for a sufficiently dense sequence of values of the scalar trajectory parameter s and to compare the largest one of these distances with the predetermined threshold S. However, this procedure is computationally very intensive. The following implementation of step S23 is much more elegant:
According to the algorithm by Boehm (to be found in the above-mentioned technical report by Boehm, for example), the computer 15 determines a third sequence of intermediate vectors by means of the second sequence of intermediate vectors in a step S31 according to
In the first iteration of FIG. 4—that is to say when the first characteristic intermediate values correspond to the initial trajectory 2, the second intermediate trajectory 23 is always compared with the initial trajectory 2 as part of step S23 or, respectively, the space coordinates of the corresponding intermediate vectors are always compared with one another as part of step S33. In later iterations, that is to say when the first characteristic intermediate values no longer correspond to the initial trajectory 2 but to their own intermediate trajectory (called first intermediate trajectory in the text which follows), various procedures are possible which will be explained in the text which follows.
Thus, according to
In the procedure according to
According to
A step S42 corresponds to the step S22 of
In a step S45, the computer 15 determines the value of the logical variable OK. Step S45 essentially corresponds to step S33 of
Steps S46 to S48 essentially correspond to steps S24 to S26 of
Compared with the procedure of
However, this procedure, too, can still be optimized further. This will be explained in greater detail in conjunction with
The procedure according to
Steps S49 to S51 correspond to steps S36 to S38 of
B splines, in particular, have the characteristic, among other things, that removing a characteristic intermediate vector only influences the spine locally (that is to say around the removed intermediate vector). It is possible, therefore to divide the first intermediate trajectory into sections which adjoin one another. To each section in this case, such a number of intermediate vectors are allocated in the first sequence that at least the elimination of the center intermediate vector of this section changes the first intermediate trajectory only within this section but does not influence it outside this section. The required number of intermediate vectors is determined in this case by, e.g. the complexity of the polynomial on which the spline is based.
In this procedure, the number of intermediate vectors per section can be reduced at least once. This has the effect that the number of intermediate vectors is lowered by more than one with each iteration. If then the test criterion of step S24 is violated by a second intermediate trajectory 23, the following procedure can be adopted:
The computer 15 checks the sections in which the second intermediate trajectory 23 is too far away from the initial trajectory 2. In these sections, it determines the rough trajectory 13 by means of the first intermediate values determined last. For the remaining sections, the computer 15 can carry out further filterings with low-pass characteristic, that is to say coarsen the initial trajectory 2 even further.
The formulations with respect to step S26 of
The type of determination of the rough function GF and of the rough trajectory 13 described above is very efficient and is therefore preferred. However, it is also possible to determine the rough trajectory 13 in another manner. This will be explained in greater detail in conjunction with
According to
In a step S62, the computer 15 accepts the multiplicity of positions pA as positions of a first intermediate trajectory and thus defines the first intermediate trajectory. In a step S63, the computer 15 then determines for each predetermined value of the scalar trajectory parameter s, by means of the positions on the first intermediate trajectory, corresponding positions on the second intermediate trajectory. The positions on the first intermediate trajectory used by the computer 15 for determining a position on the second intermediate trajectory correspond to an interval of the scalar trajectory parameter s which contains the predetermined value of the trajectory parameter s for the respective position on the second intermediate trajectory. By means of the corresponding positions on the first intermediate trajectory, the computer 15 determines (still as part of step S63), a weighted or unweighted mean value of the positions on the first intermediate trajectory. This mean value corresponds to the position on the second intermediate trajectory.
In steps S64 and S65, the computer 15 checks whether the distance of the second intermediate trajectory from the initial trajectory 2 is always below the predetermined threshold S independently of the value of the scalar trajectory parameter s. In this context, the function of step S64 corresponds to that of step S23 of
Steps S66 and S67 essentially correspond to steps S25 and S26 of
Independently of whether the rough trajectory 13 is determined in accordance with the procedure of
| Number | Date | Country | Kind |
|---|---|---|---|
| 10 2005 061 570 | Dec 2005 | DE | national |
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/EP2006/069227 | 12/1/2006 | WO | 00 | 6/23/2008 |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO2007/074025 | 7/5/2007 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 5847960 | Cutler et al. | Dec 1998 | A |
| 6677722 | Hamamura et al. | Jan 2004 | B2 |
| 6825633 | Hamann et al. | Nov 2004 | B2 |
| 6845287 | Galburt et al. | Jan 2005 | B2 |
| 6957121 | Lottgen et al. | Oct 2005 | B2 |
| 7085620 | Maeda et al. | Aug 2006 | B2 |
| 7130718 | Gunnarsson et al. | Oct 2006 | B2 |
| 7208901 | Ladra et al. | Apr 2007 | B2 |
| 7272524 | Brogardh | Sep 2007 | B2 |
| 7444202 | Fauser et al. | Oct 2008 | B2 |
| 7450127 | Hong et al. | Nov 2008 | B2 |
| 7778716 | Ueda et al. | Aug 2010 | B2 |
| Number | Date | Country |
|---|---|---|
| 101 56 781 | Feb 2003 | DE |
| 698 28 530 | Jun 2005 | DE |
| 103 55 614 | Jul 2005 | DE |
| 0 594 699 | Dec 1995 | EP |
| Number | Date | Country | |
|---|---|---|---|
| 20080269944 A1 | Oct 2008 | US |
