首页 /研究 /Time Optimal Path Planning of Palletizing Robot
MANIPULATION

Time Optimal Path Planning of Palletizing Robot

Yong Xu, Ying Hong

发表年份
2013
引用次数
7

摘要

In order to improve the efficiency and reduce the vibration of Palletizing Robot, a new optimal trajectory planning algorithm is proposed. This algorithm is applied to the trajectory planning of Palletizing manipulators. The S-shape acceleration and deceleration curve is adopted to interpolate joint position sequences. Considering constraints of joint velocities, accelerations and jerks, the traveling time of the manipulator is minimized. The joint interpolation confined by deviation is used to approximate the straight path, and the deviation is decreased significantly by adding only small number of knots. Traveling time is solved by using quintic polynomial programming strategy between the knots, and then time-jerk optimal trajectories which satisfy constraints are planned. The results show that the method can avoid the problem of manipulator singular points and improve the palletize efficiency.

关键词

JerkAccelerationTrajectoryQuintic functionControl theory (sociology)Mathematical optimizationMathematicsMotion planningPath (computing)Position (finance)

相关论文

查看 MANIPULATION 分类全部论文