arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.06428cs.RO
收藏

提高目标跟踪可观测性的传感器分配算法

Sensor Assignment Algorithms to Improve Observability while Tracking Targets

Lifeng Zhou, Pratap Tokekar

摘要:

我们研究了两个传感器分配问题的多目标跟踪的目标,以提高潜在的估计器的可观测性。我们考虑可观测性矩阵的各种度量作为分配价值函数。我们首先研究一般的版本,传感器必须形成团队来跟踪单个目标。如果价值函数是单调递增的且是次模的,则贪心算法产生1/2-近似。然后,我们研究了一个限制的版本,正好有两个传感器必须分配给每个目标。我们提出了一个1/3-近似算法,适用于任意价值函数(不一定是次模或单调)。除了近似算法,我们还提出了各种性质的可观性措施。我们证明了可观测性矩阵的条件数的逆既不是单调的,也不是次模的,但提出了其他的措施。具体地说,我们证明了对称可观测性矩阵的迹和秩是单调的和次模的和对称可观测性矩阵的对数行列式是单调的和次模的矩阵是非奇异的。如果目标的运动模型未知,则无法精确地计算逆。相反,我们提出了一个距离传感器的下限。除了理论结果,我们通过模拟经验评估我们的结果。

英文摘要:

We study two sensor assignment problems for multi-target 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 which 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 non-singular. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