Asynchronous deterministic rendezvous in bounded terrains
type: Item
instance of: scholarly article
title: Asynchronous deterministic rendezvous in bounded terrains
zbMATH Open document ID: 1227.68107
author: Jurek Czyzowicz
author: David Ilcinkas
author: Arnaud Labourel
author: Andrzej Pelc
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5987012
zbMATH Keywords: mobile agent
zbMATH Keywords: rendezvous
zbMATH Keywords: deterministic
zbMATH Keywords: polygon
zbMATH Keywords: obstacle
MaRDI profile type: Publication
full work available at URL: hal-00643686
OpenAlex ID: W4393147309
cites work: The Rendezvous Search Problem
cites work: Rendezvous search on labeled networks
cites work: Rendezvous search on a graph
cites work: The rendezvous problem on discrete locations
cites work: Two Dimensional Rendezvous Search
cites work: Q4449250
cites work: Asynchronous deterministic rendezvous in graphs
cites work: Q5417602
cites work: Deterministic rendezvous in graphs
cites work: Gathering of asynchronous robots with limited visibility
cites work: Rendezvous Search on the Line
cites work: Optimal shortest path queries in a simple polygon
cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane
cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
cites work: Gathering asynchronous oblivious mobile robots in a ring
cites work: How to meet in anonymous network
cites work: LATIN 2004: Theoretical Informatics
cites work: Impossibility of gathering by a set of autonomous mobile robots
cites work: Q4134504
cites work: Asynchronous Deterministic Rendezvous on the Line
cites work: Q4818870
cites work: Q2934643
cites work: Finding the medial axis of a simple polygon in linear time
DOI: 10.1016/J.TCS.2011.09.002
description: scientific article; zbMATH DE number 5987012