Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound

Romain Cosson, Laurent Massoulié

We study the problem of collective tree exploration in which a team of $k$ mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agent…