Fully automated two-robot flexible assembly cell

Li Chen Fu; Yung Jen Hsu

Fully automated two-robot flexible assembly cell

Li Chen Fu^*
, Yung Jen Hsu

^*Corresponding author for this work

National Taiwan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

In this paper, the problem of scheduling for a two-robot assembly cell is formulated and an algorithm is then proposed to resolve the problem. Such a cell is able to process more than one type of assembly task and each type can be performed more than once (usually many times). All the parts are input to the cell through a conveyor belt in a serial order, which are on-line identified using an overhead camera and a side camera. Both robots are identical in terms of their assembly function, i.e. each of them can perform any type of assembly task. Buffers are assumed to be present in order to store the parts which already arrived but are unready to be assembled. The proposed scheduling algorithm after integrating the on-line assembly planning and motion planning is to optimize the performance measure- makespan.

Original language	English
Title of host publication	Proceedings - IEEE International Conference on Robotics and Automation
Publisher	Publ by IEEE
Pages	332-338
Number of pages	7
ISBN (Print)	0818634529
State	Published - 1993
Externally published	Yes
Event	Proceedings of the IEEE International Conference on Robotics and Automation - Atlanta, GA, USA Duration: 02 05 1993 → 06 05 1993

Publication series

Name	Proceedings - IEEE International Conference on Robotics and Automation
Volume	3
ISSN (Print)	1050-4729

Conference

Conference	Proceedings of the IEEE International Conference on Robotics and Automation
City	Atlanta, GA, USA
Period	02/05/93 → 06/05/93

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Cite this

@inproceedings{0ff82dce83eb4236b6fcae6d6d6b8836,

title = "Fully automated two-robot flexible assembly cell",

abstract = "In this paper, the problem of scheduling for a two-robot assembly cell is formulated and an algorithm is then proposed to resolve the problem. Such a cell is able to process more than one type of assembly task and each type can be performed more than once (usually many times). All the parts are input to the cell through a conveyor belt in a serial order, which are on-line identified using an overhead camera and a side camera. Both robots are identical in terms of their assembly function, i.e. each of them can perform any type of assembly task. Buffers are assumed to be present in order to store the parts which already arrived but are unready to be assembled. The proposed scheduling algorithm after integrating the on-line assembly planning and motion planning is to optimize the performance measure- makespan.",

author = "Fu, \{Li Chen\} and Hsu, \{Yung Jen\}",

year = "1993",

language = "英语",

isbn = "0818634529",

series = "Proceedings - IEEE International Conference on Robotics and Automation",

publisher = "Publ by IEEE",

pages = "332--338",

booktitle = "Proceedings - IEEE International Conference on Robotics and Automation",

note = "Proceedings of the IEEE International Conference on Robotics and Automation ; Conference date: 02-05-1993 Through 06-05-1993",

}

TY - GEN

T1 - Fully automated two-robot flexible assembly cell

AU - Fu, Li Chen

AU - Hsu, Yung Jen

PY - 1993

Y1 - 1993

N2 - In this paper, the problem of scheduling for a two-robot assembly cell is formulated and an algorithm is then proposed to resolve the problem. Such a cell is able to process more than one type of assembly task and each type can be performed more than once (usually many times). All the parts are input to the cell through a conveyor belt in a serial order, which are on-line identified using an overhead camera and a side camera. Both robots are identical in terms of their assembly function, i.e. each of them can perform any type of assembly task. Buffers are assumed to be present in order to store the parts which already arrived but are unready to be assembled. The proposed scheduling algorithm after integrating the on-line assembly planning and motion planning is to optimize the performance measure- makespan.

AB - In this paper, the problem of scheduling for a two-robot assembly cell is formulated and an algorithm is then proposed to resolve the problem. Such a cell is able to process more than one type of assembly task and each type can be performed more than once (usually many times). All the parts are input to the cell through a conveyor belt in a serial order, which are on-line identified using an overhead camera and a side camera. Both robots are identical in terms of their assembly function, i.e. each of them can perform any type of assembly task. Buffers are assumed to be present in order to store the parts which already arrived but are unready to be assembled. The proposed scheduling algorithm after integrating the on-line assembly planning and motion planning is to optimize the performance measure- makespan.

UR - https://www.scopus.com/pages/publications/0027297496

M3 - 会议稿件

AN - SCOPUS:0027297496

SN - 0818634529

T3 - Proceedings - IEEE International Conference on Robotics and Automation

SP - 332

EP - 338

BT - Proceedings - IEEE International Conference on Robotics and Automation

PB - Publ by IEEE

T2 - Proceedings of the IEEE International Conference on Robotics and Automation

Y2 - 2 May 1993 through 6 May 1993

ER -

Fully automated two-robot flexible assembly cell

Abstract

Publication series

Conference

UN SDGs

Other files and links

Fingerprint

Cite this