Optimization of autonomous agent routes in logistics warehouse

Authors

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.

References

Mobile Robot Platforms, Shuttle Automated Storage and Retrieval Systems, Industrial Robotic Manipulators, and Gantry Robots: Global Market Analysis and Forecasts, Informa PLC, https://www.tractica.com/research/warehousing-and-logistics-robots/

MIKLINSKA, Joanna. TRENDS IN THE LOGISTICS MARKET AND WAREHOUSES FOR LOGISTICS SERVICE PROVIDERS-EXPERIENCES FROM POLAND. Economic and Social Development: Book of Proceedings, 2020, 193-202.

M. Khamphroo, N. Kwankeo, K. Kaemarungsi and K. Fukawa, "MicroPython-based educational mobile robot for computer coding learning," 2017 8th International Conference of Information and Communication Technology for Embedded Systems (IC-ICTES), Chonburi, 2017

Dokic, Kristian & Radisic, Bojan & Cobović, Mirko. (2020). MicroPython or Arduino C for ESP32 - Efficiency for Neural Network Edge Devices. 10.1007/978-3-030-43364-2_4.

N. Deo, Graph theory with applications to engineering and computer science (Englewood Cliffs, NJ: Prentice-Hall, 1974)

G. Laporte, "The traveling salesman problem: An overview of exact and approximate algorithms," EJOR, Vol.59, pp. 231-247, 1992

Lu Feng, "Shortest path algorithm: Taxonomy and Advance in Research", Acta Geodaetica et Car tographica Sinica, vol. 30, no. 3, pp. 269-275, 2001.

D. Dobrilovic ; V. Jevtic ; I. Beker ; Z. Stojanov, “Shortest-path based Model for Warehouse Inner Transportation Optimization” in 7th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)

Y. Liu and T. M. Vitolo, "Graph Data Warehouse: Steps to Integrating Graph Databases Into the Traditional Conceptual Structure of a Data Warehouse," 2013 IEEE International Congress on Big Data, 2013, pp. 433-434, doi: 10.1109/BigData.Congress.2013.72

Jang, Ho & Sun, Ji. (2011). A Graph Optimization Algorithm for Warehouses with Middle Cross Aisles. Applied Mechanics and Materials. 145. 354-358. 10.4028/www.scientific.net/AMM.145.354.

Acharya, B. D. and Gill, M. K. "On the Index of Gracefulness of a Graph and the Gracefulness of Two-Dimensional Square Lattice Graphs." Indian J. Math. 23, 81-94. 1981.

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, “Introduction to algorithms,” MIT Press, 1994.

Warehouse material flows and flow charts, https://www.mecalux.co.uk/warehouse-manual/warehouse-design/warehouse-material-flowchart

Organizacja i monitorowanie procesów magazynowych, Aleksander Niemczyk et al., Instytut Logistyki i Magazynowania 2014

Logistyka nowoczesnej gospodarki magazynowej, Andrzej Szymonik, Daniel Chudzik, Difin 2018

B. Mbakop A. Kevine, The Effectiveness of ABC Cross Analysis on Products Allocation in the Warehouse, International Journal of Novel Research in Interdisciplinary Studies Vol. 5, Issue 1, pp: (11-30), Month: January - Feburary 2018

Downloads

Published

2024-04-19

Issue

Section

ARTICLES / PAPERS / General