Asynchronous deterministic rendezvous in bounded terrains
DOI10.1016/J.TCS.2011.09.002zbMATH Open1227.68107OpenAlexW4393147309MaRDI QIDQ650932FDOQ650932
Arnaud Labourel, Jurek Czyzowicz, Andrzej Pelc, David Ilcinkas
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.science/hal-00643686
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)
Cites Work
- Asynchronous deterministic rendezvous in graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Two Dimensional Rendezvous Search
- Title not available (Why is that?)
- Rendezvous search on labeled networks
- Rendezvous Search on the Line
- Title not available (Why is that?)
- The Rendezvous Search Problem
- Gathering of asynchronous robots with limited visibility
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
- How to meet in anonymous network
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Impossibility of gathering by a set of autonomous mobile robots
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Optimal shortest path queries in a simple polygon
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rendezvous search on a graph
- Asynchronous Deterministic Rendezvous on the Line
- Title not available (Why is that?)
- Finding the medial axis of a simple polygon in linear time
Cited In (11)
- A general framework for searching on a line
- Fast rendezvous on a cycle by agents with different speeds
- Searching on a line: a complete characterization of the optimal solution
- Title not available (Why is that?)
- Asynchronous Deterministic Rendezvous on the Line
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
- Deterministic Rendezvous with Detection Using Beeps
- Asynchronous rendezvous with different maps
- Asymmetric rendezvous search on the circle
- Meeting in a polygon by anonymous oblivious robots
- Meeting in a polygon by anonymous oblivious robots
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)
