Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
From MaRDI portal
Publication:1946493
DOI10.1007/s00224-011-9379-7zbMath1260.68399OpenAlexW2092863347MaRDI QIDQ1946493
Adrian Kosowski, Andrzej Pelc, Jurek Czyzowicz
Publication date: 15 April 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9379-7
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Agent technology and artificial intelligence (68T42)
Related Items (4)
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* ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to meet in anonymous network
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- The theory of search games and rendezvous.
- Asynchronous deterministic rendezvous in graphs
- Impossibility of gathering by a set of autonomous mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Reconstructing Visibility Graphs with Simple Robots
- Deterministic Rendezvous in Trees with Little Memory
- Asynchronous Deterministic Rendezvous in Bounded Terrains
- Asynchronous Deterministic Rendezvous on the Line
- Two Dimensional Rendezvous Search
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search on a graph
- Rendezvous Search on the Line
- The Rendezvous Search Problem
- LATIN 2004: Theoretical Informatics
This page was built for publication: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
