在变化的环境中通过匹配激光距离扫描进行定位

Ola Bengtsson, A. Baerveldt
{"title":"在变化的环境中通过匹配激光距离扫描进行定位","authors":"Ola Bengtsson, A. Baerveldt","doi":"10.1109/EURBOT.1999.827637","DOIUrl":null,"url":null,"abstract":"We present a novel scan matching algorithm, IDC-S, Iterative Dual Correspondence-Sector, that matches range scans. The algorithm is based on the known Iterative Dual Correspondence, IDC, algorithm which has shown good performance in real environments. The improvement is that IDC-S is able to deal with relatively large changes in the environment. It divides the scan in several sectors, detects and removes those sectors that are changed and matches the scans only using unchanged sectors. IDC-S and other variants of IDC are extensively simulated and evaluated. The simulations show that IDC-S is very robust and can locate in many different kind of environments. We also show that it is possible to effectively combine the existing IDC algorithms with IDC-S, thus obtaining an algorithm that performs very well both in rectilinear as well as nonrectilinear environments, even when changed as much as 65%.","PeriodicalId":364500,"journal":{"name":"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Localization in changing environments by matching laser range scans\",\"authors\":\"Ola Bengtsson, A. Baerveldt\",\"doi\":\"10.1109/EURBOT.1999.827637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel scan matching algorithm, IDC-S, Iterative Dual Correspondence-Sector, that matches range scans. The algorithm is based on the known Iterative Dual Correspondence, IDC, algorithm which has shown good performance in real environments. The improvement is that IDC-S is able to deal with relatively large changes in the environment. It divides the scan in several sectors, detects and removes those sectors that are changed and matches the scans only using unchanged sectors. IDC-S and other variants of IDC are extensively simulated and evaluated. The simulations show that IDC-S is very robust and can locate in many different kind of environments. We also show that it is possible to effectively combine the existing IDC algorithms with IDC-S, thus obtaining an algorithm that performs very well both in rectilinear as well as nonrectilinear environments, even when changed as much as 65%.\",\"PeriodicalId\":364500,\"journal\":{\"name\":\"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURBOT.1999.827637\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURBOT.1999.827637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

我们提出了一种新的扫描匹配算法,IDC-S,迭代对偶对应扇区,匹配范围扫描。该算法基于已知的迭代对偶通信(IDC)算法,该算法在实际环境中表现出良好的性能。改进之处在于IDC-S能够处理环境中相对较大的变化。它将扫描划分为几个扇区,检测并删除那些更改的扇区,并仅使用未更改的扇区匹配扫描。IDC- s和IDC的其他变体被广泛地模拟和评估。仿真结果表明,IDC-S具有很强的鲁棒性,可以在多种不同的环境中进行定位。我们还表明,可以有效地将现有的IDC算法与IDC- s结合起来,从而获得在直线和非线性环境中都表现良好的算法,即使变化高达65%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Localization in changing environments by matching laser range scans
We present a novel scan matching algorithm, IDC-S, Iterative Dual Correspondence-Sector, that matches range scans. The algorithm is based on the known Iterative Dual Correspondence, IDC, algorithm which has shown good performance in real environments. The improvement is that IDC-S is able to deal with relatively large changes in the environment. It divides the scan in several sectors, detects and removes those sectors that are changed and matches the scans only using unchanged sectors. IDC-S and other variants of IDC are extensively simulated and evaluated. The simulations show that IDC-S is very robust and can locate in many different kind of environments. We also show that it is possible to effectively combine the existing IDC algorithms with IDC-S, thus obtaining an algorithm that performs very well both in rectilinear as well as nonrectilinear environments, even when changed as much as 65%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信