TY - JOUR
AU - Thi-Thuong Vuong,
AU - Tien-Phong Nguyen,
AU - Minh-Tuan Nguyen,
PY - 2023/08/10
Y2 - 2024/07/25
TI - SMOOTH AND TIME OPTIMIZATION TRAJECTORY PLANNING FOR ROBOTS USING POLYNOMIAL INTERPOLATION
JF - UTEHY Journal of Science and Technology
JA - jst
VL - 39
IS -
SE - Articles
DO -
UR - http://tapchi.utehy.edu.vn/index.php/jst/article/view/626
SP - 8-14
AB - In this study, the trajectory planning for robots using polynomials is investigated. The polynomials used to plan the robotâ€™s trajectory include multiple cubic polynomials, multiple quintic polynomials, and one higher-order polynomial for the entire trajectory segment with the requirement of smooth motion, i.e., maintaining continuity of velocity, acceleration, and jerk within allowable limits. The traveling time was also an optimized factor. The application results for a parallel robot show that the trajectory using multiple cubic polynomials has the shortest traveling time. However, using multiple cubic polynomials has the disadvantage of a discontinuous jerk. Using a single higher-order polynomial for the entire trajectory takes about 12 % more time than multiple cubic polynomials but has the advantage of a continuous jerk.
ER -