Long-Range Rover Localization by Matching LIDAR Scans to Orbital Elevation Maps

被引:41
作者
Carle, Patrick J. F. [1 ]
Furgale, Paul T. [1 ]
Barfoot, Timothy D. [1 ]
机构
[1] Univ Toronto, Inst Aerosp Studies, Toronto, ON M3H 5T6, Canada
关键词
VISUAL ODOMETRY; EXPLORATION; REGISTRATION; RANSAC;
D O I
10.1002/rob.20336
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Current rover localization techniques such as visual odometry have proven to be very effective on short- to medium-length traverses (e.g., up to a few kilometers). This paper deals with the problem of long-range rover localization (e.g., 10 km and up) by developing an algorithm named MOGA (Multi-frame Odometry-compensated Global Alignment). This algorithm is designed to globally localize a rover by matching features detected from a three-dimensional (3D) orbital elevation map to features from rover-based, 3D LIDAR scans. The accuracy and efficiency of MOGA are enhanced with visual odometry and inclinometer/sun-sensor orientation measurements. The methodology was tested with real data, including 37 LIDAR scans of terrain from a Mars Moon analog site on Devon Island, Nunavut. When a scan contained a sufficient number of good topographic features, localization produced position errors of no more than 100 m, of which most were less than 50 m and some even as low as a few meters. Results were compared to and shown to outperform VIPER, a competing global localization algorithm that was given the same initial conditions as MOGA. On a 10-km traverse, MOGA's localization estimates were shown to significantly outperform visual odometry estimates. This paper shows how the developed algorithm can be used to accurately and autonomously localize a rover over long-range traverses. (C) 2010 Wiley Periodicals, Inc.
引用
收藏
页码:344 / 370
页数:27
相关论文
共 47 条
[1]  
[Anonymous], THESIS CARNEGIE MELL
[2]  
[Anonymous], 1992, Computer and Robot Vision
[3]  
[Anonymous], THESIS U TORONTO
[4]  
[Anonymous], 1996, Numerical methods for least squares problems, DOI DOI 10.1137/1.9781611971484
[5]   LEAST-SQUARES FITTING OF 2 3-D POINT SETS [J].
ARUN, KS ;
HUANG, TS ;
BLOSTEIN, SD .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (05) :699-700
[6]  
Bakambu J., 2006, P 3 CANADIAN C COMPU, P61
[7]   Speeded-Up Robust Features (SURF) [J].
Bay, Herbert ;
Ess, Andreas ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) :346-359
[8]  
BEHAR A, 2004, P IEEE AER C BIG SKY, V1
[9]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[10]   RANSAC-based DARCES: A new approach to fast automatic registration of partially overlapping range images [J].
Chen, CS ;
Hung, YP ;
Cheng, JB .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (11) :1229-1234