Asynchronous deterministic rendezvous in bounded terrains

DOI10.1016/j.tcs.2011.09.002zbMath1227.68107MaRDI QIDQ650932

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

zbMATH Keywords

polygon; deterministic; rendezvous; obstacle; mobile agent

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68T40: Artificial intelligence for robotics

68T42: Agent technology and artificial intelligence

Related Items

A general framework for searching on a line, Meeting in a polygon by anonymous oblivious robots, Fast rendezvous on a cycle by agents with different speeds, Searching on a line: a complete characterization of the optimal solution, Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• How to meet in anonymous network
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Optimal shortest path queries in a simple polygon
• 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
• Asynchronous Deterministic Rendezvous on the Line
• Two Dimensional Rendezvous Search
• Rendezvous search on a graph
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Rendezvous search on labeled networks
• Rendezvous Search on the Line
• The Rendezvous Search Problem
• The rendezvous problem on discrete locations
• LATIN 2004: Theoretical Informatics