Synchronous rendezvous for location-aware agents
From MaRDI portal
(Redirected from Publication:3095348)
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 910916 (Why is no real title available?)
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Asynchronous deterministic rendezvous in graphs
- Broadcasting in UDG radio networks with unknown topology
- Collective tree spanners of graphs
- Consensus and Cooperation in Networked Multi-Agent Systems
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Deterministic rendezvous in graphs
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Geometrically aware communication in random wireless networks
- How to meet asynchronously (almost) everywhere
- How to meet in anonymous network
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- Rendezvous Search on the Line
- 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
- Rendezvous search when marks are left at the starting points
- Tell Me Where I Am So I Can Meet You Sooner
- The Rendezvous Search Problem
- The theory of search games and rendezvous.
- Two Dimensional Rendezvous Search
Cited in
(19)- Sniffing helps to meet: deterministic rendezvous of anonymous agents in the grid
- 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
- Gathering teams of bounded memory agents on a line
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Partial gathering of mobile agents in asynchronous unidirectional rings
- Continuous rendezvous algorithm for memoryless agents with limited visibility in the Euclidean space
- Fast deterministic rendezvous in labeled lines
- 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)
