Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots
Theory of Computing Systems
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Theoretical Computer Science
Distributed Models and Algorithms for Mobile Robot Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Characterizing geometric patterns formable by oblivious anonymous mobile robots
Theoretical Computer Science
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Hi-index | 0.00 |
In this paper we study the Near-Gathering problem for a set of asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in Look-Compute-Move (LCM) cycles: In this problem, the robots have to get close enough to each other, so that every robot can see all the others, without touching (i.e., colliding) with any other robot. The importance of this problem might not be clear at a first sight: Solving the Near-Gathering problem, it is possible to overcome the limitations of having robots with limited visibility, and it is therefore possible to exploit all the studies (the majority, actually) done on this topic, in the unlimited visibility setting. In fact, after the robots get close enough, they are able to see all the robots in the system, a scenario similar to the one where the robots have unlimited visibility. Here, we present a collision-free algorithm for the Near-Gathering problem, the first to our knowledge, that allows a set of autonomous mobile robots to nearly gather within finite time. The collision-free feature of our solution is crucial in order to combine it with an unlimited visibility protocol. In fact, the majority of the algorithms that can be found on the topic assume that all robots occupy distinct positions at the beginning. Hence, only providing a collision-free Near-Gathering algorithm, as the one presented here, is it possible to successfully combine it with an unlimited visibility protocol, hence overcoming the natural limitations of the limited visibility scenario. In our model, distances are induced by the infinity norm. A discussion on how to extend our algorithm to models with different distance functions, including the usual Euclidean distance, is also presented.