Rendezvous of two robots with constant memory

Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita

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

24 Citations (Scopus)

Abstract

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities have no persistent memory, even if the system is semi-synchronous and movements are rigid. It has been recently shown that if each entity is endowed with O (1) bits of persistent visible memory (called lights), they can rendezvous even if the system is asynchronous. In this paper we investigate the rendezvous problem in two weaker settings in systems of robots endowed with visible lights: in FSTATE, a robot can only see its own light, while in FCOMM a robot can only see the other robot's light. Among other things, we prove that, with rigid movements, finite-state robots can rendezvous in semi-synchronous settings, and finite-communication robots are able to rendezvous even in asynchronous ones. All proofs are constructive: in each setting, we present a protocol that allows the two robots to rendezvous in finite time.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers
Pages189-200
Number of pages12
DOIs
Publication statusPublished - Dec 1 2013
Event20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013 - Ischia, Italy
Duration: Jul 1 2013Jul 3 2013

Publication series

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

Other

Other20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013
CountryItaly
CityIschia
Period7/1/137/3/13

Fingerprint

Rendezvous
Robot
Robots
Data storage equipment
Thing
Communication

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Flocchini, P., Santoro, N., Viglietta, G., & Yamashita, M. (2013). Rendezvous of two robots with constant memory. In Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers (pp. 189-200). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8179 LNCS). https://doi.org/10.1007/978-3-319-03578-9_16

Rendezvous of two robots with constant memory. / Flocchini, Paola; Santoro, Nicola; Viglietta, Giovanni; Yamashita, Masafumi.

Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers. 2013. p. 189-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8179 LNCS).

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

Flocchini, P, Santoro, N, Viglietta, G & Yamashita, M 2013, Rendezvous of two robots with constant memory. in Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8179 LNCS, pp. 189-200, 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, Ischia, Italy, 7/1/13. https://doi.org/10.1007/978-3-319-03578-9_16
Flocchini P, Santoro N, Viglietta G, Yamashita M. Rendezvous of two robots with constant memory. In Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers. 2013. p. 189-200. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-03578-9_16
Flocchini, Paola ; Santoro, Nicola ; Viglietta, Giovanni ; Yamashita, Masafumi. / Rendezvous of two robots with constant memory. Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers. 2013. pp. 189-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a25d96dfb6c248dbaed3c62e6cda237a,
title = "Rendezvous of two robots with constant memory",
abstract = "We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities have no persistent memory, even if the system is semi-synchronous and movements are rigid. It has been recently shown that if each entity is endowed with O (1) bits of persistent visible memory (called lights), they can rendezvous even if the system is asynchronous. In this paper we investigate the rendezvous problem in two weaker settings in systems of robots endowed with visible lights: in FSTATE, a robot can only see its own light, while in FCOMM a robot can only see the other robot's light. Among other things, we prove that, with rigid movements, finite-state robots can rendezvous in semi-synchronous settings, and finite-communication robots are able to rendezvous even in asynchronous ones. All proofs are constructive: in each setting, we present a protocol that allows the two robots to rendezvous in finite time.",
author = "Paola Flocchini and Nicola Santoro and Giovanni Viglietta and Masafumi Yamashita",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/978-3-319-03578-9_16",
language = "English",
isbn = "9783319035772",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "189--200",
booktitle = "Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers",

}

TY - GEN

T1 - Rendezvous of two robots with constant memory

AU - Flocchini, Paola

AU - Santoro, Nicola

AU - Viglietta, Giovanni

AU - Yamashita, Masafumi

PY - 2013/12/1

Y1 - 2013/12/1

N2 - We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities have no persistent memory, even if the system is semi-synchronous and movements are rigid. It has been recently shown that if each entity is endowed with O (1) bits of persistent visible memory (called lights), they can rendezvous even if the system is asynchronous. In this paper we investigate the rendezvous problem in two weaker settings in systems of robots endowed with visible lights: in FSTATE, a robot can only see its own light, while in FCOMM a robot can only see the other robot's light. Among other things, we prove that, with rigid movements, finite-state robots can rendezvous in semi-synchronous settings, and finite-communication robots are able to rendezvous even in asynchronous ones. All proofs are constructive: in each setting, we present a protocol that allows the two robots to rendezvous in finite time.

AB - We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities have no persistent memory, even if the system is semi-synchronous and movements are rigid. It has been recently shown that if each entity is endowed with O (1) bits of persistent visible memory (called lights), they can rendezvous even if the system is asynchronous. In this paper we investigate the rendezvous problem in two weaker settings in systems of robots endowed with visible lights: in FSTATE, a robot can only see its own light, while in FCOMM a robot can only see the other robot's light. Among other things, we prove that, with rigid movements, finite-state robots can rendezvous in semi-synchronous settings, and finite-communication robots are able to rendezvous even in asynchronous ones. All proofs are constructive: in each setting, we present a protocol that allows the two robots to rendezvous in finite time.

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

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

U2 - 10.1007/978-3-319-03578-9_16

DO - 10.1007/978-3-319-03578-9_16

M3 - Conference contribution

AN - SCOPUS:84892972810

SN - 9783319035772

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

SP - 189

EP - 200

BT - Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers

ER -