Technical Note - Optimal Patrol of a Perimeter
Technical Note - Optimal Patrol of a Perimeter
复制标题
技术说明 - 周界的最佳巡逻
作者：
Kyle Y. Lin
防御者派遣巡逻兵在防御圈内巡逻以防范潜在的攻击。只要巡逻人员的长期派遣率被限制在某个常数，防守者就决定派遣巡逻人员的时间点以及每个巡逻人员的方向和速度。在周边任何一点的攻击需要相同的时间，在此期间，它将被每个路过的巡逻人员以相同的概率独立检测到。防御者希望最大化在攻击完成之前检测到攻击的概率，而攻击者希望最小化它。我们研究了两种情况，这取决于巡逻员是卧底还是穿制服。传统的智慧会建议，攻击者获得优势，如果他能看到巡逻队去，以便他的攻击时间，但我们表明，防御者可以实现同样的最佳检测概率仔细分散巡逻队的概率对学习攻击。
A defender dispatches patrollers to circumambulate a perimeter to guard against potential attacks. The defender decides on the time points to dispatch patrollers and each patroller’s direction and speed, as long as the long-run rate at which patrollers are dispatched is capped at some constant. An attack at any point on the perimeter requires the same amount of time, during which it will be detected by each passing patroller independently with the same probability. The defender wants to maximize the probability of detecting an attack before it completes, while the attacker wants to minimize it. We study two scenarios, depending on whether the patrollers are undercover or wear a uniform. Conventional wisdom would suggest that the attacker gains advantage if he can see the patrollers going by so as to time his attack, but we show that the defender can achieve the same optimal detection probability by carefully spreading out the patrollers probabilistically against a learning attacker.