{"title":"解决能见度范围为1的填充问题","authors":"Attila Hideg, L. Blázovics, B. Forstner","doi":"10.1109/SISY.2016.7601503","DOIUrl":null,"url":null,"abstract":"This paper discusses new methodologies of discovering areas with inexpensive autonomous robots. Consider a set of robots which has to disperse through the area in order to cover it. The area is divided into smaller cells and each cell has to be occupied by exactly one robot. When the robots are injected into the area one at a time the problem is called Filling. The main challenges arise from the limited capabilities of the robots: in this paper they do not have any means of explicit communication and their sensing range is limited to 1.","PeriodicalId":193153,"journal":{"name":"2016 IEEE 14th International Symposium on Intelligent Systems and Informatics (SISY)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Solving the filling problem with the visibility range of 1\",\"authors\":\"Attila Hideg, L. Blázovics, B. Forstner\",\"doi\":\"10.1109/SISY.2016.7601503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses new methodologies of discovering areas with inexpensive autonomous robots. Consider a set of robots which has to disperse through the area in order to cover it. The area is divided into smaller cells and each cell has to be occupied by exactly one robot. When the robots are injected into the area one at a time the problem is called Filling. The main challenges arise from the limited capabilities of the robots: in this paper they do not have any means of explicit communication and their sensing range is limited to 1.\",\"PeriodicalId\":193153,\"journal\":{\"name\":\"2016 IEEE 14th International Symposium on Intelligent Systems and Informatics (SISY)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 14th International Symposium on Intelligent Systems and Informatics (SISY)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SISY.2016.7601503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 14th International Symposium on Intelligent Systems and Informatics (SISY)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SISY.2016.7601503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving the filling problem with the visibility range of 1
This paper discusses new methodologies of discovering areas with inexpensive autonomous robots. Consider a set of robots which has to disperse through the area in order to cover it. The area is divided into smaller cells and each cell has to be occupied by exactly one robot. When the robots are injected into the area one at a time the problem is called Filling. The main challenges arise from the limited capabilities of the robots: in this paper they do not have any means of explicit communication and their sensing range is limited to 1.