Multi-scale Point and Line Range Data Algorithms for Mapping and Localization
- Creators
- Pfister, Samuel T.
- Burdick, Joel W.
Abstract
This paper presents a multi-scale point and line based representation of two-dimensional range scan data. The techniques are based on a multi-scale Hough transform and a tree representation of the environment's features. The multiscale representation can lead to improved robustness and computational efficiencies in basic operations, such as matching and correspondence, that commonly arise in many localization and mapping procedures. For multi-scale matching and correspondence we introduce a χ^2 criterion that is calculated from the estimated variance in position of each detected line segment or point. This improved correspondence method can be used as the basis for simple scan-matching displacement estimation, as a part of a SLAM implementation, or as the basis for solutions to the kidnapped robot problem. Experimental results (using a Sick LMS-200 range scanner) show the effectiveness of our methods.
Additional Information
© 2006 IEEE. Issue Date: 15-19 May 2006; Date of Current Version: 26 June 2006. This research has was sponsored in part by a National Science Foundation Engineering Research Center grant (NSF9402726) and NSF ERC-CREST partnership award EEC-9730980.Attached Files
Published - Pfister2006p93602008_Ieee_International_Conference_On_Robotics_And_Automation_Vols_1-9.pdf
Files
Name | Size | Download all |
---|---|---|
md5:d817a121177fb9f58019e0002575777b
|
925.2 kB | Preview Download |
Additional details
- Eprint ID
- 21847
- Resolver ID
- CaltechAUTHORS:20110121-100516594
- NSF
- EEC-9402726
- NSF
- EEC-9730980
- European Research Council (ERC)
- Created
-
2011-01-24Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field