Rendezvous Problem
From MaRDI portal
Publication:2961403
DOI10.1007/978-1-4614-6825-7_11zbMath1356.91019OpenAlexW4205159102MaRDI QIDQ2961403
Publication date: 20 February 2017
Published in: Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_11
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rendezvous and election of mobile agents: Impact of sense of direction
- The theory of search games and rendezvous.
- Sense of direction in distributed computing
- Rendezvous in planar environments with obstacles and unknown initial distance
- Asynchronous deterministic rendezvous in graphs
- Impossibility of gathering by a set of autonomous mobile robots
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Synchronous Rendezvous for Location-Aware Agents
- How to meet asynchronously (almost) everywhere
- Improved Bounds for the Symmetric Rendezvous Value on the Line
- Mobile Agent Rendezvous in a Synchronous Torus
- Asynchronous Deterministic Rendezvous on the Line
- Multiple Random Walks and Interacting Particle Systems
- Note: Two rendezvous search problems on the line
- Consensus and Cooperation in Networked Multi-Agent Systems
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Collecting Information by Power-Aware Mobile Agents
- The rendezvous problem on discrete locations
- Algorithms - ESA 2003
