Deterministic rendezvous with different maps

DOI10.1016/J.JCSS.2019.06.001MaRDI QIDQ2323344zbMATH OpenOpenAlexWikidataFDO

Authors Ashley Farrugia, Leszek Gąsieniec, Łukasz Kuszner, Eduardo Pacheco

Publication date 30 August 2019

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2019.06.001

zbMATH Keywords

distributed algorithmsmobile agentsrendezvous problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Deterministic Rendezvous in Restricted Graphs
• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• How to meet asynchronously (almost) everywhere

Cites work

• A distributed algorithm for gathering many fat mobile robots in the plane
• Deterministic Rendezvous in Restricted Graphs
• Deterministic meeting of sniffing agents in the plane
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Gathering despite mischief
• Gathering few fat mobile robots in the plane
• Gathering of oblivious robots on infinite grids with minimum traveled distance
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Gathering on rings under the look-compute-move model
• How to meet asynchronously (almost) everywhere
• How to meet in anonymous network
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
• Rendezvous of distance-aware mobile agents in unknown graphs
• Rendezvous of heterogeneous mobile agents in edge-weighted networks
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Rendezvous search on labeled networks
• Rendezvous search when marks are left at the starting points
• Search Theory
• Synchronous rendezvous for location-aware agents
• Tell Me Where I Am So I Can Meet You Sooner
• The Rendezvous Search Problem
• The gathering problem for two oblivious robots with unreliable compasses
• The rendezvous problem on discrete locations
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Two Dimensional Rendezvous Search

Cited in

(4)

• Rendezvous problem
• On asynchronous rendezvous in general graphs
• Different speeds suffice for rendezvous of two agents on arbitrary graphs
• Asynchronous rendezvous with different maps

This page was built for publication: Deterministic rendezvous with different maps

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