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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1050; p. 115395
Main Authors:	Gao, Younan, Pelc, Andrzej
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.09.2025
Subjects:	Deterministic algorithm Grid Mark Mobile agent Rendezvous Time Mark Mobile agent Time Rendezvous Deterministic algorithm Grid
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!