An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem involving a Human-Robot Team
Abstract
This article presents an approximation algorithm for a task allocation, sequencing and scheduling problem involving a team of human operators and robots. Specifically, we present an algorithm with an approximation ratio as a function of the number of human operators (m) and the number of robots (k) in the team. The approximation ratios are 72 -52k, 52 -1k and 72 -1k when m=1, m≥ k≥ 2 and k>m≥ 2 respectively. We also present computational results to corroborate the performance of the proposed approximation algorithm.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.