Please use this identifier to cite or link to this item:
Title: An optimal data association method based on the minimum weighted bipartite perfect matching
Authors: Zhang, X
Rad, AB
Huang, G
Wong, YK 
Keywords: Bipartite matching
Data association
Mobile robot
Issue Date: 2015
Publisher: Kluwer Academic Publishers
Source: Autonomous robots, 2015 How to cite?
Journal: Autonomous Robots 
Abstract: Data association is an important problem in simultaneous localization and mapping, however, many single frame based methods only provide suboptimal solutions. In this paper an optimal graph theoretic approach is proposed. We formulate the data association as an integer programming (IP) and then prove that it is equivalent to a minimum weight bipartite perfect matching problem. Therefore, optimally solving the bipartite matching problem implies optimally resolving the IP, i.e. the data association problem. We compare the proposed approach with other widely used data association methods. Experimental results validate the effectiveness and accuracy of the proposed approach, and manifest that this graph based data association method can be used for online application.
ISSN: 0929-5593
DOI: 10.1007/s10514-015-9439-y
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Checked on Sep 18, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.