A general lower bound for collaborative tree exploration

We consider collaborative graph exploration with a set of k agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small (k ≤ √ n) and large (k ≥ n) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains. First, we significantly extend a lower bound of Omega(log k / loglog k) by Dynia et al. on the competitive ratio of a collaborative tree exploration strategy to the range k ≤ n logc n for any c ∈ mathbbN. Second, we provide a tight lower bound on the number of agents needed for any competitive exploration algorithm. In particular, we show that any collaborative tree exploration algorithm with k = Dn1+o(1) agents has a competitive ratio of ω(1), while Dereniowski et al. gave an algorithm with k = Dn1+varepsilon agents and competitive ratio O(1), for any varepsilon > 0 and with D denoting the diameter of the graph. Lastly, we show that, for any exploration algorithm using k = n agents, there exist trees of arbitrarily large height D that require Omega(D2) rounds, and we provide a simple algorithm that matches this bound for all trees.