Ring Exploration of Myopic Luminous Robots with Visibility More Than One

Nagahama, Shota; Ooshita, Fukuhito; Inoue, Michiko

doi:10.1007/978-3-030-34992-9_20

Cited by 7 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They showed that the number of robots required to achieve the tasks can be reduced compared to non-luminous robots. Nagahama et al [19] studied the same problem in case of φ ≥ 2 and showed that, in the SSYNC and ASYNC models, the number of robots required to achieve the tasks can be reduced compared to the case of φ = 1.…”

Section: Background and Motivationmentioning

confidence: 99%

Terminating grid exploration with myopic luminous robots

Nagahama

Ooshita

Inoue

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and luminous robots mean that they have light devices that can emit colors. First, we prove that, in the semi-synchronous and asynchronous models, three myopic robots are necessary to achieve the terminating grid exploration if the visible distance is one. Next, we give fourteen algorithms for the terminating grid exploration in various assumptions of synchrony (fully-synchronous, semi-synchronous, and asynchronous models), visible distance, the number of colors, and a chirality. Six of them are optimal in terms of the number of robots.

show abstract

Section: Background and Motivationmentioning

confidence: 99%

Terminating grid exploration with myopic luminous robots

Nagahama

Ooshita

Inoue

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Luminous robots were used to circumvent classical impossibility results in the oblivious model, mainly for gathering [12,33,22]. In this paper, we consider the particular combination of myopic and luminous robot model, that was previously used for ring exploration [30,29], infinite grid exploration [6], and gathering on rings [27].…”

Section: Introductionmentioning

confidence: 99%

An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids

Kamei¹,

Tixeuil²

2020

Preprint

View full text Add to dashboard Cite

We consider the problem of constructing a maximum independent set with mobile myopic luminous robots on a grid network whose size is finite but unknown to the robots. In this setting, the robots enter the grid network one-byone from a corner of the grid, and they eventually have to be disseminated on the grid nodes so that the occupied positions form a maximum independent set of the network. We assume that robots are asynchronous, anonymous, silent, and they execute the same distributed algorithm. In this paper, we propose two algorithms: The first one assumes the number of light colors of each robot is three and the visible range is two, but uses additional strong assumptions of port-numbering for each node. To delete this assumption, the second one assumes the number of light colors of each robot is seven and the visible range is three. In both algorithms, the number of movements is O(n(L + l)) steps where n is the number of nodes and L and l are the grid dimensions.

show abstract

“…As a result of the above observations, it becomes interesting to study the interplay between the myopic and luminous properties for LCM robots: can lights improve task solvability of myopic robots. To our knowledge, only three papers [18,17,2] consider this combination. Ooshita et al [18] and Nagahama et al [17] demonstrate that for the task of ring exploration, even a two-color light significantly improves task solvability.…”

Section: Introduction 1background and Motivationmentioning

confidence: 99%

“…To our knowledge, only three papers [18,17,2] consider this combination. Ooshita et al [18] and Nagahama et al [17] demonstrate that for the task of ring exploration, even a two-color light significantly improves task solvability. Bramas et al [2] give exploration algorithms for myopic robots in infinite grids by using a constant-color light.…”

Section: Introduction 1background and Motivationmentioning

confidence: 99%

Gathering on Rings for Myopic Asynchronous Robots with Lights

Kamei,

Lamani,

Ooshita

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

We investigate gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring-shaped networks. Different from most work using the Look-Compute-Move (LCM) model, we assume that robots have limited visibility and lights. That is, robots can observe nodes only within a certain fixed distance, and emit a color from a set of constant number of colors. We consider gathering algorithms depending on two parameters related to the initial configuration: Minit, which denotes the number of nodes between two border nodes, and Oinit, which denotes the number of nodes hosting robots between two border nodes. In both cases, a border node is a node hosting one or more robots that cannot see other robots on at least one side. Our main contribution is to prove that, if Minit or Oinit is odd, gathering is always feasible with three or four colors. The proposed algorithms do not require additional assumptions, such as knowledge of the number of robots, multiplicity detection capabilities, or the assumption of towerless initial configurations. These results demonstrate the power of lights to achieve gathering of robots with limited visibility.

show abstract

Ring Exploration of Myopic Luminous Robots with Visibility More Than One

Cited by 7 publications

References 18 publications

Terminating grid exploration with myopic luminous robots

Terminating grid exploration with myopic luminous robots

An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids

Gathering on Rings for Myopic Asynchronous Robots with Lights

Contact Info

Product

Resources

About