Minimum-time assembly sequence planning for a multi-robot system

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

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

Abstract

A minimum-time assembly sequence planning algorithm for a multi-robot cell is presented. The algorithm uses compact diagrammatic representation of the problem to account for constraints of collision avoidance between the robots. An arrangement for a near optimum assembly sequence is developed based on dynamic programming. This is then taken as an initial state seeking iteratively for a time-minimum sequence.. The algorithm is derived for a two robot cell, and then extended for application to three and more robot workcells.

Original languageBritish English
Title of host publicationIEEE International Workshop on Emerging Technologies and Factory Automation
Subtitle of host publicationTechnology for the Intelligent Factory - Proceedings, ETFA 1992
EditorsR. Zurawski, T.S. Dillon
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages305-310
Number of pages6
ISBN (Electronic)0780308867
DOIs
StatePublished - 1992
Event1992 IEEE International Workshop on Emerging Technologies and Factory Automation, ETFA 1992 - Melbourne, Australia
Duration: 11 Aug 199214 Aug 1992

Publication series

NameIEEE International Conference on Emerging Technologies and Factory Automation, ETFA
Volume1992-August
ISSN (Print)1946-0740
ISSN (Electronic)1946-0759

Conference

Conference1992 IEEE International Workshop on Emerging Technologies and Factory Automation, ETFA 1992
Country/TerritoryAustralia
CityMelbourne
Period11/08/9214/08/92

Fingerprint

Dive into the research topics of 'Minimum-time assembly sequence planning for a multi-robot system'. Together they form a unique fingerprint.

Cite this