In this paper we address the problem of assigning a set of tasks to a set of Automated Guided Vehicles (AGVs), in a conflict-free manner. Specifically, we consider a system of multiple AGVs, moving along a predefined roadmap, and utilized for transportation of goods in automated warehouses. Sequential application of task assignment and path planning often gives rise to pathological situations, such as deadlocks, in which AGVs block each other, thus preventing tasks completion. In this paper we propose a method for assigning tasks while taking into account the subsequent path planning, encoding possible conflicts into a conflict graph, that is subsequently utilized for defining constraints of an optimization problem. Simulations are performed on maps of real industrial environments, to compare the proposed method with traditional task assignment.

Optimized simultaneous conflict-free task assignment and path planning for multi-AGV systems / Sabattini, Lorenzo; Digani, Valerio; Secchi, Cristian; Fantuzzi, Cesare. - 2017-(2017), pp. 1083-1088. ((Intervento presentato al convegno 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2017 tenutosi a can nel 2017.

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Powered by IRIS-about IRIS-Utilizzo dei cookie

 Copyright © 2021