Abstract
To achieve online Cartesian space trajectory planning, the paper presents methods for approximating Cartesian paths by recursive joint trajectories. Systematic procedures are proposed for approximating an arbitrary smooth Cartesian path by concatenated line segments and for selecting intermediate knot points along the line segments. Two recursive joint trajectory planning algorithms are derived using quartic spline interpolation. The proposed approach is illustrated by a numerical example.
Original language | English |
---|---|
Pages (from-to) | 542-547 |
Number of pages | 6 |
Journal | IEEE Transactions on Systems, Man and Cybernetics |
Volume | 22 |
Issue number | 3 |
DOIs | |
State | Published - 1992 |
Externally published | Yes |