We consider multi-robot service scenarios, where tasks appear at any time and in any location of the working area. A solution to such a service task problem requires finding a suitable task assignment and a collision-free trajectory for each robot of a multi-robot team. In cluttered environments, such as indoor spaces with hallways, those two problems are tightly coupled. We propose a decentralized algorithm for simultaneously solving both problems, called Hierarchical Task Assignment and Path Finding (HTAPF). HTAPF extends a previous bio-inspired Multi-Robot Task Allocation (MRTA) framework [1], In this work, task allocation is performed on a arbitrarily deep hierarchy of work areas and is tightly coupled with a fully distributed version of the priority-based planning paradigm [12], using only broadcast communication. Specifically, priorities are assigned implicitly by the order in which data is received from nearby robots. No token passing procedure or specific schedule is in place ensuring robust execution also in the presence of limited probabilistic communication and robot failures.

Summary: Distributed task assignment and path planning with limited communication for robot teams / Albani, D.; Honig, W.; Ayanian, N.; Nardi, D.; Trianni, V.. - 3:(2019), pp. 1770-1772. (Intervento presentato al convegno 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 tenutosi a Montreal; Canada).

Summary: Distributed task assignment and path planning with limited communication for robot teams

Albani D.
;
Nardi D.
;
2019

Abstract

We consider multi-robot service scenarios, where tasks appear at any time and in any location of the working area. A solution to such a service task problem requires finding a suitable task assignment and a collision-free trajectory for each robot of a multi-robot team. In cluttered environments, such as indoor spaces with hallways, those two problems are tightly coupled. We propose a decentralized algorithm for simultaneously solving both problems, called Hierarchical Task Assignment and Path Finding (HTAPF). HTAPF extends a previous bio-inspired Multi-Robot Task Allocation (MRTA) framework [1], In this work, task allocation is performed on a arbitrarily deep hierarchy of work areas and is tightly coupled with a fully distributed version of the priority-based planning paradigm [12], using only broadcast communication. Specifically, priorities are assigned implicitly by the order in which data is received from nearby robots. No token passing procedure or specific schedule is in place ensuring robust execution also in the presence of limited probabilistic communication and robot failures.
2019
18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
Robots; Industrial robots; Multi-robot task
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Summary: Distributed task assignment and path planning with limited communication for robot teams / Albani, D.; Honig, W.; Ayanian, N.; Nardi, D.; Trianni, V.. - 3:(2019), pp. 1770-1772. (Intervento presentato al convegno 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 tenutosi a Montreal; Canada).
File allegati a questo prodotto
File Dimensione Formato  
Albani_Summary_2019.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.02 MB
Formato Adobe PDF
1.02 MB Adobe PDF   Contatta l'autore
Albani_Postprint_Summary_2019.pdf

Open Access dal 09/05/2020

Note: https://dl.acm.org/doi/10.5555/3306127.3331913
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 594.01 kB
Formato Adobe PDF
594.01 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1380368
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact