FA-SETPOWER-MRTA: A Solution for Solving the Multi-Robot Task Allocation Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

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

Résumé

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.
Fichier principal
Vignette du fichier
467079_1_En_28_Chapter.pdf (611.27 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01913866 , version 1 (06-11-2018)

Licence

Identifiants

Citer

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⟩
88 Consultations
160 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More