2006 IEEE/RSJ International Conference on Intelligent Robots and Systems 2006
DOI: 10.1109/iros.2006.282246
|View full text |Cite
|
Sign up to set email alerts
|

A 3-D Scan Matching using Improved 3-D Normal Distributions Transform for Mobile Robotic Mapping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
83
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 171 publications
(83 citation statements)
references
References 1 publication
0
83
0
Order By: Relevance
“…Magnusson et al [7] propose the use of a sequence of grids, each with a different resolution. Takeuchi and Tsubouchi [12] use a heterogeneous grid structure with larger cells further from the sensor in each scan. Kaminade et al [13] introduce varying amounts of blurring to the Gaussians in order to model different levels of confidence in the representation.…”
Section: D-ndtmentioning
confidence: 99%
“…Magnusson et al [7] propose the use of a sequence of grids, each with a different resolution. Takeuchi and Tsubouchi [12] use a heterogeneous grid structure with larger cells further from the sensor in each scan. Kaminade et al [13] introduce varying amounts of blurring to the Gaussians in order to model different levels of confidence in the representation.…”
Section: D-ndtmentioning
confidence: 99%
“…Ravi Kaushik, Jizhong Xiao*, William Morris and Zhigang Zhu preview or odometry [2], Angle Histogram [10]. It is known that these algorithms also fail to converge to a global minimum when there is a large rotation and translation transformation between two scans, which is our case between the ground robot and the wall-climbing robot (one scan inverted with respect to each other if the wall-climbing robot is on the ceiling).…”
Section: Laser Scan Registration Of Dual-robot System Using Visionmentioning
confidence: 99%
“…D laser scan registration is a widely studied research topic in robotics community [1][2][3]. Relative pose between two laser scans has been traditionally computed using the ICP algorithm and its variants [1,4].…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm indicates the correct solution even in cases when the overlap is poor and having large interfering structures within two successive scans. It can not get trapped in local minima like the well known Iterated Closest Point (ICP) [2] or the 3D Normal Distributions Transform (NDT) [3]. It is furthermore able to consider intensity information which are becoming important in the latest technology of Laser Range Finders (LRF).…”
Section: Introductionmentioning
confidence: 99%