Synchronous Rendezvous for Location-Aware Agents
From MaRDI portal
Publication:3095348
DOI10.1007/978-3-642-24100-0_42zbMath1350.68208OpenAlexW1498202041MaRDI QIDQ3095348
Jurek Czyzowicz, Adrian Kosowski, Russell Martin, Andrew J. Collins, Leszek Gąsieniec
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_42
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)
Related Items
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults, Optimal rendezvous on a line by location-aware robots in the presence of spies*, Move-optimal partial gathering of mobile agents in asynchronous trees, Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks, Rendezvous of heterogeneous mobile agents in edge-weighted networks, Deterministic rendezvous in infinite trees, Rendezvous Problem, Deterministic treasure hunt and rendezvous in arbitrary connected graphs, Partial gathering of mobile agents in asynchronous unidirectional rings, Gathering in the plane of location-aware robots in the presence of spies, Deterministic rendezvous with different maps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to meet in anonymous network
- The theory of search games and rendezvous.
- Asynchronous deterministic rendezvous in graphs
- Broadcasting in UDG radio networks with unknown topology
- Deterministic rendezvous in graphs
- Tell Me Where I Am So I Can Meet You Sooner
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Two Dimensional Rendezvous Search
- Rendezvous Search: A Personal Perspective
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search on a graph
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Rendezvous search when marks are left at the starting points
- Rendezvous Search on the Line
- Consensus and Cooperation in Networked Multi-Agent Systems
- The Rendezvous Search Problem
- How to meet when you forget
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Collective tree spanners of graphs
- Geometrically aware communication in random wireless networks
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
