ACM Home Page
Please provide us with feedback. Feedback
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
Full text PdfPdf (353 KB)
Source
ACM Transactions on Autonomous and Adaptive Systems (TAAS) archive
Volume 4 ,  Issue 1  (January 2009) table of contents
Article No. 9  
Year of Publication: 2009
ISSN:1556-4665
Authors
Samia Souissi  Japan Advanced Institute of Science and Technology (JAIST), Ishikawa, Japan
Xavier Défago  Japan Advanced Institute of Science and Technology (JAIST), Ishikawa, Japan
Masafumi Yamashita  Kyushu University, Fukuoka, Japan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 107,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1462187.1462196
What is a DOI?

ABSTRACT

Reaching agreement among a set of mobile robots is one of the most fundamental issues in distributed robotic systems. This problem is often illustrated by the gathering problem, where the robots must self-organize and meet at some location not determined in advance, and without the help of some global coordinate system. While very simple to express, this problem has the advantage of retaining the inherent difficulty of agreement, namely the question of breaking symmetry between robots. In previous works, it has been proved that the gathering problem is solvable in asynchronous model with oblivious (i.e., memory-less) robots and limited visibility, as long as the robots share the knowledge of some direction, as provided by a compass. However, the problem has no solution in the semi-synchronous model when robots do not share a compass, or when they cannot detect multiplicity.

In this article, we define a model in which compasses may be unreliable, and study the solvability of gathering oblivious mobile robots with limited visibility in the semi-synchronous model. In particular, we give an algorithm that solves the problem in finite time in a system where compasses are unstable for some arbitrary long periods, provided that they stabilize eventually. In addition, we show that our algorithm solves the gathering problem for at most three robots in the asynchronous model. Our algorithm is intrinsically self-stabilizing.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Ando, H., Oasa, Y., Suzuki, I., and Yamashita, M. 1999. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Automat. 15, 5, 818--828.
 
3
Balch, T. and Arkin, R. C. 1998. Behavior-based formation control for multi-robot teams. IEEE Trans. Robot. Automat. 14, 6, 926--939.
 
4
Beni, G. and Hackwood, S. 1992. Coherent swarm motion under distributed control. In Proceedings of the International Symposium on Distributed Autonomous Robotic Systems (DARS'92), 39--52.
 
5
6
 
7
Cieliebak, M. 2004. Gathering non-oblivious mobile robots. In Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN'04), 577--588.
 
8
Cieliebak, M., Flocchini, P., Prencipe, G., and Santoro, N. 2003. Solving the robots gathering problem. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP'03), 1181--1196.
 
9
Cohen, R. and Peleg, D. 2004. Robot convergence via center of gravity algorithms. In Proceedings of the Colloquium on Structural Information and Communication Complexity (SIROCCO'04). Lecture Notes in Computer Science, vol. 3104. 79--88.
 
10
 
11
Czyzowicz, J., Gasieniec, L., and Pelc, A. 2006. Gathering few fat mobile robots in the plane. In Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS'06). Lecture Notes in Computer Science, vol. 4305. 350--364.
 
12
Défago, X., Gradinariu, M., Messika, S., and Raipin-Parvédy, P. 2006. Fault-tolerant and self-stabilizing mobile robots gathering. In Proceedings of the 20th International Symposium on Distributed Computing (DISC'06). Lecture Notes in Computer Science, vol. 4167, 46--60.
 
13
14
 
15
Fishkin, A. V. 2004. Disk graphs: A short survey. Proceedings of the Workshop on Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 2909, 260--264.
 
16
 
17
Flocchini, P., Prencipe, G., Santoro, N., and Widmayer, P. 2001. Pattern formation by autonomous robots without chirality. In Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO'01). 147--162.
 
18
 
19
 
20
Imazu, H., Itoh, N., Katayama, Y., Inuzuka, N., and Wada, K. 2005. A gathering problem for autonomous mobile robots with disagreement in compasses (in Japanese). In Proceedings of the 1st Workshop on Theoretical Computer Science. 43--46.
 
21
 
22
Izumi, T., Katayama, Y., Inuzuka, N., and Wada, K. 2007. Gathering autonomous mobile robots with dynamic compasses: An optimal result. In Proceedings of the 21st International Symposium on Distributed Computing (DISC'07). Lecture Notes in Computer Science, vol. 4731, 298--312.
 
23
Katayama, Y., Tomida, Y., Imazu, H., Inuzuka, N., and Wada, K. 2007. Dynamic compass models and gathering algorithms for autonomous mobile robots. In Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO'07). Lecture Notes in Computer Science, vol. 4474, 274--288.
 
24
Kawauchi, Y., Inaba, M., and Fukuda, T. 1993. A principle of distributed decision making of cellular robotic system (cebot). In Proceedings of the IEEE International Conference on Robotics and Automation. Lecture Notes in Computer Science, vol. 3, 833--838.
 
25
Krieger, M. J. B., Billeter, J.-B., and Keller, L. 2000. Ant-like task allocation and recruitment in cooperative robots. Nature 406, 6799, 992--995.
 
26
 
27
Matarić, M. J. 1995. From local interactions to collective intelligence. In Proceedings of Biology and Technology of Intelligent Autonomous Agents. Lecture Notes in Computer Science, vol. 144, 275--295.
 
28
Peleg, D. 2005. Distributed coordination algorithms for mobile robot swarms: New directions and challenges. In Proceedings of the 7th International Workshop on Distributed Computing (IWDC'05). 1--12.
 
29
 
30
Prencipe, G. 2001b. Corda: Distributed coordination of a set of autonomous mobile robots. In Proceedings of the 4th European Research Seminar on Advances in Distributed Systems and Dependable Systems (ERSADS'01). 185--190.
 
31
Prencipe, G. 2005. On the feasibility of gathering by autonomous mobile robots. In Proceedings of the Colloquium on Structural Information and Communication Complexity (SIROCCO'05). 246--261.
 
32
Souissi, S. 2007. Fault-resilient cooperation of autonomous mobile robots with unreliable compass sensors. Japan Advanced Institute of Science and Technology.
 
33
Souissi, S., Défago, X., and Yamashita, M. 2006a. Gathering asynchronous mobile robots with inaccurate compasses. In Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS'06). Lecture Notes in Computer Science, vol. 4305, 333--349.
 
34
Souissi, S., Défago, X., and Yamashita, M. 2006b. Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In Proceedings of the 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'06). Lecture Notes in Computer Science, vol. 4280, 471--487.
 
35
 
36
 
37

Collaborative Colleagues:
Samia Souissi: colleagues
Xavier Défago: colleagues
Masafumi Yamashita: colleagues