Conference
Open access
Sep 2026
Competitive Connected Multi-robot Exploration of Unknown Graphs
This work introduces a novel exploration procedure, DFS-BGS, to tackle the problem of exploring an unknown n-node graph by k robots that must remain connected throughout the process, and analyzes its performance both theoretically and experimentally.
Dolev Mutzari, Y. Aumann, Sarit Kraus
· Proceedings of the Thirty-Fi... · 0 citations