Efficient algorithm for time-optimal feedrate planning and smoothing with confined chord error and acceleration


DOI: 10.1007/s00170-012-4450-3

Cite this article as:
Zhang, K., Yuan, CM. & Gao, XS. Int J Adv Manuf Technol (2013) 66: 1685. doi:10.1007/s00170-012-4450-3


In this paper, an efficient algorithm is proposed to generate a smooth near-time-optimal feedrate function along a parametric tool path for three-axis CNC machining under a feedrate bound, an acceleration bound for each axis, and a chord error bound. The algorithm first gives a discrete and computationally efficient algorithm to find a sequence of globally optimal velocity points under the feedrate, acceleration, and chord error bounds. A linear programming strategy is proposed to smooth the velocity points sequence. Finally, the velocity points sequence is fitted into a cubic spline to obtain a near-time-optimal and smooth feedrate function. Simulation and experiment results for Non-uniform rational basis spline curves are presented to illustrate the feasibility of the algorithm.


Time-optimal feedrate planning Chord error Confined acceleration Discrete velocity searching Feedrate smoothing 

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.KLMM, Institute of Systems Science, AMSSChinese Academy of SciencesBeijingChina

Personalised recommendations