@ARTICLE{Markowski_Tomasz_Optimization_2021,
 author={Markowski, Tomasz and Bilski, Piotr},
 volume={vol. 67},
 number={No 4},
 journal={International Journal of Electronics and Telecommunications},
 pages={559-564},
 howpublished={online},
 year={2021},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={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.},
 type={Article},
 title={Optimization of Autonomous Agent Routes in Logistics Warehouse},
 URL={http://www.czasopisma.pan.pl/Content/121888/PDF/77_3464-Bliski_skl1.pdf},
 doi={10.24425/ijet.2021.137846},
 keywords={shortest path problem, hive of robots, logistics, microcontrollers},
}