| 一种新的移动机器人Monte Carlo自主定位算法 |
| |
| 引用本文： | 房芳,马旭东,戴先中. 一种新的移动机器人Monte Carlo自主定位算法[J]. 东南大学学报(自然科学版), 2007, 37(1): 40-44 |
| |
| 作者姓名： | 房芳 马旭东 戴先中 |
| |
| 作者单位： | 东南大学自动化学院,南京,210096 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划)，国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 针对当出现一些未建模的机器人运动时(如碰撞或者绑架问题),以小采样数目实现常规Monte Carlo方法难以解决的问题,提出一种新的Monte Carlo定位算法,该算法同时采用p(Xkzk)与p(XkXk-1)作为重要性函数并从中进行采样,避免了采样集不包含真实位姿采样的情况,能够有效地解决全局定位与绑架问题.同时在重采样过程中引入了过收敛检验与均匀性检验用于判断采样与感知信息的匹配程度,以适时进行重采样,节省了计算资源并提高了定位效率.实验结果表明该方法具有良好的性能.
|
| 关 键 词： | 移动机器人 Monte Carlo算法 重要性函数 过收敛检验 均匀性检验 |
| 文章编号： | 1001-0505（2007）01-0040-05 |
| 修稿时间： | 2006-06-12 |
New Monte Carlo algorithm for mobile robot self-localization |
| |
| Fang Fang,Ma Xudong,Dai Xianzhong. New Monte Carlo algorithm for mobile robot self-localization[J]. Journal of Southeast University(Natural Science Edition), 2007, 37(1): 40-44 |
| |
| Authors: | Fang Fang Ma Xudong Dai Xianzhong |
| |
| Affiliation: | School of Automatic, Southeast University, Nanjing 210096, China |
| |
| Abstract: | A novel Monte Carlo method is proposed aiming at the solution of unmodeled motion problem(such as bumping or kidnapped problem) which is inextricable merely using conventional Monte Carlo localization.By adopting both p(Xkzk) and p(XkXk-1) as importance functions and sampling from them,the global localization and kidnapped problems are figured out efficiently.The over-convergence and uniformity validations are introduced to verify correspondence between sample distribution and sensor information for timely resampling which highly saves computational resource and enhances localization efficiency.Experimental results validate the favorable performance of this approach. |
| |
| Keywords: | mobile robot Monte Carlo algorithm importance function over-convergence validation uniformity validation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
