scholarly journals Tracking Multiple Vehicles Constrained to a Road Network From a UAV with Sparse Visual Measurements

2021 ◽  
Vol 8 ◽  
Author(s):  
Jared J. Moore ◽  
Craig C. Bidstrup ◽  
Cameron K. Peterson ◽  
Randal W. Beard

Multiple-target tracking algorithms generally operate in the local frame of the sensor and have difficulty with track reallocation when targets move in and out of the sensor field-of-view. This poses a problem when an unmanned aerial vehicle (UAV) is tracking multiple ground targets on a road network larger than its field-of-view. To address this problem, we propose a Rao-Blackwellized Particle Filter (RBPF) to maintain individual target tracks and to perform probabilistic data association when the targets are constrained to a road network. This is particularly useful when a target leaves and then re-enters the UAV’s field-of-view. The RBPF is structured as a particle filter of particle filters. The top level filter handles data association and each of its particles maintains a bank of particle filters to handle target tracking. The tracking particle filters incorporate both positive and negative information when a measurement is received. We implement two path planning controllers, receding horizon and deep reinforcement learning, and compare their ability to improve the certainty for multiple target location estimates. The controllers prioritize paths that reduce each target’s entropy. In addition, we develop an algorithm that computes the upper bound on the filter’s performance, thus facilitating an estimate of the number of UAVs needed to achieve a desired performance threshold.

Author(s):  
Tao Yang ◽  
Prashant G. Mehta

This paper is concerned with the problem of tracking single or multiple targets with multiple nontarget-specific observations (measurements). For such filtering problems with data association uncertainty, a novel feedback control-based particle filter algorithm is introduced. The algorithm is referred to as the probabilistic data association-feedback particle filter (PDA-FPF). The proposed filter is shown to represent a generalization—to the nonlinear non-Gaussian case—of the classical Kalman filter-based probabilistic data association filter (PDAF). One remarkable conclusion is that the proposed PDA-FPF algorithm retains the error-based feedback structure of the classical PDAF algorithm, even in the nonlinear non-Gaussian case. The theoretical results are illustrated with the aid of numerical examples motivated by multiple target tracking (MTT) applications.


2007 ◽  
Vol 8 (1) ◽  
pp. 2-15 ◽  
Author(s):  
Simo Särkkä ◽  
Aki Vehtari ◽  
Jouko Lampinen

2021 ◽  
Author(s):  
◽  
Praveen Babu Choppala

<p>This thesis addresses several challenges in Bayesian target tracking, particularly for array signal processing applications, and for multiple targets.  The optimal method for multiple target tracking is the Bayes’ joint filter that operates by hypothesising all the targets collectively using a joint state. As a consequence, the computational complexity of the filter increases rapidly with the number of targets. The probability hypothesis density and the multi-Bernoulli filters that overcome this complexity do not possess a suitable framework to operate directly on phased sensor array data. Instead, such data is converted into beamformer images in which close targets may not be effectively resolved and much information is lost. This thesis develops a multiple signal classification (MUSIC) based multi-target particle filter that improves upon the filters mentioned above. A MUSIC based multi-Bernoulli particle filter is also developed, that operates more directly on array data.  The above mentioned particle filters require a resampling step which impedes information accumulation over successive observations, and affects the detection of very covert targets. This thesis develops soft resampling and soft systematic resampling to overcome this problem without affecting the accuracy of approximation. Additionally, modified Kolmogorov-Smirnov testing is proposed, to numerically evaluate the accuracy of the particle filter approximation.</p>


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Xiaohua Li ◽  
Bo Lu ◽  
Wasiq Ali ◽  
Jun Su ◽  
Haiyan Jin

The major advantage of the passive multiple-target tracking is that the sonars do not emit signals and thus they can remain covert, which will reduce the risk of being attacked. However, the nonlinearity of the passive Doppler and bearing measurements, the range unobservability problem, and the measurement to target data association uncertainty make the passive multiple-target tracking problem challenging. To deal with the target to measurement data association uncertainty problem from multiple sensors, this paper proposed a batch recursive extended Rauch-Tung-Striebel smoother- (RTSS-) based probabilistic multiple hypothesis tracker (PMHT) algorithm, which can effectively handle a large number of passive measurements including clutters. The recursive extended RTSS which consists of a forward filter and a backward smoothing is used to deal with the nonlinear Doppler and bearing measurements. The target range unobservability problem is avoided due to using multiple passive sensors. The simulation results show that the proposed algorithm works well in a passive multiple-target tracking system under dense clutter environment, and its computing cost is low.


Sign in / Sign up

Export Citation Format

Share Document