Infinite Grid Exploration by Disoriented Robots

  title={Infinite Grid Exploration by Disoriented Robots},
  author={Quentin Bramas and St{\'e}phane Devismes and Pascal Lafourcade},
We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycles. They all agree on a common chirality, but have no global compass. Finally, they may use lights of different colors, but except from that, robots have neither persistent memories, nor communication mean. We consider the infinite grid exploration (IGE) problem. For this problem we give two impossibility results and… 
Brief Announcement: Infinite Grid Exploration by Disoriented Robots
This work considers the infinite grid exploration (IGE) problem, and shows that two robots are not sufficient in settings to solve the problem, even when robots have a common coordinate system.
D C ] 6 J un 2 01 9 Infinite Grid Exploration by Disoriented Robots ∗
This work considers the infinite grid exploration (IGE) problem, and presents three algorithms that solve the IGE problem in various settings, including one which is optimal in terms of number of robots.
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality
Swarms of luminous myopic opaque robots that run in synchronous Look-Compute-Move cycles, which have no global compass, but agree on a common chirality are considered, and optimal solutions to the perpetual exploration of a finite grid are proposed.
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids
This paper considers 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, and proposes two algorithms that assume the number of light colors of each robot is three and the visible range is two.
Gathering on Rings for Myopic Asynchronous Robots with Lights
This work investigates gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring-shaped networks using the Look-Compute-Move model and proves that, if $M_{init}$ or $O_{init$ is odd, gathering is always feasible with three or four colors.
Ring Exploration of Myopic Luminous Robots with Visibility More Than One
These results show the power of large visibility for luminous robots because, when the visible distance is one and the number of colors is two, three and four robots are necessary to achieve perpetual and terminating exploration in the semi-synchronous and asynchronous models.
Synchronizing asynchronous mobile robots with limited visibility using lights
This paper proposed a technique of synchronizing the robots which are asynchronous by nature, using observable colored lights, where the robots have limited range of visibility.
Terminating Grid Exploration with Myopic Luminous Robots
This work proves 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, and gives fourteen algorithms for the terminatingGrid exploration in various assumptions of synchrony, visible distance, the number of colors, and a chirality.
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots
This work investigates optimal (w.r.t., visibility range and number of used colors) solutions to the infinite grid exploration problem (IGE) by a small team of M2C robots and addresses optimality of these two criteria separately by proposing two algorithms.


Mutual Visibility by Asynchronous Robots on Infinite Grid
This paper considers the luminous robots model, in which each robot is equipped with an externally visible light which can assume a constant number of predefined colors, and proposes a distributed algorithm which solves the Mutual Visibility problem in a grid based terrain.
Gathering Multiple Robots in a Ring and an Infinite Grid
This paper has developed two algorithms to gather multiple robots at a single node (not known beforehand) of a Ring Graph and an infinite Grid, in finite time.
Optimal Grid Exploration by Asynchronous Oblivious Robots
It is shown that except in two particular cases, 3 robots are necessary and sufficient to deterministically explore a grid of at least three nodes and the optimal number of robots for the two remaining cases is 5.
Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction
This paper investigates the exclusive perpetual exploration of grid shaped networks using anonymous, oblivious and fully asynchronous robots, and proves that three deterministic robots are necessary and sufficient, provided that the size of the grid is n ×m with 3≤n≤m or n=2 and m≥4.
Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots
A discrete version of the Arbitrary Pattern Formation problem where the robots are operating on a two dimensional infinite grid is investigated, it is shown that a set of robots can form any arbitrary pattern, if their starting configuration is asymmetric.