# Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 Distributed Computing Research Group Ottawa 2 LaBRI - Laboratoire Bordelais de Recherche en Informatique 3 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d-Électronique, Informatique et Radiocommunications de Bordeaux ENSEIRB, CNRS - Centre National de la Recherche Scientifique : UMR5800 4 DII - Département d-Informatique et d-Ingénierie 5 School of Computer Science Ottawa

Abstract : In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. The weakest of the commonly used models is {\sc Asynch} where the autonomous mobile robots, endowed with visibility sensors but otherwise unable to communicate, operate in Look-Compute-Move cycles performed asynchronously for each robot. The robots are often assumed or required to be oblivious: they keep no memory of observations and computations made in previous cycles. We consider the setting when the robots are dispersed in an anonymous and unlabeled graph, and they must perform the very basic task of {\em exploration}: within finite time every node must be visited by at least one robot and the robots must enter a quiescent state. The complexity measure of a solution is the number of robots used to perform the task. We study the case when the graph is an arbitrary tree and establish some unexpected results. We first prove that there are $n$-node trees where $\Omegan$ robots are necessary; this holds even if the maximum degree is $4$. On the other hand, we show that if the maximum degree is $3$, it is possible to explore with only $O\frac{\log n} {\log\log n}$ robots. The proof of the result is constructive. Finally, we prove that the size of the team is asymptotically {\em optimal}: we show that there are trees of degree $3$ whose exploration requires $\Omega\frac{\log n}{\log\log n}$ robots.

Keywords : mobile agent robot oblivious asynchronous exploration

Autor: Paola Flocchini - David Ilcinkas - Andrzej Pelc - Nicola Santoro -

Fuente: https://hal.archives-ouvertes.fr/

DESCARGAR PDF