Indexed by:
Abstract:
Data association is the foundation of state estimation in mobile robot simultaneous localization and mapping. Aiming at the problems of false association, high computational complexity in joint compatible branch and bound algorithm, we propose an optimized joint compatible branch and bound data association algorithm based on Gaussian mixture clustering. Firstly, the local association strategy is adopted to limit data association in local region, so as to reduce the number of features involved in data association at the current moment. Secondly, the Gaussian mixture clustering algorithm is used in local areas to group the observed values at the current moment, so as to get several groups that have little correlation with each other. Finally, joint compatible branch and bound data association algorithm is used in each group for data association, and the optimal solution is obtained according to mutual exclusion criteria and optimal criteria. The experiment results verify that the algorithm improved the accuracy of data association, reduced the computational complexity and improved the efficiency of data association.
Keyword:
Reprint Author's Address:
Email:
Source :
IEEE ACCESS
ISSN: 2169-3536
Year: 2020
Volume: 8
Page: 2590-2598
3 . 9 0 0
JCR@2022
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 5
Affiliated Colleges: