高级检索
    黄庆成, 洪炳熔, 厉茂海, 罗荣华. 基于主动环形闭合约束的移动机器人分层同时定位和地图创建[J]. 计算机研究与发展, 2007, 44(4): 636-642.
    引用本文: 黄庆成, 洪炳熔, 厉茂海, 罗荣华. 基于主动环形闭合约束的移动机器人分层同时定位和地图创建[J]. 计算机研究与发展, 2007, 44(4): 636-642.
    Huang Qingcheng, Hong Bingrong, Li Maohai, Luo Ronghua. Mobile Robot Hierarchical Simultaneous Localization and Mapping Based on Active Loop Closure Constraint[J]. Journal of Computer Research and Development, 2007, 44(4): 636-642.
    Citation: Huang Qingcheng, Hong Bingrong, Li Maohai, Luo Ronghua. Mobile Robot Hierarchical Simultaneous Localization and Mapping Based on Active Loop Closure Constraint[J]. Journal of Computer Research and Development, 2007, 44(4): 636-642.

    基于主动环形闭合约束的移动机器人分层同时定位和地图创建

    Mobile Robot Hierarchical Simultaneous Localization and Mapping Based on Active Loop Closure Constraint

    • 摘要: 基于Rao-Blackwellized 粒子滤波器提出了一种基于主动闭环策略的移动机器人分层同时定位和地图创建(simultaneous localization and mapping, SLAM)方法,基于信息熵的主动闭环策略同时考虑机器人位姿和地图的不确定性;局部几何特征地图之间的相对关系通过一致性算法估计,并通过环形闭合约束的最小化过程回溯修正.在仅有单目视觉和里程计的基础上,建立了鲁棒的感知模型;通过有效的尺度不变特征变换(scale invariant feature transform, SIFT)方法提取环境特征,基于KD-Tree的最近邻搜索算法实现特征匹配.实际实验表明该方法为实现SLAM提供了一种有效可靠的途径.

       

      Abstract: A hierarchical map representation approach based on active loop closure constraint is proposed to implement mobile robot simultaneous localization and mapping (SLAM) efficiently with the Rao-Blackwellized particle filters (RBPF). The hierarchical map includes the local metric map and the global topological map, and in the global level an active loop closure strategy based on information entropy is proposed to reduce the map uncertainty as well as the robot trajectory uncertainty. The estimation of relative locations between local metric feature maps is maintained with local map alignment algorithm, and a minimization procedure is carried out using the loop closure constraint with backward correction to reduce the uncertainty between local maps. The robot is only equipped with monocular vision and odometer, and the robust observation model is constructed; Scale invariant feature transform (SIFT) is used to extract image features served as the nature landmarks, and SIFT features are invariant to image scaling, rotation, and change in 3D viewpoints, which are highly distinctive due to a special technique for their description. A fast nearest neighbor search algorithm using KD-tree is presented to implement SIFT feature matching in the time cost of O(log\-2N). Experiments on the real robot show that the proposed method provides an efficient and robust method for implementing SLAM.

       

    /

    返回文章
    返回