Sensor Assignment Algorithms to Improve Observability While Tracking Targets
Sensor Assignment Algorithms to Improve Observability While Tracking Targets
复制标题
传感器分配算法可提高跟踪目标时的可观测性
DOI:
--
复制
发表时间:
2017
影响因子:
7.8
通讯作者:
Pratap Tokekar
中科院分区:
文献类型:
--
作者:
Lifeng Zhou;Pratap Tokekar
In this paper, we study two sensor assignment problems for multitarget tracking with the goal of improving the observability of the underlying estimator. We consider various measures of the observability matrix as the assignment value function. We first study the general version where the sensors must form teams to track individual targets. If the value function is monotonically increasing and submodular, then a greedy algorithm yields a $1/2$–approximation. We then study a restricted version where exactly two sensors must be assigned to each target. We present a $1/3$–approximation algorithm for this problem, which holds for arbitrary value functions (not necessarily submodular or monotone). In addition to approximation algorithms, we also present various properties of observability measures. We show that the inverse of the condition number of the observability matrix is neither monotone nor submodular, but present other measures that are. Specifically, we show that the trace and rank of the symmetric observability matrix are monotone and submodular and the log determinant of the symmetric observability matrix is monotone and submodular when the matrix is nonsingular. If the target's motion model is not known, the inverse cannot be computed exactly. Instead, we present a lower bound for distance sensors. In addition to theoretical results, we evaluate our results empirically through simulations.
DOI:
10.1109/icra.2017.7989244
发表时间:
2017-05
期刊:
2017 IEEE International Conference on Robotics and Automation (ICRA)
影响因子:
--
作者:
Lifeng Zhou;Pratap Tokekar
通讯作者:
Lifeng Zhou;Pratap Tokekar