Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Getting close without touching
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.01 |
Over the past few years, the focus of robotic design has been moving from a scenario where a few specialized (and expensive) units were used to solve a variety of tasks, to a scenario where many general purpose (and cheap) units are used to achieve some common goal. Consequently, part of the focus has been to understand better how to coordinate and control a set of such “simpler” mobile units efficiently. Studies can be found in different disciplines, from engineering to artificial life: a shared feature of the majority of these works has been the design of algorithms based on heuristics, with no main concern on their correctness and termination. Few researchers have focused on trying to model formally an environment constituted by mobile units, analyzing which kind of capabilities they must have in order to achieve their goals; in other words, to study the problem from a computational point of view. In this paper we do a direct comparison between two models, ATOM and CORDA, introduced in two studies leading in this direction. First their main features are described, and then the main differences are highlighted, showing the relationship between the class of problems solvable in the two models.