25 citations · 126 across the 37 of their papers we have counts for
21 papers · 1 filter
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…
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 Size Discovery and Topology Recognition in Radio Networks with Short Labels
Adam Gańczorz, Tomasz Jurdziński, Mateusz Lewko +1
We consider the fundamental problems of size discovery and topology recognition in radio networks modeled by simple undirected connected graphs. Size discovery calls for all nodes…
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel +1
A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task…
Almost Universal Anonymous Rendezvous in the Plane
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at d…