Tell Me Where I Am So I Can Meet You Sooner
From MaRDI portal
Publication:3587463
Recommendations
Cited in
(19)- Rendezvous in planar environments with obstacles and unknown initial distance
- Deterministic polynomial approach in the plane
- A general framework for searching on a line
- Linear rendezvous with asymmetric clocks
- Gathering in the plane of location-aware robots in the presence of spies
- On asynchronous rendezvous in general graphs
- 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
- Byzantine gathering in polynomial time
- Price of asynchrony in mobile agents computing
- Searching on a line: a complete characterization of the optimal solution
- Byzantine gathering in polynomial time
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Leader election for anonymous asynchronous agents in arbitrary networks
- Continuous rendezvous algorithm for memoryless agents with limited visibility in the Euclidean space
- Synchronous rendezvous for location-aware agents
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Deterministic rendezvous with different maps
- Asynchronous approach in the plane: a deterministic polynomial algorithm
This page was built for publication: Tell Me Where I Am So I Can Meet You Sooner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587463)