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 progr...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.展开更多
This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain e...This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.展开更多
在基于接收信号强度(received signal strength,RSS)的定位中,传感器量测的系统偏差及锚节点位置的不确定性会对定位结果造成严重影响。对此,提出一种面向不确定量测的鲁棒定位方法。首先,针对传感器量测有偏差及锚节点位置不确定的定...在基于接收信号强度(received signal strength,RSS)的定位中,传感器量测的系统偏差及锚节点位置的不确定性会对定位结果造成严重影响。对此,提出一种面向不确定量测的鲁棒定位方法。首先,针对传感器量测有偏差及锚节点位置不确定的定位问题,建立相应的量测模型;其次,基于经典的极大似然估计准则建立关于目标位置的估计问题;最后,对所建立的非凸位置估计问题,采用合理的近似、松弛数学手段,将其转化为凸的半正定规划问题,从而保证得到全局最优解。仿真实验表明,在不同定位场景和条件下,所提方法的定位精度相比文献中的几种定位方法均有明显的优势,最高可提升约50%,证明其能有效降低量测不确定性对定位结果的不利影响,具有良好的鲁棒性。展开更多
基金supported by the National Natural Science Fundation of China (61203238 61134005+5 种基金 60921001 90916024 91116016)the National Basic Research Program of China (973 Program) (2012CB8212002012CB821201)the National Science Foundation for Postdoctoral Scientists of China (2012M520140)
文摘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.
基金supported by the National Natural Science Foundation of China(6157328561305133)
文摘This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.
文摘在基于接收信号强度(received signal strength,RSS)的定位中,传感器量测的系统偏差及锚节点位置的不确定性会对定位结果造成严重影响。对此,提出一种面向不确定量测的鲁棒定位方法。首先,针对传感器量测有偏差及锚节点位置不确定的定位问题,建立相应的量测模型;其次,基于经典的极大似然估计准则建立关于目标位置的估计问题;最后,对所建立的非凸位置估计问题,采用合理的近似、松弛数学手段,将其转化为凸的半正定规划问题,从而保证得到全局最优解。仿真实验表明,在不同定位场景和条件下,所提方法的定位精度相比文献中的几种定位方法均有明显的优势,最高可提升约50%,证明其能有效降低量测不确定性对定位结果的不利影响,具有良好的鲁棒性。
