Gathering over Meeting Nodes in Infinite Grid*
From MaRDI portal
Publication:5044391
DOI10.3233/FI-222128MaRDI QIDQ5044391
Bibhuti Das, Subhash Bhagat, Abhinav Chakraborty, Krishnendu Mukhopadhyaya
Publication date: 31 October 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Gathering over meeting nodes in infinite grid
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- \(k\)-circle formation by disoriented asynchronous robots
- Gathering robots in graphs: the central role of synchronicity
- Gathering on rings under the look-compute-move model
- Stabilization, safety, and security of distributed systems. 21st international symposium, SSS 2019, Pisa, Italy, October 22--25, 2019. Proceedings
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Embedded pattern formation by asynchronous robots without chirality
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Gathering six oblivious robots on anonymous symmetric rings
- Gathering asynchronous oblivious mobile robots in a ring
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Functional Renormalization and Ultracold Quantum Gases
- Optimal gathering by asynchronous oblivious robots in hypercubes
This page was built for publication: Gathering over Meeting Nodes in Infinite Grid*
