Communication and location discovery in geometric ring networks
From MaRDI portal
Publication:1740645
DOI10.1016/j.ic.2018.12.001zbMath1421.68005MaRDI QIDQ1740645
Leszek Gąsieniec, Russell Martin, Grzegorz Stachowiak, Tomasz Jurdziński
Publication date: 2 May 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2018.12.001
distributed algorithms; mobile robots; combinatorial structures; boundary patrolling; location discovery
Cites Work
- Unnamed Item
- Unnamed Item
- Position discovery for a system of bouncing robots
- Optimality and competitiveness of exploring polygons by mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Forbidding just one intersection
- Distributed broadcast in radio networks of unknown topology.
- Approximation algorithms for lawn mowing and milling
- The Polygon Exploration Problem
- Observe and Remain Silent (Communication-Less Agent Location Discovery)
- Network Exploration by Silent and Oblivious Robots
- Distributed Computing by Mobile Robots: Gathering
- Collective tree exploration
- Information Spreading by Mobile Particles on a Line
- How to learn an unknown environment. I
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- Position Discovery for a System of Bouncing Robots
- On the computational power of oblivious robots
- Iterated Impact Dynamics of N-Beads on a Ring
- Localization for a System of Colliding Robots
- Survivability of Swarms of Bouncing Robots
- Optimal reconstruction of graphs under the additive model
