Look-ahead-window-based interval adaptive feedrate scheduling for long five-axis spline toolpaths under axial drive constraints

Abstract

Scheduling of the five-axis spline toolpath feedrate is of great significance for high-quality and high-efficiency machining using five-axis machine tools. Due to the fact that there exists nonlinear relationship between the Cartesian space of the cutting tool and the joint space of the five feed axes, it is a challenging task to schedule the five-axis feedrate under axial drive constraints. Most existing methods are researched for routine short spline toolpaths, however, the five-axis feedrate scheduling method expressed for long spline toolpaths is limited. This article proposes an interval adaptive feedrate scheduling method based on a dynamic moving look-ahead window, so as to generate smooth feedrate for long five-axis toolpath in a piecewise manner without using the integral toolpath geometry. First, the length of the look-ahead window which equals to that of the toolpath interval is determined in case of abrupt braking at the end of the toolpath. Then, the interval permissible tangential feed parameters in terms of the velocity, acceleration, and jerk are determined according to the axial drive constraints at each toolpath interval. At the same time, the end velocity of the current interval is obtained through looking ahead the next interval. Using the start and end velocities and the permissible feed parameters of each interval, the five-axis motion feedrate is scheduled via an interval adaptive manner. Thus, the feedrate scheduling task for long five-axis toolpath is partitioned into a series of extremely short toolpaths, which realizes the efficient scheduling of long spline toolpath feedrate. Experimental results on two representative five-axis spline toolpaths demonstrate the feasibility of the proposed approach, especially for long toolpaths.

Keywords

Feedrate scheduling five-axis computer numerical control machine tools drive constraints spline toolpaths

Introduction

Machining quality and efficiency are two key factors in manufacturing industry. Scheduling of the appropriate feedrate is acknowledged as one of the most important tasks in computer numerical control (CNC) machining to achieve favorable machining quality and efficiency.^1–3 This is because of the fact that too low feedrate results in inefficiency feed motion, while too high feedrate may lead to the axial drive limitations being exceeded, which not only goes against the machining quality but also makes damage to the machine tools possibly.⁴ One can schedule constant feedrate with initial launching and final braking for routine linear or circular toolpaths, while for free-form spline toolpaths, it is no longer suitable because the variable geometry within one spline toolpath requires different axial drive capabilities.⁵ If a constant speed is utilized, the feedrate must be scheduled as a most conservative value so as to compromise to the most dangerous area on the spline.⁶ Therefore, scheduling the feedrate adaptively becomes so significant that it has been researched in a lot of literatures.

Existing feedrate scheduling methods can be mainly classified into three kinds of categories in terms of the feedrate-sensitive point method, the constraint optimization method, and the feedrate-profile iterative adjustment method, respectively. The feedrate-sensitive point method searches dangerous corners with considered constraints, and connects the allowable speed values at these corners smoothly. For example, Yong and Narayanaswami⁷ scheduled the feedrate-sensitive corners under limited chord-error, and connected the sensitive corners with acceleration constriants; Fan et al.⁸ determined the permissible velocities of critical points with acceleration and jerk constraints, and connected them with a proposed jounce confined feedrate profile; Jia et al.⁹ scheduled feedrate-sensitive regions under confined chord error, acceleration, jerk, and contour error, and connected these regions with the jerk-limited S-shape feedrate profile. This kind of method is mainly applicable to three-axis machine tools. While for five-axis machining with three translational axes and two rotary axes, the feedrate-sensitive point method cannot be directly utilized because of the nonlinear relationship between the tool motion and axial motion.¹⁰

The second category of feedrate scheduling method, that is, the constraint optimization method, aims at solving the feedrate optimization problems with the objective of minimum path-tracking time under the considered constraints. For example, Debrouwere et al.¹¹ proposed a time-optimal path following method using sequential convex programming approach to solve the corresponding nonconvex optimal control problems introduced by the jerk limitation; Pham¹² established a velocity curve in the “displacement–velocity” phase space, and computed the time-optimal trajectory by integration; Erkorkmaz et al.¹³ scheduled the feedrate for spline toolpaths by using a “pseudo-jerk” concept through linear programming; Liu et al.¹⁴ linearized the interrelated multiple constraints and scheduled the optimal five-axis feedrate through linear programming. In addition, the third category of method, that is, the feedrate-profile iterative adjustment method, adjusts the feedrate profile iteratively until all of the considered constraints can be satisfied. For example, Sencer et al.¹⁵ expressed the feedrate profile as a B-spline and modulated the control points iteratively to maximize the feed along the toolpath without violating the programmed feed and the axial drive limits; Beudaert et al.¹⁶ discretized the toolpath and scheduled all discretization-point velocities by iteratively searching the deceleration point using dichotomy; Sun et al.¹⁷ and Chen et al.¹⁸ presented a proportional adjustment approach for the feed profile under axial jerk constraints, and afterwards, they further presented a moving knot sequence-based feedrate scheduling method under drive and contour-error constraints;¹⁹ Liang et al.²⁰ expressed the feedrate in the form of B-spline curve, and adjusted it iteratively by raising the control points from a zero-speed velocity curve. It is worth noting that although above two categories of methods can be utilized for scheduling five-axis feedrate, most of them are merely suitable for short toolpaths because the integral iterative calculation should be fulfilled when using these approaches so that the computation load becomes too heavy to be employed for long toolpaths.

Based on above analyzation, one can see the fact that the feedrate scheduling methods for long five-axis toolpaths specifically remains challenging. To solve this issue, this article proposes a look-ahead-window-based interval adaptive feedrate scheduling method, so as to schedule the feedrate of five-axis long spline toolpaths in a piecewise manner. Due to the fact that scheduling the feedrate profile integrally requires high computational burden, this article partitions the long spline toolpath into intervals through applying the look-ahead window, and schedules near time-optimal feedrate profile within each interval with the consideration of smooth transition between adjacent intervals under axial drive constraints, thus piecewise generating the integral smooth feedrate profile. In the following texts, the detail scheme of the proposed method is given in section “Interval adaptive feedrate scheduling based on a look-ahead window,” and the performance of the proposed method is evaluated in section “Experimental tests.” Finally, conclusions are summarized in section “Conclusion.”

Interval adaptive feedrate scheduling based on a look-ahead window

Comparing with three-axis machine tools, the five-axis machine tools contain not only three translational axes, but also two additional rotary axes, which achieves more flexible spatial accessibility, but increases the difficulty of the feedrate scheduling for five-axis spline toolpath. It is a routine scheme to adjust the integral feedrate profile on the whole toolpath iteratively during five-axis feedrate scheduling, however, this is not suitable for long five-axis toolpath due to the time-consuming computational burden. In this article, the feedrate of the five-axis spline toolpath is scheduled interval by interval, and the transition smoothness is ensured through the applying of a look-ahead window. By doing this, the integral feedrate scheduling task for a long spline toolpath is divided into a series of successive feedrate scheduling tasks for extremely short toolpaths, so that the computational burden can be released.

The general idea of the presented interval adaptive feedrate scheduling method is introduced below. First, the length of the look-ahead window is determined according to the braking distance, and the length of each sub-divided interval is taken as the same value as the look-ahead window. Then, the allowable feed parameters in terms of maximum velocity, acceleration, and jerk of the current interval are determined according to axial drive constraints. After that, the feed parameters of the next interval are computed by applying the look-ahead window. Finally, schedule the current-interval feedrate based on S-shape acceleration/deceleration principle according to the starting velocity, the allowable feed parameters, and the ending velocity which is obtained using the next-interval allowable feed parameters. Note that during the final step of the proposed method, feedrate smoothness between two adjacent intervals are considered and ensured. The detail algorithm is described in the following sub-sections.

