Abstract
We consider the multi-robot task scheduling problem with precedence constraints, and introduce a general algorithm to approximate a solution to this problem. Our algorithm utilizes an iterated auction scheme, in which a batch of tasks that are pairwise unconstrained is selected in each iteration and scheduled using a modified sequential single-item auction. This algorithm also gains flexibility by allowing the use of task prioritization to order the scheduling process. We demonstrate the effectiveness of this iterated auction scheme empirically using existing 100- and 1000-task data sets that we have modified to include precedence constraints.
| Original language | English (US) |
|---|---|
| Title of host publication | AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems |
| Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
| Pages | 1078-1086 |
| Number of pages | 9 |
| ISBN (Electronic) | 9781450342391 |
| State | Published - Jan 1 2016 |
| Event | 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016 - Singapore, Singapore Duration: May 9 2016 → May 13 2016 |
Other
| Other | 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016 |
|---|---|
| Country/Territory | Singapore |
| City | Singapore |
| Period | 5/9/16 → 5/13/16 |