2 citations · 3 across the 5 of their papers we have counts for
7 papers
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…
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
Adam Gańczorz, Tomasz Jurdziński, Andrzej Pelc
We consider two fundamental communication tasks in arbitrary radio networks: broadcasting (information from one source has to reach all nodes) and gossiping (every node has a messa…
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…
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
Subhash Bhagat, Andrzej Pelc
We consider the fundamental task of network exploration. A network is modeled as a simple connected undirected n-node graph with unlabeled nodes, and all ports at any node of degre…
Fast Deterministic Rendezvous in Labeled Lines
Avery Miller, Andrzej Pelc
Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as…
Computing Functions by Teams of Deterministic Finite Automata
Debasish Pattanayak, Andrzej Pelc
We consider the task of computing functions , where is the set of natural numbers, by finite teams of agents modelled as deterministic…
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs
Debasish Pattanayak, Andrzej Pelc
Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unk…