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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00378601" target="_blank" >RIV/68407700:21240/25:00378601 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1609/aaai.v39i22.34483" target="_blank" >https://doi.org/10.1609/aaai.v39i22.34483</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1609/aaai.v39i22.34483" target="_blank" >10.1609/aaai.v39i22.34483</a>

Result language

angličtina

Original language name

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

Original language description

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 Constraint 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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotics and advanced industrial production</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 39th AAAI Conference on Artificial Intelligence

ISBN

978-1-57735-897-8

ISSN

2159-5399

e-ISSN

2374-3468

Number of pages

9

Pages from-to

23177-23185

Publisher name

AAAI Press

Place of publication

Menlo Park

Event location

Philadelphia

Event date

Feb 27, 2025

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

001477505600007