An assembly sequence planning algorithm for a multi-robot cell

K. Jiang, L. D. Seneviratne, S. W.E. Earles

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

A computationally efficient assembly sequence planning algorithm for a multi-robot cell is presented. A compact diagrammatic representation of the problem accounting for constraints which avoid collisions between the robots is introduced. The algorithm is based on dynamic programming. The computational complexity of the algorithm is O(\ognJk) for m robots to assemble n elements in k groups.

Original languageBritish English
Title of host publicationIROS 1992 - Proceedings of the 1992 IEEE/RSJ International Conference on Intelligent Robots and Systems
Subtitle of host publicationSensor-Based Robotics and Opportunties for its Industrial Applications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2110-2115
Number of pages6
ISBN (Electronic)0780307372
DOIs
StatePublished - 1992
Event1992 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 1992 - Raleigh, United States
Duration: 7 Jul 199210 Jul 1992

Publication series

NameIEEE International Conference on Intelligent Robots and Systems
Volume3
ISSN (Print)2153-0858
ISSN (Electronic)2153-0866

Conference

Conference1992 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 1992
Country/TerritoryUnited States
CityRaleigh
Period7/07/9210/07/92

Fingerprint

Dive into the research topics of 'An assembly sequence planning algorithm for a multi-robot cell'. Together they form a unique fingerprint.

Cite this