This paper proposes a novel dynamic method based on Behavior Trees (BTs) that integrates planning and allocation of tasks in mixed human robot teams, suitable for manufacturing environments. The Behavior Tree formulation allows encoding a single job as a compound of different tasks with temporal and logic constraints. In this way, instead of formulating an offline centralized optimization problem, the role allocation problem is solved with multiple simplified online optimization sub-problems, without complex and cross-schedule task dependencies. These sub-problems are defined as Mixed-Integer Linear Programs (MILPs), that, according to the worker-actions related costs and the workers’ availability, allocate the yet-to-execute tasks among the available workers. To characterize the behavior of the developed method, we opted to perform different simulation experiments, in which the results of the action-worker allocation and the computational complexity are evaluated. The obtained results, due to the nature of the algorithm and to the possibility of simulating the agents’ behavior, illustrate adequately also how the algorithm performs in real experiments.
An Integrated Dynamic Method for Allocating Roles and Planning Tasks for Mixed Human-Robot Teams / Fusaro, Fabio; Lamon, Edoardo; De Momi, Elena; Ajoudani, Arash. - (2021), pp. 534-539. (Intervento presentato al convegno 30th IEEE International Conference on Robot and Human Interactive Communication, RO-MAN 2021 tenutosi a Vancouver, BC, Canada nel 8th-12th August 2021) [10.1109/RO-MAN50785.2021.9515500].
An Integrated Dynamic Method for Allocating Roles and Planning Tasks for Mixed Human-Robot Teams
Lamon, Edoardo;
2021-01-01
Abstract
This paper proposes a novel dynamic method based on Behavior Trees (BTs) that integrates planning and allocation of tasks in mixed human robot teams, suitable for manufacturing environments. The Behavior Tree formulation allows encoding a single job as a compound of different tasks with temporal and logic constraints. In this way, instead of formulating an offline centralized optimization problem, the role allocation problem is solved with multiple simplified online optimization sub-problems, without complex and cross-schedule task dependencies. These sub-problems are defined as Mixed-Integer Linear Programs (MILPs), that, according to the worker-actions related costs and the workers’ availability, allocate the yet-to-execute tasks among the available workers. To characterize the behavior of the developed method, we opted to perform different simulation experiments, in which the results of the action-worker allocation and the computational complexity are evaluated. The obtained results, due to the nature of the algorithm and to the possibility of simulating the agents’ behavior, illustrate adequately also how the algorithm performs in real experiments.File | Dimensione | Formato | |
---|---|---|---|
RO_MAN_2021_An_Integrated_Dynamic_Method_for_Allocating_Roles_and_Planning_Tasks_for_Mixed_Human_Robot_Teams.pdf
accesso aperto
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
461.86 kB
Formato
Adobe PDF
|
461.86 kB | Adobe PDF | Visualizza/Apri |
An_Integrated_Dynamic_Method_for_Allocating_Roles_and_Planning_Tasks_for_Mixed_Human-Robot_Teams.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.05 MB
Formato
Adobe PDF
|
1.05 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione