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

Abstract 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.
AbstractList 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.
This study addresses the problem of ‘Circle Formation on an Infinite Grid by Fat Robots’ ( 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, resolves the 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.
Author Ghosh, Satakshi
Kumar Kundu, Manash
Sau, Buddhadeb
Goswami, Pritam
Author_xml – sequence: 1
  givenname: Pritam
  surname: Goswami
  fullname: Goswami, Pritam
  email: pritamgoswami.math.rs@jadavpuruniversity.in
  organization: Jadavpur University
– sequence: 2
  givenname: Manash
  surname: Kumar Kundu
  fullname: Kumar Kundu, Manash
  organization: Gayeshpur Government Polytechnic, Department of Science and Humanities
– sequence: 3
  givenname: Satakshi
  surname: Ghosh
  fullname: Ghosh, Satakshi
  organization: Jadavpur University
– sequence: 4
  givenname: Buddhadeb
  surname: Sau
  fullname: Sau, Buddhadeb
  organization: Jadavpur University
BookMark eNp9kEFLAzEQhYNUsK3-BCHgeeskm012b0qxKhS86Dkk2URTtknNbpH992apevQ0w_DmvZlvgWYhBovQNYEVgRpuiWCsEhxWFChb0ZJwIOIMzad5UQnRzP56Dhdo0fc7AEYZF3O0WftkOotdTHs1-BiwHrHqx2A-Ugzx2ON4UJ_HLFADTlHHIU8CVgH74Hzwg8XvybeX6NyprrdXP3WJ3jYPr-unYvvy-Ly-3xaG1nwohNNtW0PZMttoUYPVUBNdNsYxownllucTtWCuIkRUAojiShNXNtSxpjZQLtHNyfeQYr6qH-QuHlPIkbIEQWlVEiBZVZ1UJsW-T9bJQ_J7lUZJQE7I5C8yOSGTP8jy3t1pL_828fiKqWvloMYuJpdUMD7H_G_xDXM3c7I
Cites_doi 10.1137/050645221
10.1016/j.tcs.2022.10.015
10.1007/978-3-031-21017-4_26
10.7494/csci.2021.22.1.3840
10.1080/17445760.2022.2124411
10.1007/s00446-016-0291-x
10.1007/978-3-031-37765-5_12
10.4230/LIPIcs.DISC.2020.12
10.3390/app13137991
10.1016/j.tcs.2008.01.050
10.1007/978-3-031-21017-4_11
10.1007/978-3-030-03232-6_21
10.1137/S009753979628292X
10.1016/j.tcs.2008.07.026
10.1145/3491003.3493373
10.1007/978-3-031-21017-4_18
10.1007/978-3-030-79527-6_11
10.1145/584490.584509
10.1016/j.tcs.2005.01.001
10.1007/s00446-017-0293-3
10.1007/978-3-030-67087-0_9
10.1080/17445760.2022.2088750
10.1007/978-3-030-39219-2_28
10.1007/978-3-642-28073-3_8
ContentType Journal Article
Copyright 2024 Informa UK Limited, trading as Taylor & Francis Group 2024
2024 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2024 Informa UK Limited, trading as Taylor & Francis Group 2024
– notice: 2024 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/17445760.2024.2316017
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1744-5779
EndPage 247
ExternalDocumentID 10_1080_17445760_2024_2316017
2316017
Genre Research Article
GrantInformation_xml – fundername: University Grants Commission
  grantid: 1132/(CSIR-UGC NET JUNE 2017)
GroupedDBID .7F
.QJ
0BK
0R~
29J
30N
4.4
5GY
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EBS
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NX~
O9-
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
8FD
ADYSH
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c286t-7fbdd803d4e9b780eb081b39cf4cb126e6576b74f51175701a6ab1f392f498c03
ISSN 1744-5760
IngestDate Fri Jul 25 07:29:33 EDT 2025
Wed Oct 01 01:59:52 EDT 2025
Mon Oct 20 23:48:30 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c286t-7fbdd803d4e9b780eb081b39cf4cb126e6576b74f51175701a6ab1f392f498c03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 3072253101
PQPubID 176139
PageCount 34
ParticipantIDs informaworld_taylorfrancis_310_1080_17445760_2024_2316017
crossref_primary_10_1080_17445760_2024_2316017
proquest_journals_3072253101
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-03-03
PublicationDateYYYYMMDD 2024-03-03
PublicationDate_xml – month: 03
  year: 2024
  text: 2024-03-03
  day: 03
PublicationDecade 2020
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of parallel, emergent and distributed systems
PublicationYear 2024
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References e_1_3_2_27_1
e_1_3_2_20_1
e_1_3_2_21_1
e_1_3_2_23_1
e_1_3_2_24_1
e_1_3_2_25_1
e_1_3_2_26_1
Tanaka O. (e_1_3_2_18_1) 1992
e_1_3_2_16_1
e_1_3_2_9_1
e_1_3_2_17_1
e_1_3_2_8_1
e_1_3_2_7_1
e_1_3_2_19_1
e_1_3_2_2_1
e_1_3_2_10_1
e_1_3_2_11_1
e_1_3_2_6_1
e_1_3_2_12_1
e_1_3_2_5_1
e_1_3_2_13_1
e_1_3_2_4_1
e_1_3_2_14_1
e_1_3_2_3_1
e_1_3_2_15_1
Sugihara K (e_1_3_2_22_1) 1990; 1
References_xml – ident: e_1_3_2_2_1
  doi: 10.1137/050645221
– volume-title: Forming a circle by distributed anonymous mobile robots
  year: 1992
  ident: e_1_3_2_18_1
– ident: e_1_3_2_5_1
  doi: 10.1016/j.tcs.2022.10.015
– ident: e_1_3_2_27_1
  doi: 10.1007/978-3-031-21017-4_26
– ident: e_1_3_2_15_1
  doi: 10.7494/csci.2021.22.1.3840
– ident: e_1_3_2_12_1
  doi: 10.1080/17445760.2022.2124411
– ident: e_1_3_2_26_1
  doi: 10.1007/s00446-016-0291-x
– ident: e_1_3_2_7_1
  doi: 10.1007/978-3-031-37765-5_12
– ident: e_1_3_2_14_1
  doi: 10.4230/LIPIcs.DISC.2020.12
– ident: e_1_3_2_16_1
  doi: 10.3390/app13137991
– volume: 1
  start-page: 138
  year: 1990
  ident: e_1_3_2_22_1
  article-title: Distributed motion coordination of multiple mobile robots
  publication-title: Proc 5th IEEE Int Symp Intell Control
– ident: e_1_3_2_23_1
  doi: 10.1016/j.tcs.2008.01.050
– ident: e_1_3_2_9_1
  doi: 10.1007/978-3-031-21017-4_11
– ident: e_1_3_2_17_1
  doi: 10.1007/978-3-030-03232-6_21
– ident: e_1_3_2_24_1
  doi: 10.1137/S009753979628292X
– ident: e_1_3_2_11_1
  doi: 10.1016/j.tcs.2008.07.026
– ident: e_1_3_2_6_1
  doi: 10.1145/3491003.3493373
– ident: e_1_3_2_4_1
  doi: 10.1007/978-3-031-21017-4_18
– ident: e_1_3_2_10_1
  doi: 10.1007/978-3-030-79527-6_11
– ident: e_1_3_2_25_1
  doi: 10.1145/584490.584509
– ident: e_1_3_2_13_1
  doi: 10.1016/j.tcs.2005.01.001
– ident: e_1_3_2_3_1
  doi: 10.1007/s00446-017-0293-3
– ident: e_1_3_2_8_1
  doi: 10.1007/978-3-030-67087-0_9
– ident: e_1_3_2_19_1
  doi: 10.1080/17445760.2022.2088750
– ident: e_1_3_2_20_1
  doi: 10.1007/978-3-030-39219-2_28
– ident: e_1_3_2_21_1
  doi: 10.1007/978-3-642-28073-3_8
SSID ssj0042467
Score 2.288841
Snippet 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...
This study addresses the problem of ‘Circle Formation on an Infinite Grid by Fat Robots’ ( CF_FAT_GRID). Unlike prior work focused solely on point robots in...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Index Database
Publisher
StartPage 214
SubjectTerms Algorithms
asynchronous
circle formation
infinite grid
LCM cycle
luminous robots
Robots
Swarm robot algorithm
Title Circle formation by asynchronous opaque fat robots on an infinite grid
URI https://www.tandfonline.com/doi/abs/10.1080/17445760.2024.2316017
https://www.proquest.com/docview/3072253101
Volume 39
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1744-5779
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0042467
  issn: 1744-5760
  databaseCode: AHDZW
  dateStart: 20050101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1744-5779
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0042467
  issn: 1744-5760
  databaseCode: 30N
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.tandfonline.com/page/title-lists
  providerName: Taylor & Francis
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lj9MwELZK98KFN2LZBfnArUrJw3kdl4WlAoE4dMWKS2THNq2WpigPrZa_wx9lJnbSRF2J1yWqnNhJx5894_H4G0JesISHeSqFwxKlHMZT7iQChjtTkeTaVVGg0DXw4WO0OGfvLsKLyeTnIGqpqcU8_3HjuZJ_6VUog37FU7J_0bN9o1AAv6F_4Qo9DNc_6uPTdQkluwOIaEvy6rrIkfEWY1thRYz0rJrXs3IrtmZvgGNwo16jsTn7Wq5HmTrHDsIBrQRShH-zW_rKHNk0sekSmXcxaRZYrtWA_rzl3K-u-KYNF_iEPojNbt9ow8vZ-6aQjTkvVPCqd0u_XW2rlXFW1_yyWq17JxBvn37VSLniUomhw8JnbcRW0ENsuZc7ZDD9xow5sAIyOzVqWGZSznRztiFAstj0RxMwG-hy37B57qkJE1eJLePL5viVczB0YXEa7_RiH61o79wiBz6oDndKDk4Wr7987hQ-81mbqLj_-O6gWOK-vPEVIxNoRJC7ZxC0Vs7yHrljlyf0xGDtPpmo4gG526X-oFYTPCRnBnq0hx4V13QIPWqgRwF61ECPwkO8oB30KELvETk_e7M8XTg2JYeT-0lUO7EWUiZuIJlKRZy4SoBJKYI01ywXnh-pCP6tiJkOkQI2dj0eceFpMMI1S5PcDR6TabEt1BNCQx3JPFSSI6Nf7sGcgZv8sQBBsVzG8pDMOyll3w3zSuZZQttOrBmKNbNiPSTpUJZZ3QJNG4xlwW_qHneCz-zYgipuDNoOKnpP_6PpI3J7NwqOybQuG_UMDNlaPLdA-gXH95uI
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagDLBQnqJQwANrQtI4TjKiiqpA26mVull-ogopQWk6lF_POQ9UQIiha5KzfGf7_J1z_g6hOxLzUCZKOCTW2iE84U4sYLkTTRU3nqaBtkcD4wkdzsjzPJxv3IWxaZU2hjYVUUTpq-3itofRTUrcPaBoAjjZg_CuR1xAKBBVRLtoLwSwb6sYBN6k8cakR8oqslbEsTLNLZ6_mvm2P31jL_3lrcstaNBGsul8lXny5q4K4cqPH7yO22l3hA5rhIofqil1jHZ0eoLaTfUHXDuDUzToL3L4AH9df8RijflynUrLt5utlhjicdADG17gPBNZAU9SzFMM6i4s1MWv-UKdodngcdofOnVVBkf2Ylo4kRFKxV6giE5EFHtaAKoQQSINkcLvUU2h8yIiJrQsoJHnc8qFbwCHGZLE0gvOUSvNUn2BcGiokqFW3JK6SR-mjf3PGwnQm0gVqQ5ym7Fg7xX5BvNrTtPGSsxaidVW6qBkc8RYUZ56mKpECQv-ke02w8vqdQwiXgQODwT9yy2avkX7w-l4xEZPk5crdGBflWlsQRe1inylrwHXFOKmnLif6RnpzQ
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagSIiF8hSFAh5YE5LGcZIRFaLyqhioxBb5iSqkpErTofx6zkmMKAgxsMY5y-fH-Tv7_B1CFyRmoUgkd0islENYwpyYw3InikqmPUUDZY4GHsd0NCF3L6GNJpy3YZXGh9YNUURtq83inkltI-IuAUQTgMkeeHcD4gJAAaciWkcb1NyKmVcc3tgaYzIgdRJZI-IYGfuI57dqVranFfLSH8a63oHSLuK27U3gyZu7qLgr3r_ROv5LuR203eJTfNVMqF20pvI91LW5H3BrCvZROpyW8AP-fPyI-RKz-TIXhm23WMwxeOOgBtaswmXBiwq-5JjlGLSdGqCLX8upPECT9OZ5OHLanAyOGMS0ciLNpYy9QBKV8Cj2FAdMwYNEaCK4P6CKQuN5RHRoOEAjz2eUcV8DCtMkiYUXHKJOXuTqCOFQUylCJZmhdBM-TBpzyxtx0JsIGckecu1QZLOGeiPzW0ZT20uZ6aWs7aUeSr4OWFbVZx66SVCSBX_I9u3oZu0qBhEvAnMHgv7xP6o-R5tP12n2cDu-P0FbpqSOYQv6qFOVC3UKoKbiZ_W0_QARbehx
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Circle+formation+by+asynchronous+opaque+fat+robots+on+an+infinite+grid&rft.jtitle=International+journal+of+parallel%2C+emergent+and+distributed+systems&rft.au=Goswami%2C+Pritam&rft.au=Kumar+Kundu%2C+Manash&rft.au=Ghosh%2C+Satakshi&rft.au=Sau%2C+Buddhadeb&rft.date=2024-03-03&rft.pub=Taylor+%26+Francis&rft.issn=1744-5760&rft.eissn=1744-5779&rft.volume=39&rft.issue=2&rft.spage=214&rft.epage=247&rft_id=info:doi/10.1080%2F17445760.2024.2316017&rft.externalDocID=2316017
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1744-5760&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1744-5760&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1744-5760&client=summon