2018
DOI: 10.1007/978-3-030-03232-6_20
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: We investigate exploration algorithms for autonomous mobile robots evolving in uniform ring-shaped networks. Different from the usual Look-Compute-Move (LCM) model, we consider two characteristics: myopia and luminosity. Myopia means each robot has a limited visibility. We consider the weakest assumption for myopia: each robot can only observe its neighboring nodes. Luminosity means each robot maintains a non-volatile visible light. We consider the weakest assumption for luminosity: each robot can use only two… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…In the same paper, the authors show that 5 robots are necessary in the Fsync model, and they present an algorithm for 5 robots working when all robots are on consecutive vertices in the initial configuration. If robots however have 1 bit of persistent memory which is visible/accessible by any robot within their visibility radius (the LUMIN OU S model), then three (in Fsync) or four (in Ssync and Async) robots are necessary and sufficient to solve terminating exploration [23] (for specific initial configurations). These numbers are reduced by one for (non-exclusive) perpetual exploration.…”
Section: Known Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the same paper, the authors show that 5 robots are necessary in the Fsync model, and they present an algorithm for 5 robots working when all robots are on consecutive vertices in the initial configuration. If robots however have 1 bit of persistent memory which is visible/accessible by any robot within their visibility radius (the LUMIN OU S model), then three (in Fsync) or four (in Ssync and Async) robots are necessary and sufficient to solve terminating exploration [23] (for specific initial configurations). These numbers are reduced by one for (non-exclusive) perpetual exploration.…”
Section: Known Resultsmentioning
confidence: 99%
“…Taking as initial configurations the configurations without towers is thus also rather natural for this problem. Finally, one may also look for universal algorithms [23]. Given a number of robots in a specified model, a universal algorithm is an algorithm solving the problem from any initial configuration which is solvable in the considered setting.…”
Section: Preliminariesmentioning
confidence: 99%