The novel paradigm of collaborative automation, with machines and industrial robots that synergically share the same workspace with human workers, requires to rethink how activities are prioritized in order to account for possible variabilities in their durations. This article proposes a scheduling method for collaborative assembly tasks that allows to optimally plan assembly activities based on the knowledge acquired during runtime and so adapts to variations along the life cycle of a manufacturing process. The scheduler is based on time Petri nets and the output plan is optimized by minimizing the idle time of each agent. The experimental validation carried out on a realistic industrial use-case consisting of a small assembly line with two robots and a human operator confirms the effectiveness of the approach.
Optimal scheduling of human–robot collaborative assembly operations with time Petri nets
A. Casalino;A. M. Zanchettin;L. Piroddi;P. Rocco
2021-01-01
Abstract
The novel paradigm of collaborative automation, with machines and industrial robots that synergically share the same workspace with human workers, requires to rethink how activities are prioritized in order to account for possible variabilities in their durations. This article proposes a scheduling method for collaborative assembly tasks that allows to optimally plan assembly activities based on the knowledge acquired during runtime and so adapts to variations along the life cycle of a manufacturing process. The scheduler is based on time Petri nets and the output plan is optimized by minimizing the idle time of each agent. The experimental validation carried out on a realistic industrial use-case consisting of a small assembly line with two robots and a human operator confirms the effectiveness of the approach.File | Dimensione | Formato | |
---|---|---|---|
TASE_Casalino_et_al_2021.pdf
Accesso riservato
:
Publisher’s version
Dimensione
4.01 MB
Formato
Adobe PDF
|
4.01 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.