Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid

Two identical anonymous mobile agents have to meet at a node of the infinite oriented grid whose nodes are unlabeled. This problem is known as rendezvous. The agents execute the same deterministic algorithm. Time is divided into rounds, and in each round each agent can either stay idle at the curren...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1050; S. 115395
Hauptverfasser:	Gao, Younan, Pelc, Andrzej
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 27.09.2025
Schlagworte:	Deterministic algorithm Grid Mark Mobile agent Rendezvous Time Mark Mobile agent Time Rendezvous Deterministic algorithm Grid
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!