An asynchronous maximum independent set algorithm by myopic luminous robots on grids

S Kamei, S Tixeuil - The Computer Journal, 2024 - academic.oup.com
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 …

[HTML][HTML] On time complexity for connectivity-preserving scattering of mobile robots

T Izumi, D Kaino, MG Potop-Butucaru… - Theoretical Computer …, 2018 - Elsevier
The scattering problem is a fundamental task for mobile robots, which requires that no two
robots share the same position. We investigate the scattering problem in the limited-visibility …

Weak coverage of a rectangular barrier

S Dobrev, E Kranakis, D Krizanc, M Lafond, J Maňuch… - Algorithmica, 2020 - Springer
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a
rectangular region. Each sensor can monitor a circular area of specific diameter around its …

Optimal online and offline algorithms for robot-assisted restoration of barrier coverage

J Czyzowicz, E Kranakis, D Krizanc… - Discrete Applied …, 2020 - Elsevier
Assume that n wireless sensors are initially arbitrarily distributed on a line segment barrier.
Each sensor is said to cover the portion of the barrier that intersects with its sensing area …

Can a Skywalker Localize the Midpoint of a Rope?

A Monde, Y Yamauchi, S Kijima… - ACM Transactions on …, 2021 - dl.acm.org
This article poses a question about a simple localization problem. The question is if an
oblivious walker on a line segment can localize the midpoint of the line segment in a finite …

Self-stabilizing localization of the middle point of a line segment by an oblivious robot with limited visibility

A Monde, Y Yamauchi, S Kijima… - Stabilization, Safety, and …, 2017 - Springer
This paper poses a question about a simple localization problem, which is arisen from self-
stabilizing location problems by oblivious mobile autonomous robots with limited visibility …

Can Walker Localize The Middle Point of A Line-segment?

A Monde, Y Yamauchi, S Kijima… - arXiv preprint arXiv …, 2017 - arxiv.org
This paper poses a question about a simple localization problem. The question is if an {\em
oblivious} walker on a line-segment can localize the middle point of the line-segment in {\em …