Capturing an evader in polygonal environments with obstacles: The full visibility case
Capturing an evader in polygonal environments with obstacles: The full visibility case
复制标题
在有障碍物的多边形环境中抓捕逃犯：完全可见性案例
DOI：
10.1177/0278364912452894
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
S. Suri
中科院分区：
文献类型：
--
作者：
D. Bhadauria;Kyle Klein;Volkan Isler;S. Suri
假设一个不可预测的逃避者可以在一个具有任意复杂性的多边形环境中自由移动，并且受到完整的摄像机监视。有多少追赶者，每个追赶者的最大速度都与逃避者相同，才能保证成功捕获逃避者？追捕者总是通过摄像头网络知道逃避者的当前位置，但需要实际到达逃避者才能捕捉到它。我们允许逃避者知道所有追踪者的当前位置——这符合标准的最坏情况分析模型，但也模拟了逃避者“入侵”监控系统的实际情况。我们的主要结果是证明三个追捕者总是足够的，有时是必要的。边界与多边形环境中顶点或孔的数量无关。
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and sufficient to guarantee a successful capture of the evader? The pursuers always know the evader’s current position through a camera network, but need to physically reach the evader to capture it. We allow the evader knowledge of the current positions of all the pursuers as well—this accords with the standard worst-case analysis model, but also models a practical situation where the evader has ‘hacked’ into the surveillance system. Our main result is to prove that three pursuers are always sufficient and sometimes necessary to capture the evader. The bound is independent of the number of vertices or holes in the polygonal environment.