Optimization of autonomous agent routes in logistics warehouse
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
Issue
Section
License
Copyright (c) 2021 International Journal of Electronics and Telecommunications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on https://creativecommons.org/licenses/by/4.0/.
2. Author’s Warranties
The author warrants that the article is original, written by stated author/s, has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author/s. The undersigned also warrants that the manuscript (or its essential substance) has not been published other than as an abstract or doctorate thesis and has not been submitted for consideration elsewhere, for print, electronic or digital publication.
3. User Rights
Under the Creative Commons Attribution license, the author(s) and users are free to share (copy, distribute and transmit the contribution) under the following conditions: 1. they must attribute the contribution in the manner specified by the author or licensor, 2. they may alter, transform, or build upon this work, 3. they may use this contribution for commercial purposes.
4. Rights of Authors
Authors retain the following rights:
- copyright, and other proprietary rights relating to the article, such as patent rights,
- the right to use the substance of the article in own future works, including lectures and books,
- the right to reproduce the article for own purposes, provided the copies are not offered for sale,
- the right to self-archive the article
- the right to supervision over the integrity of the content of the work and its fair use.
5. Co-Authorship
If the article was prepared jointly with other authors, the signatory of this form warrants that he/she has been authorized by all co-authors to sign this agreement on their behalf, and agrees to inform his/her co-authors of the terms of this agreement.
6. Termination
This agreement can be terminated by the author or the Journal Owner upon two months’ notice where the other party has materially breached this agreement and failed to remedy such breach within a month of being given the terminating party’s notice requesting such breach to be remedied. No breach or violation of this agreement will cause this agreement or any license granted in it to terminate automatically or affect the definition of the Journal Owner. The author and the Journal Owner may agree to terminate this agreement at any time. This agreement or any license granted in it cannot be terminated otherwise than in accordance with this section 6. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
7. Royalties
This agreement entitles the author to no royalties or other fees. To such extent as legally permissible, the author waives his or her right to collect royalties relative to the article in respect of any use of the article by the Journal Owner or its sublicensee.
8. Miscellaneous
The Journal Owner will publish the article (or have it published) in the Journal if the article’s editorial process is successfully completed and the Journal Owner or its sublicensee has become obligated to have the article published. Where such obligation depends on the payment of a fee, it shall not be deemed to exist until such time as that fee is paid. The Journal Owner may conform the article to a style of punctuation, spelling, capitalization and usage that it deems appropriate. The Journal Owner will be allowed to sublicense the rights that are licensed to it under this agreement. This agreement will be governed by the laws of Poland.
By signing this License, Author(s) warrant(s) that they have the full power to enter into this agreement. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
