Arbitrary pattern formation by opaque fat robots on infinite grid

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Parallel Emergent and Distributed Systems Pub Date : 2022-06-03 DOI:10.1080/17445760.2022.2088750
Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh, B. Sau
{"title":"Arbitrary pattern formation by opaque fat robots on infinite grid","authors":"Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh, B. Sau","doi":"10.1080/17445760.2022.2088750","DOIUrl":null,"url":null,"abstract":"ABSTRACT Arbitrary Pattern formation ( ) by a swarm of mobile robots is a widely studied problem in the literature. Many works regarding have been proposed on plane and infinite grid by point robots. But in practical application, it is impossible to design point robots. In Bose et al. [Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the robots are assumed opaque fat robots but the environment is plane. To the best of our knowledge, no work till now ever considered the problem assuming opaque fat robots on infinite grid where movements are restricted. In this paper, we have provided a collisionless distributed algorithm and solved using 9 colours.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Parallel Emergent and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17445760.2022.2088750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 10

Abstract

ABSTRACT Arbitrary Pattern formation ( ) by a swarm of mobile robots is a widely studied problem in the literature. Many works regarding have been proposed on plane and infinite grid by point robots. But in practical application, it is impossible to design point robots. In Bose et al. [Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the robots are assumed opaque fat robots but the environment is plane. To the best of our knowledge, no work till now ever considered the problem assuming opaque fat robots on infinite grid where movements are restricted. In this paper, we have provided a collisionless distributed algorithm and solved using 9 colours.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不透明脂肪机器人在无限网格上形成任意图案
移动机器人群的任意模式形成是一个被广泛研究的问题。许多关于平面和无限网格点机器人的研究工作已经被提出。但在实际应用中,设计点机器人是不可能的。在Bose等人。[异步遗忘机器人在无限网格上的任意图案形成。]计算科学,2020;815:213-227],机器人被假设为不透明的脂肪机器人,但环境是平面的。据我们所知,到目前为止,还没有工作考虑过假设不透明的肥胖机器人在无限网格上运动受限的问题。在本文中,我们提供了一种无冲突的分布式算法,并使用9种颜色进行求解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.30
自引率
0.00%
发文量
27
期刊最新文献
Enhancing blockchain security through natural language processing and real-time monitoring Verification of cryptocurrency consensus protocols: reenterable colored Petri net model design Security and dependability analysis of blockchain systems in partially synchronous networks with Byzantine faults Fundamental data structures for matrix-free finite elements on hybrid tetrahedral grids Blocking aware offline survivable path provisioning of connection requests in elastic optical networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1