Name
Abstract | ||
|---|---|---|
In this paper, we seek 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 mapu0027s Hessian, instead of its dense covariance-as is the case for the Schmidt-Kalman filter. By doing so, the C-SKF has memory requirements typically linear in the size of the map, as opposed to quadratic for storing the mapu0027s 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 two relaxations of the C-SKF algorithm: (i) The sC-SKF, which operates on the Cholesky factors of independent sub-maps resulting from dividing the map into overlapping segments. (ii) We formulate an efficient method for sparsifying the Cholesky factor by selecting and processing a subset of loop-closure measurements based on their temporal distribution. Lastly, we assess the processing and memory requirements of the proposed algorithms, and compare their positioning accuracy against other inconsistent map-based localization approaches that employ measurement-noise-covariance inflation to compensate for the mapu0027s uncertainty. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICRA.2017.7989741 | international conference on robotics and automation |
DocType | Volume | Issue |
Conference | abs/1604.08087 | 1 |
Citations | PageRank | References |
2 | 0.37 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryan DuToit | 1 | 7 | 1.53 |
| Joel A. Hesch | 2 | 273 | 13.62 |
| Esha D. Nerurkar | 3 | 144 | 8.58 |
| Stergios I. Roumeliotis | 4 | 2124 | 151.96 |