Loop-closure Candidates Selection By Exploiting Structure In Vehicle Trajectory

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
2011 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2011, 2153-0858 pp. 92 - 97
Issue Date:
2011-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012004279OK.pdf491.33 kB
Adobe PDF
One of the most important problems in robot localisation is the detection of previously visited places (loops). When a robot closes a loop, the association between observed features and present ones can be used to update its position. The computational c
Please use this identifier to cite or link to this item: