基于签名向量与路标定位的子地图匹配算法

J4 ›› 2013, Vol. 35 ›› Issue (6): 148-151.

基于签名向量与路标定位的子地图匹配算法

姚芝凤1,2，叶秀芬1，戴学丰2

(1.哈尔滨工程大学自动化学院，黑龙江哈尔滨 150001；2.齐齐哈尔大学计算机与控制工程学院，黑龙江齐齐哈尔 161006)

收稿日期:2012-05-18 修回日期:2012-08-17 出版日期:2013-06-25 发布日期:2013-06-25
基金资助:
黑龙江省教育厅科技项目（12521601）

Sub-map matching algorithm based on
signature vector and landmark localization

YAO Zhifeng1,2,YE Xiufen1,DAI Xuefeng2

(1.College of Automation,Harbin Engineering University,Harbin 150001;
2.College of Computer and Control Engineering,Qiqihar University,Qiqihar 161006,China)

Received:2012-05-18 Revised:2012-08-17 Online:2013-06-25 Published:2013-06-25

摘要/Abstract

摘要：

在移动机器人的分层同时定位和地图构建SLAM算法中，通过签名元素实现局部子地图的匹配存在计算复杂性的问题，提出了通过构建签名元素向量的方法来解决子地图匹配的问题；由于机器人在重复访问某一个区域的时候，两次的运动轨迹不可能完全重合，因此在该方法中结合了基于路标进行定位的技术，从而实现可靠的回路闭合确认计算。另外，讨论了在获得全局地图的后处理过程中存在两个或者多于两个的闭合回路共享部分路径时，实现全局优化的算法中限制条件的修改问题。最后，通过一个算例说明子地图匹配过程的具体操作。

关键词: 子地图匹配, 同时定位和地图构建, 路标, 签名向量

Abstract:

Because of the computational complexity in the signature element based local submap matching for hierarchical Simultaneous Localization and Mapping (SLAM) algorithm, a signature vector based matching approach was proposed in this paper. Since there may be a difference between the two trajectories that the robot passed the same subregion at first time and at second time, the approach was improved by combining a landmark localization technique to realize more reliable loop closing calculation. In addition, the constraints equation was discussed for the case that two or more closed loops share a common subpath for obtaining a global optimized map of the environment. Finally, a demonstration case was given to show the application of our approach.

Key words: sub-map matching;simultaneous localization and mapping;landmark;signature vector

姚芝凤1,2，叶秀芬1，戴学丰2. 基于签名向量与路标定位的子地图匹配算法[J]. J4, 2013, 35(6): 148-151.

YAO Zhifeng1,2,YE Xiufen1,DAI Xuefeng2. Sub-map matching algorithm based on
signature vector and landmark localization [J]. J4, 2013, 35(6): 148-151.