6 citations · 6 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Tight bounds for undirected graph exploration with pebbles and multiple agents
Yann Disser, Jan Hackfeld, Max Klimm
We study the problem of deterministically exploring an undirected and initially unknown graph with vertices either by a single agent equipped with a set of pebbles, or by a set…
cs.DS2018
Maximal Exploration of Trees with Energy-Constrained Agents
Evangelos Bampas, Jérémie Chalopin, Shantanu Das +2
We consider the problem of exploring an unknown tree with a team of initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than…