On registration of vector maps with known correspondences
Loading...
Date
2018-05-21
Authors
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Altmetrics
Abstract
Data association and registration is an important and actively researched topic in robotics. This paper deals with registration of two sets of line segments, which is especially useful in mapping applications. Our method is non-iterative, finding an optimal transformation in a single step, in a time proportional only to a number of the corresponding line segments. The procedure also provides diagnostic measures of reliability of the computation and of similarity of the data sets being registered. At this point, the method presumes known correspondences, which is limiting, but the discussion in the end reveals some possibilities to overcome this issue, which we are examining. Practical properties are demonstrated on a typical task of localization of a robot with a known map.
Description
Citation
Proceedings of 12th International Conference Elektro 2018. 2018, p. 1-6.
https://ieeexplore.ieee.org/document/8398367/
https://ieeexplore.ieee.org/document/8398367/
Document type
Peer-reviewed
Document version
Accepted version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
(C) IEEE