Filters








116 Hits in 5.1 sec

Remembering without memory: Tree exploration by asynchronous oblivious robots

Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2010 Theoretical Computer Science  
The robots are often assumed (or required to be) oblivious: they keep no memory of observations and computations made in previous cycles.  ...  asynchronously for each robot.  ...  Since robots are oblivious, i.e., they do not have any memory of past observations, the destination is decided by a robot during a Compute operation solely on the basis of the location of other robots  ... 
doi:10.1016/j.tcs.2010.01.007 fatcat:4br3ig6trfawxfp2q7cujwwphy

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots [chapter]

Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
Lecture Notes in Computer Science  
The robots are often assumed (or required to be) oblivious: they keep no memory of observations and computations made in previous cycles.  ...  asynchronously for each robot.  ...  Since robots are oblivious, i.e., they do not have any memory of past observations, the destination is decided by a robot during a Compute operation solely on the basis of the location of other robots  ... 
doi:10.1007/978-3-540-69355-0_5 fatcat:crkh6nlni5d2bmqmftmeefodvq

Oblivious Robots on Graphs: Exploration [chapter]

David Ilcinkas
2019 Lecture Notes in Computer Science  
This chapter focuses on the problem of exploring a graph by a team of mobile robots endowed with vision.  ...  The goal for these robots is to explore the graph in which they are, that is to visit all vertices of the graph.  ...  This more or less explains why exclusive perpetual exploration cannot be solved by more than n − q robots. Algorithmic techniques for oblivious robots in rings and grids.  ... 
doi:10.1007/978-3-030-11072-7_9 fatcat:kipiyqnzybb2fp75dwm3fsdbxe

Network Exploration by Silent and Oblivious Robots [chapter]

Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro
2010 Lecture Notes in Computer Science  
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchronously.  ...  In particular we are concerned with what graphs can be explored, and how, if the robots do not remember the past and have no explicit means of communication.  ...  Moreover, since robots are oblivious, the task of deciding the global status of the exploration process, in particular termination detection, has to be performed without memory and without communication  ... 
doi:10.1007/978-3-642-16926-7_20 fatcat:6ltzt4gctjab5pn55qxbbd5pxm

How many oblivious robots can explore a line

Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2011 Information Processing Letters  
We consider the problem of exploring an anonymous line by a team of k identical, oblivious, asynchronous deterministic mobile robots that can view the environment but cannot communicate.  ...  For k < n, exploration by k robots turns out to be possible, if and only if either k = 3, or k ≥ 5, or k = 4 and n is odd.  ...  Robots are also oblivious: they do not remember past observations and in each cycle the computation is based only on the result of the Look operation in this cycle.  ... 
doi:10.1016/j.ipl.2011.07.018 fatcat:had3v6e7bbf37b3e63hhwexi2i

Use of Information, Memory and Randomization in Asynchronous Gathering [article]

Andrzej Pelc
2017 arXiv   pre-print
This machine has initial input, unbounded memory, and is randomized.  ...  We investigate initial information, unbounded memory and randomization in gathering mobile agents on a grid.  ...  Acknowledgements This research was supported in part by NSERC discovery grant 8136 -2013 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.  ... 
arXiv:1709.05869v1 fatcat:74pldjfb6nbp5khhbcpisoqola

Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction [chapter]

François Bonnet, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil
2011 Lecture Notes in Computer Science  
In this paper, we investigate the exclusive perpetual exploration of grid shaped networks using anonymous, oblivious and fully asynchronous robots.  ...  by an adversary that schedules robots for execution, and may change between invocations of particular robots).  ...  various stages of the exploration process since robots have no persistent memory.  ... 
doi:10.1007/978-3-642-25873-2_18 fatcat:3xsiddkck5hh7dnrnrqoff4csm

