Home /Research /Indistinguishability Operators Applied to Task Allocation Problems in Multi-Agent Systems
SWARM

Indistinguishability Operators Applied to Task Allocation Problems in Multi-Agent Systems

José Guerrero, Juan-José Miñana, Óscar Valero, Gabriel Oliver

Year
2017
Citations
14
Access
Open access

Abstract

In this paper we show an application of indistinguishability operators to model response functions. Such functions are used in the mathematical modeling of the task allocation problem in multi-agent systems when the stimulus, perceived by the agent, to perform a task is assessed by means of the response threshold model. In particular, we propose this kind of operators to represent a response function when the stimulus only depends on the distance between the agent and a determined task, since we prove that two celebrated response functions used in the literature can be reproduced by appropriate indistinguishability operators when the stimulus only depends on the distance to each task that must be carried out. Despite the fact there is currently no systematic method to generate response functions, this paper provides, for the first time, a theoretical foundation to generate them and study their properties. To validate the theoretical results, the aforementioned indistinguishability operators have been used to simulate, with MATLAB, the allocation of a set of tasks in a multi-robot system with fuzzy Markov chains.

Keywords

Computer scienceMarkov chainTheoretical computer scienceMachine learning

Related papers

Browse all SWARM papers