期刊文献+

用概率假设密度滤波实现同步定位与地图创建 被引量:3

Implementation of SLAM by probability hypothesis density filter
下载PDF
导出
摘要 针对杂波环境中传统同步定位与地图创建(SLAM)算法无法有效表达传感器多种信息以及容易发生错误数据关联的问题,提出一种基于概率假设密度滤波的SLAM算法。该算法将每一时刻传感器的观测信息和环境地图表示为随机有限集,建立联合目标状态变量;通过概率假设密度(PHD)滤波对机器人位姿和环境地图状态进行同时估计,并利用粒子滤波实现PHD滤波。在进行目标状态提取时,为避免聚类算法引入的误差,对粒子集进行时滞输出。提出的SLAM算法能准确表达观测的不确定性、漏检以及杂波引起的虚警等多种传感器信息,且避免了数据关联过程,使系统状态估计更接近真实值。仿真实验结果表明:与传统SLAM算法相比,新算法的机器人定位及环境构图精度提高了50%以上,为杂波环境下SLAM问题的研究提供了新的途径。 Traditional Simultaneous Localization and Mapping(SLAM) algorithm is lack of the ability to describe multiple sensor information accurately in a clutter environment,and it is prone to false data association.Therefore,this paper proposes a SLAM algorithm based on Probability Hypothesis Density(PHD) filter to deal with these problems.By taking the sensor observation and environmental map as random finite sets in every time step,a joint target state variable is constructed.Then,with the Probability Hypothesis Density(PHD) filtering,the poses and environmental map of the robot are estimated simultaneously and the PHD filter is realized by a particle filter.To avoid the error caused by cluster,a time-delay particle set outputting approach is proposed for joint target state extracting.The new algorithm can describe the observation uncertainty,loss detecting,false alarm due to a clutter and other sensor information accurately,and also can avoid the data association,by which the system state estimation is closer to real values.The simulation results show that the accuracy of the new algorithm in the vehicle localization and mapping is improved by more than 50% as compared with that of traditional SLAM algorithm.It provides a new solution for SLAM problems in the clutter environment.
出处 《光学精密工程》 EI CAS CSCD 北大核心 2011年第12期3064-3073,共10页 Optics and Precision Engineering
基金 国家自然科学基金资助项目(No.60904087) 黑龙江省博士后科研启动基金资助项目(No.LBH-Q09127)
关键词 同步定位与地图创建 随机有限集 概率假设密度滤波 粒子滤波 目标状态提取 Simultaneous Localization and Mapping(SLAM) random finite set probability hypothesis density filter particle filter target state extraction
  • 相关文献

参考文献24

  • 1SMITH R, SELF M, CHESSEMAN P. Estimating uncertain spatial relationships in robotics. Proceedings of Conference on Uncertainty in Artificial Intelligence. Amsterdam: North Holland, 1988:435-461.
  • 2DISSANAYAKE G, NEWMAN P, CLARK S, et al. A solution to the simultaneous localization and map building(SLAM) problem[J]. IEEE Trans on Robotics and Automation, 2001,17(3):229-241.
  • 3THRUN S, KOLLER D, GHAHMARANI Z, et al. Simultaneous localization and mapping with sparse extended information filters: theory and initial results[J]. Springer Tracts in Advanced Robotics, 2004, 7:363-380.
  • 4PAZ L M, TARDOS J D, NEIRA J. Divide and conquer: EKF SLAM in O(n)[J]. IEEE Transactions on Robotics, 2008, 24(5):1107-1120.
  • 5MONTEMERLO M, THRUN S, KOLLER D, et al. FastSLAM: A factored solution to the simultaneous localization and mapping problem. Proc of the AAAI National Conference on Artificial Intelligence. Edmonton, Canada: AAAI Press, 2002:593-598.
  • 6MONTEMERLO M, THRUN S, KOLLER D, et al. FastSLAM2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges. Proc of the 6th International Joint Conference on Artificial Intelligence. Acapulco, Mexico, 2003:1151-1156.
  • 7KIM C, SAKTHIVEL R, CHUNG W K. Unscented FastSLAM: A robust and efficient solution to the SLAM problem[J]. IEEE Transactions on Robotics, 2008,24(4):808-820.
  • 8KAESS M, RANGANATHAN A, DELLAERT F. iSAM: incremental smoothing and mapping[J]. IEEE Transactions on Robotics, 2008, 24(6):1365-1378.
  • 9HUANG SH D, WANG ZH, DISSANAYAKE G. Sparse local submap joining filter for building large-scale maps[J]. IEEE Transactions on Robotics, 2008,24(5):1121-1130.
  • 10NI K, DELLAERT F. Multi-level submap based SLAM using nested dissection. Proc of the International Conference on Intelligent Robots and Systems. Taipei: IEEE Press, 2010:2558-2565.

二级参考文献1

共引文献13

同被引文献29

引证文献3

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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