Quentin Bramas

Learn More
We consider the problem of scattering n robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner [5], all solutions must be probabilistic. We investigate the amount of randomness (that is, the number of random bits used by the robots) that is necessary to achieve scattering. We first prove that n log n(More)
We consider the problem of aggregating data in a dynamic graph, that is, aggregating the data that originates from all nodes in the graph to a specific node, the sink. We are interested in giving lower bounds for this problem, under different kinds of adversaries. In our model, nodes are endowed with unlimited memory and unlimited computational power. Yet,(More)
We assume that a message may be delivered by packets through multiple hops and investigate the feasibility and efficiency of an implementation of the Omega Failure Detector under such assumption. We prove that the existence and sustainability of a leader is exponentially more probable in a multi-hop Omega implementation than in a single-hop one. An(More)
We propose a new probabilistic pattern formation algorithm for oblivious mobile robots that operates in the ASYNC model. Unlike previous work, our algorithm makes no assumptions about the local coordinate systems of robots (the robots do not share a common "North" nor a common "Right"), yet it preserves the ability from any initial configuration that(More)