The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
1999
DOI: 10.1002/(sici)1097-0207(19990910)46:1<45::aid-nme662>3.0.co;2-k
|View full text |Cite
|
Sign up to set email alerts
|

Cubic spline algorithms for orientation interpolation

Abstract: SUMMARYThis article presents a class of spline algorithms for generating orientation trajectories that approximately minimize angular acceleration. Each algorithm constructs a twice-di erentiable curve on the rotation group SO(3) that interpolates a given ordered set of rotation matrices at speciÿed knot times. Rotation matrices are parametrized, respectively, by the unit quaternion, canonical co-ordinate, and Cayley-Rodrigues representations. All the algorithms share the common feature of (i) being invariant … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
21
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 44 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…Piecewise interpolating functions with high continuity and/or geometrically continuous splines are adequate tools in generating smooth motion of the robotic manipulators when the manipulator kinematics (velocity, acceleration, and/or jerk) or dynamics (force and/or torque) is considered . Such approach should reduce resonant frequency excitation and generate smoother trajectory profile.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Piecewise interpolating functions with high continuity and/or geometrically continuous splines are adequate tools in generating smooth motion of the robotic manipulators when the manipulator kinematics (velocity, acceleration, and/or jerk) or dynamics (force and/or torque) is considered . Such approach should reduce resonant frequency excitation and generate smoother trajectory profile.…”
Section: Introductionmentioning
confidence: 99%
“…Such approach should reduce resonant frequency excitation and generate smoother trajectory profile. The interpolation of smooth curves (twice differentiable and cubic in the parametrized coordinates) invariant with respect to the fixed/moving frame represents an excellent approach to minimize angular acceleration . A new planning approach of a manipulator along a set of nodal points for a collection of established kinematical requirements is presented in the work of du Plessis and Snyman .…”
Section: Introductionmentioning
confidence: 99%
“…The trajectories used in path planning can have different representations, among them, piecewise interpolating curves, parametric and/or geometric continuous splines,() or uniform cubic B‐spline with parametric and geometric continuity, have been usually considered. () The interpolation of smooth curves for generating orientation trajectories with minimal angular acceleration is presented in Courchamp et al A new interpolation methodology for the path planning of an industrial robot and a set of prescribed kinematical requirements is presented in Gregory and Courchamp . Algebraic‐trigonometric Hermite polynomial curves that are very practical in generating smooth and continuous manipulator motion are considered in Kramer and Drake .…”
Section: Introductionmentioning
confidence: 99%
“…There have been many attempts to solve similar interpolation problems on Lie groups in terms of the coordinates of the embedding space [10], [13]. The idea is to find a suitable mapping in order to express the information in a linear space, solve the interpolation problem there and pull the trajectory back to a manifold.…”
Section: Introductionmentioning
confidence: 99%
“…Popular SO(3) interpolation algorithms adopt various re-parametrizations of the rotation matrices (e.g. rotation axes and angles, unit quaternions) and perform cubic spline interpolation based on such representations [10]. These algorithms, however, often do not generalize to higher-dimensional manifolds.…”
Section: Introductionmentioning
confidence: 99%