具有空间不确定警报信号的对抗性巡逻
Adversarial patrolling with spatially uncertain alarm signals
摘要:
在保护复杂的基础设施或大型环境时,对每个区域的持续监控是负担不起的。为了解决这个问题,一个常见的对策是使用廉价但范围广泛的传感器,能够检测到大面积发生的可疑事件,支持巡逻人员提高其策略的有效性。然而,这种传感器通常受到不确定性的影响。在本文中,我们专注于空间不确定报警信号。也就是说,警报系统能够检测到攻击,但不确定攻击发生的确切位置。当要保护的地区很广时,例如在边境巡逻和公平现场监视中,这种情况很常见。我们建议,据我们所知,第一巡逻安全游戏模型,其中一个后卫是由一个空间不确定的报警系统,非确定性地产生信号,一旦目标受到攻击的支持。我们发现,在任意图形中找到最佳策略是APX硬,即使在零和游戏,我们提供了两个(指数时间)的精确算法和两个(多项式时间)的近似算法。此外,我们分析了在特殊拓扑结构的环境中发生的事情,表明在线性和循环图的最佳巡逻策略可以在多项式时间内找到,事实上允许我们的算法在现实生活中使用的情况下,而在树上的问题是NP-难的。最后,我们证明了在没有误报和漏检的情况下,最佳巡逻策略可以减少到停留在一个地方,等待信号,并最好地对其做出响应。这种策略即使在不可忽略的漏检率下也是最佳的,不幸的是,这会影响到每一个商业报警系统。我们在模拟中评估我们的方法,评估定量和定性方面。
英文摘要:
When securing complex infrastructures or large environments, constant surveillance of every area is not affordable. To cope with this issue, a common countermeasure is the usage of cheap but wide-ranged sensors, able to detect suspicious events that occur in large areas, supporting patrollers to improve the effectiveness of their strategies. However, such sensors are commonly affected by uncertainty. In the present paper, we focus on spatially uncertain alarm signals. That is, the alarm system is able to detect an attack but it is uncertain on the exact position where the attack is taking place. This is common when the area to be secured is wide such as in border patrolling and fair site surveillance. We propose, to the best of our knowledge, the first Patrolling Security Game model where a Defender is supported by a spatially uncertain alarm system which non-deterministically generates signals once a target is under attack. We show that finding the optimal strategy in arbitrary graphs is APX-hard even in zero-sum games and we provide two (exponential time) exact algorithms and two (polynomial time) approximation algorithms. Furthermore, we analyse what happens in environments with special topologies, showing that in linear and cycle graphs the optimal patrolling strategy can be found in polynomial time, de facto allowing our algorithms to be used in real-life scenarios, while in trees the problem is NP-hard. Finally, we show that without false positives and missed detections, the best patrolling strategy reduces to stay in a place, wait for a signal, and respond to it at best. This strategy is optimal even with non-negligible missed detection rates, which, unfortunately, affect every commercial alarm system. We evaluate our methods in simulation, assessing both quantitative and qualitative aspects.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。