Author's School

School of Engineering & Applied Science

Author's Department/Program

Electrical and Systems Engineering

Language

English (en)

Date of Award

10-4-2013

Degree Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Chair and Committee

Arye Nehorai

Abstract

In this dissertation, we develop computationally efficient algorithms for multiple-target tracking: MTT) in complex scenarios. For each of these scenarios, we develop measurement and state-space models, and then exploit the structure in these models to propose efficient tracking algorithms. In addition, we address design issues such as sensor selection and resource allocation.

First, we consider MTT when the targets themselves are moving in a

time-varying multipath environment. We develop a sparse-measurement model that allows us to exploit the inherent joint delay-Doppler diversity offered by the environment. We then reformulate the problem of MTT as a

block-support recovery problem using the sparse measurement model. We exploit the structure of the dictionary matrix to develop a computationally efficient block support recovery algorithm: and thereby a

multiple-target tracking algorithm) under the assumption that the channel state describing the time-varying multipath environment is known. Further, we also derive an upper bound on the

overall error probability of wrongly identifying the support of the sparse signal. We then relax the assumption that the channel state is known. We develop a new particle filter called

the Multiple Rao-Blackwellized Particle Filter: MRBPF) to jointly estimate

both the target and the channel states. We also compute the posterior Cramér-Rao bound: PCRB) on the estimates

of the target and the channel states and use the PCRB to find a

suitable subset of antennas to be used for transmission in each tracking interval,

as well as the power transmitted by these antennas.

Second, we consider the problem of tracking an unknown number and types of targets using a multi-modal sensor network. In a multi-modal sensor network, different quantities associated with the same state are measured using sensors of different kinds. Hence, an efficient method that can suitably combine the diverse information measured by each sensor is required. We first develop a Hierarchical Particle Filter: HPF) to estimate the unknown state from the multi-modal measurements for a special class of problems which can be modeled hierarchically. We then model our problem of

tracking using a hierarchical model and then use the proposed HPF for joint initiation, termination and tracking of multiple targets. The multi-modal data consists of the measurements collected from a radar, an

infrared camera and a human scout. We also propose a unified framework for multi-modal sensor management

that comprises sensor selection: SS), resource allocation: RA) and data fusion: DF). Our approach is inspired by the trading behavior of economic agents in commercial markets. We model the sensors and the sensor manager as economic agents, and the interaction among them as a double sided market with both consumers and producers. We propose an iterative double auction mechanism for computing the equilibrium of such a market. We relate the equilibrium point to the solutions of SS, RA and DF.

Third, we address MTT problem in the presence of data association

ambiguity that arises due to clutter. Data association corresponds to the problem

of assigning a measurement to each target. We treat the data association

and state estimation as separate subproblems. We develop a game-theoretic

framework to solve the data association, in which we model each tracker as

a player and the set of measurements as strategies. We develop utility functions

for each player, and then use a regret-based learning algorithm to find the

correlated equilibrium of this game. The game-theoretic approach allows us to associate

measurements to all the targets simultaneously. We then use particle filtering

on the reduced dimensional state of each target, independently.

DOI

https://doi.org/10.7936/K7XS5SG7

Comments

Permanent URL: http://dx.doi.org/10.7936/K7XS5SG7

Share

COinS