Job Allocation schemes for Mobile Service Robots in Hospitals

Abstract

Automation of logistics in pickup and delivery in hospital shows a great helping hand to the active workers. The application needs to allocate jobs to robots. The objective of the application is to produce an efficient system with the minimum total movement distance of all robots distance. In this paper, we propose two schemes, deep Hungarian (d-Hungarian) and deep Voronoi (d-Voronoi) job scheduling schemes. The d-Hungarian scheme is designed for one type of environment where the location of jobs is known prior whereas prior knowledge of jobs is not required in the d-Voronoi scheme. Simulation results show that our schemes efficiently reduce the traveled distance.