2 papers
cs.DC2025
Gathering Teams of Bounded Memory Agents on a Line
Younan Gao, Andrzej Pelc
Several mobile agents, modelled as deterministic automata, navigate in an infinite line in synchronous rounds. All agents start in the same round. In each round, an agent can move…
cs.DC2024
Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid
Younan Gao, Andrzej Pelc
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 sa…