Asynchronous deterministic rendezvous in bounded terrains
From MaRDI portal
Recommendations
- Asynchronous deterministic rendezvous in bounded terrains
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- How to meet asynchronously (almost) everywhere
- How to meet asynchronously (almost) everywhere
Cites work
- scientific article; zbMATH DE number 3562002 (Why is no real title available?)
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- scientific article; zbMATH DE number 2102782 (Why is no real title available?)
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Asynchronous Deterministic Rendezvous on the Line
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- Finding the medial axis of a simple polygon in linear time
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering of asynchronous robots with limited visibility
- How to meet asynchronously (almost) everywhere
- How to meet in anonymous network
- Impossibility of gathering by a set of autonomous mobile robots
- LATIN 2004: Theoretical Informatics
- Optimal shortest path queries in a simple polygon
- Rendezvous Search on the Line
- Rendezvous search on a graph
- Rendezvous search on labeled networks
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- The Rendezvous Search Problem
- The rendezvous problem on discrete locations
- Two Dimensional Rendezvous Search
Cited in
(16)- How to meet asynchronously (almost) everywhere
- Asynchronous rendezvous with different maps
- Asymmetric rendezvous search on the circle
- Asynchronous Deterministic Rendezvous on the Line
- Rendezvous in planar environments with obstacles and unknown initial distance
- Meeting in a polygon by anonymous oblivious robots
- How to meet asynchronously (almost) everywhere
- Asynchronous deterministic rendezvous in bounded terrains
- Meeting in a polygon by anonymous oblivious robots
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- A general framework for searching on a line
- Fast rendezvous on a cycle by agents with different speeds
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
- scientific article; zbMATH DE number 1729496 (Why is no real title available?)
- Searching on a line: a complete characterization of the optimal solution
This page was built for publication: Asynchronous deterministic rendezvous in bounded terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650932)
