A MODEL FOR PROCESSING APPLICATIONS AND DISTRIBUTING TASKS FOR A ROBOTIC WAREHOUSE
Abstract
The purpose of this work is - development of a model for processing applications and distributing
tasks between robots that serve a robotic warehouse. This research is relevant due to
increase number of warehouse space, the appearance of stores without buyers (darkstores) and
the popularization of purchases through the Internet, which requires the involvement of robots to
solve transport problems when arranging orders. To achieve this goal, in this work solves the
problem of conceptual representation of a robotic warehouse in the form of a queuing system,
which allows using its quality indicators to improve transport processes. Models of the control
system of a single robot and processing of orders are presented in the form of finite state machine,
which simplifies model experiments and further implementation in onboard robot computers. Propose
the criterion for evaluating the duration of the execution of orders by robots, including several
types and positions of product in the order, is proposed, which allows processing one order
by several robots at the same time. The route of each robot is represented by a set of sections of the path between the collection points of individual products, described in the form of ordered
permutations. Such representation made it possible to define a system of inequalities, on the basis
of which routes of several robots for processing one order are formed. Algorithms for the distribution
of tasks for the robot's onboard computer and the central warehouse server have been developed.
The greatest computational load lies on the server because all possible permutations for
each order are calculated there. Experimental researches on the simulation model have shown the
high efficiency of the developed models and algorithms.
References
current state of affairs in the field of robotization of warehouses], Sb. trudov X Vserossiyskoy
nauchnoy konferentsii i molodezhnogo nauchnogo foruma v ramkakh meropriyatiy,
posvyashchennykh godu Nauki i tekhnologiy v Rossiyskoy Federatsii, Gelendzhik, 20–22
oktyabrya 2021 goda [Proceedings of the X All-Russian Scientific Conference and Youth Scientific
Forum as part of events dedicated to the Year of Science and Technology in the Russian
Federation, Gelendzhik, October 20–22, 2021]. Rostov-on-Donu: YuFU, 2021, pp. 173-178.
2. Trefilov S., Nikitin Y. Automatic warehouses with transport robots of increased reliability, Acta
Logistica, 2018, Vol. 5, No. 3, pp. 19-23.
3. Li Zhenping, Li Wenyu. Mathematical model and algorithm for the task allocation problem of
robots in the smart warehouse, American Journal of Operations Research, 2015, Vol. 5,
pp. 493-502.
4. Zhang H.G., Zilong C.H., Chris Z., Weinan Y., Yong L., Wenxin W. Layout design for intelligent
warehouse by evolution with fitness approximation, IEEE Access, 2019, pp. 1-7.
5. Azadeh K., Debjit R. Robotized Warehouse Systems: Developments and Research Opportunities,
SSRN Electronic Journal, 2017, pp. 55.
6. Sultanova A.B., Abdullayeva M.Y. Planning the Trajectory of a Warehouse Mobile Robot,
International Academy Journal Web of Scholar, 2020, Vol. 7 (49), pp. 1-5.
7. Kalinov I. Development of a heterogeneous robotic system for automated inventory stocktaking
of industrial warehouse. Doctoral Program in Engineering Systems, 2020, 175 p.
8. Bolu A. Omer K. Adaptive Task Planning for Multi-Robot Smart Warehouse, IEEE Access,
2021, pp. 1-13.
9. Claes D., Oliehoek F., Baier H., Tuyls K. Decentralised Online Planning for Multi-Robot
Warehouse Commissioning, Proceedings of the 16th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2017), 2017, Paper No. 536.
10. Chen Yuxiao, Rosolia Ugo, and Aaron D. Ames Decentralized Task and Path Planning for
Multi-Robot Systems, arXiv:2011.10034v1 [cs.RO], 2020, pp. 1-8.
11. Kam Fai Elvis Tsang, Yuqing Ni, Cheuk Fung Raphael Wong and Ling Shi. A Novel Warehouse
Multi-Robot Automation System with Semi-Complete and Computationally Efficient
Path Planning and Adaptive Genetic Task Allocation Algorithms, 15th International Conference
on Control, Automation, Robotics and Vision, ICARCV 2018, 10 p.
12. Honig Wolfgang, Satish Kumar T.K., Cohen Liron, Ma Hang, Koenig Sven, Ayanian Nora.
Path Planning With Kinematic Constraints For Robot Groups, Southern California Robotics
Symposium, 2016, 2 p.
13. Ledzinski D., Marchinak T., Maszewski M., Boroński D. Robot Actions Planning Algorithms,
Multi-Agent System. Solid State Phenomena, 2015, pp. 221-230.
14. Romanenko V.A. Sistemy i seti massovogo obsluzhivaniya: ucheb. posobie [Systems and networks
of queuing: a tutorial]. Samara: Izd-vo Samarskogo universiteta, 2021, 68 p.
15. Denisov A.A. Sistemy massovogo obsluzhivaniya [Queuing systems], Vestnik Voronezhskogo
instituta vysokikh tekhnologiy [Bulletin of the Voronezh Institute of High Technologies], 2019,
No. 2 (29), pp. 60-63.
16. Lyubimova T.V. Konechnyy avtomat: teoriya i realizatsiya [Finite automaton: theory and implementation],
Universitetskaya nauka [Universitetskaya nauka], 2020, No. 1 (9), pp. 117-121.
17. Kalyaev I.A., Gayduk A.R., Kapustyan S.G. Modeli i algoritmy kollektivnogo upravleniya v
gruppakh robotov [Models and algorithms of collective control in groups of robots]. Moscow:
Fizmatlit, 2009, 278 p.
18. Bertsekas D., Castanon D. Parallel synchronous and asynchronous implementations of the
auction algorithm, Intern. J. of Parallel Computing, 1991, Vol. 17, pp. 707-732.
19. Bruff D. The Assignment Problem and the Hungarian Method. Retrieved June 26, 2016.
20. Beloglazov D.A., Solov'ev V.V., Titov A.E. [i dr.]. Metod raspredeleniya tseley v gruppakh
intellektual'nykh mobil'nykh robotov [The method of distribution of goals in groups of intelligent
mobile robots], Izvestiya Tul'skogo gosudarstvennogo universiteta. Tekhnicheskie nauki
[Bulletin of the Tula State University. Technical science], 2016, No. 11-3, pp. 122-133.
21. Jukna S. Extremal Combinatorics: With Applications in Computer Science. Berlin. Springer,
2001, 375 p.
