4 citations · 5 across the 5 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2011★ 4 cited
The BG-simulation for Byzantine Mobile Robots
Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil +1
This paper investigates the task solvability of mobile robot systems subject to Byzantine faults. We first consider the gathering problem, which requires all robots to meet in fini…
cs.DC2008
The cost of probabilistic gathering in oblivious robot networks
Julien Clement, Xavier Defago, Maria Gradinariu Potop-Butucaru +1
In this paper we address the complexity issues of two agreement problems in oblivious robot networks namely gathering and scattering. These abstractions are fundamental coordinatio…