Motion Strategies for Surveillance
Motion Strategies for Surveillance
复制标题
监控运动策略
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
S. Hutchinson
中科院分区：
文献类型：
--
作者：
S. Bhattacharya;S. Candido;S. Hutchinson
我们在一个有障碍的环境中解决监控问题。我们证明了在一个角落跟踪有一个跟踪者的逃避者的问题是完全可决定的。追踪者和逃避者对彼此的瞬时位置都有完整的信息。追踪者有关于逃避者的瞬时速度的完整信息。我们提出了一个追踪者可见区域的分区，在此区域中，我们基于逃避者所在的区域，提供了逃避者逃离追踪者可见区域或追踪者在未来所有时间跟踪目标的策略。我们还给出了反问题的解：给定逃避者的位置，求出逃避者能逃离目标可见区域的追捕者的位置。这些结果已经提供了不同速度的追捕者和逃避者。基于反问题的结果，我们提供了一个O（n log n）算法，该算法可以确定在某些初始跟踪者和逃避者位置上，逃避者是否可以逃离跟踪者的可见区域。最后，将二维拐角的目标跟踪问题推广到三维边缘的目标跟踪问题。
We address the problem of surveillance in an environment with obstacles. We show that the problem of tracking an evader with one pursuer around one corner is completely decidable. The pursuer and the evader have complete information about each other’s instantaneous position. The pursuer has complete information about the instantaneous velocity of the evader. We present a partition of the visibility region of the pursuer where based on the region in which the evader lies, we provide strategies for the evader to escape the visibility region of the pursuer or for the pursuer to track the target for all future time. We also present the solution to the inverse problem: given the position of the evader, the positions of the pursuer for which the evader can escape the visibility region of the target. These results have been provided for varying speeds of the pursuer and the evader. Based on the results of the inverse problem we provide an O(n log n) algorithm that can decide if the evader can escape from the visibility region of a pursuer for some initial pursuer and evader positions. Finally, we extend the result of the target tracking problem around a corner in two dimensions to an edge in three dimensions.