We consider multi-agent transport task problems where, e.g. in a factory setting, items have to be delivered from a given start to a goal pose while the delivering robots need to avoid collisions with each other on the floor. We introduce a Task Conflict-Based Search (TCBS) Algorithm to solve the combined delivery task allocation and multi-agent path planning problem optimally. The problem is known to be NP-hard and the optimal solver cannot scale. However, we introduce it as a baseline to evaluate the sub-optimality of other approaches. We show experimental results that compare our solver with different sub-optimal ones in terms of regret.
@article{arxiv.1907.10360,
title = {An Optimal Algorithm to Solve the Combined Task Allocation and Path Finding Problem},
author = {Christian Henkel and Jannik Abbenseth and Marc Toussaint},
journal= {arXiv preprint arXiv:1907.10360},
year = {2020}
}