Computability of Perpetual Exploration in Highly Dynamic Rings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Computability of Perpetual Exploration in Highly Dynamic Rings

Abstract

We consider systems made of autonomous mobile robots evolving in highly dynamic discrete environment, i.e., graphs where edges may appear and disappear unpredictably without any recurrence, stability, nor periodicity assumption. Robots are uniform (they execute the same algorithm), they are anonymous (they are devoid of any observable ID), they have no means allowing them to communicate together, they share no common sense of direction, and they have no global knowledge related to the size of the environment. However, each of them is endowed with persistent memory and is able to detect whether it stands alone at its current location. A highly dynamic environment is modeled by a graph such that its topology keeps continuously changing over time. In this paper, we consider only dynamic graphs in which nodes are anonymous, each of them is infinitely often reachable from any other one, and such that its underlying graph (i.e., the static graph made of the same set of nodes and that includes all edges that are present at least once over time) forms a ring of arbitrary size. In this context, we consider the fundamental problem of perpetual exploration: each node is required to be infinitely often visited by a robot. This paper analyses the computability of this problem in (fully) synchronous settings, i.e., we study the deterministic solvability of the problem with respect to the number of robots. We provide three algorithms and two impossibility results that characterize, for any ring size, the necessary and sufficient number of robots to perform perpetual exploration of highly dynamic rings.
Fichier principal
Vignette du fichier
main.pdf (336.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01548109 , version 1 (07-07-2017)

Identifiers

  • HAL Id : hal-01548109 , version 1

Cite

Marjorie Bournat, Swan Dubois, Franck Petit. Computability of Perpetual Exploration in Highly Dynamic Rings. The 37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017) , Jun 2017, Atlanta, United States. ⟨hal-01548109⟩
199 View
115 Download

Share

Gmail Facebook X LinkedIn More