Synchronous rendezvous for location-aware agents
DOI10.1007/978-3-642-24100-0_42zbMATH Open1350.68208OpenAlexW1498202041MaRDI QIDQ3095348FDOQ3095348
Authors: Jurek Czyzowicz, Adrian Kosowski, Russell Martin, Andrew 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)
Cites Work
- Consensus and Cooperation in Networked Multi-Agent Systems
- The theory of search games and rendezvous.
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Two Dimensional Rendezvous Search
- Title not available (Why is that?)
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Rendezvous search when marks are left at the starting points
- Rendezvous Search on the Line
- The Rendezvous Search Problem
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- How to meet in anonymous network
- Title not available (Why is that?)
- How to meet asynchronously (almost) everywhere
- Collective tree spanners of graphs
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Rendezvous search on a graph
- Rendezvous Search: A Personal Perspective
- Geometrically aware communication in random wireless networks
- Broadcasting in UDG radio networks with unknown topology
- Tell Me Where I Am So I Can Meet You Sooner
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
Cited In (16)
- Deterministic rendezvous in infinite trees
- Rendezvous of distance-aware mobile agents in unknown graphs
- Tell Me Where I Am So I Can Meet You Sooner
- Gathering in the plane of location-aware robots in the presence of spies
- Rendezvous problem
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Continuous rendezvous algorithm for memoryless agents with limited visibility in the Euclidean space
- Partial gathering of mobile agents in asynchronous unidirectional rings
- Move-optimal partial gathering of mobile agents in asynchronous trees
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Asynchronous rendezvous with different maps
- Deterministic rendezvous with different maps
This page was built for publication: Synchronous rendezvous for location-aware agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095348)
