1. ZHAW digitalcollection
  2. School of Engineering
  3. Publikationen
  4. Publikationen School of Engineering
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCieliebak, Mark-
dc.contributor.authorFlocchini, Paola-
dc.contributor.authorPrencipe, Giuseppe-
dc.contributor.authorSantoro, Nicola-
dc.date.accessioned2018-06-20T14:41:48Z-
dc.date.available2018-06-20T14:41:48Z-
dc.date.issued2012-
dc.identifier.issn1095-7111de_CH
dc.identifier.issn0097-5397de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/7122-
dc.description.abstractConsider a set of n > 2 identical mobile computational entities in the plane, called robots, operating in Look-Compute-Move cycles, without any means of direct communication. The Gathering Problem is the primitive task of all entities gathering in finite time at a point not fixed in advance, without any external control. The problem has been extensively studied in the literature under a variety of strong assumptions (e.g., synchronicity of the cycles, instantaneous movements, complete memory of the past, common coordinate system, etc.). In this paper we consider the setting without those assumptions, that is, when the entities are oblivious (i.e., they do not remember results and observations from previous cycles), disoriented (i.e., have no common coordinate system), and fully asynchronous (i.e., no assumptions exist on timing of cycles and activities within a cycle). The existing algorithmic contributions for such robots are limited to solutions for n ≤ 4 or for restricted sets of initial configurations of the robots; the question of whether such weak robots could deterministically gather has remained open. In this paper, we prove that indeed the Gathering Problem is solvable, for any n > 2 and any initial configuration, even under such restrictive conditions.de_CH
dc.language.isodede_CH
dc.publisherSociety for Industrial and Applied Mathematicsde_CH
dc.relation.ispartofSIAM Journal on Computingde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subjectDistributed systemde_CH
dc.subjectGatheringde_CH
dc.subjectRobotde_CH
dc.subject.ddc004: Informatikde_CH
dc.subject.ddc621.3: Elektro-, Kommunikations-, Steuerungs- und Regelungstechnikde_CH
dc.titleDistributed computing by mobile robots : gatheringde_CH
dc.typeBeitrag in wissenschaftlicher Zeitschriftde_CH
dcterms.typeTextde_CH
zhaw.departementSchool of Engineeringde_CH
zhaw.organisationalunitInstitut für Informatik (InIT)de_CH
dc.identifier.doi10.1137/100796534de_CH
zhaw.funding.euNode_CH
zhaw.issue4de_CH
zhaw.originated.zhawYesde_CH
zhaw.pages.end879de_CH
zhaw.pages.start829de_CH
zhaw.publication.statuspublishedVersionde_CH
zhaw.volume41de_CH
zhaw.publication.reviewPeer review (Publikation)de_CH
zhaw.webfeedSoftware Systemsde_CH
zhaw.webfeedNatural Language Processingde_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.
Show simple item record
Cieliebak, M., Flocchini, P., Prencipe, G., & Santoro, N. (2012). Distributed computing by mobile robots : gathering. SIAM Journal on Computing, 41(4), 829–879. https://doi.org/10.1137/100796534
Cieliebak, M. et al. (2012) ‘Distributed computing by mobile robots : gathering’, SIAM Journal on Computing, 41(4), pp. 829–879. Available at: https://doi.org/10.1137/100796534.
M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, “Distributed computing by mobile robots : gathering,” SIAM Journal on Computing, vol. 41, no. 4, pp. 829–879, 2012, doi: 10.1137/100796534.
CIELIEBAK, Mark, Paola FLOCCHINI, Giuseppe PRENCIPE und Nicola SANTORO, 2012. Distributed computing by mobile robots : gathering. SIAM Journal on Computing. 2012. Bd. 41, Nr. 4, S. 829–879. DOI 10.1137/100796534
Cieliebak, Mark, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro. 2012. “Distributed computing by mobile robots : gathering.” SIAM Journal on Computing 41 (4): 829–79. https://doi.org/10.1137/100796534.
Cieliebak, Mark, et al. “Distributed computing by mobile robots : gathering.” SIAM Journal on Computing, vol. 41, no. 4, 2012, pp. 829–79, https://doi.org/10.1137/100796534.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.