Optimal Assignment of Customer-Desired Items to the Fetching Robots in Superstores
Keywords:Markov decision processes, task assignment problem, optimality criteria, shopping assistance
This paper discusses a task assignment problem. The scenario under consideration is a superstore with a team of fetching robots. There is a set of customers each requiring a unique set of items. The goal is to assign the task of fetching the items to the available robots in such a way that the time and effort required for fetching the item is minimized. For this purpose, a Markov Decision Process based model has been proposed. The proposed-model is solvable using stochastic dynamic programming algorithms such as value iteration for the calculation of optimal task assignment policy. The analysis of the characteristics of the resulting optimal policy has been presented with the help of a numerical case study.
Authors who publish with Engineering Journal agree to transfer all copyright rights in and to the above work to the Engineering Journal (EJ)'s Editorial Board so that EJ's Editorial Board shall have the right to publish the work for nonprofit use in any media or form. In return, authors retain: (1) all proprietary rights other than copyright; (2) re-use of all or part of the above paper in their other work; (3) right to reproduce or authorize others to reproduce the above paper for authors' personal use or for company use if the source and EJ's copyright notice is indicated, and if the reproduction is not made for the purpose of sale.