A proposal toward a possibilistic multi-robot task allocation

Abstract

[EN] One of the main problems to solve in a multi-robot systems is to select the best robot to execute each task (task allocation). Several ways to address this problem have been proposed in the literature. This paper focuses on one of them, the so-called response threshold methods. In a recent previous work, it was proved that the possibilistic Markov chains outperform the classical probabilistic approaches when they are used to implement response threshold methods. The aim of this paper is to summarize the advances given by or research group toward a new possibilistic swarm multi-robot task allocation framework.