不透明脂肪机器人在无限网格上形成任意图案

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":"不透明脂肪机器人在无限网格上形成任意图案","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":"{\"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}","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

摘要

移动机器人群的任意模式形成是一个被广泛研究的问题。许多关于平面和无限网格点机器人的研究工作已经被提出。但在实际应用中，设计点机器人是不可能的。在Bose等人。[异步遗忘机器人在无限网格上的任意图案形成。]计算科学，2020;815:213-227]，机器人被假设为不透明的脂肪机器人，但环境是平面的。据我们所知，到目前为止，还没有工作考虑过假设不透明的肥胖机器人在无限网格上运动受限的问题。在本文中，我们提供了一种无冲突的分布式算法，并使用9种颜色进行求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Arbitrary pattern formation by opaque fat robots on infinite grid

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Parallel Emergent and Distributed Systems COMPUTER SCIENCE, THEORY & METHODS-

CiteScore

2.30

自引率

0.00%

发文量