Circle formation by asynchronous opaque fat robots on an infinite grid

This study addresses the problem of 'Circle Formation on an Infinite Grid by Fat Robots' ( $ CF\_FAT\_GRID $ CF _FAT _GRID ). Unlike prior work focused solely on point robots in discrete domain, it introduces fat robots to circle formation on an infinite grid, aligning with practicality as...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of parallel, emergent and distributed systems Vol. 39; no. 2; pp. 214 - 247
Main Authors Goswami, Pritam, Kumar Kundu, Manash, Ghosh, Satakshi, Sau, Buddhadeb
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 03.03.2024
Taylor & Francis Ltd
Subjects
Algorithms
asynchronous
circle formation
infinite grid
LCM cycle
luminous robots
Robots
Swarm robot algorithm
Online AccessGet full text
ISSN1744-5760
1744-5779
DOI10.1080/17445760.2024.2316017

Cover

More Information
Summary:This study addresses the problem of 'Circle Formation on an Infinite Grid by Fat Robots' ( $ CF\_FAT\_GRID $ CF _FAT _GRID ). Unlike prior work focused solely on point robots in discrete domain, it introduces fat robots to circle formation on an infinite grid, aligning with practicality as even small robots inherently possess dimensions. The algorithm, named $ CIRCLE\_FG $ CIRCLE _FG , resolves the $ CF\_FAT\_GRID $ CF _FAT _GRID problem using a swarm of fat luminous robots. Operating under an asynchronous scheduler, it achieves this with five distinct colors and by leveraging one-axis agreement among the robots.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1744-5760
1744-5779
DOI:10.1080/17445760.2024.2316017