Gathering six oblivious robots on anonymous symmetric rings. D'Angelo, G.; Di Stefano, G.; and Navarra, A. Journal of Discrete Algorithms, 2014.
abstract   bibtex   
A recent model for robot-based computing systems makes use of identical, memoryless, and mobile robots placed on nodes of anonymous graphs. Robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current robots disposal on the entire ring (Look), takes a decision whether to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes a move to this neighbor (Move). Cycles are performed asynchronously for each robot. We consider the case of 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 node. This is the first case left open after a series of papers 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. © 2013 Elsevier B.V.
@article{
 title = {Gathering six oblivious robots on anonymous symmetric rings},
 type = {article},
 year = {2014},
 identifiers = {[object Object]},
 keywords = {Anonymous rings,Asynchronous systems,Gathering,Oblivious robots},
 volume = {26},
 id = {8f1fa09c-48e2-3b81-8fb6-1ca3ae4ff4f3},
 created = {2018-10-08T12:08:10.637Z},
 file_attached = {false},
 profile_id = {84ce8429-76d1-3854-b705-aea791bb12b7},
 group_id = {f21b0253-3968-3a3c-94e9-8d6f3fa6acf2},
 last_modified = {2018-10-08T12:08:10.751Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {A recent model for robot-based computing systems makes use of identical, memoryless, and mobile robots placed on nodes of anonymous graphs. Robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current robots disposal on the entire ring (Look), takes a decision whether to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes a move to this neighbor (Move). Cycles are performed asynchronously for each robot. We consider the case of 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 node. This is the first case left open after a series of papers 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. © 2013 Elsevier B.V.},
 bibtype = {article},
 author = {D'Angelo, G. and Di Stefano, G. and Navarra, A.},
 journal = {Journal of Discrete Algorithms}
}
Downloads: 0