Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
type: Item
instance of: scholarly article
title: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
zbMATH Open document ID: 1260.68399
author: Adrian Kosowski
author: Andrzej Pelc
author: Jurek Czyzowicz
published in: Theory of Computing Systems
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6153883
zbMATH Keywords: mobile agent
zbMATH Keywords: rendezvous
zbMATH Keywords: deterministic
zbMATH Keywords: polygon
zbMATH Keywords: obstacle
zbMATH Keywords: bounded memory
MaRDI profile type: Publication
full work available at URL: s00224-011-9379-7
OpenAlex ID: W2092863347
cites work: The Rendezvous Search Problem
cites work: The theory of search games and rendezvous.
cites work: Rendezvous search on a graph
cites work: Two Dimensional Rendezvous Search
cites work: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
cites work: Reconstructing Visibility Graphs with Simple Robots
cites work: Q4449250
cites work: Asynchronous Deterministic Rendezvous in Bounded Terrains
cites work: Q5417602
cites work: Asynchronous deterministic rendezvous in graphs
cites work: Deterministic rendezvous in graphs
cites work: Q2762510
cites work: Deterministic Rendezvous in Trees with Little Memory
cites work: Rendezvous Search on the Line
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: Asynchronous Deterministic Rendezvous on the Line
cites work: Q2934643
DOI: 10.1007/S00224-011-9379-7
description: scientific article; zbMATH DE number 6153883