{"title":"Sensor-Based Terrain Acquisition: a \"Seed Spreader\" Strategy","authors":"V. Lumelsky, S. Mukhopadhyay, K. Sun","doi":"10.1109/IROS.1989.637888","DOIUrl":null,"url":null,"abstract":"The problem of terrain acquisition presents one aspect of the more general problem of automatic motion planning in the presence of obstacles. In turn, there is a number of ways to formulate the terrain acquisition problem. We consider a case whereby a mobile robot is required to cover all reachable areas of a finite-size planar terrain populated with a finite number of obstacles of arbitrary shape. The robot is equipped with a “vision” which delivers coordinates of all visible obstacles within a limited radius (radius of vision). The proposed algorithm guarantees convergence and exhibits an upper bound performance quadratic in the perimeters of obstacles in the terrain.","PeriodicalId":332317,"journal":{"name":"Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1989.637888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
Abstract
The problem of terrain acquisition presents one aspect of the more general problem of automatic motion planning in the presence of obstacles. In turn, there is a number of ways to formulate the terrain acquisition problem. We consider a case whereby a mobile robot is required to cover all reachable areas of a finite-size planar terrain populated with a finite number of obstacles of arbitrary shape. The robot is equipped with a “vision” which delivers coordinates of all visible obstacles within a limited radius (radius of vision). The proposed algorithm guarantees convergence and exhibits an upper bound performance quadratic in the perimeters of obstacles in the terrain.