A data association method based on simulate anneal arithmetic for mobile robot SLAM

This paper researches the data association problem in mobile robot simultaneous localization and mapping (SLAM) and try to solve this problem with the thought of simulate anneal arithmetic. The essentiality of data association in SLAM is analyzed and then the data association problem is transformed into a combinatorial optimization problem, defined by variables and functions in details. The simulate anneal arithmetic is then used to solve the problem ultimately. The comparison experiment results show that the proposed method is more robust, of higher efficiency and cause better map building result relative to the traditional available methods.

[1]  Martin David Adams,et al.  Toward multidimensional assignment data association in robot localization and mapping , 2006, IEEE Transactions on Robotics.

[2]  Sen Zhang,et al.  An Efficient Data Association Approach to Simultaneous Localization and Map Building , 2005, Int. J. Robotics Res..

[3]  A. Vicino,et al.  A set theoretic approach to the simultaneous localization and map building problem , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[4]  C. Morefield Application of 0-1 integer programming to multitarget tracking problems , 1977 .

[5]  Sen Zhang,et al.  An Efficient Data Association Approach to Simultaneous Localization and Map Building , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[6]  Stergios I. Roumeliotis,et al.  Bayesian estimation and Kalman filtering: a unified framework for mobile robot localization , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[7]  Y. Bar-Shalom,et al.  Tracking in a cluttered environment with probabilistic data association , 1975, Autom..