Scalable Multi-Agent Maze Traversal with Local Communication
This work proposes a distributed algorithm that enables agents to collectively traverse an unknown, possibly cyclic graph and proves that the algorithm is complete, that its makespan is asymptotically equivalent to that of an optimal full-knowledge strategy, and derive its time and space complexity.