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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
