Learn More
In this paper, we investigate the possibility to deterministi-cally solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong(More)
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the leader. The latter aims in arranging the robots in the plane to form any given pattern. The solvability of both these tasks turns out to be necessary in order to achieve more complex(More)
In this paper, we present a protocol to collect data within a vehicular ad hoc network (VANET). In spite of the intrinsic dynamic of such network, our protocol simultaneously offers three relevant properties: (1) It allows any vehicle to collect data beyond its direct neighborhood (i.e., vehicles within direct communication range) using vehicle-to-vehicle(More)
This paper investigates an open problem introduced in Dieudonné et al. (ACM Trans Algorithms 11(1):1, 2014). Two or more mobile agents start from nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a(More)
We consider distributed systems made of <i>weak mobile</i> robots, that is, mobile devices, equipped with sensors, that are <i>anonymous</i>, <i>autonomous</i>, <i>disoriented</i>, and <i>oblivious</i>. The <i>Circle Formation Problem</i> (CFP) consists of the design of a protocol insuring that, starting from an initial arbitrary configuration where no two(More)
This paper provides a complexity study of the deterministic localization problem in robot networks using local and relative observations only. This is an important issue in collective and cooperative robotics where global positioning systems (GPS) are not available, and the basic premise is the localization ability of the group. We prove that given a set of(More)