Deterministic Algorithms for Dispersing Faulty and Non-Faulty Robots on Oriented and Unoriented Grid Graphs

This paper presents three deterministic algorithms for dispersing robots on oriented and unoriented grid graphs, considering both faulty and non-faulty robots. The algorithms achieve optimal time and memory complexity.