TY - JOUR N2 - The paper introduces the distributed framework for determining the shortest path of robots in the logistic applications, i.e. the warehouse with a swarm of robots cooperating in the Real- Time mode. The proposed solution uses the optimization routine to avoid the downtime and collisions between robots. The presented approach uses the reference model based on Dijkstra, Floyd- Warshall and Bellman-Ford algorithms, which search the path in the weighted undirected graph. Their application in the onboard robot’s computer requires the analysis of the time efficiency. Results of comparative simulations for the implemented algorithms are presented. For their evaluation the data sets reflecting actual processes were used. Outcomes of experiments have shown that the tested algorithms are applicable for the logistic purposes, however their ability to operate in the Real-Time requires the detailed analysis. L1 - http://journals.pan.pl/Content/121888/PDF/77_3464-Bliski_skl1.pdf L2 - http://journals.pan.pl/Content/121888 PY - 2021 IS - No 4 EP - 564 DO - 10.24425/ijet.2021.137846 KW - shortest path problem KW - hive of robots KW - logistics KW - microcontrollers A1 - Markowski, Tomasz A1 - Bilski, Piotr PB - Polish Academy of Sciences Committee of Electronics and Telecommunications VL - vol. 67 DA - 2021.12.27 T1 - Optimization of Autonomous Agent Routes in Logistics Warehouse SP - 559 UR - http://journals.pan.pl/dlibra/publication/edition/121888 T2 - International Journal of Electronics and Telecommunications ER -