TY - GEN

T1 - Zero-error target tracking through limited querying of binary sensors

AU - Barbosa, Patricia R.

AU - Li, Hua

AU - Chong, Edwin K.P.

AU - Hannig, Jan

AU - Kulkarni, Sanjeev R.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We consider the problem of tracking a target that moves according to a Markov chain. An estimator queries a set of sensors to obtain tracking information. We are interested in finding the minimum number of queries per time step such that a target is trackable. Three scenarios are analyzed. First we investigate the case where the estimator is required to know the exact location of the target at each time step. We then relax our requirements and explore the case where the estimator may lose track of the target at a given time step, but it is able to "catchup," regaining up-To-date information about the target's track. Finally, we consider the case where tracking information is only known after a delay of d time steps. We provide necessary and sufficient conditions on the number of queries per time step to track in the above three scenarios. These conditions are stated in terms of the entropy rate of the target's Markov chain.

AB - We consider the problem of tracking a target that moves according to a Markov chain. An estimator queries a set of sensors to obtain tracking information. We are interested in finding the minimum number of queries per time step such that a target is trackable. Three scenarios are analyzed. First we investigate the case where the estimator is required to know the exact location of the target at each time step. We then relax our requirements and explore the case where the estimator may lose track of the target at a given time step, but it is able to "catchup," regaining up-To-date information about the target's track. Finally, we consider the case where tracking information is only known after a delay of d time steps. We provide necessary and sufficient conditions on the number of queries per time step to track in the above three scenarios. These conditions are stated in terms of the entropy rate of the target's Markov chain.

UR - http://www.scopus.com/inward/record.url?scp=83755204770&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755204770&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:83755204770

T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

SP - 1424

EP - 1431

BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

T2 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

Y2 - 27 September 2006 through 29 September 2006

ER -