Trajectory planning of multiple manipulators

In the paper, a global method of redundancy resolution has been proposed to solve the task of trajectories planning for multiple manipulators operating in a common workspace. The task of manipulators is to follow, via end-effectors, the geometric paths given in a task space. A final time of the task performance is not fixed. The control constraints and state inequality constraints resulting from collision avoidance are taken into account. This task has been solved based on the calculus of variations. A computer example involving two planar redundant manipulators of three revolute kinematics pairs is presented.

[1]  M. Galicki,et al.  Optimal Planning of a Collision-free Trajectory of Redundant Manipulators , 1992 .

[2]  Y. Hamam,et al.  Optimal motion planning of a multiple-robot system based on decomposition coordination , 1992, IEEE Trans. Robotics Autom..

[3]  E. Freund,et al.  Real-Time Pathfinding in Multirobot Systems Including Obstacle Avoidance , 1988, Int. J. Robotics Res..

[4]  Grzegorz Pajak,et al.  Planning of an optimal collision-free trajectory subject to control constraints , 2001, Proceedings of the Second International Workshop on Robot Motion and Control. RoMoCo'01 (IEEE Cat. No.01EX535).

[5]  Vijay Kumar,et al.  Nonholonomic motion planning for multiple mobile manipulators , 1997, Proceedings of International Conference on Robotics and Automation.

[6]  Bum Hee Lee,et al.  Collision-Free Motion Planning of Two Robots , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Eduardo Todt,et al.  Analysis and classification of multiple robot coordination methods , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[8]  E. Freund,et al.  Pathfinding in multi-robot systems: Solution and applications , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[9]  B. Brunt.  The calculus of variations , 2003 .