Asymptotically optimal deterministic rendezvous

DOI10.1142/S012905411100860XMaRDI QIDQ3173941zbMATH OpenFDO

Authors Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre

Publication date 10 October 2011

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

Full work available at URL https://doi.org/10.1142/S012905411100860X

zbMATH Keywords

autonomous agentsmobile robot networksoptimalityrendezvous

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Recommendations

• Deterministic rendezvous in graphs
• Algorithms and Computation
• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs

Cites work

• Asynchronous deterministic rendezvous in graphs
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering few fat mobile robots in the plane

Cited in

(10)

• Analysis of a randomized rendezvous algorithm
• Asymmetric rendezvous search on the circle
• Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
• Space-optimal rendezvous of mobile agents in asynchronous trees
• Asynchronous Deterministic Rendezvous on the Line
• Merging time of random mobile agents
• On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
• Algorithms and Computation
• Deterministic rendezvous in graphs
• Time versus cost tradeoffs for deterministic rendezvous in networks

This page was built for publication: Asymptotically optimal deterministic rendezvous

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