Author:
Khelvas Aleksandr,Afanasenko Taras,Gilya-Zetinov Aleksandr,Tikhonov Ilya,Danilov Albert,Tsybul’ko Evgenia,Pashkov Ruslan,Zaripov Ruslan
Abstract
The article proposes a new approach for solving the problem of optimization of the swarm of robots routing in the sorting center. Approach is based on multi agent event-based simulation of the logistics sorting center on the base of event-driven framework COS.SIM. The problem of optimization of the swarm of robots routing for the sorting center is analyzed and case dataset for future researches is proposed. The method of swarm of robots routing based on path reservation by means of Dijkstra algorithm is proposed. The approach to the optimal robots quantity estimation is also proposed.
Reference15 articles.
1. Model of cellular automata
2. Robinson J. B. On the Hamiltonian game (a traveling-salesman problem). Santa Monica, CA: RAND Corporation, 1949.
3. Slavkov I., Carrillo-Zapata D., Carranza N., Diego X., Jansson F., Kaandorp J.A., Hauert S., and Sharpe J., Morphogenesis in robot swarms, Science Robotics, 3, 2018. doi:10.1126/scirobotics.aau91.
4. Nagalingam V. and Kumar S.., Development of collision free path planning algorithm for warehouse mobile robot, Procedia Computer Science, 133, pp. 456–463, 2018. doi:10.1016/j.procs.2018.07.056.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two Approaches of Ant Colony Optimization for Sorting Center Path Finding;2024 4th International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET);2024-05-16