Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
From MaRDI portal
Publication:392198
DOI10.1016/j.tcs.2012.07.004zbMath1358.68295OpenAlexW2179376195MaRDI QIDQ392198
Samuel Guilbault, Andrzej Pelc
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.004
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)
Related Items (7)
Byzantine gathering in networks ⋮ Ring exploration with myopic luminous robots ⋮ Byzantine gathering in polynomial time ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Universal Systems of Oblivious Mobile Robots
Cites Work
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Asynchronous deterministic rendezvous in graphs
- Impossibility of gathering by a set of autonomous mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Structural Information and Communication Complexity
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Algorithms and Computation
- LATIN 2004: Theoretical Informatics
- LATIN 2004: Theoretical Informatics
This page was built for publication: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs