Abstract

Imagine a tracking agent PP who wants to follow a moving target QQ in dd-dimensional Euclidean space. The tracker has access to a noisy location sensor that reports an estimate Q~(t)\tilde{Q}(t) of the target's true location Q(t)Q(t) at time tt, where ∣∣Q(T)−Q~(T)∣∣||Q(T) - \tilde{Q}(T)|| represents the sensor's localization error. We study the limits of tracking performance under this kind of sensing imprecision. In particular, we investigate (1) what is PP's best strategy to follow QQ if both PP and QQ can move with equal speed, (2) at what rate does the distance ∣∣Q(t)−P(t)∣∣||Q(t) - P(t)|| grow under worst-case localization noise, (3) if PP wants to keep QQ within a prescribed distance LL, how much faster does it need to move, and (4) what is the effect of obstacles on the tracking performance, etc. Under a relative error model of noise, we are able to give upper and lower bounds for the worst-case tracking performance, both with or without obstacles.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.