Robot localization based on scan-matching—estimating the covariance matrix for the IDC algorithm

✍ Scribed by Ola Bengtsson; Albert-Jan Baerveldt

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 278 KB
• Volume: 44
• Category: Article
• ISSN: 0921-8890
• DOI: 10.1016/s0921-8890(03)00008-3

✦ Synopsis

We have previously presented a new scan-matching algorithm based on the IDC (iterative dual correspondence) algorithm, which showed a good localization performance even in environments with severe changes. The problem of the IDC algorithm is that there is no good way to estimate a covariance matrix of the position estimate, which prohibits an effective fusion with other position estimates of other sensors. This paper presents two new ways to estimate the covariance matrix. The first estimates the covariance matrix from the Hessian matrix of the error function minimized by the scan-matching algorithm. The second one, which is an off-line method, estimates the covariance matrix of a specific scan, from a specific position by simulating and matching scans around the position. Simulation results show that the covariance matrix provided by the off-line method fully corresponds with the real one. Some preliminary tests on real data indicate that the off-line method gives a good quality value of a specific scan position, which is of great value in map building.