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.展开更多
With the increment of the number of Gaussian components, the computation cost increases in the Gaussian mixture probability hypothesis density(GM-PHD) filter. Based on the theory of Chen et al, we propose an improved ...With the increment of the number of Gaussian components, the computation cost increases in the Gaussian mixture probability hypothesis density(GM-PHD) filter. Based on the theory of Chen et al, we propose an improved pruning algorithm for the GM-PHD filter, which utilizes not only the Gaussian components’ means and covariance, but their weights as a new criterion to improve the estimate accuracy of the conventional pruning algorithm for tracking very closely proximity targets. Moreover, it solves the end-less while-loop problem without the need of a second merging step. Simulation results show that this improved algorithm is easier to implement and more robust than the formal ones.展开更多
In order to improve the accuracy of free flight conflict detection and reduce the false alarm rate, an improved flight conflict detection algorithm is proposed based on Gauss-Hermite particle filter(GHPF). The algor...In order to improve the accuracy of free flight conflict detection and reduce the false alarm rate, an improved flight conflict detection algorithm is proposed based on Gauss-Hermite particle filter(GHPF). The algorithm improves the traditional flight conflict detection method in two aspects:(i) New observation data are integrated into system state transition probability, and Gauss-Hermite Filter(GHF) is used for generating the importance density function.(ii) GHPF is used for flight trajectory prediction and flight conflict probability calculation. The experimental results show that the accuracy of conflict detection and tracing with GHPF is better than that with standard particle filter. The detected conflict probability is more precise with GHPF, and GHPF is suitable for early free flight conflict detection.展开更多
The probability hypothesis density (PHD) propagates the posterior intensity in place of the poste- rior probability density of the multi-target state. The cardinalized PHD (CPHD) recursion is a generalization of P...The probability hypothesis density (PHD) propagates the posterior intensity in place of the poste- rior probability density of the multi-target state. The cardinalized PHD (CPHD) recursion is a generalization of PHD recursion, which jointly propagates the posterior intensity function and posterior cardinality distribution. A number of sequential Monte Carlo (SMC) implementations of PHD and CPHD filters (also known as SMC- PHD and SMC-CPHD filters, respectively) for general non-linear non-Gaussian models have been proposed. However, these approaches encounter the limitations when the observation variable is analytically unknown or the observation noise is null or too small. In this paper, we propose a convolution kernel approach in the SMC-CPHD filter. The simuIation results show the performance of the proposed filter on several simulated case studies when compared to the SMC-CPHD filter.展开更多
基金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.
基金supported by the National Natural Science Foundation of China(61703228)
文摘With the increment of the number of Gaussian components, the computation cost increases in the Gaussian mixture probability hypothesis density(GM-PHD) filter. Based on the theory of Chen et al, we propose an improved pruning algorithm for the GM-PHD filter, which utilizes not only the Gaussian components’ means and covariance, but their weights as a new criterion to improve the estimate accuracy of the conventional pruning algorithm for tracking very closely proximity targets. Moreover, it solves the end-less while-loop problem without the need of a second merging step. Simulation results show that this improved algorithm is easier to implement and more robust than the formal ones.
基金Supported by the Joint Project of National Natural Science Foundation of ChinaCivil Aviation Administration of China(U1333116)
文摘In order to improve the accuracy of free flight conflict detection and reduce the false alarm rate, an improved flight conflict detection algorithm is proposed based on Gauss-Hermite particle filter(GHPF). The algorithm improves the traditional flight conflict detection method in two aspects:(i) New observation data are integrated into system state transition probability, and Gauss-Hermite Filter(GHF) is used for generating the importance density function.(ii) GHPF is used for flight trajectory prediction and flight conflict probability calculation. The experimental results show that the accuracy of conflict detection and tracing with GHPF is better than that with standard particle filter. The detected conflict probability is more precise with GHPF, and GHPF is suitable for early free flight conflict detection.
基金Supported in Part by the Foundation of the Excellent State Key Laboratory under Grant 40523005,and the Ministry of Education of China
文摘The probability hypothesis density (PHD) propagates the posterior intensity in place of the poste- rior probability density of the multi-target state. The cardinalized PHD (CPHD) recursion is a generalization of PHD recursion, which jointly propagates the posterior intensity function and posterior cardinality distribution. A number of sequential Monte Carlo (SMC) implementations of PHD and CPHD filters (also known as SMC- PHD and SMC-CPHD filters, respectively) for general non-linear non-Gaussian models have been proposed. However, these approaches encounter the limitations when the observation variable is analytically unknown or the observation noise is null or too small. In this paper, we propose a convolution kernel approach in the SMC-CPHD filter. The simuIation results show the performance of the proposed filter on several simulated case studies when compared to the SMC-CPHD filter.