Agent rendezvous: A dynamic symmetry-breaking problem
From MaRDI portal
Recommendations
Cited in
(36)- Gathering of robots in a ring with mobile faults
- Use of information, memory and randomization in asynchronous gathering
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Time versus space trade-offs for rendezvous in trees
- Deterministic polynomial approach in the plane
- Fast rendezvous on a cycle by agents with different speeds
- Asynchronous deterministic rendezvous in graphs
- Map construction of unknown graphs by multiple agents
- Anonymous meeting in networks
- Price of asynchrony in mobile agents computing
- Rendezvous problem
- Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
- Deterministic Meeting of Sniffing Agents in the Plane*
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Asynchronous Deterministic Rendezvous on the Line
- Sliding encryption: a cryptographic tool for mobile agents
- 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*
- Linear rendezvous with asymmetric clocks
- A generalized two-agent location problem: Asymmetric dynamics and coordination
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens
- Black hole search in common interconnection networks
- Gathering despite mischief
- Gathering in the plane of location-aware robots in the presence of spies
- Gathering in dynamic rings
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
- Almost universal anonymous rendezvous in the plane
- Asynchronous deterministic rendezvous in bounded terrains
- Want to gather? No need to chatter!
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- How to meet in anonymous network
This page was built for publication: Agent rendezvous: A dynamic symmetry-breaking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818870)
