In the context of Logistics 4.0, effective management of fleets of mobile agents in automated industrial plants is imperative to ensure productivity and enhance business flexibility. This study introduces an AGV traffic management system based on the Lifelong Multi-Agent Path Finding (L-MAPF) algorithm for the coordination of a fleet of AGVs. Unlike previous studies applied to a standardized grid-like environment, we focus on real-world industrial scenarios with bidirectional narrow corridors, where AGVs operate, moving on a roadmap. Our solution is based on a three-layer environment representation, i.e., a gridmap layer useful to represent the workspace of the AGVs, a roadmap layer employed to plan AGV paths, and a topological layer that divides the plant into different sectors, like corridors. For complete conflict resolution, we utilize our Bounded Horizon Conflict-Based Search, incorporating two innovative strategies for calculating corridor extension on the roadmap and expanding the time horizon within the corridor. The results of the tests conducted in a real industrial setting are presented and discussed in detail, demonstrating the effectiveness of our proposed method. Specifically, this methodology guarantees real-time AGV coordination and mitigates deadlock situations.

AGV Traffic Management in Automated Industrial Plants: An Enhanced Lifelong Multi-Agent Path Finding Approach / Bonetti, A.; Proia, S.; Guidetti, S.; Sabattini, L.. - (2024), pp. 626-632. (Intervento presentato al convegno 20th IEEE International Conference on Automation Science and Engineering, CASE 2024 tenutosi a ita nel 2024) [10.1109/CASE59546.2024.10711842].

AGV Traffic Management in Automated Industrial Plants: An Enhanced Lifelong Multi-Agent Path Finding Approach

Bonetti A.
;
Proia S.;Sabattini L.
2024

Abstract

In the context of Logistics 4.0, effective management of fleets of mobile agents in automated industrial plants is imperative to ensure productivity and enhance business flexibility. This study introduces an AGV traffic management system based on the Lifelong Multi-Agent Path Finding (L-MAPF) algorithm for the coordination of a fleet of AGVs. Unlike previous studies applied to a standardized grid-like environment, we focus on real-world industrial scenarios with bidirectional narrow corridors, where AGVs operate, moving on a roadmap. Our solution is based on a three-layer environment representation, i.e., a gridmap layer useful to represent the workspace of the AGVs, a roadmap layer employed to plan AGV paths, and a topological layer that divides the plant into different sectors, like corridors. For complete conflict resolution, we utilize our Bounded Horizon Conflict-Based Search, incorporating two innovative strategies for calculating corridor extension on the roadmap and expanding the time horizon within the corridor. The results of the tests conducted in a real industrial setting are presented and discussed in detail, demonstrating the effectiveness of our proposed method. Specifically, this methodology guarantees real-time AGV coordination and mitigates deadlock situations.
2024
20th IEEE International Conference on Automation Science and Engineering, CASE 2024
ita
2024
626
632
Bonetti, A.; Proia, S.; Guidetti, S.; Sabattini, L.
AGV Traffic Management in Automated Industrial Plants: An Enhanced Lifelong Multi-Agent Path Finding Approach / Bonetti, A.; Proia, S.; Guidetti, S.; Sabattini, L.. - (2024), pp. 626-632. (Intervento presentato al convegno 20th IEEE International Conference on Automation Science and Engineering, CASE 2024 tenutosi a ita nel 2024) [10.1109/CASE59546.2024.10711842].
File in questo prodotto:
File Dimensione Formato  
24CASEa.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 776.92 kB
Formato Adobe PDF
776.92 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

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