2 papers
cs.DS2020
Improved Lower Bound for Competitive Graph Exploration
Alexander Birx, Yann Disser, Alexander V. Hopp +1
We give an improved lower bound of 10/3 on the competitive ratio for the exploration of an undirected, edge-weighted graph with a single agent that needs to return to the starting…
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…