International audienceWe study the convergence problem in fully asynchronous, uni-dimensional robot networks that are prone to Byzantine (i.e. malicious) failures. In these settings, oblivious anonymous robots with arbitrary initial positions are required to eventually converge to an a apriori unknown position despite a subset of them exhibiting Byzantine behavior. Our contribution is twofold. We propose a deterministic algorithm that solves the problem in the most generic settings: fully asynchronous robots that operate in the non-atomic CORDA model. Our algorithm provides convergence in 5f+1-sized networks where f is the upper bound on the number of Byzantine robots. Additionally, we prove that 5f+1 is a lower bound whenever robot schedul...
International audienceThe class of robot convergence tasks has been shown to capture fundamental asp...
International audienceThe class of robot convergence tasks has been shown to capture fundamental asp...
We consider distributed computations, by identical autonomous mobile entities, that solve the Point ...
International audienceWe study the convergence problem in fully asynchronous, uni-dimensional robot ...
We study the convergence problem in fully asynchronous, uni-dimensional robot net-works that are pro...
We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-siz...
International audienceGiven a set of robots with arbitrary initial location and no agreement on a gl...
AbstractGiven a set of robots with arbitrary initial location and no agreement on a global coordinat...
International audienceGiven a set of robots with arbitrary initial location and no agreement on a gl...
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system...
This work is under review in Distributed Computing JournalGathering is a fundamental coordination pr...
International audienceWe propose a framework to build formal developments for robot networks using t...
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating explo-r...
International audienceThe class of robot convergence tasks has been shown to capture fundamental asp...
International audienceThe class of robot convergence tasks has been shown to capture fundamental asp...
We consider distributed computations, by identical autonomous mobile entities, that solve the Point ...
International audienceWe study the convergence problem in fully asynchronous, uni-dimensional robot ...
We study the convergence problem in fully asynchronous, uni-dimensional robot net-works that are pro...
We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-siz...
International audienceGiven a set of robots with arbitrary initial location and no agreement on a gl...
AbstractGiven a set of robots with arbitrary initial location and no agreement on a global coordinat...
International audienceGiven a set of robots with arbitrary initial location and no agreement on a gl...
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system...
This work is under review in Distributed Computing JournalGathering is a fundamental coordination pr...
International audienceWe propose a framework to build formal developments for robot networks using t...
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating explo-r...
International audienceThe class of robot convergence tasks has been shown to capture fundamental asp...
International audienceThe class of robot convergence tasks has been shown to capture fundamental asp...
We consider distributed computations, by identical autonomous mobile entities, that solve the Point ...