In this paper, we propose an algorithm for coordinating a group of mobile robots that go through predefined paths in a dynamic industrial environment. Coordination diagrams are used for representing the possible collisions among the vehicles. We exploit this information for developing a centralized and incremental planning algorithm that allows to coordinate the vehicles and to take into account unexpected events that can occur in an industrial environment. Simulation tests have been executed in order to compare the performance of our algorithm with the one currently implemented by the company.
Coordination of Industrial AGVs
OLMI, Roberto;
2011
Abstract
In this paper, we propose an algorithm for coordinating a group of mobile robots that go through predefined paths in a dynamic industrial environment. Coordination diagrams are used for representing the possible collisions among the vehicles. We exploit this information for developing a centralized and incremental planning algorithm that allows to coordinate the vehicles and to take into account unexpected events that can occur in an industrial environment. Simulation tests have been executed in order to compare the performance of our algorithm with the one currently implemented by the company.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
olmi2011.pdf
solo gestori archivio
Descrizione: Full text editoriale
Tipologia:
Full text (versione editoriale)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
1.62 MB
Formato
Adobe PDF
|
1.62 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.