基于传感器的地形采集:一种“播种机”策略

V. Lumelsky, S. Mukhopadhyay, K. Sun
{"title":"基于传感器的地形采集:一种“播种机”策略","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":"{\"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}","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

摘要

地形获取问题是障碍物自动运动规划这一更普遍问题的一个方面。反过来,有许多方法来制定地形获取问题。我们考虑这样一种情况,即移动机器人需要覆盖有限大小的平面地形中所有可到达的区域,该地形中填充了有限数量的任意形状的障碍物。机器人配备了一个“视觉”,可以在有限的半径(视觉半径)内提供所有可见障碍物的坐标。该算法保证了算法的收敛性,并在障碍物周围表现出二次元的上界性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sensor-Based Terrain Acquisition: a "Seed Spreader" Strategy
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信