Universal Systems of Oblivious Mobile Robots
From MaRDI portal
Publication:2835029
DOI10.1007/978-3-319-48314-6_16zbMath1482.68056arXiv1602.04881OpenAlexW2963609357MaRDI QIDQ2835029
Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita, Paola Flocchini
Publication date: 1 December 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.04881
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Computing on rings by oblivious robots: a unified approach for different tasks
- Uniform multi-agent deployment on a ring
- Symmetry types of periodic sequences
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Drawing planar graphs using the canonical ordering
- How many oblivious robots can explore a line
- Gathering on rings under the look-compute-move model
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering six oblivious robots on anonymous symmetric rings
- Gathering asynchronous oblivious mobile robots in a ring
- On the self-stabilization of mobile oblivious robots in uniform rings
- Universal Systems of Oblivious Mobile Robots
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- Network Exploration by Silent and Oblivious Robots
- Distributed Computing by Mobile Robots: Gathering
- Graph Decomposition for Improving Memoryless Periodic Exploration
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
- Exclusive Perpetual Ring Exploration without Chirality
- Generation of Permutations by Adjacent Transposition
This page was built for publication: Universal Systems of Oblivious Mobile Robots
