Time-optimal traversal of curved paths by Cartesian CNC machines under both constant and speed-dependent axis acceleration bounds
By Sebastian D. Timar, Rida T. Farouki. 2007
57 citations recorded by the source corpus.
Subfields: Computational Mechanics, Control and Systems Engineering, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/f5965a723bc9f8afb1207a44976e673ab3800131
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Control and Systems Engineering
In Industrial and Manufacturing Engineering
Citations in the corpus
- A greedy algorithm for feedrate planning of CNC machines along curved tool paths with confined jerk (2012, methodology): “The optimal feedrate planning problem with acceleration bounds [1, 2, 3, 4] uses a similar rule, but the difference is that it cannot be proved that the “greedy rule” generates a globally optimal solution for the problem.”
- Efficient algorithm for time-optimal feedrate planning and smoothing with confined chord error and acceleration (2013, methodology): “Following [3, 4], Zhang et al [6] gave a simplified feedrate planning method for quadratic B-splines and realized industrial CNC machining.”