TY - JOUR
T1 - Suboptimal Robot Joint Interpolation Within User‐Specified Knot Tolerances
AU - Simon, Dan
AU - Isik, Can
PY - 1993/10
Y1 - 1993/10
N2 - Approximation of a desired robot path can be accomplished by interpolating a curve through a sequence of joint‐space knots. A smooth interpolated trajectory can be realized by using trigonometric splines. But, sometimes the joint trajectory is not required to exactly pass through the given knots. The knots may rather be centers of tolerances near which the trajectory is required to pass. In this article, we optimize trigonometric splines through a given set of knots subject to user‐specified knot tolerances. The contribution of this article is the straightforward way in which intermediate constraints (i.e., knot angles) are incorporated into the parameter optimization problem. Another contribution is the exploitation of the decoupled nature of trigonometric splines to reduce the computational expense of the problem. The additional freedom of varying the knot angles results in a lower objective function and a higher computational expense compared to the case in which the knot angles are constrained to exact values. The specific objective functions considered are minimum jerk and minimum torque. In the minimum jerk case, the optimization problem reduces to a quadratic programming problem. Simulation results for a two‐link manipulator are presented to support the results of this article.
AB - Approximation of a desired robot path can be accomplished by interpolating a curve through a sequence of joint‐space knots. A smooth interpolated trajectory can be realized by using trigonometric splines. But, sometimes the joint trajectory is not required to exactly pass through the given knots. The knots may rather be centers of tolerances near which the trajectory is required to pass. In this article, we optimize trigonometric splines through a given set of knots subject to user‐specified knot tolerances. The contribution of this article is the straightforward way in which intermediate constraints (i.e., knot angles) are incorporated into the parameter optimization problem. Another contribution is the exploitation of the decoupled nature of trigonometric splines to reduce the computational expense of the problem. The additional freedom of varying the knot angles results in a lower objective function and a higher computational expense compared to the case in which the knot angles are constrained to exact values. The specific objective functions considered are minimum jerk and minimum torque. In the minimum jerk case, the optimization problem reduces to a quadratic programming problem. Simulation results for a two‐link manipulator are presented to support the results of this article.
UR - http://www.scopus.com/inward/record.url?scp=0027678279&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027678279&partnerID=8YFLogxK
U2 - 10.1002/rob.4620100702
DO - 10.1002/rob.4620100702
M3 - Article
AN - SCOPUS:0027678279
SN - 0741-2223
VL - 10
SP - 889
EP - 911
JO - Journal of Robotic Systems
JF - Journal of Robotic Systems
IS - 7
ER -