Constrained time-efficient and smooth cubic spline trajectory generation for industrial robots

被引:24
作者
Cao, B [1 ]
Dodds, GI [1 ]
Irwin, GW [1 ]
机构
[1] Queens Univ Belfast, Dept Elect & Elect Engn, Belfast BT9 5AH, Antrim, North Ireland
来源
IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS | 1997年 / 144卷 / 05期
关键词
industrial robots; smooth cubic spline trajectory generation; cubic splines;
D O I
10.1049/ip-cta:19971494
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An approach to constrained time-efficient and smooth cubic spline trajectory generation is presented. A suitable objective function to combine the minimisation of travelling time with smoothness of the robot trajectories is proposed. Cubic splines are used to describe the joint trajectories which satisfy constraints on velocity, acceleration and jerk. The algorithm combining the penalty function and polytope method is developed and used to find the globally optimal solution to the optimisation problems. Minimisation of the energy, the vibrations and the mechanical wear of the robotic system is also explained intuitively. The effects of the weights in the objective function and of control knots on smoothness, time optimality and path deviation errors are shown mainly by simulation. The simulation results also show that path deviation errors can be reduced through suitably choosing the weights in the objective function and all the joint trajectories are optimised in terms of the objective function, whereas a solely time-efficient trajectory generation scheme only fully utilises the slowest joint capabilities. The feasibility of the method is further illustrated by experimental results with a SCARA type robot.
引用
收藏
页码:467 / 475
页数:9
相关论文
共 25 条
[1]  
CAO BL, 1994, IEEE INT CONF ROBOT, P1853, DOI 10.1109/ROBOT.1994.351191
[2]  
Cao Y, 1996, CHINESE J CHEM, V14, P1
[3]   ONLINE APPROXIMATE CARTESIAN PATH TRAJECTORY PLANNING FOR ROBOTIC MANIPULATORS [J].
CHANG, YH ;
LEE, TT ;
LIU, CH .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1992, 22 (03) :542-547
[4]   BOUNDED DEVIATION JOINT PATH ALGORITHMS FOR PIECEWISE CUBIC POLYNOMIAL TRAJECTORIES [J].
CHOI, BK ;
KIM, DW .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1990, 20 (03) :725-733
[5]  
DE PK, 1994, P IEEE INT C ROB AUT, V4, P2742
[6]  
GERALD CF, 1989, APPL NUMERICAL ANAL, P181
[7]  
GILBERT J, 1989, THESIS U HULL UK
[8]  
GILL P, 1993, PRACTICAL OPTIMIZATI
[9]  
KAHN ME, 1971, ASME, P164
[10]  
Khatib O., 1983, P 6 IFTOMM WORLD C T, P1128