arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.08087cs.RO
收藏

移动设备上基于地图的一致性三维定位

Consistent Map-based 3D Localization on Mobile Devices

Ryan C. DuToit, Joel A. Hesch, Esha D. Nerurkar, Stergios I. Roumeliotis

摘要:

本文的目的是提供一致的,实时的3D定位能力,移动设备导航在以前的地图区域。为此,我们引入了Cholesky-施密特-卡尔曼滤波器(C-SKF),它明确地考虑了先验地图的不确定性,通过采用稀疏的Cholesky因子的地图的Hessian,而不是其密集的协方差-施密特-卡尔曼滤波器(SKF)的情况。通过这样做,C-SKF的内存要求通常与映射的大小成线性关系,而不是用于存储映射的协方差的二次关系。此外,为了约束C-SKF的处理需求(在映射的大小上介于线性和二次之间),我们引入了C-SKF算法的松弛,sC-SKF,其对独立子映射的Cholesky因子进行操作,该子映射是将用于构建映射的轨迹和观测划分为重叠段而产生的。最后,我们评估了所提出的C-SKF和sC-SKF算法的处理和内存要求,并将其定位精度与其他采用测量噪声协方差膨胀来补偿地图不确定性的近似基于地图的定位方法进行比较。

英文摘要:

The objective of this paper is to provide consistent, real-time 3D localization capabilities to mobile devices navigating within previously mapped areas. To this end, we introduce the Cholesky-Schmidt-Kalman filter (C-SKF), which explicitly considers the uncertainty of the prior map, by employing the sparse Cholesky factor of the map's Hessian, instead of its dense covariance--as is the case for the Schmidt-Kalman filter (SKF). By doing so, the C-SKF has memory requirements typically linear in the size of the map, as opposed to quadratic for storing the map's covariance. Moreover, and in order to bound the processing needs of the C-SKF (between linear and quadratic in the size of the map), we introduce a relaxation of the C-SKF algorithm, the sC-SKF, which operates on the Cholesky factors of independent sub-maps resulting from dividing the trajectory and observations used for constructing the map into overlapping segments. Lastly, we assess the processing and memory requirements of the proposed C-SKF and sC-SKF algorithms, and compare their positioning accuracy against other approximate map-based localization approaches that employ measurement-noise-covariance inflation to compensate for the map's uncertainty.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