
Veuillez utiliser cette adresse pour citer ce document :
https://hdl.handle.net/20.500.12177/13899Affichage complet
| Élément Dublin Core | Valeur | Langue |
|---|---|---|
| dc.contributor.advisor | Abessolo Alo’o, Ghislain | - |
| dc.contributor.author | Pamoe Dissang, Estébanc | - |
| dc.date.accessioned | 2026-07-29T07:49:44Z | - |
| dc.date.available | 2026-07-29T07:49:44Z | - |
| dc.date.issued | 2024 | - |
| dc.identifier.uri | https://hdl.handle.net/20.500.12177/13899 | - |
| dc.description.abstract | In today’s context, tactical and operational responses to incidents such as natural disasters and fires are often inadequate due to anthropological factors (such as the risk to the lives of rescue teams) and natural factors (such as the accessibility of affected areas). The increasing use of robots aims to ensure the rescue of people and property in disaster zones without risking the lives of rescuers. Auction methods are used to assign rescue tasks, selecting the appropriate robot for each task. We have enhanced the HaucTioN protocol by integrating the concept of parallelism to eliminate bottlenecks in determining winning bids. The improved protocol, named HaucTioN-K due to the use of the K-Means clustering algorithm to form K groups of bids, proved superior to its predecessor in terms of temporal complexity and experimental performance. | fr_FR |
| dc.format.extent | 47 | fr_FR |
| dc.publisher | Université de Yaoundé I | fr_FR |
| dc.subject | Multi-Agent System | fr_FR |
| dc.subject | Task Allocation | fr_FR |
| dc.subject | Auction Algorithm | fr_FR |
| dc.subject | K-Means Algorithm | fr_FR |
| dc.subject | Parallel Processing | fr_FR |
| dc.title | Protocole d’allocation des tâches dans une constellation de robots basée sur la méthode hybride des enchères des enchères et K-Means | fr_FR |
| dc.type | Thesis | - |
| Collection(s) : | Mémoires soutenus | |
Fichier(s) constituant ce document :
| Fichier | Description | Taille | Format | |
|---|---|---|---|---|
| FS_MEM_BC_26_ 0184.PDF | 2.95 MB | Adobe PDF | Voir/Ouvrir |
Tous les documents du DICAMES sont protégés par copyright, avec tous droits réservés.