Time-Optimal Trajectory Planning Based on Dynamics for Industrial Robot

Given the trajectory of the industrial robot in Cartesian space, the existing methods only consider the kinematic constraints when optimizing the time trajectory planning, and ignore the maximum driving ability of the motor, which is likely to cause an overrun alarm and greatly reduce the trajectory accuracy. Therefore, this paper studies the time-optimal trajectory planning algorithm based on dynamics. Firstly, the algorithm discretizes the path, calculates the Cartesian coordinates of each discrete point and the differential about the path length. Then, this algorithm considers the constraints of dynamics and kinematics, uses the principle of linear programming, recursively calculates the upper limit value of speed and the maximum acceleration value at each discrete point, and calculates the speed value at each discrete point and keeps it within its allowable ranges. Finally, this algorithm uses the speed to calculate the corresponding time of each discrete point, and according to the interpolation period, outputs the path position of each period, the position and orientation in the Cartesian space and joint parameters. The MATLAB program is written to verify the feasibility and efficiency of the algorithm.