Bezier Curve Based Programmed Trajectory For Coordinated Motion Of Two Robots In Cartesian Space

摘要

Coordinated motion of two robots in Cartesian space is considered in the paper. The goal is to generate trajectories for which change of distance between points on trajectories during motion is minimal. To minimize relative position errors along trajectories an idea of the corrective motion is introduced. Trajectory coordinates are calculated as the sum of programmed and corrective motions. To calculate the speed vector of the programmed motion at the current position, the speed at the closest point on the programmed trajectory is used. The closest point is defined as: (i) the point to which the distance from the current position is minimal or (ii) the programmed position at given time. In order to attract the generated trajectory to the programmed one a modification of the programmed speed vector is proposed. The described approach is verified in a simulation. For simulation experiments programmed trajectories defined by Bezier curve segments are used. Simulations for different shapes of programmed trajectories and different programmed velocity rates are presented.