Abstract
The gathering on meeting points problem requires the robots to gather at one of the pre-defined meeting points. This paper investigates a discrete version of the problem where the robots and meeting nodes are deployed on the nodes of an anonymous infinite square grid. The robots are identical, autonomous, anonymous, and oblivious. They operate under an asynchronous scheduler. Robots do not have any agreement on a global coordinate system. Initial configurations, for which the problem is unsolvable, have been characterized. A deterministic distributed algorithm has been proposed to solve the problem, for the rest of the configurations.
Author supplied keywords
Cite
CITATION STYLE
Bhagat, S., Chakraborty, A., Das, B., & Mukhopadhyaya, K. (2020). Gathering over Meeting Nodes in Infinite Grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12016 LNCS, pp. 318–330). Springer. https://doi.org/10.1007/978-3-030-39219-2_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
