Show simple item record

dc.contributor.authorAgathangelou, Chrysovalandisen
dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorMavronicolas, Mariosen
dc.creatorAgathangelou, Chrysovalandisen
dc.creatorGeorgiou, Chryssisen
dc.creatorMavronicolas, Mariosen
dc.date.accessioned2019-11-13T10:38:11Z
dc.date.available2019-11-13T10:38:11Z
dc.date.issued2013
dc.identifier.isbn978-1-4503-2065-8
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53498
dc.description.abstractWe revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and robots only make local decisions. We use a state-machine representation to formulate the gathering problem and develop a distributed algorithm that solves the problem for any number of fat robots. The main idea behind the algorithm is to enforce the robots to reach a configuration in which all the following hold: (i) The robots' centers form a convex hull in which all robots are on the convex hull's boundaryen
dc.description.abstract(ii) Each robot can see all other robotsen
dc.description.abstract(iii) The configuration is connected: every robot touches another robot and all robots form together a connected formation. We show that starting from any initial configuration, the fat robots eventually reach such a configuration and terminate yielding a solution to the gathering problem. Copyright 2013 ACM.en
dc.sourceProceedings of the Annual ACM Symposium on Principles of Distributed Computingen
dc.source2013 ACM Symposium on Principles of Distributed Computing, PODC 2013en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84883515128&doi=10.1145%2f2484239.2484266&partnerID=40&md5=3a7fd719ec5c2ba2beb3591f46c5fb05
dc.subjectAlgorithmsen
dc.subjectRobotsen
dc.subjectComputational geometryen
dc.subjectLocal decisionsen
dc.subjectAsynchronyen
dc.subjectConvex hullen
dc.subjectFat robotsen
dc.subjectGatheringen
dc.subjectGathering problemen
dc.subjectInitial configurationen
dc.subjectState machineen
dc.subjectState-machinesen
dc.titleA distributed algorithm for gathering many fat mobile robots in the planeen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.identifier.doi10.1145/2484239.2484266
dc.description.startingpage250
dc.description.endingpage259
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: ACM SIGOPSen
dc.description.notesACM SIGACTen
dc.description.notesConference code: 99174en
dc.description.notesCited By :24</p>en
dc.contributor.orcidGeorgiou, Chryssis [0000-0003-4360-0260]


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record