FA-SETPOWER-MRTA: A Solution for Solving the Multi-Robot Task Allocation Problem

Abstract : The Multi-Robot Task Allocation problem (MRTA) is the situation where we have a set of tasks and robots; then we must decide the assignments between robots and tasks in order to optimize a certain measure (e.g. allocate the maximum number of tasks...). We present an effective solution to resolve this problem by implementing a two-stage methodology: first a global allocation that uses the Firefly Algorithm (FA), next a local allocation that uses the set theory properties (Power Set algorithm). Finally, results of the different simulations show that our solution is efficient in terms of the rate of allocated tasks and the calculated allocations are locally optimal.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Hal Ifip <>
Submitted on : Tuesday, November 6, 2018 - 4:25:49 PM
Last modification on : Thursday, November 8, 2018 - 1:56:44 PM
Document(s) archivé(s) le : Thursday, February 7, 2019 - 3:52:19 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Farouq Zitouni, Ramdane Maamri. FA-SETPOWER-MRTA: A Solution for Solving the Multi-Robot Task Allocation Problem. Abdelmalek Amine; Malek Mouhoub; Otmane Ait Mohamed; Bachir Djebbar. 6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. Springer International Publishing, IFIP Advances in Information and Communication Technology, AICT-522, pp.317-328, 2018, Computational Intelligence and Its Applications. 〈10.1007/978-3-319-89743-1_28〉. 〈hal-01913866〉



Record views