一种改进的几何约束分枝定界SLAM重定位算法  

An improved geometric constraints branch and bound relocation algorithm for simultaneous localization and mapping

作　　者：曹小兵[1] 徐伊岑[2] 郭剑辉[3] 芮长颖[1] CAO Xiaobing XU Yicen GUO Jianhui RUI Changying(School of Control Technology, Wuxi Institute of Technology, Wuxi 214121, China School of Mechanical and Electrical Technology, Wuxi Vocational Institute of Commerce, Wuxi 214153, China The 28th Research Institute of China Electronics Technology Group Corporation, Nanjing 210007, China)

机构地区：[1]无锡职业技术学院控制技术学院,江苏无锡214121 [2]无锡商业职业技术学院机电技术学院,江苏无锡214153 [3]中国电子科技集团公司第二十八研究所,江苏南京210007

出　　处：《现代电子技术》2016年第21期141-144,149,共5页Modern Electronics Technique

基　　金：江苏省自然科学基金青年基金项目(BK20140794);中国博士后科学基金面上项目(2014M551599);无锡职业技术学院科研基金项目(BT2012-06);江苏省高校"青蓝工程"基金资助

摘　　要：重定位技术是机器人在已有SLAM地图的环境中依靠自身传感器重新获得定位信息的关键技术。几何约束分枝定界重定位(GCBB)算法是一种有效的方法,但是其存在计算速度慢的缺点。针对GCBB算法的不足,从两个方面对其进行改进:一是采用分组方式进行数据关联;二是结合传感器探测范围在局部区域中选择特征进行数据关联。仿真结果表明,所提出的快速几何约束分枝定界重定位(FGCBB)算法能够正确实现重定位,且计算复杂度与观测数目两者之间服从线性关系,当处理观测数目较多的问题时,FGCBB的计算效率明显优于GCBB算法。The relocation technology is a key technology for robot to recover the location information by its sensor in the existing SLAM （simultaneous localization and mapping） environment. The geometric constraints branch and bound （GCBB） algo- rithm is an effective method, hut its computation speed is slow. To overcome the shortcoming of GCBB algorithm, the algorithm was improved in two aspects： the packet mode is selected for data association; the feature is selected in local region for data as- sociation according to the detection range of the sensor. The simulation results show that the proposed fast geometric constrains branch and bound （FGCBB） algorithm can relocate correctly, both the computational complexity and observation quantity are in accord with the linear relation, and the calculation efficiency of FGCBB algorithm is better than that of GCBB algorithm while processing much observation quantity.

关 键 词：重定位 几何约束分枝定界算法 同时定位与地图创建 联合相容 

分 类 号：TN98-34[电子电信—信息与通信工程] TP24[自动化与计算机技术—检测技术与自动化装置]