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
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01913866
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 6, 2018 - 4:25:49 PM
Last modification on : Thursday, November 8, 2018 - 1:56:44 PM
Long-term archiving on : Thursday, February 7, 2019 - 3:52:19 PM

File

 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

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Farouq Zitouni, Ramdane Maamri. FA-SETPOWER-MRTA: A Solution for Solving the Multi-Robot Task Allocation Problem. 6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.317-328, ⟨10.1007/978-3-319-89743-1_28⟩. ⟨hal-01913866⟩

Share

Metrics

Record views

50