Simultaneous localization and mapping （SLAM） is a key technology for mobile robots operating under unknown environment. While FastSLAM algorithm is a popular solution to the SLAM problem, it suffers from two major d...Simultaneous localization and mapping （SLAM） is a key technology for mobile robots operating under unknown environment. While FastSLAM algorithm is a popular solution to the SLAM problem, it suffers from two major drawbacks： one is particle set degeneracy due to lack of observation information in proposal distribution design of the particle filter; the other is errors accumulation caused by linearization of the nonlinear robot motion model and the nonlinear environment observation model. For the purpose of overcoming the above problems, a new iterated sigma point FastSLAM （ISP-FastSLAM） algorithm is proposed. The main contribution of the algorithm lies in the utilization of iterated sigma point Kalman filter （ISPKF）, which minimizes statistical linearization error through Gaussian-Newton iteration, to design an optimal proposal distribution of the particle filter and to estimate the environment landmarks. On the basis of Rao-Blackwellized particle filter, the proposed ISP-FastSLAM algorithm is comprised by two main parts： in the first part, an iterated sigma point particle filter （ISPPF） to localize the robot is proposed, in which the proposal distribution is accurately estimated by the ISPKF; in the second part, a set of ISPKFs is used to estimate the environment landmarks. The simulation test of the proposed ISP-FastSLAM algorithm compared with FastSLAM2.0 algorithm and Unscented FastSLAM algorithm is carried out, and the performances of the three algorithms are compared. The simulation and comparing results show that the proposed ISP-FastSLAM outperforms other two algorithms both in accuracy and in robustness. The proposed algorithm provides reference for the optimization research of FastSLAM algorithm.展开更多
基于激光点云地图的动态障碍剔除是同步定位与建图(simultaneous localization and mapping,SLAM)研究领域的难题之一。动态障碍的移动轨迹不仅会遮挡真实的静态环境信息,也会对移动机器人的定位和路径规划造成阻碍。针对激光点云地图...基于激光点云地图的动态障碍剔除是同步定位与建图(simultaneous localization and mapping,SLAM)研究领域的难题之一。动态障碍的移动轨迹不仅会遮挡真实的静态环境信息,也会对移动机器人的定位和路径规划造成阻碍。针对激光点云地图中的动态障碍识别问题,该文提出一种基于卡尔曼滤波的运动障碍跟踪方法。首先,对原始点云预处理,使用欧式聚类算法,实现离散点云聚类。其次设计了基于卡尔曼滤波的运动障碍状态预估方程,并预测出动态障碍点云目标在下一时刻的位置。然后,使用匈牙利算法将预测位置与下一时刻真实位置进行匹配,实现对每一时刻动态障碍体的识别。最后,剔除后进行点云配准建图。在室内外环境下对提出的动态障碍剔除算法进行验证,并将剔除动态障碍后的点云地图可视化输出。实验结果表明该算法在室内外环境下对激光点云地图中动态障碍均能较好地识别与剔除。展开更多
基金supported by Open Foundation of State Key Laboratory of Robotics and System, China (Grant No. SKLRS-2009-ZD-04)National Natural Science Foundation of China (Grant No. 60909055, Grant No.61005070)Fundamental Research Funds for the Central Universities of China (Grant No. 2009JBZ001-2)
文摘Simultaneous localization and mapping （SLAM） is a key technology for mobile robots operating under unknown environment. While FastSLAM algorithm is a popular solution to the SLAM problem, it suffers from two major drawbacks： one is particle set degeneracy due to lack of observation information in proposal distribution design of the particle filter; the other is errors accumulation caused by linearization of the nonlinear robot motion model and the nonlinear environment observation model. For the purpose of overcoming the above problems, a new iterated sigma point FastSLAM （ISP-FastSLAM） algorithm is proposed. The main contribution of the algorithm lies in the utilization of iterated sigma point Kalman filter （ISPKF）, which minimizes statistical linearization error through Gaussian-Newton iteration, to design an optimal proposal distribution of the particle filter and to estimate the environment landmarks. On the basis of Rao-Blackwellized particle filter, the proposed ISP-FastSLAM algorithm is comprised by two main parts： in the first part, an iterated sigma point particle filter （ISPPF） to localize the robot is proposed, in which the proposal distribution is accurately estimated by the ISPKF; in the second part, a set of ISPKFs is used to estimate the environment landmarks. The simulation test of the proposed ISP-FastSLAM algorithm compared with FastSLAM2.0 algorithm and Unscented FastSLAM algorithm is carried out, and the performances of the three algorithms are compared. The simulation and comparing results show that the proposed ISP-FastSLAM outperforms other two algorithms both in accuracy and in robustness. The proposed algorithm provides reference for the optimization research of FastSLAM algorithm.
文摘基于激光点云地图的动态障碍剔除是同步定位与建图(simultaneous localization and mapping,SLAM)研究领域的难题之一。动态障碍的移动轨迹不仅会遮挡真实的静态环境信息,也会对移动机器人的定位和路径规划造成阻碍。针对激光点云地图中的动态障碍识别问题,该文提出一种基于卡尔曼滤波的运动障碍跟踪方法。首先,对原始点云预处理,使用欧式聚类算法,实现离散点云聚类。其次设计了基于卡尔曼滤波的运动障碍状态预估方程,并预测出动态障碍点云目标在下一时刻的位置。然后,使用匈牙利算法将预测位置与下一时刻真实位置进行匹配,实现对每一时刻动态障碍体的识别。最后,剔除后进行点云配准建图。在室内外环境下对提出的动态障碍剔除算法进行验证,并将剔除动态障碍后的点云地图可视化输出。实验结果表明该算法在室内外环境下对激光点云地图中动态障碍均能较好地识别与剔除。
