DocumentCode
2705470
Title
A novel graph-based matching method to merge the extracted maps from mobile robots
Author
Karambakhsh, A. ; Azizi, V. ; Hoseini, Mojtaba ; Heiran, K. ; Khanian, M.Y.A. ; Meybodi, Mohammad Reza
Author_Institution
Dept. of Electr., Comput. & IT Eng., Qazvin Islamic Azad Univ. (QIAU), Qazvin, Iran
fYear
2012
fDate
6-8 June 2012
Firstpage
317
Lastpage
321
Abstract
In Recent years Robotic Science has shown a lot of advances and also faced new conditions and challenges. One of the most discussed issues in mobile robots study fields is the mapping discussion or SLAM, in which robots identify environment through range finder and estimate the position Emergence of this issue has also brought up another challenge in terms of map integration. In other words, in case of having two or more robots in a common environment that each one generates its own individual maps, a special method is needed to integrate their generated maps. During recent years various articles were presented upon this challenge, in which the integrated map is generated based on distances obtained from range finder sensors and the similarity of these distances between several maps. In this paper we are intended to generate a graph based on image processing techniques, match them and discuss upon the improvement enhanced by this in compare with other point matching method.
Keywords
SLAM (robots); distance measurement; graph theory; image matching; mobile robots; sensors; SLAM; extracted map merging; graph-based matching method; image processing techniques; map integration; mapping discussion; mobile robots; point matching method; position emergence estimation; range finder sensors; robotic science; Corporate acquisitions; Feature extraction; Iterative closest point algorithm; Laser applications; Robot sensing systems; Skeleton; Autonomous Robot; SLAM; Scan Matching; Skeletonize;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Automation (ICIA), 2012 International Conference on
Conference_Location
Shenyang
Print_ISBN
978-1-4673-2238-6
Electronic_ISBN
978-1-4673-2236-2
Type
conf
DOI
10.1109/ICInfA.2012.6246825
Filename
6246825
Link To Document