摘要
Exploration of a graph network means each node of the graph has to be visited by at least one robot. The problem of exploration has been studied in various networks like rings, trees, finite rectangular grids, etc. If we consider infinite domain, previous works solved the problem on infinite rectangular grid and the robots have common chirality. In this work, we have studied the problem of exploration of infinite triangular grid. We have given an algorithm that works under a fully synchronous scheduler. Five robots can explore the infinite triangular grid without collision executing the algorithm. We have used myopic luminous robots. The lights of the robots can be of four different types. Each robot can see up to two hop distance. The robots are without any chirality and there is no axis agreement among the robots.
摘要译文
Exploration of a graph network means each node of the graph has to be visited by at least one robot. The problem of exploration has been studied in various networks like rings, trees, finite rectangular grids, etc. If we consider infinite domain, previous works solved the problem on infinite rectangular grid and the robots have common chirality. In this work, we have studied the problem of exploration of infinite triangular grid. We have given an algorithm that works under a fully synchronous scheduler. Five robots can explore the infinite triangular grid without collision executing the algorithm. We have used myopic luminous robots. The lights of the robots can be of four different types. Each robot can see up to two hop distance. The robots are without any chirality and there is no axis agreement among the robots.
Raja Das[1];Buddhadeb Sau[1]. Exploration of Infinite Triangular Grid by Myopic Robots without Chirality[C]//ICDCN '25: Proceedings of the 26th International Conference on Distributed Computing and Networking, Hyderabad India, January 4 - 7, 2025, IN: ACM, 2025: 264 - 268