Tracking multiple space objects using multiple surveillance sensors is a critical approach in many Space Situation Awareness(SSA) applications. In this process, the uncertainties of targets,dynamics, and observations ...Tracking multiple space objects using multiple surveillance sensors is a critical approach in many Space Situation Awareness(SSA) applications. In this process, the uncertainties of targets,dynamics, and observations are usually represented by the probability distributions. However, precise characterization of uncertainty becomes challenging due to imperfect knowledge about some key aspects, such as birth targets and sensor detection profiles. To overcome this challenge, this paper proposes a multi-sensor possibility PHD filter based on the theory of outer probability measures. An effective compensation method is introduced to tackle variations in the fields of view of SSA sensors or instances of missed detections, aiming to mitigate the inconsistency in localized information. The proposed method is adapted to centralized and distributed sensor networks, offering effective solutions for multi-sensor multi-target tracking. The major innovation of the proposed method compared with typical methods is the proper description of epistemic uncertainty, which yields more robust performance in the scenarios of lacking some information about the system.The effectiveness of the multi-sensor possibility PHD filter is demonstrated by a comparison with conventional methods in two simulated scenarios.展开更多
CPHD(Cardinalized Probability Hypothesis Density)滤波是一种杂波环境下可变目标数的多目标跟踪算法,该文针对算法中存在的目标漏检问题提出一种改进算法,该算法在高斯混合框架下实现贝叶斯递归,通过对各个高斯分量进行标记,对目标...CPHD(Cardinalized Probability Hypothesis Density)滤波是一种杂波环境下可变目标数的多目标跟踪算法,该文针对算法中存在的目标漏检问题提出一种改进算法,该算法在高斯混合框架下实现贝叶斯递归,通过对各个高斯分量进行标记,对目标进行航迹关联,在此基础上对修剪合并后各个高斯分量的权值进行两次分配。首先对超过检测门限的高斯分量权值进行分配,有效解决了目标漏检问题,然后基于一个目标只可能产生一个观测的事实进行第2次分配,改善了目标发生交叉时的算法性能。实验结果表明,所提方法在多目标状态估计和航迹维持方面均优于普通的CPHD算法。展开更多
提出一种基于演化网络模型和区间分析的群目标势概率假设密度(cardinalized probability hypothesis density,CPHD)滤波算法。针对传统的粒子CPHD群目标跟踪算法中粒子数多、运算量大的问题,采用箱粒子实现CPHD滤波器,减少了粒子数,降...提出一种基于演化网络模型和区间分析的群目标势概率假设密度(cardinalized probability hypothesis density,CPHD)滤波算法。针对传统的粒子CPHD群目标跟踪算法中粒子数多、运算量大的问题,采用箱粒子实现CPHD滤波器,减少了粒子数,降低了运算量。算法通过对群目标状态采用CPHD滤波进行预测更新,并使用所获得的群信息修正群内目标的状态,进而实现对群质心的跟踪和群目标的势估计。仿真对比实验表明,所提算法在达到与传统算法相似估计性能的条件下,大幅降低了算法的运算量,同时在强杂波环境下也具有更为突出的优势。展开更多
The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction（MEE）, is an essential requirement for a multi-target filter, whose key performance assessm...The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction（MEE）, is an essential requirement for a multi-target filter, whose key performance assessments are based on accuracy, computational efficiency and reliability. The probability hypothesis density（PHD） filter, implemented by the sequential Monte Carlo approach,affords a computationally efficient solution to general multi-target filtering for a time-varying number of targets, but leaves no clue for optimal MEE. In this paper, new data association techniques are proposed to distinguish real measurements of targets from clutter, as well as to associate particles with measurements. The MEE problem is then formulated as a family of parallel singleestimate extraction problems, facilitating the use of the classic expected a posteriori（EAP） estimator, namely the multi-EAP（MEAP） estimator. The resulting MEAP estimator is free of iterative clustering computation, computes quickly and yields accurate and reliable estimates. Typical simulation scenarios are employed to demonstrate the superiority of the MEAP estimator over existing methods in terms of faster processing speed and better estimation accuracy.展开更多
针对当前扩展目标跟踪量测划分方法中,距离划分存在划分数过多、计算复杂度高的问题,本文将密度峰值快速聚类算法CFSFDP (Clustering by Fast Search and Find of Density Peaks)与箱粒子势概率假设滤波器(Box Cardinalized Probability...针对当前扩展目标跟踪量测划分方法中,距离划分存在划分数过多、计算复杂度高的问题,本文将密度峰值快速聚类算法CFSFDP (Clustering by Fast Search and Find of Density Peaks)与箱粒子势概率假设滤波器(Box Cardinalized Probability Hypothesis Density filter, Box-CPHD)相结合,提出基于CFSFDP的箱粒子CPHD扩展目标滤波算法.该算法采用CFSFDP进行量测划分,基于量测信息密度的不同可以有效划分区间量测,并剔除杂波量测,然后采用箱粒子CPHD进行预测更新和目标状态估计.仿真实验表明与经典的距离划分方法相比,在箱粒子CPHD扩展目标算法流程中采用CFSFDP进行量测预处理, CFSFDP在达到同等效果的前提下,运行时间明显减少;在剔除杂波之后的高杂波环境下,杂波的变化只影响距离划分的运算时间而不再影响CFSFDP划分,采用CFSFDP处理量测信息可以有效提高运行效率和算法实时性,剔除杂波之后在一定程度上提高了目标位置估计精度.展开更多
An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as dron...An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.展开更多
As a typical implementation of the probability hypothesis density(PHD) filter, sequential Monte Carlo PHD(SMC-PHD) is widely employed in highly nonlinear systems. However, the particle impoverishment problem introduce...As a typical implementation of the probability hypothesis density(PHD) filter, sequential Monte Carlo PHD(SMC-PHD) is widely employed in highly nonlinear systems. However, the particle impoverishment problem introduced by the resampling step, together with the high computational burden problem, may lead to performance degradation and restrain the use of SMC-PHD filter in practical applications. In this work, a novel SMC-PHD filter based on particle compensation is proposed to solve above problems. Firstly, according to a comprehensive analysis on the particle impoverishment problem, a new particle generating mechanism is developed to compensate the particles. Then, all the particles are integrated into the SMC-PHD filter framework. Simulation results demonstrate that, in comparison with the SMC-PHD filter, proposed PC-SMC-PHD filter is capable of overcoming the particle impoverishment problem, as well as improving the processing rate for a certain tracking accuracy in different scenarios.展开更多
基金funded by the National Natural Science Foundation of China(No.12202049)the Beijing Institute of Technology Research Fund Program for Young Scholars,China.
文摘Tracking multiple space objects using multiple surveillance sensors is a critical approach in many Space Situation Awareness(SSA) applications. In this process, the uncertainties of targets,dynamics, and observations are usually represented by the probability distributions. However, precise characterization of uncertainty becomes challenging due to imperfect knowledge about some key aspects, such as birth targets and sensor detection profiles. To overcome this challenge, this paper proposes a multi-sensor possibility PHD filter based on the theory of outer probability measures. An effective compensation method is introduced to tackle variations in the fields of view of SSA sensors or instances of missed detections, aiming to mitigate the inconsistency in localized information. The proposed method is adapted to centralized and distributed sensor networks, offering effective solutions for multi-sensor multi-target tracking. The major innovation of the proposed method compared with typical methods is the proper description of epistemic uncertainty, which yields more robust performance in the scenarios of lacking some information about the system.The effectiveness of the multi-sensor possibility PHD filter is demonstrated by a comparison with conventional methods in two simulated scenarios.
文摘CPHD(Cardinalized Probability Hypothesis Density)滤波是一种杂波环境下可变目标数的多目标跟踪算法,该文针对算法中存在的目标漏检问题提出一种改进算法,该算法在高斯混合框架下实现贝叶斯递归,通过对各个高斯分量进行标记,对目标进行航迹关联,在此基础上对修剪合并后各个高斯分量的权值进行两次分配。首先对超过检测门限的高斯分量权值进行分配,有效解决了目标漏检问题,然后基于一个目标只可能产生一个观测的事实进行第2次分配,改善了目标发生交叉时的算法性能。实验结果表明,所提方法在多目标状态估计和航迹维持方面均优于普通的CPHD算法。
文摘提出一种基于演化网络模型和区间分析的群目标势概率假设密度(cardinalized probability hypothesis density,CPHD)滤波算法。针对传统的粒子CPHD群目标跟踪算法中粒子数多、运算量大的问题,采用箱粒子实现CPHD滤波器,减少了粒子数,降低了运算量。算法通过对群目标状态采用CPHD滤波进行预测更新,并使用所获得的群信息修正群内目标的状态,进而实现对群质心的跟踪和群目标的势估计。仿真对比实验表明,所提算法在达到与传统算法相似估计性能的条件下,大幅降低了算法的运算量,同时在强杂波环境下也具有更为突出的优势。
基金partly supported by the Marie SklodowskaCurie Individual Fellowship (No. 709267)under the European Union’s Framework Programme for ResearchInnovation Horizon 2020 and National Natural Science Foundation of China (No. 51475383)
文摘The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction（MEE）, is an essential requirement for a multi-target filter, whose key performance assessments are based on accuracy, computational efficiency and reliability. The probability hypothesis density（PHD） filter, implemented by the sequential Monte Carlo approach,affords a computationally efficient solution to general multi-target filtering for a time-varying number of targets, but leaves no clue for optimal MEE. In this paper, new data association techniques are proposed to distinguish real measurements of targets from clutter, as well as to associate particles with measurements. The MEE problem is then formulated as a family of parallel singleestimate extraction problems, facilitating the use of the classic expected a posteriori（EAP） estimator, namely the multi-EAP（MEAP） estimator. The resulting MEAP estimator is free of iterative clustering computation, computes quickly and yields accurate and reliable estimates. Typical simulation scenarios are employed to demonstrate the superiority of the MEAP estimator over existing methods in terms of faster processing speed and better estimation accuracy.
文摘针对当前扩展目标跟踪量测划分方法中,距离划分存在划分数过多、计算复杂度高的问题,本文将密度峰值快速聚类算法CFSFDP (Clustering by Fast Search and Find of Density Peaks)与箱粒子势概率假设滤波器(Box Cardinalized Probability Hypothesis Density filter, Box-CPHD)相结合,提出基于CFSFDP的箱粒子CPHD扩展目标滤波算法.该算法采用CFSFDP进行量测划分,基于量测信息密度的不同可以有效划分区间量测,并剔除杂波量测,然后采用箱粒子CPHD进行预测更新和目标状态估计.仿真实验表明与经典的距离划分方法相比,在箱粒子CPHD扩展目标算法流程中采用CFSFDP进行量测预处理, CFSFDP在达到同等效果的前提下,运行时间明显减少;在剔除杂波之后的高杂波环境下,杂波的变化只影响距离划分的运算时间而不再影响CFSFDP划分,采用CFSFDP处理量测信息可以有效提高运行效率和算法实时性,剔除杂波之后在一定程度上提高了目标位置估计精度.
基金supported by the National Natural Science Foundation of China (61773142)。
文摘An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.
基金Projects(61671462,61471383,61671463,61304103)supported by the National Natural Science Foundation of ChinaProject(ZR2012FQ004)supported by the Natural Science Foundation of Shandong Province,China
文摘As a typical implementation of the probability hypothesis density(PHD) filter, sequential Monte Carlo PHD(SMC-PHD) is widely employed in highly nonlinear systems. However, the particle impoverishment problem introduced by the resampling step, together with the high computational burden problem, may lead to performance degradation and restrain the use of SMC-PHD filter in practical applications. In this work, a novel SMC-PHD filter based on particle compensation is proposed to solve above problems. Firstly, according to a comprehensive analysis on the particle impoverishment problem, a new particle generating mechanism is developed to compensate the particles. Then, all the particles are integrated into the SMC-PHD filter framework. Simulation results demonstrate that, in comparison with the SMC-PHD filter, proposed PC-SMC-PHD filter is capable of overcoming the particle impoverishment problem, as well as improving the processing rate for a certain tracking accuracy in different scenarios.
