Feed-rate optimization with jerk constraints for generating minimum-time trajectories

By Jingyan Dong, P. Ferreira, J. Stori. 2007

195 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Feedrate optimization for smooth minimum-time trajectory generation with higher order constraints (2016, methodology): “There are a number of trajectory planning algorithms which generate trajectory to drive a manipulator or motion stage with constraints on joint torques or actuator forces along a given geometric path in minimum or near-minimum time [1–8].”
A greedy algorithm for feedrate planning of CNC machines along curved tool paths with confined jerk (2012, methodology): “Dong et al [14] extended their discrete greedy algorithm [7] by adding parametric jerk constraints.”
Statistical evaluation of an evolutionary algorithm for minimum time trajectory planning problem for industrial robots (2017, methodology): “In [10], hybrid optimization procedure is presented to calculate time optimal path-constrained subject to kinematic constraints.”
Efficient algorithm for time-optimal feedrate planning and smoothing with confined chord error and acceleration (2013, methodology): “Dong et al [13, 14] gave discrete greedy algorithms with constraints of parametric velocity, acceleration, and jerk based on a series of single variable optimization subproblems.”