Hostname: page-component-89b8bd64d-dvtzq Total loading time: 0 Render date: 2026-05-05T18:02:50.098Z Has data issue: false hasContentIssue false

Trajectory planning for coordinately operating robots

Published online by Cambridge University Press:  27 February 2009

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.

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.

Information

Type
Research Article
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.)

Article purchase

Temporarily unavailable