18 citations · 53 across the 11 of their papers we have counts for
5 papers · 1 filter
Byzantine Gathering in Networks
Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial
This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which con…
Deterministic Leader Election Among Disoriented Anonymous Sensors
Yoann dieudonné, Florence Levé, Franck Petit +1
We address the Leader Election (LE) problem in networks of anonymous sensors sharing no kind of common coordinate system. Leader Election is a fundamental symmetry breaking problem…
Leader Election Problem Versus Pattern Formation Problem
Yoann Dieudonné, Franck Petit, Vincent Villain
Leader election and arbitrary pattern formation are funda- mental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead…
Scatter of Weak Robots
Yoann Dieudonné, Franck Petit
In this paper, we first formalize the problem to be solved, i.e., the Scatter Problem (SP). We then show that SP cannot be deterministically solved. Next, we propose a randomized a…
Circle Formation of Weak Robots and Lyndon Words
Yoann Dieudonné, Franck Petit
A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words ca…