TY - GEN
T1 - Near-Gathering of Energy-Constrained Mobile Agents
AU - Bärtschi, Andreas
AU - Bampas, Evangelos
AU - Chalopin, Jérémie
AU - Das, Shantanu
AU - Karousatou, Christina
AU - Mihalák, Matús
N1 - Funding Information:
Keywords: Mobile agents · Power-aware robots · Limited battery · Gathering · Graph algorithms · Approximation · Computational complexity This work was partially supported by the SNF (project 200021L 156620) and by the ANR (project ANCOR anr-14-CE36-0002-01), while A. Bärtschi was working at ETH Zürich, and E. Bampas and C. Karousatou were working at Aix-Marseille Université. The Los Alamos National Laboratory report number is LA-UR-19-23906.
Funding Information:
This work was partially supported by the SNF (project 200021L_156620) and by the ANR (project ANCOR anr-14-CE36-0002-01), while A. Bartschi was working at ETH Zurich, and E.Bampas and C. Karousatou were working at Aix-Marseille Universit?. The Los Alamos National Laboratory report number is LA-UR-19-23906.
Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - We study the task of gathering k energy-constrained mobile agents in an undirected edge-weighted graph. Each agent is initially placed on an arbitrary node and has a limited amount of energy, which constrains the distance it can move. Since this may render gathering at a single point impossible, we study three variants of near-gathering: The goal is to move the agents into a configuration that minimizes either (i) the radius of a ball containing all agents, (ii) the maximum distance between any two agents, or (iii) the average distance between the agents. We prove that (i) is polynomial-time solvable, (ii) has a polynomial-time 2-approximation with a matching NP-hardness lower bound, while (iii) admits a polynomial-time 2(1− 1/k) -approximation, but no FPTAS, unless P = NP. We extend some of our results to additive approximation.
AB - We study the task of gathering k energy-constrained mobile agents in an undirected edge-weighted graph. Each agent is initially placed on an arbitrary node and has a limited amount of energy, which constrains the distance it can move. Since this may render gathering at a single point impossible, we study three variants of near-gathering: The goal is to move the agents into a configuration that minimizes either (i) the radius of a ball containing all agents, (ii) the maximum distance between any two agents, or (iii) the average distance between the agents. We prove that (i) is polynomial-time solvable, (ii) has a polynomial-time 2-approximation with a matching NP-hardness lower bound, while (iii) admits a polynomial-time 2(1− 1/k) -approximation, but no FPTAS, unless P = NP. We extend some of our results to additive approximation.
U2 - 10.1007/978-3-030-24922-9_4
DO - 10.1007/978-3-030-24922-9_4
M3 - Conference article in proceeding
SN - 9783030249212
T3 - Lecture Notes in Computer Science
SP - 52
EP - 65
BT - Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings
A2 - Censor-Hillel, Keren
A2 - Flammini, Michele
PB - Springer, Cham
ER -