In this paper, we investigate data fusion techniques for target tracking using distributed sensors. Specifically, we are interested in how pairs of bearing or range sensors can be best assigned to targets in order to minimize the expected error in the estimates. We refer to this as the focus of attention (FOA) problem. In its general form, FOA is NP-hard and not well approximable. However, for specific geometries we obtain significant approximation results: a 2-approximation algorithm for stereo cameras on a line, a PTAS for when the cameras are equidistant, and a 1.42 approximation for equally spaced range sensors on a circle. By reposing as a maximization problem - where the goal is to maximize the number of tracks with bounded error - we are able to leverage results from maximum set-packing to render the problem approximable. We demonstrate the results in simulation for a target tracking task, and for localizing a team of mobile agents in a sensor network. These results provide insights into sensor/target assignment strategies, as well as sensor placement in a distributed network.
|Original language||English (US)|
|Number of pages||7|
|State||Published - 2003|
|Event||2003 IEEE/RSJ International Conference on Intelligent Robots and Systems - Las Vegas, NV, United States|
Duration: Oct 27 2003 → Oct 31 2003
|Other||2003 IEEE/RSJ International Conference on Intelligent Robots and Systems|
|City||Las Vegas, NV|
|Period||10/27/03 → 10/31/03|
Copyright 2012 Elsevier B.V., All rights reserved.