Synchronous rendezvous for location-aware agents

DOI10.1007/978-3-642-24100-0_42MaRDI QIDQ3095348zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Adrian Kosowski, Russell Martin, Andrew Collins, Leszek Gąsieniec

Publication date 28 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24100-0_42

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Recommendations

• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs
• Asynchronous Deterministic Rendezvous on the Line
• Tell Me Where I Am So I Can Meet You Sooner
• Rendezvous of distance-aware mobile agents in unknown graphs

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 910916 (Why is no real title available?)
• Almost optimal asynchronous rendezvous in infinite multidimensional grids
• Asynchronous deterministic rendezvous in graphs
• Broadcasting in UDG radio networks with unknown topology
• Collective tree spanners of graphs
• Consensus and Cooperation in Networked Multi-Agent Systems
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Geometrically aware communication in random wireless networks
• How to meet asynchronously (almost) everywhere
• How to meet in anonymous network
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• On the effect of the deployment setting on broadcasting in Euclidean radio networks
• Rendezvous Search on the Line
• Rendezvous Search: A Personal Perspective
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Rendezvous search on a graph
• Rendezvous search when marks are left at the starting points
• Tell Me Where I Am So I Can Meet You Sooner
• The Rendezvous Search Problem
• The theory of search games and rendezvous.
• Two Dimensional Rendezvous Search

Cited in

(16)

• Asynchronous rendezvous with different maps
• Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
• Deterministic rendezvous with different maps
• Tell Me Where I Am So I Can Meet You Sooner
• Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
• Rendezvous problem
• Partial gathering of mobile agents in asynchronous unidirectional rings
• Optimal rendezvous on a line by location-aware robots in the presence of spies*
• Rendezvous of heterogeneous mobile agents in edge-weighted networks
• Move-optimal partial gathering of mobile agents in asynchronous trees
• Continuous rendezvous algorithm for memoryless agents with limited visibility in the Euclidean space
• Deterministic treasure hunt and rendezvous in arbitrary connected graphs
• Deterministic rendezvous in infinite trees
• Almost optimal asynchronous rendezvous in infinite multidimensional grids
• Rendezvous of distance-aware mobile agents in unknown graphs
• Gathering in the plane of location-aware robots in the presence of spies

This page was built for publication: Synchronous rendezvous for location-aware agents

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