18 citations · 53 across the 11 of their papers we have counts for
17 papers
Deterministic Treasure Hunt in the Plane with Angular Hints
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
A mobile agent equipped with a compass and a measure of length has to find an inert treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In the b…
Want to Gather? No Need to Chatter!
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents…
Byzantine Gathering in Polynomial Time
Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani
We study the task of Byzantine gathering in a network modeled as a graph. Despite the presence of Byzantine agents, all the other (good) agents, starting from possibly different no…
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to mee…
Asynchronous approach in the plane: A deterministic polynomial algorithm
Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné +2
In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them…
Impact of Knowledge on Election Time in Anonymous Networks
Yoann Dieudonné, Andrzej Pelc
Leader election is one of the basic problems in distributed computing. For anonymous networks, the task of leader election is formulated as follows: every node v of the network mus…