Multi-robot task allocation: analyzing the complexity and optimality of key architectures

Abstract

Abstract-Important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely ignored. To address part of this negligence, we focus on the problem of multi-robot task allocation. We give a formal, domainindependent, statement of the problem and show it to be an instance of another, well-studied, optimization problem. In this light, we analyze several recently proposed approaches to multi-robot task allocation, describing their fundamental characteristics in such a way that they can be objectively studied, compared, and evaluated.

Optimal Agent Cooperation with Local Information

“…In [21], the authors prove NP-hardness [74] of a simplified version of the search problem whereby the searcher only has local environment information and minimizes the time to detection. The multiagent extension is at least as complex, also recognized by the authors in [35,64], who take a more general approach and present complexity results for different multi-agent problem types. We recognize the complexity issues related to multi-agent systems.…”

The Information-Cost-Reward framework for understanding robot swarm foraging

“…Mataric et al 2003;Lerman et al 2006;Jevtic et al 2012, or the "job completion" problem on a manufacturing floor (e.g. Gerkey and Mataric 2003;Dahl et al 2009;Sarker and Dahl 2011). -Collection worksites represent resource deposits that need to be exploited as soon as possible.…”

Repeated auctions for robust task execution by a robot team

“…Auction-based methods for allocation of tasks are becoming popular in robotics [11,19] as an alternative to other allocation methods, such as centralized scheduling [3], blackboard systems [9], or application-specific methods, which do not easily generalize [1] to other domains.…”