期刊文献+

一种多机器人栅格地图拼接方法的研究 被引量:2

Research on Grid Map Merging Method of Multi-Robot
下载PDF
导出
摘要 多机器人协作式的同步定位与地图创建(SLAM)是自动导航领域的热点研究方向之一,SLAM技术中栅格地图拼接成为重要的技术点。针对采用SIFT算法进行地图拼接栅格的拼接速度较慢、有效匹配点较少、稳定性差等缺点,提出了一种新的栅格地图拼接方法。使用FAST算法快速选定特征点,利用PCA-SIFT算法生成36维特征描述符进行匹配,并借助最大后验一致性算法选取的最佳匹配点进行初始拼接参数计算,使用加权平均算法对待拼接的两幅栅格地图进行拼接融合。使用公开的数据集进行试验,结果表明,所提出的方法稳定性强、拼接速度快,且拼接精度高。 Multi-robot’s cooperative of simultaneous localization and mapping( SLAM) is one of the hot research directions in the field of automatic navigation. Grid map merging of SLAM technology become a crucial technology. A new grid map merging method is proposed to solve the problems of slower merging speed,fewer effective matching points,and poor stability in SIFT. FAST algorithm was used to select feature points quickly, PCASIFT algorithm was used to generate 36 dimensions feature descriptors for matching,and the optimal matching points setected by the MAPSAC( maximum a posteriori sample consistency) algorithm were used to calculate the initial merging parameters. The weighted average algorithm fused the two grid maps to be merged. Experiments using public data sets show that the proposed method has strong stability,fast merging speed and high merging accuracy.
作者 李雅梅 张瑞 吕猛 LI Ya-mei;ZHANG Rui;LV Meng(Eaculy of Eecrica and Cortral Enginerng Liaoning Technieal Univenity,Huludao 12505,Chima)
出处 《测控技术》 2020年第4期58-61,100,共5页 Measurement & Control Technology
关键词 多移动机器人系统 栅格地图拼接 最大后验一致性 加权平均算法 multi-mobile robot system grid map merging maximum a posteriori sample consistency weighted average algorithm
  • 相关文献

参考文献4

二级参考文献153

  • 1刘习春,喻寿益.局部快速微调遗传算法[J].计算机学报,2006,29(1):100-105. 被引量:37
  • 2杜建军,刘丽,杨水山.生成距离图的同心圆窗口矩匹配快速算法[J].中国图象图形学报,2006,11(6):890-892. 被引量:2
  • 3Thrun S. Robotic mapping: A survey [ R]. School of Computer Science, Carnegie Melon University, USA, 2002.
  • 4Fenwick J W, Newman P M, Leonard J J. Cooperative concurrent mapping and localization [ C ]//Proceedings of the 2002 IEEE International Conference on Intelligent Robots and Automation. Cambridge, MA: IEEE Press, 2002 : 1810 -1817.
  • 5Fox D, Ko J, Konolige K, et al. Distributed multirobot exploration and mapping [ J ]. Proceedings of the IEEE, 2006, 94 (7) : 1325 - 1339.
  • 6Thrun S. A probabilistic online mapping algorithm for teams of mobile robots [ J ]. International Journal of Robotics Research, 2001,20(5):335 -363.
  • 7Thrun S, BrugardD W, Fox D. A real-time algorithm for mobile robot mapping with applications to multi-robot and 3D mapping [ C ]//Proceedings of the 2000 IEEE International Conference on Robotics and Automation. CA: IEEE Press, 2000:321 - 328.
  • 8Huang W H, Beevers K. Topological map merging [ J ]. The International Journal of Robotics Research, 2005,24 ( 8 ) : 601 -613.
  • 9Lakaemper R, Latecki L M, Woher D. Incremental multirobot mapping[ C ]// IEEE International Conference on Intelligent Robtos and Systems (IROS). Edmonton, Canada: IEEE Press, 2005.
  • 10Amigoni F, Gasparini S, Gini M. Building segment-based maps without pose information [ J]. Proceedings of the IEEE, 2006, 94(7) : 1340 - 1359.

共引文献144

同被引文献27

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部