Access the full text.
Sign up today, get DeepDyve free for 14 days.
MJ Fischer, NA Lynch, M Paterson (1985)
Impossibility of distributed consensus with one faulty processJ. ACM, 32
S Chaudhuri (1993)
More choices allow more faults: set consensus problems in totally asynchronous systemsInf. Comput., 105
P Flocchini, G Prencipe, N Santoro, P Widmayer (1999)
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots, LNCS
P Flocchini, N Santoro, G Viglietta, M Yamashita (2016)
Rendezvous with constant memoryTheor. Comput. Sci., 621
Y Dieudonné, A Pelc, D Peleg (2014)
Gathering despite mischiefACM Trans. Algorithms, 11
G Marco, L Gargano, E Kranakis, D Krizanc, A Pelc, U Vaccaro (2006)
Asynchronous deterministic rendezvous in graphsTheor. Comput. Sci., 355
J Chalopin, Y Dieudonné, A Labourel, A Pelc (2014)
Automata, Languages, and Programming
S Bouchard, Y Dieudonné, B Ducourthial (2016)
Byzantine gathering in networksDistrib. Comput., 29
S Das, P Flocchini, G Prencipe, N Santoro, M Yamashita (2016)
Autonomous mobile robots with lightsTheor. Comput. Sci., 609
P Flocchini, G Prencipe, N Santoro (2012)
Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory
R Cohen, D Peleg (2005)
Convergence properties of the gravitational algorithm in asynchronous robot systemsSIAM J. Comput., 34
R Klasing, E Markou, A Pelc (2008)
Gathering asynchronous oblivious mobile robots in a ringTheor. Comput. Sci., 390
M Herlihy, N Shavit (1999)
The topological structure of asynchronous computabilityJ. ACM, 46
G D’Angelo, G Stefano, A Navarra (2013)
Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
N Agmon, D Peleg (2006)
Fault-tolerant gathering algorithms for autonomous mobile robotsSIAM J. Comput., 36
A Dessmark, P Fraigniaud, DR Kowalski, A Pelc (2006)
Deterministic rendezvous in graphsAlgorithmica, 46
M Raynal (2013)
Safe, Regular, and Atomic Read/Write Registers
M Cieliebak (2004)
LATIN 2004: Theoretical Informatics
M Herlihy, D Kozlov, S Rajsbaum (2013)
Distributed Computing Through Combinatorial Topology
H Attiya, J Welch (2004)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
E Gafni, E Koutsoupias (1999)
Three-processor tasks are undecidableSIAM J. Comput., 28
P Flocchini, G Prencipe, N Santoro, P Widmayer (2005)
Gathering of asynchronous robots with limited visibilityTheor. Comput. Sci., 337
G D’Angelo, G Stefano, A Navarra (2014)
Gathering on rings under the look-compute-move modelDistrib. Comput., 27
G D’Angelo, G Stefano, R Klasing, A Navarra (2012)
Structural Information and Communication Complexity
E Borowsky, E Gafni, N Lynch, S Rajsbaum (2001)
The BG distributed simulation algorithmDistrib. Comput., 14
M Cieliebak, P Flocchini, G Prencipe, N Santoro (2012)
Distributed computing by mobile robots: gatheringSIAM J. Comput., 41
M Herlihy, S Rajsbaum (2003)
A classification of wait-free loop agreement tasksTheor. Comput. Sci., 291
I Suzuki, M Yamashita (1999)
Distributed anonymous mobile robots: formation of geometric patternsSIAM J. Comput., 28
Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented.
Distributed Computing – Springer Journals
Published: Dec 15, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.