Gathering of six robots on anonymous symmetric rings

  • Authors:

  • Gianlorenzo D'Angelo;Gabriele Di Stefano;Alfredo Navarra

  • Affiliations:

  • Dipartimento di Ingegneria Elettrica e dell'Informazione, Università degli Studi dell'Aquila, Italy;Dipartimento di Ingegneria Elettrica e dell'Informazione, Università degli Studi dell'Aquila, Italy;Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Italy

  • Venue:
  • SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper deals with a recent model of robot-based computing which makes use of identical, memoryless mobile robots placed on nodes of anonymous graphs. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes an instantaneous move to this neighbor (Move). Cycles are performed asynchronously for each robot. In particular, we consider the case of only six robots placed on the nodes of an anonymous ring in such a way they constitute a symmetric placement with respect to one single axis of symmetry, and we ask whether there exists a strategy that allows the robots to gather at one single node. This is in fact the first case left open after a series of papers [1,2,3,4] dealing with the gathering of oblivious robots on anonymous rings. As long as the gathering is feasible, we provide a new distributed approach that guarantees a positive answer to the posed question. Despite the very special case considered, the provided strategy turns out to be very interesting as it neither completely falls into symmetry-breaking nor into symmetry-preserving techniques.