Name
Abstract | ||
|---|---|---|
Scan registration is an essential subtask when building maps based on range finder data from mobile robots. The problem is to deduce how the robot has moved between consecutive scans, based on the shape of overlapping portions of the scans. This paper presents a new algorithm for registration of 3D data. The algorithm is a generalization and improvement of the normal distributions transform (NDT) for 2D data developed by Biber and Strasser, which allows for accurate registration using a memory-efficient representation of the scan surface. A detailed quantitative and qualitative comparison of the new algorithm with the 3D version of the popular ICP (iterative closest point) algorithm is presented. Results with actual mine data, some of which were collected with a new prototype 3D laser scanner, show that the presented algorithm is faster and slightly more reliable than the standard ICP algorithm for 3D registration, while using a more memory-efficient scan surface representation. (C) 2007 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/rob.20204 | JOURNAL OF FIELD ROBOTICS |
Keywords | Field | DocType |
computer and information science,normal distribution,mobile robot | Computer vision,Computer graphics (images),Computer science,Simulation,Nondestructive testing,Artificial intelligence,Robot,Mobile robot | Journal |
Volume | Issue | ISSN |
24 | 10 | 1556-4959 |
Citations | PageRank | References |
172 | 6.74 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Magnusson | 1 | 287 | 12.86 |
| Achim J. Lilienthal | 2 | 1468 | 113.18 |
| Tom Duckett | 3 | 907 | 77.62 |