The BG-simulation for Byzantine Mobile Robots [article]

Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
2011 arXiv   pre-print
At the core of our impossibility result is a reduction from the distributed consensus problem in asynchronous shared-memory systems.  ...  It is known that the solvability of Byzantine gathering strongly depends on a number of system attributes, such as synchrony, the number of Byzantine robots, scheduling strategy, obliviousness, orientation  ...  for severe models (asynchrony, oblivious and uniform robots, and/or without agreement of coordinate systems) [1, 10] .  ... 
arXiv:1106.0113v1 fatcat:hkmx3cqo5fagpjqhqv6jz3ptvi

Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots [chapter]

Stéphane Devismes, Franck Petit, Sébastien Tixeuil
2010 Lecture Notes in Computer Science  
We consider a team of k identical, oblivious, semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path.  ...  Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots.  ...  the exploration process since robots have no persistent memory.  ... 
doi:10.1007/978-3-642-11476-2_16 fatcat:xbfxre22hng3zarcpza6fjvwyy

Optimal probabilistic ring exploration by semi-synchronous oblivious robots

Stéphane Devismes, Franck Petit, Sébastien Tixeuil
2013 Theoretical Computer Science  
We consider a team of k identical, oblivious, semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path.  ...  Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots.  ...  the exploration process since robots have no persistent memory.  ... 
doi:10.1016/j.tcs.2013.05.031 fatcat:hcd5xezoenggxhxeykuvrt5yim

Meeting in a Polygon by Anonymous Oblivious Robots [article]

Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2019 arXiv   pre-print
Moreover, oblivious searchers can execute our algorithms as well, encoding information by carefully positioning themselves within the polygon.  ...  For instance, if the searchers have memory but are anonymous, asynchronous, and have no agreement on a coordinate system or a notion of clockwise direction, then our algorithms work even if the initial  ...  In the Look-Compute-Move model, asynchronous oblivious robots with unlimited visibility can solve the Gathering problem without additional assumptions [8] .  ... 
arXiv:1705.00324v4 fatcat:il4pe72a3bbbnpmpid6xpkwebu

Optimal Grid Exploration by Asynchronous Oblivious Robots [chapter]

Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil
2012 Lecture Notes in Computer Science  
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration (exploration for short) of a grid-shaped network by a team of k asynchronous oblivious robots in  ...  the asynchronous non-atomic model, so-called CORDA.  ...  In this paper, we propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration of a grid-shaped network by a team of k asynchronous oblivious robots in the asynchronous  ... 
doi:10.1007/978-3-642-33536-5_7 fatcat:v6asal3phfcabfe2bgdboscvra

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots [article]

Stéphane Devismes, Franck Petit (LIP, INRIA Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme), Sébastien Tixeuil
2009 arXiv   pre-print
We consider a team of k identical, oblivious, asynchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path.  ...  Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots.  ...  the exploration process since robots have no persistent memory.  ... 
arXiv:0902.1834v1 fatcat:32xmhg35avgebe26iorsnioazq

Verification of Asynchronous Mobile-Robots in Partially-Known Environments [chapter]

Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger
2015 Lecture Notes in Computer Science  
The motivation is from practical scenarios in which the environment is not completely know to the robots, e.g., physical robots exploring a maze, or software agents exploring a hostile network.  ...  This paper establishes a framework based on logic and automata theory in which to model and automatically verify that multiple mobile robots, with sensing abilities, moving asynchronously, correctly perform  ...  A second limitation is that robots do not have a rich memory (e.g., they cannot remember a map of where they have visited).  ... 
doi:10.1007/978-3-319-25524-8_12 fatcat:sgruummqnbbhdi4ttrmey3dexe

Gathering Anonymous, Oblivious Robots on a Grid [article]

Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide
2017 arXiv   pre-print
memory (oblivious), "flags" and states.  ...  constant distance in each step, cannot communicate, are oblivious and do not have flags or states.  ...  They can be equipped with a memory or are oblivious, i.e., the robots do not remember anything from the past and perform their actions only on their current views.  ... 
arXiv:1702.03400v3 fatcat:2oxpzzglrndgxnsyb2hqudtm5i
« Previous Showing results 1 — 15 out of 116 results