A Routing and Task-Allocation Algorithm for Robotic Groups in Warehouse Environments
Antonios Chatzisavvas, Petros Chatzitoulousis, Dimitris Ziouzios, Minas Dasygenis
Abstract
In recent years, the need for robotic fleets in large warehouse environments has constantly increased. The customers require faster services concerning the delivery of their products, making the use of systems such as robots and order-management software more than essential. Numerous researchers have studied the problem of robot routing in a warehouse environment, aiming to suggest an efficient model concerning the robotic fleet’s management. In this research work, a methodology is proposed, providing feasible solutions for optimal pathfinding. A novel algorithm is proposed, which combines Dijkstra’s and Kuhn–Munkers algorithms efficiently. The proposed system considers the factor of energy consumption and chooses the optimal route. Moreover, the algorithm decides when a robot must head to a charging station. Finally, a software tool to visualize the movements of the robotic fleet and the real-time updates of the warehouse environment was developed.