Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains

DOI10.1007/978-3-642-15155-2_27MaRDI QIDQ3586092zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc

Publication date 3 September 2010

Published in Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15155-2_27

Mathematics Subject Classification ID

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

Recommendations

• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
• Asynchronous deterministic rendezvous in bounded terrains
• Asynchronous deterministic rendezvous in bounded terrains
• How to meet asynchronously (almost) everywhere
• How to meet asynchronously (almost) everywhere

Cited in

(4)

• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
• Asynchronous deterministic rendezvous in bounded terrains
• Asynchronous deterministic rendezvous in bounded terrains

This page was built for publication: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586092)