Complexity of planning for connected agents in a partially known environment - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2023

Complexity of planning for connected agents in a partially known environment

Résumé

The Connected Multi-Agent Path Finding (CMAPF) problem asks for a plan to move a group of agents in a graph while respecting a connectivity constraint. We study a generalization of CMAPF in which the graph is not entirely known in advance, but is discovered by the agents during their mission. We present a framework introducing this notion and study the problem of searching for a strategy to reach a configuration in this setting. We prove the problem to be PSPACE-complete when requiring all agents to be connected at all times, and NEXPTIME-hard in the decentralized case.
Fichier principal
Vignette du fichier
main.pdf (486.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03930625 , version 1 (09-01-2023)

Identifiants

Citer

Arthur Queffelec, Ocan Sankur, François Schwarzentruber. Complexity of planning for connected agents in a partially known environment. Theoretical Computer Science, 2023, 941, pp.202-220. ⟨10.1016/j.tcs.2022.11.015⟩. ⟨hal-03930625⟩
31 Consultations
45 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More