Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding

Résumé

Connected multi-agent path finding (CMAPF) consists in computing paths for multiple agents which must reach a goal configuration while remaining connected at all steps. We prove the PSPACEhardness of the problem when the underlying graph is a subgraph of a 3D grid and with range-based connectivity. Moreover, we provide an application of the WHCA * algorithm and show that it outperforms previously given algorithms by an order of magnitude in terms of the sizes of the instances it can handle.
Fichier principal
Vignette du fichier
main.pdf (517.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04075393 , version 1 (20-04-2023)

Identifiants

  • HAL Id : hal-04075393 , version 1

Citer

Isseïnie Calviac, Ocan Sankur, François Schwarzentruber. Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. AAMAS 2023 - 22nd International Conference on Autonomous Agents and Multiagent Systems, May 2023, London, United Kingdom. pp.1-9. ⟨hal-04075393⟩
74 Consultations
62 Téléchargements

Partager

Gmail Facebook X LinkedIn More