{"title":"Sensor coverage with a multi-robot system","authors":"J. Rogge, D. Aeyels","doi":"10.1109/ISIC.2007.4450863","DOIUrl":null,"url":null,"abstract":"The present paper develops a novel strategy for the exploration of an unknown environment with a multi-robot system. It is required that the entire free space is covered by the sensors of the robots, with a certainty of 100%. Communication between the robots is restricted to line-of-sight and to a maximum interdistance between robots. Contrary to most exploration problems, the topographical properties of the space need not be mapped. An algorithm is presented that guides a group of N robots, scanning the free space for target objects. The group splits to pass obstacles of unknown size and shape. The decision of splitting the group takes a trade-off between group coherence and speed of advancing into account. A direct application of the algorithm is mine held clearance.","PeriodicalId":184867,"journal":{"name":"2007 IEEE 22nd International Symposium on Intelligent Control","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 22nd International Symposium on Intelligent Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.2007.4450863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
The present paper develops a novel strategy for the exploration of an unknown environment with a multi-robot system. It is required that the entire free space is covered by the sensors of the robots, with a certainty of 100%. Communication between the robots is restricted to line-of-sight and to a maximum interdistance between robots. Contrary to most exploration problems, the topographical properties of the space need not be mapped. An algorithm is presented that guides a group of N robots, scanning the free space for target objects. The group splits to pass obstacles of unknown size and shape. The decision of splitting the group takes a trade-off between group coherence and speed of advancing into account. A direct application of the algorithm is mine held clearance.