Evacuation from a disc in the presence of a faulty robot

Jurek Czyzowicz; Konstantinos Georgiou; Maxime Godon; Evangelos Kranakis; Danny Krizanc; Wojciech Rytter; Michał Włodarczyk

doi:10.1007/978-3-319-72050-0_10

Evacuation from a disc in the presence of a faulty robot

Jurek Czyzowicz
, Konstantinos Georgiou
, Maxime Godon
, Evangelos Kranakis
, Danny Krizanc
, Wojciech Rytter
, Michał Włodarczyk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

29 Scopus citations

Abstract

We consider the evacuation problem on a circle for three robots, at most one of which is faulty. The three robots starting from the center of a unit circle search for an exit placed at an unknown location on the perimeter (of the circle). During the search, robots can communicate wirelessly at any distance. The goal is to minimize the time that the latest non-faulty robot reaches the exit. Our main contributions are two intuitive evacuation protocols for the non-faulty robots to reach the exit in two well-studied fault-models, Crash and Byzantine. Moreover, we complement our positive results by lower bounds in both models. A summary of our results reads as follows: - Case of Crash Faults: Lower Bound ≈5.188; Upper Bound ≈6.309;, - Case of Byzantine Faults: Lower Bound ≈5.948; Upper Bound ≈6.921, For comparison, it is known (see [11]) that in the case of three non-faulty robots with wireless communication we have a lower bound of 4.159, and an upper bound of 4.219 for evacuation, while for two non-faulty robots (Formula Presented) is a tight upper and lower bound for evacuation.

Original language	English
Title of host publication	Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers
Editors	Shantanu Das, Sebastien Tixeuil
Publisher	Springer Verlag
Pages	158-173
Number of pages	16
ISBN (Print)	9783319720494
DOIs	https://doi.org/10.1007/978-3-319-72050-0_10
State	Published - 1 Jan 2017
Externally published	Yes
Event	24th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2017 - Porquerolles, France Duration: 19 Jun 2017 → 22 Jun 2017

Publication series

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

Conference

Conference	24th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2017
Country/Territory	France
City	Porquerolles
Period	19/06/17 → 22/06/17

Keywords

Algorithm
Byzantine faulty
Crash faulty
Evacuation
Robot
Search

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-72050-0_10

Cite this

