EUVIMEDEUVIMED entdecken
Crossref

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures

Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan, Nikolaos Melissinos, Michal Opler

Journal of Artificial Intelligence Research · 31.03.2026 · 85

DOI: 10.1613/jair.1.19325 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Artificial Intelligence Research, online erschienen am 31.03.2026. Verfasst von Foivos Fioravantes und 4 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the makespan of the proposed solution. This is the setting studied in the Multiagent Path Finding problem. In this work, we additionally provide the agents with a way to communicate with each other. Due to size constraints, it is reasonable to assume that the range of communication of each agent will be limited. What should be the trajectories of the agents to, additionally, maintain a backbone of communication? In this work, we study the Multiagent Path Finding with Communication Constraints problem under the parameterized complexity framework. Our main contribution is three exact algorithms that are efficient when considering particular structures for the input network. We provide such algorithms for the case when the communication range and the number of agents (the makespan resp.) are provided in the input and the network has a tree topology, or bounded maximum degree (has a tree-like topology, i.e., bounded treewidth resp.). We complement these results by showing that it is highly unlikely to construct efficient algorithms when considering the number of agents as part of the input, even if the makespan is 3 and the communication range is 1.

Zitieren

APA

Fioravantes, F., Knop, D., Křišťan, J. M., Melissinos, N., & Opler, M. (2026). Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. Journal of Artificial Intelligence Research, 85. https://doi.org/10.1613/jair.1.19325

Vancouver

Fioravantes F, Knop D, Křišťan JM, Melissinos N, Opler M. Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. Journal of Artificial Intelligence Research. 2026;85. doi:10.1613/jair.1.19325

BibTeX
@article{Fioravantes2026,
  author = {Fioravantes, Foivos and Knop, Dušan and Křišťan, Jan Matyáš and Melissinos, Nikolaos and Opler, Michal},
  title = {Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures},
  journal = {Journal of Artificial Intelligence Research},
  year = {2026},
  volume = {85},
  doi = {10.1613/jair.1.19325}
}
Kostenlos starten →