Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-09T05:50:20.528Z Has data issue: false hasContentIssue false
  • English
  • Français

Trajectory planning for coordinately operating robots

Published online by Cambridge University Press:  27 February 2009

Y. P. Chien  and
Qing Xue
Y. P. Chien
Affiliation:
Department of Electrical Engineering, Purdue University, School of Engineering and Technology at Indianapolis, 1201 East 38th St, Indianapolis, IN 46205, U.S.A.
Qing Xue
Affiliation:
Department of Electrical Engineering, Purdue University, School of Engineering and Technology at Indianapolis, 1201 East 38th St, Indianapolis, IN 46205, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

An efficient locally minimum-time trajectory planning algorithm for coordinately operating multiple robots is introduced. The task of the robots is to carry a common rigid object from an initial position to a final position along a given path in three-dimensional workspace in minimum time. The number of robots in the system is arbitrary. In the proposed algorithm, the desired motion of the common object carried by the robots is used as the key to planning of the trajectories of all the non-redundant robots involved. The search method is used in the trajectory planning. The planned robot trajectories satisfy the joint velocity, acceleration and torque constraints as well as the path constraints. The other constraints such as collision-free constraints, can be easily incorporated into the trajectory planning in future research.

Type
Research Article
Information
AI EDAM , Volume 4 , Issue 3 , August 1990 , pp. 165 - 177
Copyright
Copyright © Cambridge University Press 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bobrow, J. E., Dubowsky, S. and Gibson, J. S. 1985. Time-optimal control of robotic manipulators along specified paths. International Journal of Robotic Research, 4(3), 3–17.Google Scholar
Chen, Y. B. and Desrochers, A. A. 1990. A proof of the structure of the minimum-time control law of robotic manipulators using Hamiltonian formulation. IEEE Transactions on Robotics and Automation, 6(3), 388–393.CrossRefGoogle Scholar
Hayati, S. A. 1988. Position and force control of coordinated multiple arms. IEEE Transactions on Aerospace and Electronic Systems, 24, 584–590.Google Scholar
Lee, B. H. 1985. An approach to motion planning and motion control of two robots in a common workspace. Ph.D. Dissertation, College of Engineering, The University of Michigan.Google Scholar
Li, Z., Hsu, P. and Sastry, S. 1989. Grasping coordinated manipulation by a multifingered robot hand, International Journal of Robotic Research, 8(4), 33–50.Google Scholar
Moon, S. B. and Ahmad, S. 1990. Time optimal trajectories for cooperative multiple robot systems. Proceedings of the 29th IEEE Conference on Decision and Control, Honolulu, Hawaii.Google Scholar
Shin, K. G. and McKay, N. D. 1986. A dynamic programming approach to trajectory planning of robotic manipulators. IEEE Transactions on Automatic Control, AC-31, 491–500.Google Scholar
Slotine, J. E. and Yang, H. S. 1989. Improving the efficiency of time-optimal path-following algorithm. IEEE Transactions on Robotics and Automation, 5, 118–124.CrossRefGoogle Scholar
Tan, H. H. and Potts, R. B. 1989. A discrete trajectory planner for robotic arms with six degrees of freedom. IEEE Transactions on Robotics and Automation, 5, 681–690.Google Scholar
Tarn, T. J., Bejezy, A. K., Li, Z. F. 1988. Dynamic workspace analysis of two cooperating robot arms. Proceedings American Control Conference, pp. 489–498.Google Scholar