Pages that link to "Item:Q650932"
From MaRDI portal
The following pages link to Asynchronous deterministic rendezvous in bounded terrains (Q650932):
Displaying 13 items.
- Asymmetric rendezvous search on the circle (Q1577517) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Asynchronous rendezvous with different maps (Q2303286) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations (Q2783190) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- Deterministic Rendezvous with Detection Using Beeps (Q5890529) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q6487485) (← links)