Gathering of robots in a ring with mobile faults
From MaRDI portal
Publication:1731510
DOI10.1016/j.tcs.2018.05.002zbMath1417.68158OpenAlexW4206238197WikidataQ129869067 ScholiaQ129869067MaRDI QIDQ1731510
Shantanu Das, Flaminia L. Luccio, Euripides Markou, Marco Squarcina, Riccardo Focardi
Publication date: 13 March 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://ceur-ws.org/Vol-1720/full9.pdf
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40)
Related Items (2)
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ A structured methodology for designing distributed algorithms for mobile entities
Cites Work
- Unnamed Item
- Gathering fat mobile robots with slim omnidirectional cameras
- Tight bounds for black hole search with scattered agents in synchronous rings
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- Connected graph searching
- Explore and repair graphs with black holes using mobile entities
- Locating and repairing faults in a network with mobile agents
- Mobile search for a black hole in an anonymous ring
- The theory of search games and rendezvous.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Contiguous search problem in Sierpiński graphs
- Hardness and approximation results for black hole search in arbitrary networks
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Rendezvous in networks in spite of delay faults
- Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty
- Decontamination of hypercubes by mobile agents
- How to meet asynchronously (almost) everywhere
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
- Deterministic Rendezvous in Trees with Little Memory
- Gathering Despite Mischief
- Structural Information and Communication Complexity
- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
- Principles of Distributed Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- LATIN 2004: Theoretical Informatics
- Gathering in dynamic rings
This page was built for publication: Gathering of robots in a ring with mobile faults
