Maximal exploration of trees with energy-constrained agents

Abstract : We wish to explore an unknown tree with a team of k >= 1 initially collocated mobile agents. Each agent has limited energy and cannot,as a result, traverse more than B edges. The goal is to maximize the number of nodes collectively visited by all agents during the execution.Initially, the agents have no knowledge about the structure of the tree, but they gradually discover the topology as they traverse new edges. We assume that the agents can communicate with each other at arbitrary distances, therefore the knowledge obtained by one agent after traversing an edge is instantaneously transmitted to the other agents.We propose an intuitive algorithm based on depth-first search and we study its performance compared to the optimal solution that we could obtain if we knew in advance the map of the tree. We prove that this algorithm has a constant competitive ratio. We also provide a lower bound on the competitive ratio of any algorithm.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01523302
Contributor : Shantanu Das <>
Submitted on : Tuesday, May 16, 2017 - 11:24:46 AM
Last modification on : Thursday, March 14, 2019 - 4:00:07 PM
Long-term archiving on : Friday, August 18, 2017 - 12:30:43 AM

File

treesmax.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01523302, version 1

Citation

Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou. Maximal exploration of trees with energy-constrained agents. ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01523302⟩

Share

Metrics

Record views

222

Files downloads

83