基于自适应粒子调整的有效直线SLAM

Isao Kimoto, K. Takaba
{"title":"基于自适应粒子调整的有效直线SLAM","authors":"Isao Kimoto, K. Takaba","doi":"10.1109/CCTA.2018.8511361","DOIUrl":null,"url":null,"abstract":"This paper deals with the fast SLAM algorithm for the line-based SLAM problem with a laser range scanner for a single two-wheeled mobile robot. Since the computational time of the estimation process per each step depends on the number of observed landmarks, and we control the computational time by adaptively tuning the number of particles according to the number of the observed landmarks. First, we review the estimation process of the fast line-based SLAM algorithm. Then, we propose a method for the prediction of the computational time and how to control it by using the number of particles. Finally, we show simulation results of the proposed method in order to verify its effectiveness.","PeriodicalId":358360,"journal":{"name":"2018 IEEE Conference on Control Technology and Applications (CCTA)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effective Line-Based SLAM with Adaptive Tuning of Particles\",\"authors\":\"Isao Kimoto, K. Takaba\",\"doi\":\"10.1109/CCTA.2018.8511361\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the fast SLAM algorithm for the line-based SLAM problem with a laser range scanner for a single two-wheeled mobile robot. Since the computational time of the estimation process per each step depends on the number of observed landmarks, and we control the computational time by adaptively tuning the number of particles according to the number of the observed landmarks. First, we review the estimation process of the fast line-based SLAM algorithm. Then, we propose a method for the prediction of the computational time and how to control it by using the number of particles. Finally, we show simulation results of the proposed method in order to verify its effectiveness.\",\"PeriodicalId\":358360,\"journal\":{\"name\":\"2018 IEEE Conference on Control Technology and Applications (CCTA)\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Conference on Control Technology and Applications (CCTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCTA.2018.8511361\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Conference on Control Technology and Applications (CCTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCTA.2018.8511361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对单双轮移动机器人激光距离扫描仪的直线SLAM问题,研究了快速SLAM算法。由于每一步估计过程的计算时间取决于观察到的地标的数量,我们通过根据观察到的地标的数量自适应调整粒子的数量来控制计算时间。首先,我们回顾了基于快速线的SLAM算法的估计过程。然后,我们提出了一种预测计算时间的方法,以及如何利用粒子数来控制计算时间。最后给出了该方法的仿真结果,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Effective Line-Based SLAM with Adaptive Tuning of Particles
This paper deals with the fast SLAM algorithm for the line-based SLAM problem with a laser range scanner for a single two-wheeled mobile robot. Since the computational time of the estimation process per each step depends on the number of observed landmarks, and we control the computational time by adaptively tuning the number of particles according to the number of the observed landmarks. First, we review the estimation process of the fast line-based SLAM algorithm. Then, we propose a method for the prediction of the computational time and how to control it by using the number of particles. Finally, we show simulation results of the proposed method in order to verify its effectiveness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust $\mathcal{H}_{\infty}$ Pointing Error Control of Free Space Optical Communication Systems Incremental Reference Generation for Nonsingular Control on $SE (3)$ A Distributed Parameter Approach to Model the Transcriptional Response of Escherichia Coli in a Scale-Down Reactor Passivity-Short-based Stability Analysis on Electricity Market Trading System Considering Negative Price Robust and Secure UAV Navigation Using GNSS, Phased-Array Radio System and Inertial Sensor Fusion
×
引用
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