We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
—Routing in ad hoc networks is a well known issue. Most of the previous propositions to route data between two nodes aimed to define a path (sometimes several ones) on which pac...
— Relative bearing between robots is important in applications like pursuit-evasion [11] and SLAM [7]. This is also true in in sensor networks, where the bearing of one sensor no...
— Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actio...
Abstract— This paper describes the electronics and communication system of Odin, a novel heterogeneous modular robot made of links and joints. The electronics is divided into two...
Ricardo Franco Mendoza Garcia, Andreas Lyder, Davi...