Using eventually consistent compasses to gather oblivious mobile robots with limited visibility

Samia Souissi, Xavier Défago, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Reaching agreement between 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 (not predetermined) location, without a global coordinate system. While being 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 was proved that gathering is solvable in asynchronous model with oblivious 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 and cannot detect multiplicity. In this paper, we define a model in which compasses may be unreliable, and study the solvability of gathering oblivious mobile robots with limited visibility in a 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, our algorithm is self-stabilizing.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings
PublisherSpringer Verlag
Pages484-500
Number of pages17
ISBN (Print)3540490183, 9783540490180
Publication statusPublished - Jan 1 2006
Event8th International Symposium on Self-Stabilizing Systems, SSS 2006 - Dallas, TX, United States
Duration: Nov 17 2006Nov 19 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4280 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Symposium on Self-Stabilizing Systems, SSS 2006
CountryUnited States
CityDallas, TX
Period11/17/0611/19/06

Fingerprint

Visibility
Mobile Robot
Mobile robots
Robot
Robots
Symmetry Breaking
Model
Solvability
Robotics
Multiplicity
Express
Unstable
Arbitrary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Souissi, S., Défago, X., & Yamashita, M. (2006). Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings (pp. 484-500). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4280 LNCS). Springer Verlag.

Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. / Souissi, Samia; Défago, Xavier; Yamashita, Masafumi.

Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings. Springer Verlag, 2006. p. 484-500 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4280 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Souissi, S, Défago, X & Yamashita, M 2006, Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. in Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4280 LNCS, Springer Verlag, pp. 484-500, 8th International Symposium on Self-Stabilizing Systems, SSS 2006, Dallas, TX, United States, 11/17/06.
Souissi S, Défago X, Yamashita M. Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings. Springer Verlag. 2006. p. 484-500. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Souissi, Samia ; Défago, Xavier ; Yamashita, Masafumi. / Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings. Springer Verlag, 2006. pp. 484-500 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2e784e415ebc4a74bf6f772d35364377,
title = "Using eventually consistent compasses to gather oblivious mobile robots with limited visibility",
abstract = "Reaching agreement between 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 (not predetermined) location, without a global coordinate system. While being 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 was proved that gathering is solvable in asynchronous model with oblivious 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 and cannot detect multiplicity. In this paper, we define a model in which compasses may be unreliable, and study the solvability of gathering oblivious mobile robots with limited visibility in a 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, our algorithm is self-stabilizing.",
author = "Samia Souissi and Xavier D{\'e}fago and Masafumi Yamashita",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "3540490183",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "484--500",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings",
address = "Germany",

}

TY - GEN

T1 - Using eventually consistent compasses to gather oblivious mobile robots with limited visibility

AU - Souissi, Samia

AU - Défago, Xavier

AU - Yamashita, Masafumi

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Reaching agreement between 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 (not predetermined) location, without a global coordinate system. While being 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 was proved that gathering is solvable in asynchronous model with oblivious 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 and cannot detect multiplicity. In this paper, we define a model in which compasses may be unreliable, and study the solvability of gathering oblivious mobile robots with limited visibility in a 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, our algorithm is self-stabilizing.

AB - Reaching agreement between 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 (not predetermined) location, without a global coordinate system. While being 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 was proved that gathering is solvable in asynchronous model with oblivious 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 and cannot detect multiplicity. In this paper, we define a model in which compasses may be unreliable, and study the solvability of gathering oblivious mobile robots with limited visibility in a 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, our algorithm is self-stabilizing.

UR - http://www.scopus.com/inward/record.url?scp=33845526825&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845526825&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33845526825

SN - 3540490183

SN - 9783540490180

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 484

EP - 500

BT - Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings

PB - Springer Verlag

ER -