Czyzowicz, J., Georgiou, K., Godon, M., Kranakis, E., Krizanc, D., Rytter, W., & Włodarczyk, M. (2017). Evacuation from a disc in the presence of a faulty robot. In S. Das, & S. Tixeuil (Eds.), Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers (pp. 158-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10641 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-72050-0_10

Czyzowicz, Jurek ; Georgiou, Konstantinos ; Godon, Maxime et al. / Evacuation from a disc in the presence of a faulty robot. Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers. editor / Shantanu Das ; Sebastien Tixeuil. Springer Verlag, 2017. pp. 158-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{90048eaefa9f4d1191d5a3bf4f7d696c,

title = "Evacuation from a disc in the presence of a faulty robot",

abstract = "We consider the evacuation problem on a circle for three robots, at most one of which is faulty. The three robots starting from the center of a unit circle search for an exit placed at an unknown location on the perimeter (of the circle). During the search, robots can communicate wirelessly at any distance. The goal is to minimize the time that the latest non-faulty robot reaches the exit. Our main contributions are two intuitive evacuation protocols for the non-faulty robots to reach the exit in two well-studied fault-models, Crash and Byzantine. Moreover, we complement our positive results by lower bounds in both models. A summary of our results reads as follows: - Case of Crash Faults: Lower Bound ≈5.188; Upper Bound ≈6.309;, - Case of Byzantine Faults: Lower Bound ≈5.948; Upper Bound ≈6.921, For comparison, it is known (see [11]) that in the case of three non-faulty robots with wireless communication we have a lower bound of 4.159, and an upper bound of 4.219 for evacuation, while for two non-faulty robots (Formula Presented) is a tight upper and lower bound for evacuation.",

keywords = "Algorithm, Byzantine faulty, Crash faulty, Evacuation, Robot, Search",

author = "Jurek Czyzowicz and Konstantinos Georgiou and Maxime Godon and Evangelos Kranakis and Danny Krizanc and Wojciech Rytter and Micha{\l} W{\l}odarczyk",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 24th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2017 ; Conference date: 19-06-2017 Through 22-06-2017",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-319-72050-0\_10",

language = "English",

isbn = "9783319720494",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "158--173",

editor = "Shantanu Das and Sebastien Tixeuil",

booktitle = "Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers",

address = "Germany",

}

Czyzowicz, J, Georgiou, K, Godon, M, Kranakis, E, Krizanc, D, Rytter, W & Włodarczyk, M 2017, Evacuation from a disc in the presence of a faulty robot. in S Das & S Tixeuil (eds), Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10641 LNCS, Springer Verlag, pp. 158-173, 24th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2017, Porquerolles, France, 19/06/17. https://doi.org/10.1007/978-3-319-72050-0_10

Evacuation from a disc in the presence of a faulty robot. / Czyzowicz, Jurek; Georgiou, Konstantinos; Godon, Maxime et al.
Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers. ed. / Shantanu Das; Sebastien Tixeuil. Springer Verlag, 2017. p. 158-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10641 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Evacuation from a disc in the presence of a faulty robot

AU - Czyzowicz, Jurek

AU - Georgiou, Konstantinos

AU - Godon, Maxime

AU - Kranakis, Evangelos

AU - Krizanc, Danny

AU - Rytter, Wojciech

AU - Włodarczyk, Michał

N1 - Publisher Copyright: © Springer International Publishing AG 2017.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We consider the evacuation problem on a circle for three robots, at most one of which is faulty. The three robots starting from the center of a unit circle search for an exit placed at an unknown location on the perimeter (of the circle). During the search, robots can communicate wirelessly at any distance. The goal is to minimize the time that the latest non-faulty robot reaches the exit. Our main contributions are two intuitive evacuation protocols for the non-faulty robots to reach the exit in two well-studied fault-models, Crash and Byzantine. Moreover, we complement our positive results by lower bounds in both models. A summary of our results reads as follows: - Case of Crash Faults: Lower Bound ≈5.188; Upper Bound ≈6.309;, - Case of Byzantine Faults: Lower Bound ≈5.948; Upper Bound ≈6.921, For comparison, it is known (see [11]) that in the case of three non-faulty robots with wireless communication we have a lower bound of 4.159, and an upper bound of 4.219 for evacuation, while for two non-faulty robots (Formula Presented) is a tight upper and lower bound for evacuation.

AB - We consider the evacuation problem on a circle for three robots, at most one of which is faulty. The three robots starting from the center of a unit circle search for an exit placed at an unknown location on the perimeter (of the circle). During the search, robots can communicate wirelessly at any distance. The goal is to minimize the time that the latest non-faulty robot reaches the exit. Our main contributions are two intuitive evacuation protocols for the non-faulty robots to reach the exit in two well-studied fault-models, Crash and Byzantine. Moreover, we complement our positive results by lower bounds in both models. A summary of our results reads as follows: - Case of Crash Faults: Lower Bound ≈5.188; Upper Bound ≈6.309;, - Case of Byzantine Faults: Lower Bound ≈5.948; Upper Bound ≈6.921, For comparison, it is known (see [11]) that in the case of three non-faulty robots with wireless communication we have a lower bound of 4.159, and an upper bound of 4.219 for evacuation, while for two non-faulty robots (Formula Presented) is a tight upper and lower bound for evacuation.

KW - Algorithm

KW - Byzantine faulty

KW - Crash faulty

KW - Evacuation

KW - Robot

KW - Search

UR - https://www.scopus.com/pages/publications/85040104813

U2 - 10.1007/978-3-319-72050-0_10

DO - 10.1007/978-3-319-72050-0_10

M3 - Conference contribution

AN - SCOPUS:85040104813

SN - 9783319720494

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

SP - 158

EP - 173

BT - Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers

A2 - Das, Shantanu

A2 - Tixeuil, Sebastien

PB - Springer Verlag

T2 - 24th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2017

Y2 - 19 June 2017 through 22 June 2017

ER -

Czyzowicz J, Georgiou K, Godon M, Kranakis E, Krizanc D, Rytter W et al. Evacuation from a disc in the presence of a faulty robot. In Das S, Tixeuil S, editors, Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Revised Selected Papers. Springer Verlag. 2017. p. 158-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-72050-0_10

Evacuation from a disc in the presence of a faulty robot

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this