S-shape acceleration/deceleration principle

At the very beginning, the S-shape acceleration/deceleration principle which is also utilized by Ni et al.,²¹ is introduced briefly here because it is utilized in the subsequent feedrate scheduling procedures. A whole S-shape feedrate profile is illustrated in Figure 1, where v_start and v_end means the start and end velocities, respectively; a_t_,max and j_t_,max means the maximum tangential acceleration and jerk limitations; t₁, t₂, and t₃ are calculated as

\begin{matrix} {\begin{matrix} t_{1} = {\begin{matrix} \frac{a_{t, \max}}{j_{t, \max}}, & | v_{end} - v_{start} | > \frac{a_{t, \max}^{2}}{j_{t, \max}} \\ \sqrt{\frac{| v_{end} - v_{start} |}{j_{t, \max}}}, & | v_{end} - v_{start} | \leq \frac{a_{t, \max}^{2}}{j_{t, \max}} \end{matrix} \\ t_{2} = {\begin{matrix} \frac{| v_{end} - v_{start} | - \frac{a_{t, \max}^{2}}{j_{t, \max}}}{a_{t, \max}}, & | v_{end} - v_{start} | > \frac{a_{t, \max}^{2}}{j_{t, \max}} \\ 0, & | v_{end} - v_{start} | \leq \frac{a_{t, \max}^{2}}{j_{t, \max}} \end{matrix} \end{matrix} \\ t_{3} = t_{1} \end{matrix}

(1)

Figure 1.

Illustration diagram of the S-shape feedrate profile.

The velocity value v corresponding to time t under S-shape acceleration/deceleration principle can thus be computed by

\begin{matrix} v (t) = \\ {\begin{matrix} v_{start} \pm \frac{1}{2} j_{t, \max} t^{2}, & 0 \leq t < t_{1} \\ v_{1} \pm j_{t, \max} t_{1} (t - t_{1}), v_{1} = v_{start} \pm \frac{1}{2} j_{t, \max} t_{1}^{2}, & t_{1} \leq t < t_{1} + t_{2} \\ v_{2} \pm j_{t, \max} t_{1} (t - t_{1} - t_{2}) \mp \frac{1}{2} j_{t, \max} {(t - t_{1} - t_{2})}^{2}, v_{2} = v_{1} \pm j_{t, \max}, & t_{1} t_{2}, t_{1} + t_{2} \leq t \leq t_{1} + t_{2} + t_{3} \end{matrix} \end{matrix}

(2)

Accordingly, the required displacement of the acceleration/deceleration process from v_start to v_end, denoted by s_req(v_start, v_end), can be derived as

\begin{matrix} s_{req} (v_{start}, v_{end}) = \\ {\begin{matrix} v_{start} (t_{1} + t_{2} + t_{3}) + \frac{1}{2} j_{t, \max} t_{1}^{2} (t_{2} + t_{3}) + \frac{1}{2} j_{t, \max} t_{1} (t_{2}^{2} + t_{3}^{2}) + j_{t, \max} t_{1} t_{2} t_{3}, v_{start} \leq v_{end} \\ v_{start} (t_{1} + t_{2} + t_{3}) - \frac{1}{2} j_{t, \max} t_{1}^{2} (t_{2} + t_{3}) - \frac{1}{2} j_{t, \max} t_{1} (t_{2}^{2} + t_{3}^{2}) - j_{t, \max} t_{1} t_{2} t_{3}, v_{start} > v_{end} \end{matrix} \end{matrix}

(3)

Determination of permissible feed parameters in each toolpath interval

The length of the toolpath interval, which equals to the look-ahead window length, should be determined first before calculation of the permissible feed parameters in each interval. Given a maximum programmed feedrate v_max, the braking distance, that is, the required displacement of the deceleration process from v_max to zero under the constraints of tangential acceleration and jerk limits, can be computed according to Equation (3) as

\begin{matrix} s_{br} = v_{\max} (t_{1} + t_{2} + t_{3}) - \frac{1}{2} j_{t, \max} t_{1}^{2} (t_{2} + t_{3}) \\ - \frac{1}{2} j_{t, \max} t_{1} (t_{2}^{2} + t_{3}^{2}) - j_{t, \max} t_{1} t_{2} t_{3} \end{matrix}

(4)

Once the look-ahead window length is not shorter than one braking distance, it will be not necessary to worry about whether there remains sufficient displacement for braking when we schedule the current-interval feedrate. On the contrary, the computational burden will be large if the length of the toolpath interval is too long. Therefore, the length of the toolpath interval and the look-ahead window, denoted by s_w, is determined as one braking distance

s_{w} = s_{br}

(5)

The permissible feed parameters, that is, the maximum velocity, acceleration, and jerk under axial drive constraint, in each toolpath interval are calculated using the proportional adjustment method presented and used by Sun et al.¹⁷ and Chen et al.¹⁸ The specific procedure is given as follows. Denote $q \in R^{5}$ and s as the axial position vector and the tool-tip spline arc length of the five-axis machine tools, respectively, and additionally, denote $\overset{\cdot}{q}$ and q_s as the derivative of q with respect to time and tool-tip spline arc length, respectively. With the help of differential principle, the motion relationship between five physical axes and the tool tip can be expressed as

{\begin{matrix} \dot{q} = q_{s} \dot{s} \\ \overset{\cdot\cdot}{q} = q_{s s} {\dot{s}}^{2} + q_{s} \overset{\cdot\cdot}{s} \\ \overset{⃛}{q} = q_{s s s} {\dot{s}}^{3} + 3 q_{s s} \dot{s} \overset{\cdot\cdot}{s} + q_{s} \overset{⃛}{s} \end{matrix}

(6)

where $\overset{\cdot}{s}$ , $\overset{\cdot\cdot}{s}$ , and {\ddot{s}{\vskip-6 .} are feedrate, acceleration, and jerk of the tool-tip motion, respectively. Denote the permissible feedrate, acceleration, and jerk which we want to determine as v_p, a_p, and j_p, respectively. To meet the axial drive constraints in terms of axial velocity limit ${\overset{\cdot}{q}}_{\max}$ , axial acceleration limit ${\overset{\cdot\cdot}{q}}_{\max}$ , and axial jerk limit ${\overset{⃛}{q}}_{\max}$ , a sufficient condition for the permissible feed parameters v_p, a_p, and j_p is derived according to Equation (6) as

{\begin{matrix} ‖ {\dot{q}}_{\max} ‖ \geq ‖ q_{s} ‖ v_{p} \\ ‖ {\overset{\cdot\cdot}{q}}_{\max} ‖ \geq ‖ q_{s s} ‖ v_{p}^{2} + ‖ q_{s} ‖ a_{p} \\ ‖ {\overset{⃛}{q}}_{\max} ‖ \geq ‖ q_{s s s} ‖ v_{p}^{3} + 3 ‖ q_{s s} ‖ v_{p} a_{p} + ‖ q_{s} ‖ j_{p} \end{matrix}

(7)

Given a scaling factor k, let v_p, a_p, and j_p be

{\begin{matrix} v_{p} = k \cdot v_{\max} \\ a_{p} = k^{2} \cdot a_{\max} \\ j_{p} = k^{3} \cdot j_{\max} \end{matrix}

(8)

where v_max, a_max, and j_max are the maximum programmed velocity, the maximum tangential acceleration, and the maximum tangential jerk, respectively. Substituting Equation (8) to Equation (7), the conditions that k should meet can be derived as

{\begin{matrix} ‖ {\dot{q}}_{\max} ‖ \geq ‖ q_{s} ‖ v_{\max} k \\ ‖ {\overset{\cdot\cdot}{q}}_{\max} ‖ \geq (‖ q_{s s} ‖ v_{\max}^{2} + ‖ q_{s} ‖ a_{\max}) k^{2} \\ ‖ {\overset{⃛}{q}}_{\max} ‖ \geq (‖ q_{s s s} ‖ v_{\max}^{3} + 3 ‖ q_{s s} ‖ v_{\max} a_{\max} + ‖ q_{s} ‖ j_{\max}) k^{3} \end{matrix}

(9)

It is seen from Equation (8) that the scaling factor k should be scheduled as large as possible to increase the motion efficiency and the time optimality, however, k should not be higher than 1 because the maximum feed parameters must not be exceeded. In addition, it is seen from Equation (9) that the scaling factor k cannot be too large, in case of exceeding the physical drive constraints and the maximum programmed feed parameters. Therefore, the scaling factor k is calculated as the reachable highest value under the drive constraints, that is, k can be computed according to Equation (9) as

k = \min (1, \frac{‖ {\overset{\cdot}{q}}_{max} ‖}{‖ q_{s} ‖ v_{\max}}, \sqrt{\frac{‖ {\overset{\cdot\cdot}{q}}_{max} ‖}{‖ q_{ss} ‖ v_{\max}^{2} + ‖ q_{s} ‖ a_{\max}}}, \sqrt[3]{\frac{| | {\overset{\cdot\cdot}{q}}_{\max} | |}{‖ q_{sss} ‖ v_{\max}^{3} + 3 ‖ q_{ss} ‖ v_{\max} a_{\max} + ‖ q_{s} ‖ j_{\max}}})

(10)

Given a five-axis toolpath with one tool-tip spline R(u) and one tool-orientation spline O(u), one single toolpath interval is roughly interpolated with equal arc length using the second-order Taylor expansion as

\begin{matrix} u_{r, i}^{m} = \\ {\begin{matrix} u_{r, n}^{m - 1}, & i - 1 \\ u_{r, i - 1}^{m} + \frac{1}{‖ R' (u_{r, i - 1}^{m}) ‖} δ_{s} - \frac{R' {(u_{r, i - 1}^{m})}^{T} \cdot R ″ (u_{r, i - 1}^{m})}{2 {‖ R' (u_{r, i - 1}^{m}) ‖}^{4}} δ_{s}^{2}, & i = 2, 3, \dots, n \end{matrix} \\ n = int (\frac{s_{w}}{δ_{s}}) \end{matrix}

(11)

Above, $u_{r, i}^{m}$ is the parameter of ith rough interpolation point on the mth toolpath interval, and δ_s represents the arc-length step of the rough interpolation. The tool and tool orientation vectors corresponding to each rough interpolation point can be expressed as $R (u_{r, i}^{m})$ and $O (u_{r, i}^{m})$ , respectively. Hence, the axial vector corresponding to $u_{r, i}^{m}$ , denoted by $q_{i}^{m}$ , is obtained according to the inverse kinematics of the five-axis machine tools as

q_{i}^{m} = Inv_Trans (R (u_{r, i}^{m}), O (u_{r, i}^{m}))

(12)

Thus, the derivatives of axial position q with respect to tool-tip motion arc length s in mth interval can be computed numerically by

{\begin{matrix} q_{s, i}^{m} = \frac{q_{i + 1}^{m} - q_{i - 1}^{m}}{2 δ_{s}} \\ q_{ss, i}^{m} = \frac{q_{s, i + 1}^{m} - q_{s, i - 1}^{m}}{2 δ_{s}} \\ q_{sss, i}^{m} = \frac{q_{ss, i + 1}^{m} - q_{ss, i - 1}^{m}}{2 δ_{s}} \end{matrix}

(13)

Substituting $q_{s, i}^{m}$ , $q_{ss, i}^{m}$ , and $q_{sss, i}^{m}$ to Equation (10), one obtains the scaling factor for ith rough interpolation point of the mth toolpath interval which is denoted by $k_{i}^{m}$ . Hence, to satisfy all of the drive constraints, the scaling factor of mth interval, denoted by $k^{m}$ , is determined as the minimum $k_{i}^{m}$

k^{m} = \min (k_{i}^{m}), i = 1, 2, \dots, n

(14)

The permissible feed parameters of the mth toolpath interval, in terms of the maximum velocity $v_{p}^{m}$ , the maximum acceleration $a_{p}^{m}$ , and the maximum jerk $j_{p}^{m}$ , are computed by replacing k with k^m in Equation (8) as

{\begin{matrix} v_{p}^{m} = k^{m} \cdot v_{\max} \\ a_{p}^{m} = {(k^{m})}^{2} \cdot a_{\max} \\ j_{p}^{m} = {(k^{m})}^{3} \cdot j_{\max} \end{matrix}

(15)

It is seen that the permissible acceleration and jerk may be much lower than their corresponding maximum limitations, which seems that the braking distance s_br computed by the maximum feed parameters in Equation (4) may not be sufficient for braking under the constraints of the decreased feed parameters. Therefore, we provide the following proposition to deal with this puzzle.

Proposition 1

The braking distance under S-shape acceleration/deceleration principle stays the same after scaling of the maximum feed parameters using Equation (8).

Proof

Denote the required braking distance after scaling of the feed parameters as s_br_{, s}, and s_br_{, s} can be computed according to Equation (3) as

\begin{matrix} s_{br, s} = v_{p} (t_{1, s} + t_{2, s} + t_{3, s}) - \frac{1}{2} j_{p} t_{1, s}^{2} (t_{2, s} + t_{3, s}) \\ - \frac{1}{2} j_{p} t_{1, s} (t_{2, s}^{2} + t_{3, s}^{2}) - j_{p} t_{1, s} t_{2, s} t_{3, s} \end{matrix}

(16)

where t_1,s, t_2,s, and t_3,s are increased, constant, and reduced acceleration times of the S-shape feedrate profile during braking from v_p to zero after feed-parameter scaling, and they are computed according to Equation (1) as

\begin{matrix} {\begin{matrix} t_{1, s} = {\begin{matrix} \frac{a_{p}}{j_{p}}, & v_{p} > \frac{a_{p}^{2}}{j_{p}} \\ \sqrt{\frac{v_{p}}{j_{p}}}, & v_{p} \leq \frac{a_{p}^{2}}{j_{p}} \end{matrix} \\ t_{2, s} = {\begin{matrix} \frac{v_{p} - a_{p}^{2} / j_{p}}{a_{p}}, & v_{p} > \frac{a_{p}^{2}}{j_{p}} \\ 0, & v_{p} \leq \frac{a_{p}^{2}}{j_{p}} \end{matrix} \end{matrix} \\ t_{3, s} = t_{1, s} \end{matrix}

(17)

By substituting Equations (1) and (8) into Equation (17), we deduce the following conclusions

t_{1, s} = \frac{t_{1}}{k}, t_{2, s} = \frac{t_{2}}{k}, t_{3, s} = \frac{t_{3}}{k}

(18)

Furthermore, substitute Equations (18) and (8) into Equation (16), we obtain

\begin{matrix} s_{br, s} = k v_{\max} (\frac{t_{1}}{k} + \frac{t_{2}}{k} + \frac{t_{3}}{k}) - \frac{1}{2} k^{3} j_{t, \max} {(\frac{t_{1}}{k})}^{2} (\frac{t_{2}}{k} + \frac{t_{3}}{k}) \\ - \frac{1}{2} k^{3} j_{t, \max} \frac{t_{1}}{k} ({(\frac{t_{2}}{k})}^{2} + {(\frac{t_{3}}{k})}^{2}) \\ - k^{3} j_{t, \max} \frac{t_{1}}{k} \frac{t_{2}}{k} \frac{t_{3}}{k} \\ = v_{\max} (t_{1} + t_{2} + t_{3}) - \frac{1}{2} j_{t, \max} t_{1}^{2} (t_{2} + t_{3}) \\ - \frac{1}{2} j_{t, \max} t_{1} (t_{2}^{2} + t_{3}^{2}) - j_{t, \max} t_{1} t_{2} t_{3} \\ = s_{br} \end{matrix}

(19)

Equation (19) illustrates that the braking distance after feed-parameter scaling using Equation (8) equals to the braking distance before feed-parameter scaling, which demonstrates the Proposition 1.

Thanks to the correctness of Proposition 1, it is not necessary to adjust the length of toolpath interval and look-ahead window during the process of feedrate scheduling, which means that the look-ahead window length can be determined at once before the feedrate scheduling, and this is beneficial to the computation efficiency.

Scheduling of the interval adaptive feedrate

This sub-section schedules the feedrate for each toolpath interval based on the look-ahead window, according to the previously determined interval permissible feed parameters. First, the next interval of the toolpath is looked ahead to determine the ending velocity of the current interval. Then, the current interval feedrate is scheduled using S-shape acceleration/deceleration principle according to the start and end velocities, as well as the permissible feed parameters.

As shown in Figure 2, the next toolpath interval, that is, the (m + 1)th interval, is looked ahead by the rough interpolation and its permissible velocity $v_{p}^{m + 1}$ is obtained. Take the minimum value of $v_{p}^{m}$ and $v_{p}^{m + 1}$ as the end velocity of the current mth interval, so as to ensure that the next-interval maximum permissible feed parameters are not exceeded. It is worth noting that the value of the final interval length, that is, the s_f shown in Figure 2, depends on how long the toolpath remains, therefore, the next-interval length may be shorter than the scheduled length s_w when reaches the end of the toolpath. In this case, the braking distance may be insufficient. To deal with this problem, we presents the following proposition to adjust the final interval permissible velocity v_p_{, f}.

Figure 2.

Schematic diagram of the look-ahead-window-based interval adaptive feedrate scheduling method.

Proposition 2

Denote the function of braking distance with respect to the braking velocity as s_br(v_p), that is, denote the deceleration displacement from v_p to zero under S-shape acceleration/deceleration principle as s_br(v_p), thus s_br(v_p) is a convex function.

Proof

By letting v_start = v_p, v_end = 0, a_t_,max = a_p, j_t_,max = j_p, and substituting them to Equation (1), we get

{\begin{matrix} t_{1} = t_{3} = \frac{a_{p}}{j_{p}}, t_{2} = \frac{v_{p}}{a_{p}} - \frac{a_{p}}{j_{p}}, v_{p} > \frac{a_{p}^{2}}{j_{p}} \\ t_{1} = t_{3} = \sqrt{\frac{v_{p}}{j_{p}}}, t_{2} = 0, v_{p} \leq \frac{a_{p}^{2}}{j_{p}} \end{matrix}

(20)

Substituting Equation (20) to Equation (3), we can derive the braking distance s_br(v_p) as

s_{br} (v_{p}) = {\begin{matrix} \frac{1}{2 a_{p}} v_{p}^{2} + \frac{a_{p}}{2 j_{p}} v_{p}, v_{p} > \frac{a_{p}^{2}}{j_{p}} \\ \frac{1}{\sqrt{j_{p}}} {(v_{p})}^{\frac{3}{2}}, v_{p} \leq \frac{a_{p}^{2}}{j_{p}} \end{matrix}

(21)

The second-order derivative of s_br(v_p) with respect to v_p is thus obtained

{s ″}_{br} (v_{p}) = {\begin{matrix} \frac{1}{a_{p}}, & v_{p} > \frac{a_{p}^{2}}{j_{p}} \\ \frac{3}{4 \sqrt{j_{p}}} {(v_{p})}^{- \frac{1}{2}}, & v_{p} \leq \frac{a_{p}^{2}}{j_{p}} \end{matrix}

(22)

Therefore, it always has ${s ″}_{br} (v_{p}) > 0$ , which illustrates that s_br(v_p) is a convex function. Thus, Proposition 2 is proved.

Given a scaling factor k_f < 1, the following Equation (23) is always satisfied due to the fact that s_br(v_p) is a convex function

s_{br} (k_{f} \cdot v_{p}) < k_{f} \cdot s_{br} (v_{p}) = k_{f} \cdot s_{w}

(23)

Take k_f as $k_{f} = s_{f} / s_{w}$ , and substitute it to Equation (23), then it yields

s_{br} (\frac{s_{f}}{s_{w}} \cdot v_{p}) < s_{f}

(24)

Equation (24) means that when we scale the permissible velocity v_p to $(s_{f} / s_{w}) \cdot v_{p}$ , the required braking distance under S-shape acceleration/deceleration principle must be smaller than the existing displacement s_f. Therefore, once the length of the final interval s_f is obtained, the permissible velocity of the final interval v_p_,f can be easily computed by

v_{p, f} = \frac{s_{f}}{s_{w}} \cdot v_{p}^{l}

(25)

where l stands for the total interval amounts, and $v_{p}^{l}$ is the initial scheduled permissible velocity using Equation (15). As can be seen from Equation (25), only a proportional scaling is conducted at the final interval due to the non-routine case, therefore, no additional computational burden is added.

According to the next-interval permissible velocity, the end velocity of current interval $v_{e}^{m}$ is computed as

v_{e}^{m} = \min (v_{p}^{m}, v_{p}^{m + 1})

(26)

The start velocity of current interval $v_{s}^{m}$ is undisputed token as the final feedrate of the previous interval. Based on the start velocity $v_{s}^{m}$ , the end velocity $v_{e}^{m}$ , and the permissible feed parameters in terms of $v_{p}^{m}$ , $a_{p}^{m}$ , and $j_{p}^{m}$ , the current mth interval feedrate is scheduled, and the detail procedure can be classified into four cases as shown in Figure 2.

Case 1: $v_{p}^{m} > \max (v_{s}^{m}, v_{e}^{m})$

In this case, the permissible velocity is larger than either of the start and end velocities, therefore, the scheduled feedrate first increases from $v_{s}^{m}$ to v_c, and then decreases from v_c to $v_{e}^{m}$ . The main task in above procedure is to determine the appropriate value of v_c which stands for the largest velocity in current interval.

To determine v_c, we define a displacement function s_ad(v) which represents the total required displacement of the processes including acceleration from $v_{s}^{m}$ to v and the deceleration from v to $v_{e}^{m}$ under the constraints of $a_{p}^{m}$ and $j_{p}^{m}$ , that is

s_{ad} (v) = s_{req} (v_{s}^{m}, v) + s_{req} (v, v_{e}^{m})

(27)

Compare the length of mth interval s_w with $s_{ad} (v_{p}^{m})$ . If $s_{w} \geq s_{ad} (v_{p}^{m})$ , it is indicated that the existing displacement is sufficient for acceleration from the start velocity to the maximum permissible velocity and then deceleration to the end velocity, therefore, let $v_{c} = v_{p}^{m}$ . Otherwise, if $s_{w} < s_{ad} (v_{p}^{m})$ , the maximum velocity of mth interval cannot reach $v_{p}^{m}$ , and although the specific value of v_c can be found out by the dichotomy method, the iteration should be conducted, which is negative to the computation efficiency. Therefore, a concise approach without iteration is provided as follows, so as to rapidly calculate the value of v_c when $s_{w} < s_{ad} (v_{p}^{m})$ .

Proposition 3

When v_c is selected as

\begin{matrix} v_{c} = \\ \frac{(s_{w} - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))) v_{p}^{m} + (s_{ad} (v_{p}^{m}) - s_{w}) \max (v_{s}^{m}, v_{e}^{m})}{s_{ad} (v_{p}^{m}) - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))} \end{matrix}

(28)

$v_{c} > \max (v_{s}^{m}, v_{e}^{m})$ and $s_{ad} (v_{c}) \leq s_{w}$ can be satisfied.

Proof

According to Equations (1), (3), and (27), s_ad(v) can be rewritten as

\begin{matrix} s_{ad} (v) = {\begin{matrix} \frac{1}{a_{p}^{m}} v^{2} + \frac{a_{p}^{m}}{j_{p}^{m}} v - \frac{{(v_{s}^{m})}^{2} + {(v_{e}^{m})}^{2}}{2 a_{p}^{m}} + \frac{a_{p}^{m} (v_{s}^{m} + v_{e}^{m})}{2 j_{p}^{m}}, & v - \max (v_{s}^{m}, v_{e}^{m}) > \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \\ (v + v_{s}^{m}) \sqrt{\frac{v - v_{s}^{m}}{j_{p}^{m}}} + (v + v_{e}^{m}) \sqrt{\frac{v - v_{e}^{m}}{j_{p}^{m}}}, & v - \min (v_{s}^{m}, v_{e}^{m}) \leq \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \\ \begin{matrix} \frac{1}{2 a_{p}^{m}} v^{2} + \frac{a_{p}^{m}}{2 j_{p}^{m}} v + (v + \max (v_{s}^{m}, v_{e}^{m})) \sqrt{\frac{v - \max (v_{s}^{m}, v_{e}^{m})}{j_{p}^{m}}} - \frac{\min {(v_{s}^{m}, v_{e}^{m})}^{2}}{2 a_{p}^{m}} \\ + \frac{a_{p}^{m} \min (v_{s}^{m}, v_{e}^{m})}{2 j_{p}^{m}}, v - \min (v_{s}^{m}, v_{e}^{m}) > \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}}, \end{matrix} & v - \max (v_{s}^{m}, v_{e}^{m}) \leq \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \end{matrix} \end{matrix}

(29)

Therefore, the first-order derivative of s_ad(v) with respect to v is

{s^{'}}_{a d} (v) = {\begin{matrix} \frac{2}{a_{p}^{m}} v + \frac{a_{p}^{m}}{j_{p}^{m}}, & v - \max (v_{s}^{m}, v_{e}^{m}) > \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \\ \sqrt{\frac{v - v_{s}^{m}}{j_{p}^{m}}} + \frac{v + v_{s}^{m}}{2 \sqrt{j_{p}^{m} (v - v_{s}^{m})}} + \sqrt{\frac{v - v_{e}^{m}}{j_{p}^{m}}} + \frac{v + v_{e}^{m}}{2 \sqrt{j_{p}^{m} (v - v_{e}^{m})}}, & v - \min (v_{s}^{m}, v_{e}^{m}) \leq \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \\ \frac{1}{a_{p}^{m}} v + \frac{a_{p}^{m}}{2 j_{p}^{m}} + \sqrt{\frac{v - \max (v_{s}^{m}, v_{e}^{m})}{j_{p}^{m}}} + \frac{v + \max (v_{s}^{m}, v_{e}^{m})}{2 \sqrt{j_{p}^{m} (v - \max (v_{s}^{m}, v_{e}^{m}))}}, & v - \min (v_{s}^{m}, v_{e}^{m}) > \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}}, v - \max (v_{s}^{m}, v_{e}^{m}) \leq \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \end{matrix}

(30)

It is seen from Equation (30) that one always has $s'_{ad} (v) > 0$ , which indicates that s_ad(v) is an increasing function, therefore, due to the fact that $v_{p}^{m} > \max (v_{s}^{m}, v_{e}^{m})$ , it always has

\begin{matrix} s_{ad} (\max (v_{s}^{m}, v_{e}^{m})) = \\ s_{req} (\min (v_{s}^{m}, v_{e}^{m}), \max (v_{s}^{m}, v_{e}^{m})) < s_{req} (v_{p}^{m}, 0) \\ = s_{w} < s_{ad} (v_{p}^{m}) \end{matrix}

(31)

In addition, the second-order of s_ad(v) with respect to v is computed as

{s^{″}}_{a d} (v) = {\begin{matrix} \frac{2}{a_{p}^{m}}, & v - \max (v_{s}^{m}, v_{e}^{m}) > \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \\ \frac{1}{\sqrt{j_{p}^{m} (v - v_{s}^{m})}} + \frac{j_{p}^{m} (v + v_{s}^{m})}{2} {(v - v_{s}^{m})}^{- \frac{3}{2}} + \frac{1}{\sqrt{j_{p}^{m} (v - v_{e}^{m})}} + \frac{j_{p}^{m} (v + v_{e}^{m})}{2} {(v - v_{e}^{m})}^{- \frac{3}{2}}, & v - \min (v_{s}^{m}, v_{e}^{m}) \leq \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \\ \frac{1}{a_{p}^{m}} + \frac{1}{\sqrt{j_{p}^{m} (v - \max (v_{s}^{m}, v_{e}^{m}))}} + \frac{j_{p}^{m} (v + \max (v_{s}^{m}, v_{e}^{m}))}{2} {(v - \max (v_{s}^{m}, v_{e}^{m}))}^{- \frac{3}{2}}, & v - \min (v_{s}^{m}, v_{e}^{m}) > \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}}, v - \max (v_{s}^{m}, v_{e}^{m}) \leq \frac{{(a_{p}^{m})}^{2}}{j_{p}^{m}} \end{matrix}

(32)

Therefore, ${s ″}_{ad} (v) > 0$ can be satisfied when $v > \max (v_{s}^{m}, v_{e}^{m})$ , which demonstrates that s_ad(v) is a convex function when $v > \max (v_{s}^{m}, v_{e}^{m})$ . Thus, given a factor $k_{f} \in [0, 1]$ , we have

\begin{matrix} s_{ad} (\max (v_{s}^{m}, v_{e}^{m}) + k_{f} (v_{p} - \max (v_{s}^{m}, v_{e}^{m}))) \\ < s_{ad} (\max (v_{s}^{m}, v_{e}^{m})) + k_{f} (s_{ad} (v_{p}) - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))) \end{matrix}

(33)

According to Equation (31), it is derived that $0 < (s_{w} - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))) / (s_{ad} (v_{p}^{m}) - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))) < 1$ . Therefore, take k_f as

k_{f} = \frac{s_{w} - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))}{s_{ad} (v_{p}^{m}) - s_{ad} (\max (v_{s}^{m}, v_{e}^{m}))}

(34)

Thus, Equation (28) can be rewritten as

\begin{matrix} v_{c} = \max (v_{s}^{m}, v_{e}^{m}) + k_{f} (v_{p}^{m} - \max (v_{s}^{m}, v_{e}^{m})) \\ > \max (v_{s}^{m}, v_{e}^{m}) \end{matrix}

(35)

In addition, substitute Equations (28) and (34) to Equation (33) yields

s_{ad} (v_{c}) < s_{w}

(36)

Equations (35) and (36) demonstrate Proposition 3.

As a consequence, the current-interval maximum velocity v_c is computed according to Equation (28) when $s_{w} < s_{ad} (v_{p}^{m})$ in Case 1, so as to meet the condition $s_{ad} (v_{c}) < s_{w}$ , that is, the acceleration from $v_{s}^{m}$ to v_c and the deceleration from v_c to $v_{e}^{m}$ can be realized within one toolpath interval.

Furthermore, the acceleration-start point parameter is taken as the initial-point parameter of this interval, that is, $u_{r, 1}^{m}$ , and the deceleration-start point parameter u_d is computed as

{\begin{matrix} Nd = int (\frac{s_{req} (v_{c}, v_{e}^{m})}{δ_{s}}) \\ u_{d} = u_{r, n - Nd}^{m} \end{matrix}

(37)

Case 2: $v_{p}^{m} = v_{s}^{m} = v_{e}^{m}$ .

In this case, the permissible velocity equals to the start and end velocities of the current interval. Hence, constant speed is scheduled in this kind of interval as shown in Figure 2.

Case 3: $v_{p}^{m} = v_{e}^{m} > v_{s}^{m}$ .

In this case, the permissible velocity equals to the end velocity which is larger than the start velocity. Therefore, the acceleration from $v_{s}^{m}$ to $v_{p}^{m}$ is scheduled once this kind of interval is reached, and the acceleration-start point parameter is taken as the initial-point parameter of this interval, that is, $u_{r, 1}^{m}$ .

Case 4: $v_{p}^{m} = v_{s}^{m} > v_{e}^{m}$ .

In this case, the permissible velocity equals to the start velocity which is larger than the end velocity. Therefore, the deceleration from $v_{s}^{m}$ to $v_{e}^{m}$ is scheduled at the end of this kind of interval, and the deceleration-start point parameter u_d is computed by

{\begin{matrix} Nd = int (\frac{s_{req} (v_{s}^{m}, v_{e}^{m})}{δ_{s}}) \\ u_{d} = u_{r, n - Nd}^{m} \end{matrix}

(38)

Above four cases can cover all situations possible to occur, and the reason is analyzed as follows. On one hand, it is seen from Equation (26) that we always have $v_{p}^{m} \geq v_{e}^{m}$ and $v_{p}^{m + 1} \geq v_{e}^{m}$ . On the other hand, since the end velocity of mth interval $v_{e}^{m}$ will become the start velocity of (m + 1)th interval $v_{s}^{m + 1}$ , it can be concluded that $v_{p}^{m + 1} \geq v_{s}^{m + 1}$ , that is, $v_{p}^{m} \geq v_{s}^{m}$ . Therefore, there always exists $v_{p}^{m} \geq max (v_{s}^{m}, v_{e}^{m})$ , which stands for a fact that the interval permissible velocity must not be lower than the start and the end velocities of current interval when using the proposed algorithm. Since above four cases cover all situations when $v_{p}^{m} \geq max (v_{s}^{m}, v_{e}^{m})$ , they can represent all possible situations that may occur.

Based on above analyzation, the main procedure of the presented interval-adaptive feedrate scheduling method for long five-axis spline toolpath is summarized as the pseudocode in Table 1. First, execute the rough interpolation of one toolpath interval, and calculate the permissible feed parameters of the current interval. Then, look-ahead the next interval, and calculate the end velocity of the current interval. After that, schedule the current-interval feedrate according to the corresponding case in sub-section “Scheduling of the interval adaptive feedrate.” Finally, determine whether the final interval is reached, and end the algorithm once the final interval feedrate has been scheduled. The whole procedure can be executed without computation-time unfixed iterations, and only one small interval feedrate is scheduled in each period no matter how long the toolpath is, which is favorable to the efficient scheduling for the feedrate of long five-axis toolpaths.

Table 1.

Proposed interval-adaptive feedrate scheduling algorithm.

Input: R(u), O(u), δ_s, v_max, a_max, j_max
Output: Feedrate profile
Start
Let m = 1;

v_{s}^{m} = 0

;
Calculate s_w using Equation (5);
Rough interpolate one toolpath interval with the length of s_w using Equation (11);
Calculate

v_{p}^{m}

a_{p}^{m}

, and

j_{p}^{m}

using Equation (15);
While 1
Do {
Look-ahead (m + 1)th interval;
Calculate

v_{p}^{m + 1}

a_{p}^{m + 1}

, and

j_{p}^{m + 1}

using Equation (15);
If (m + 1)th interval is the final interval
Do {
Calculate v_p_{, f} using equation (25);
Update

v_{p}^{m + 1}

by letting

v_{p}^{m + 1} = v_{p, f}

;
}
Calculate

v_{e}^{m}

using Equation (26);
Schedule mth interval feedrate according to

v_{s}^{m}

v_{e}^{m}

v_{p}^{m}

a_{p}^{m}

, and

j_{p}^{m}

based on the method presented in sub-section “Scheduling of the interval adaptive feedrate”;
Let

v_{p}^{m} = v_{p}^{m + 1}

a_{p}^{m} = a_{p}^{m + 1}

j_{p}^{m} = j_{p}^{m + 1}

;
Let m = m + 1;

v_{s}^{m}

= The final speed of (m-1)th interval;
If mth interval is the final interval
Do {
Break;
}
}
Let

v_{e}^{m} = 0

;
Schedule mth interval feedrate according to

v_{s}^{m}

v_{e}^{m}

v_{p}^{m}

a_{p}^{m}

, and

j_{p}^{m}

based on the method presented in sub-section “Scheduling of the interval adaptive feedrate”;
End

Experimental tests

In this section, experiments are conducted to evaluate the performance of the presented feedrate scheduling method, including the tests for both short and long toolpaths.

Experimental setup

A five-axis feed-drive experimental platform with three translational axes x, y, and z and two rotary axes B and C as shown in Figure 3 is developed in-house for the experiment tests. The three translational axes x, y, and z are driven by three ASDA^® servo motors, and their leads are all 4 mm. The two rotary axes B and C are driven by two ASDA^® servo motors, and their reduction ratio are all 90. The five servo motors run in velocity mode, and the position loops of them are configured in an rapid control prototype (RCP) controller RT-Cube produced by Beijing Links^® Corporation. The analog voltage commands from −10 V to + 10 V generated by the RT-Cube are utilized for control of the motors, and the 17-bit encoders embedded in the servo motors are utilized for position feedback. The direct and inverse kinematics of the five-axis feed-drive system with B and C rotary axes are provided in Equations (39) and (40), respectively

{\begin{matrix} O_{x} = \sin (q_{b}) \cos (q_{c}) \\ O_{y} = - \sin (q_{b}) \sin (q_{c}) \\ O_{z} = \cos (q_{b}) \\ R_{x} = - \sin (q_{b}) \cos (q_{c}) L + \cos (q_{c}) (q_{x} - M_{x}) + \sin (q_{c}) (q_{y} - M_{y}) + M_{x} \\ R_{y} = \sin (q_{b}) \sin (q_{c}) L - \sin (q_{c}) (q_{x} - M_{x}) + \cos (θ_{c}) (q_{y} - M_{y}) + M_{y} \\ R_{z} = - \cos (q_{b}) L + q_{z} + L \end{matrix}

(39)

{\begin{matrix} q_{b} = k \arccos (O_{z}), k = 1, - 1 \\ q_{c} = {\begin{matrix} k π + \arctan (O_{x} / O_{y}), O_{x} \neq 0, O_{y} \neq 0, k = 0, \pm 1, \pm 2, \\ 0, O_{x} = 0, O_{y} = 0 \\ k π / 2, O_{x} = 0, O_{y} \neq 0, k = 0, \pm 1, \end{matrix} \\ q_{x} = M_{x} + \sin (q_{b}) L + \cos (q_{c}) (R_{x} - M_{x}) - \sin (q_{c}) (R_{y} - M_{y}) \\ q_{y} = M_{y} - \sin (q_{c}) (R_{x} - M_{x}) + \cos (q_{c}) (R_{y} - M_{y}) \\ q_{z} = \cos (q_{b}) L - L + R_{z} \end{matrix}

(40)

Above, q =[q_x, q_y, q_z, q_b, q_c]^T is the axial position vector; R =[R_x, R_y, R_z]^T and O =[O_x, O_y, O_z]^T is the tool-tip position and tool-orientation vector, respectively; L represents the distance from the B-axis rotary axis to the tool-tip, and [M_x, M_y, M_z]^T is the origin of the machining coordinate.

Figure 3.

Experimental platform for the verification tests.

A short S-shape five-axis dual-NURBS toolpath shown in Figure 4(a) is first employed for testing the effectiveness of the presented feedrate scheduling approach. Furthermore, a long five-axis toolpath for the machining of the impeller shown in Figure 4(b) is employed for testing the performance of the presented method on long toolpaths. The impeller toolpath is generated by CAM software NX10.0 and the tool-axis direction is always perpendicular to the impeller surface.

Figure 4.

Five-axis toolpaths used for the experimental tests: (a) S-shape toolpath and (b) impeller toolpath.

Experimental results

According to the drive capability of the utilized servo motors, the axial drive constraints utilized for the S-shape toolpath test are set as those in Table 2. The reference tool-tip velocity v_max is set as v_max = 25 mm/s. Accordingly, the maximum tool-tip motion acceleration and jerk are set as $a_{\max} = (v_{\max} / \max ({\dot{q}}_{\max})) \max ({\overset{\cdot\cdot}{q}}_{\max}) = 83.3 {mm / s}^{2}$ and $j_{\max} = (v_{\max} / \max ({\dot{q}}_{\max})) \max ({\overset{⃛}{q}}_{\max}) = 4116.7 {mm / s}^{3}$ , respectively. The braking distance, that is, the toolpath interval length, can be computed by Equation (5) as s_w = 4.0 mm. The feedrate of the S-shape toolpath is scheduled using the proposed method, and the schedule result is illustrated in Figures 5 and 6. The total arc length of the S-shape testing toolpath is 264.6 mm, and the total amount of the toolpath interval is 67. In Figure 5, the permissible velocity, acceleration, and jerk in each partitioned interval are depicted by piecewise lines with the colors of black, blue, and red, respectively. In addition, the consecutive nattier blue line shown in Figure 5 represents the final scheduled feedrate profile, and it can be seen that the final feedrate profile is nearly the largest reachable profile under the constraint of permissible velocities in multiple intervals, which indicates the proposed method can make full use of machine tools’ dynamics.

Table 2.

Axial drive constraints used for the S-shape toolpath test.

Symbol	Parameter	Value
${\overset{\cdot}{q}}_{\max}$	Velocity constraints of the five axes	[30 mm/s, 30 mm/s, 30 mm/s, 0.8 rad/s, 0.8 rad/s]^T
${\overset{\cdot\cdot}{q}}_{\max}$	Acceleration constraints of the five axes	[100 mm/s², 100 mm/s², 100 mm/s², 2 rad/s², 2 rad/s²]^T
${\overset{\dots}{q}}_{\max}$	Jerk constraints of the five axes	[5000 mm/s³, 5000 mm/s³, 5000 mm/s³, 80 rad/s³, 80 rad/s³]^T

Figure 5.

Feedrate scheduling result for the S-shape toolpath.

Figure 6.

Scheduled feedrate on the S-shape five-axis toolpath.

The axial positions at each interpolation interval are computed according to the scheduled federate, with the interpolation period of 2 ms. The computed positions of five axes are used as position commands for control of the five-axis feed-drive systems in the Links^® RT-cube controller. The real motion positions of five axes at each interpolation period are measured by the encoders embedded in the servo motors, and the actual-position signals are collected by the RT-cube controller with a sampling period of 2 ms which is same to the interpolation period. The sampled position signals are then stored in the host PC. These positions of each axis are employed for calculation of the velocities, accelerations, and jerks of the five axes. The results are shown in Figure 7. As can be seen from Figure 7, the actual motion parameters of every axes can be effectively bonded within the constraints set in Table 2, and this demonstrates the feasibility of the presented interval adaptive feedrate scheduling method.

Figure 7.

Experimental result of the S-shape toolpath: (a) actual feed parameters of translational axes and (b) actual feed parameters of rotary axes.

In addition, the proposed method is also compared with the recent published regional constant five-axis feedrate scheduling method by Ma et al.²² Employing similar axial drive constraints provided in Table 2, the feedrate profile for the S-shape toolpath scheduled by Ma’s method is obtained, and it is compared with the feedrate scheduled by the proposed method in Figure 8. As shown in Figure 8, comparing with the regional constant feedrate the proposed interval adaptive feedrate varies more frequently, but more time-optimality can be obtained within the drive limitations. Besides, another advantage of the proposed method is that the interval adaptive method can generate feedrate profile for long five-axis toolpath in real time, because it schedules the feedrate interval by interval, unlike the previous regional constant method which schedule the feedrate by taking the whole toolpath in its entirety. The computation time for scheduling of the S-shape toolpath by Ma’s method is about 2.1 s on a 3.4-GHz Intel Core CPU. As for the proposed method, the feedrate scheduling is executed in a piecewise manner, and the computation time for each interval is about 0.027 s. Although the total computation time in 67 intervals is nearly the same with Ma’s method, the computation time within one single interval will not increases with the increasing of total toolpath length, while the computation time of Ma’s method scales with the toolpath length. This indicates that the proposed interval adaptive method is more suitable for real-time application during five-axis spline interpolation.

Figure 8.

Comparison of feedrate profiles scheduled by the proposed method and Ma’s regional constant feedrate scheduling method.

Furthermore, the impeller toolpath shown in Figure 4(b) is employed as the testing objective for evaluating the performance of the presented feedrate scheduling method on long five-axis toolpath. The axial drive constraints are tuned to those in Table 3 which are different to those in Table 2, so as to further evaluate the feasibility of the proposed approach. The total length of the tool-tip spline is about 2107.7 mm, and the length of toolpath interval is computed as 2.4 mm. Distinctly, schedule the feedrate on the integral toolpath which has a length of 2107.7 mm must be extremely time consuming, however, it is divided into a series of intervals with a length of 2.4 mm each interval so that the feedrate can be efficiently scheduled using the proposed interval adaptive method. The scheduled feedrate using the proposed method is shown in Figures 9 and 10. In addition, the actual motion parameters of the five axes are illustrated in Figure 11. Similar to the result of the S-shape toolpath, the actual velocities, accelerations, and jerks of five axes of the impeller toolpath are all bonded within the limitations set in Table 3. Hence, the effectiveness of the proposed feedrate scheduling method on long five-axis toolpath is verified.

Table 3.

Axial drive constraints used for the impeller toolpath test.

Symbol	Parameter	Value
${\overset{\cdot}{q}}_{\max}$	Velocity constraints of the five axes	[60 mm/s, 60 mm/s, 60 mm/s, 0.6 rad/s, 0.6 rad/s]^T
${\overset{\cdot\cdot}{q}}_{\max}$	Acceleration constraints of the five axes	[700 mm/s², 700 mm/s², 700 mm/s², 4 rad/s², 4 rad/s²]^T
${\overset{\dots}{q}}_{\max}$	Jerk constraints of the five axes	[20,000 mm/s³, 20,000 mm/s³, 20,000 mm/s³, 150 rad/s³, 150 rad/s³]^T

Figure 9.

Feedrate scheduling result for the impeller toolpath.

Figure 10.

Scheduled feedrate on the impeller toolpath.

Figure 11.

Experimental result of the impeller toolpath: (a) actual feed parameters of translational axes and (b) actual feed parameters of rotary axes.

Conclusion

This article presents an interval adaptive feedrate scheduling method based on a look-ahead window for long five-axis spline toolpaths. Using the proposed scheme, the feedrate of long five-axis toolpath can be scheduled in a piecewise manner, without requiring the integral geometric information of the whole toolpath. Therefore, the computational burden can be released, which means that the computation burden does not increase with the rising of the toolpath length. The key to the proposed approach is to schedule the interval start and end velocities and the interval permissible feed parameters in terms of tool-tip motion velocity, acceleration, and jerk, under the axial drive constraints and S-shape acceleration/deceleration principle. Once above parameters are obtained, the feedrate profile at each interval is scheduled as high as possible without increasing the computational burden under the permissible parameters, so as to generate integral near time-optimal feedrate. Experimental tests on two representative five-axis toolpaths, that is, a short S-shape toolpath and a long impeller machining toolpath, are conducted to evaluate the performance of the proposed method. Testing results illustrate that the presented interval adaptive feedrate scheduling method not only is feasible for both short and long toolpath, but also can make a good use of the axial drive capabilities. Contribution of this article is significant for CNC interpolation of long five-axis spline toolpaths. In future, the feedrate scheduling methods for multi-segment long five-axis spline toolpaths are under research.

Footnotes

Declaration of conflicting interests

The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research is supported by the Fundamental Research Funds for the Central Universities (3072020CF0701).

ORCID iDs

De-Ning Song

Jian-Wei Ma

References

W-J

Rastegar

, et al. A real-time and look-ahead interpolation algorithm with axial jerk-smooth transition scheme for computer numerical control machining of micro-line segments. Proc IMechE, Part B: J Eng Manuf 2019; 223(9): 2007–2019.

Huang

Zhu

L-M.

Feedrate scheduling for interpolation of parametric tool path using the sine series representation of jerk profile. Proc IMechE, Part B: J Eng Manuf 2017; 23(13): 2359–2371.

Huang

Zhu

LM.

Parallel acceleration/deceleration feedrate scheduling for computer numerical control machine tools based on bi-directional scanning technique. Proc IMechE, Part B: J Eng Manuf 2019; 233(3): 937–947.

Chen

Sun

Contour error–bounded parametric interpolator with minimum feedrate fluctuation for five-axis CNC machine tools. Int J Adv Manuf Technol 2019; 103: 567–584.

Wang

, et al. A novel minimum-time feedrate schedule method for five-axis sculpture surface machining with kinematic and geometric constraints. Proc IMechE, Part B: J Eng Manuf 2018; 233(5): 1483–1499.

Liu

Huang

Yin

, et al. Development and implementation of a NURBS interpolator with smooth feedrate scheduling for CNC machine tools. Int J Mach Tools Manuf 2014; 87: 1–15.

Yong

Narayanaswami

A parametric interpolator with confined chord errors, acceleration and deceleration for NC machining. Comput Aided Des 2003; 35(13): 1249–1259.

Fan

Gao

Yan

, et al. Interpolation of parametric CNC machining path under confined jounce. Int J Adv Manuf Technol 2012; 62(5-8): 719–739.

Jia

Song

, et al. A NURBS interpolator with constant speed at feedrate-sensitive regions under drive and contour-error constraints. Int J Mach Tools Manuf 2017; 116: 1–17.

10.

Song

JW.

Interval partition-based feedrate scheduling with axial drive constraints for five-axis spline toolpaths. Int J Adv Manuf Technol 2019; 105(11): 4701–4714.

11.

Debrouwere

Loock

Pipeleers

, et al. Time-optimal path following for robots with convex–concave constraints using sequential convex programming. IEEE Trans Robot 2013; 29(6): 1485–1495.

12.

Pham

QC.

A general, fast, and robust implementation of the time-optimal path parameterization algorithm. IEEE Trans Robot 2014; 30(6): 1533–1540.

13.

Erkorkmaz

Chen

Zhao

, et al. Linear programming and windowing based feedrate optimization for spline toolpaths. CIRP Annals—Manuf Technol 2017; 66(1)): 393–396.

14.

Liu

Sun

, et al. The optimal feedrate planning on five-axis parametric tool path with geometric and kinematic constraints for CNC machine tools. Int J Prod Res 2017; 55(13): 3715–3731.

15.

Sencer

Altintas

Croft

Feed optimization for five-axis CNC machine tools with drive constraints. Int J Mach Tools Manuf 2008; 48(7-8): 733–745.

16.

Beudaert

Lavernhe

Tournier

Feedrate interpolation with axis jerk constraints on 5-axis NURBS and G1 toolpath. Int J Mach Tools Manuf 2012; 57: 73–82.

17.

Sun

Zhao

Bao

, et al. A novel adaptive-feedrate interpolation method for NURBS toolpath with drive constraints. Int J Mach Tools Manuf 2014; 77: 74–81.

18.

Chen

Sun

Adaptive feedrate planning for continuous parametric tool path with confined contour error and axis jerks. Int J Adv Manuf Technol 2017; 89: 1113–1125.

19.

Chen

Sun

A moving knot sequence-based feedrate scheduling method of parametric interpolator for CNC machining with contour error and drive constraints. Int J Adv Manuf Technol 2018; 98: 487–504.

20.

Liang

Zhao

An iterative feed rate scheduling method with confined high-order constraints in parametric interpolation. Int J Adv Manuf Technol 2017; 92(5-8): 2001–2015.

21.

Zhang

, et al. A bidirectional adaptive feedrate scheduling method of NURBS interpolation based on S-shaped ACC/DEC algorithm. IEEE Access 2018; 6: 63794–63812.

22.

Jia

Qin

, et al. A five-axis dual NURBS interpolator with constant speed at feedrate-sensitive regions under axial drive constraints. J Manuf Sci Eng 2019; 141(6): 061002.