An Optimization-Based Parallel Particle Filter for Multitarget Tracking

Abstract

<p> Particle filters are being used in a number of state estimation applications because of their capability to effectively solve nonlinear and non-Gaussian problems. However, they have high computational requirements and this becomes even more so in the case of multitarget tracking, where data association is the bottleneck. In order to perform data association and estimation jointly, typically an augmented state vector, whose dimensions depend on the number of targets, is used in particle filters. As the number of targets increases, the corresponding computational load increases exponentially. In this case, parallelization is a possibility for achieving real-time feasibility in large-scale multitarget tracking applications. In this paper, we present an optimization-based scheduling algorithm that minimizes the total computation time for the bus-connected heterogeneous primary-secondary architecture. This scheduler is capable of selecting the optimal number of processors from a large pool of secondary processors and mapping the particles among the selected ones. A new distributed resampling algorithm suitable for parallel computing is also proposed. Furthermore, a less communication intensive parallel implementation of the particle filter without sacrificing tracking accuracy using an efficient load balancing technique, in which optimal particle migration among secondary processors is ensured, is presented. Simulation results demonstrate the tracking effectiveness of the new parallel particle filter and the speedup achieved using parallelization.</p>