Satakshi Ghosh, Pritam Goswami, Avisek Sharma, B. Sau
{"title":"异步机器人在无限网格上移动最优和时间最优的任意模式","authors":"Satakshi Ghosh, Pritam Goswami, Avisek Sharma, B. Sau","doi":"10.1080/17445760.2022.2124411","DOIUrl":null,"url":null,"abstract":"ABSTRACT The ARBITRARY PATTERN FORMATION (APF) is widely studied in distributed computing for swarm robots. This paper deals with the APF problem in an infinite grid under an asynchronous scheduler. In [Bose K, Adhikary R, Kundu MK, et al. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the authors proposed an algorithm for APF problem in model under an asynchronous scheduler, but the proposed algorithm was neither time optimal nor move optimal. This work provides two algorithms that solve APF problem in an asynchronous scheduler. The first algorithm is move optimal considering model and the second algorithm is move and time optimal considering the model, where each robot has one light having three distinct colours.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid\",\"authors\":\"Satakshi Ghosh, Pritam Goswami, Avisek Sharma, B. Sau\",\"doi\":\"10.1080/17445760.2022.2124411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT The ARBITRARY PATTERN FORMATION (APF) is widely studied in distributed computing for swarm robots. This paper deals with the APF problem in an infinite grid under an asynchronous scheduler. In [Bose K, Adhikary R, Kundu MK, et al. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the authors proposed an algorithm for APF problem in model under an asynchronous scheduler, but the proposed algorithm was neither time optimal nor move optimal. This work provides two algorithms that solve APF problem in an asynchronous scheduler. The first algorithm is move optimal considering model and the second algorithm is move and time optimal considering the model, where each robot has one light having three distinct colours.\",\"PeriodicalId\":45411,\"journal\":{\"name\":\"International Journal of Parallel Emergent and Distributed Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"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.2124411\",\"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.2124411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid
ABSTRACT The ARBITRARY PATTERN FORMATION (APF) is widely studied in distributed computing for swarm robots. This paper deals with the APF problem in an infinite grid under an asynchronous scheduler. In [Bose K, Adhikary R, Kundu MK, et al. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the authors proposed an algorithm for APF problem in model under an asynchronous scheduler, but the proposed algorithm was neither time optimal nor move optimal. This work provides two algorithms that solve APF problem in an asynchronous scheduler. The first algorithm is move optimal considering model and the second algorithm is move and time optimal considering the model, where each robot has one light having three distinct colours.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
