Journal of Systems Engineering and Electronics ›› 2013, Vol. 24 ›› Issue (4): 555-563.doi: 10.1109/JSEE.2013.00064


Optimal set integer programming algorithm for multiple maneuvering targets tracking in clutter

Xiaoyan Fu1,2,*, Yingmin Jia1, and Xiaohe Liu3   

  1. 1. School of Mathematics and System Science, Beihang University, Beijing 100191, China;
    2. College of Information Engineering, Capital Normal University, Beijing 100048, China;
    3. Department of Systems and Control, Beijing Information Science and Technology University, Beijing 100283, China
  • Online:2013-08-21 Published:2010-01-03


The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear programming (LP) based branchand-bound method and adjusting the constraint conditions, an optimal set integer programming (OSIP) algorithm is then proposed for tracking multiple non-maneuvering targets in clutter. For the case of maneuvering targets, this paper introduces the OSIP algorithm into the filtering step of the interacting multiple model (IMM) algorithm resulting in the IMM based on OSIP algorithm. Extensive Monte Carlo simulations show that the presented algorithms can obtain superior estimations even in the case of high density noises.