利用多个不可移动标记增强拓扑世界的探索

Hui Wang, M. Jenkin, Patrick W. Dymond
{"title":"利用多个不可移动标记增强拓扑世界的探索","authors":"Hui Wang, M. Jenkin, Patrick W. Dymond","doi":"10.1109/CRV.2012.49","DOIUrl":null,"url":null,"abstract":"The fundamental problem in robotic exploration and mapping of an unknown environment is answering the question 'have I been here before?', which is also known as the 'loop closing' problem. One approach to answering this problem in embedded topological worlds is to resort to the use of an external marking aid that can help the robot disambiguate places. This paper investigates the power of different marker-based aids in topological exploration. We describe enhanced versions of edge- and vertex-based marker algorithms and demonstrate algorithms with enhanced lower bounds in terms of number of markers and motions required in order to map an embedded topological environment.","PeriodicalId":372951,"journal":{"name":"2012 Ninth Conference on Computer and Robot Vision","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Enhancing Exploration in Topological Worlds with Multiple Immovable Markers\",\"authors\":\"Hui Wang, M. Jenkin, Patrick W. Dymond\",\"doi\":\"10.1109/CRV.2012.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The fundamental problem in robotic exploration and mapping of an unknown environment is answering the question 'have I been here before?', which is also known as the 'loop closing' problem. One approach to answering this problem in embedded topological worlds is to resort to the use of an external marking aid that can help the robot disambiguate places. This paper investigates the power of different marker-based aids in topological exploration. We describe enhanced versions of edge- and vertex-based marker algorithms and demonstrate algorithms with enhanced lower bounds in terms of number of markers and motions required in order to map an embedded topological environment.\",\"PeriodicalId\":372951,\"journal\":{\"name\":\"2012 Ninth Conference on Computer and Robot Vision\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Ninth Conference on Computer and Robot Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CRV.2012.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Ninth Conference on Computer and Robot Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CRV.2012.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

机器人探索和绘制未知环境的基本问题是回答“我以前来过这里吗?”,这也被称为“闭环”问题。在嵌入式拓扑世界中回答这个问题的一种方法是求助于使用外部标记辅助工具,它可以帮助机器人消除位置的歧义。本文研究了不同的基于标记的辅助工具在拓扑探索中的作用。我们描述了基于边缘和顶点的标记算法的增强版本,并演示了在映射嵌入式拓扑环境所需的标记和运动数量方面具有增强下限的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Enhancing Exploration in Topological Worlds with Multiple Immovable Markers
The fundamental problem in robotic exploration and mapping of an unknown environment is answering the question 'have I been here before?', which is also known as the 'loop closing' problem. One approach to answering this problem in embedded topological worlds is to resort to the use of an external marking aid that can help the robot disambiguate places. This paper investigates the power of different marker-based aids in topological exploration. We describe enhanced versions of edge- and vertex-based marker algorithms and demonstrate algorithms with enhanced lower bounds in terms of number of markers and motions required in order to map an embedded topological environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visual Place Categorization in Indoor Environments Probabilistic Obstacle Detection Using 2 1/2 D Terrain Maps Shape from Suggestive Contours Using 3D Priors Large-Scale Tattoo Image Retrieval A Metaheuristic Bat-Inspired Algorithm for Full Body Human Pose Estimation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1