Formulation and optimization of cubic polynomial joint trajectories for industrial robots
Formulation and optimization of cubic polynomial joint trajectories for industrial robots
复制标题
DOI：
10.1109/tac.1983.1103181
复制
发表时间：
1983
影响因子：
6.8
通讯作者：
C. Lin;P. Chang;J. Luh
中科院分区：
文献类型：
--
作者：
C. Lin;P. Chang;J. Luh
Because of physical constraints, the optimum control of industrial robots is a difficult problem. An alternative approach is to divide the problem into two parts: optimum path planning for off-line processing followed by on-line path tracking. The path tracking can be achieved by adopting the existing approach. The path planning is done at the joint level. Cubic spline functions are used for constructing joint trajectories for industrial robots. The motion of the robot is specified by a sequence of Cartesian knots, i.e., positions and orientations of the hand. For an N -joint robot, these Cartesian knots are transformed into N sets of joint displacements, with one set for each joint. Piecewise cubic polynomials are used to fit the sequence of joint displacements for each of the N joints. Because of the use of the cubic spline function idea, there are only n - 2 equations to be solved for each joint, where n is the number of selected knots. The problem is proved to be uniquely solvable. An algorithm is developed to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subject to the physical constraints on joint velocities, accelerations, and jerks. Fortran programs have been written to implement: 1) the procedure for constructing the cubic polynomial joint trajectories; and 2) the algorithm for minimizing the traveling time. Results are illustrated by means of a numerical example.
