25 citations · 126 across the 37 of their papers we have counts for
54 papers
Rendezvous of Mobile Deterministic Automata in Graphs
Bibhuti Das, Andrzej Pelc
Two mobile agents, modeled as identical deterministic finite automata (DFA) navigating in synchronous rounds in a graph with unlabeled nodes, have to meet at some node. The well-re…
Impact of Knowledge on the Cost of Treasure Hunt in Trees
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
A mobile agent has to find an inert target in some environment that can be a graph or a terrain in the plane. This task is known as treasure hunt. We consider deterministic algorit…
Explorable families of graphs
Andrzej Pelc
Graph exploration is one of the fundamental tasks performed by a mobile agent in a graph. An -node graph has unlabeled nodes, and all ports at any node of degree are arbitra…
Deterministic Rendezvous Algorithms
Andrzej Pelc
The task of rendezvous (also called {\em gathering}) calls for a meeting of two or more mobile entities, starting from different positions in some environment. Those entities are c…
Exploring Wedges of an Oriented Grid by an Automaton with Pebbles
Subhash Bhagat, Andrzej Pelc
A mobile agent, modeled as a deterministic finite automaton, navigates in the infinite anonymous oriented grid . It has to explore a given infinite su…
Deterministic Rendezvous in Infinite Trees
Subhash Bhagat, Andrzej Pelc
The rendezvous task calls for two mobile agents, starting from different nodes of a network modeled as a graph to meet at the same node. Agents have different labels which are inte…