Rendezvous problem
From MaRDI portal
Recommendations
Cites work
- Asynchronous deterministic rendezvous in graphs
- Asynchronous Deterministic Rendezvous on the Line
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Collecting information by power-aware mobile agents
- Consensus and Cooperation in Networked Multi-Agent Systems
- Deterministic rendezvous in graphs
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- Gathering despite mischief
- How to meet asynchronously (almost) everywhere
- scientific article; zbMATH DE number 2216492 (Why is no real title available?)
- Impossibility of gathering by a set of autonomous mobile robots
- Improved Bounds for the Symmetric Rendezvous Value on the Line
- Mobile Agent Rendezvous in a Synchronous Torus
- Multiple Random Walks and Interacting Particle Systems
- Note: Two rendezvous search problems on the line
- Rendezvous and election of mobile agents: Impact of sense of direction
- Rendezvous in planar environments with obstacles and unknown initial distance
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Sense of direction in distributed computing
- Synchronous rendezvous for location-aware agents
- The rendezvous problem on discrete locations
- The Rendezvous Search Problem
- The theory of search games and rendezvous.
Cited in
(3)
This page was built for publication: Rendezvous problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961403)