A Light-and-Fast SLAM Algorithm for Robots in Indoor Environments Using Line Segment Map
Author(s) -
Bor-Woei Kuo,
Hsun-Hao Chang,
YungChang Chen,
ShiYu Huang
Publication year - 2011
Publication title -
journal of robotics
Language(s) - English
Resource type - Journals
eISSN - 1687-9619
pISSN - 1687-9600
DOI - 10.1155/2011/257852
Subject(s) - computer science , simultaneous localization and mapping , particle filter , line (geometry) , algorithm , robot , computer vision , artificial intelligence , property (philosophy) , mobile robot , computational complexity theory , grid , filter (signal processing) , philosophy , geometry , mathematics , epistemology
Simultaneous Localization and Mapping (SLAM) is an important technique for robotic system navigation. Due to the high complexity of the algorithm, SLAM usually needs long computational time or large amount of memory to achieve accurate results. In this paper, we present a lightweight Rao-Blackwellized particle filter- (RBPF-) based SLAM algorithm for indoor environments, which uses line segments extracted from the laser range finder as the fundamental map structure so as to reduce the memory usage. Since most major structures of indoor environments are usually orthogonal to each other, we can also efficiently increase the accuracy and reduce the complexity of our algorithm by exploiting this orthogonal property of line segments, that is, we treat line segments that are parallel or perpendicular to each other in a special way when calculating the importance weight of each particle. Experimental results shows that our work is capable of drawing maps in complex indoor environments, needing only very low amount of memory and much less computational time as compared to other grid map-based RBPF SLAM algorithms
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom