arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.10399math.OC
收藏

线上的周期模式及其它网络

Periodic Patrols on the Line and Other Networks

Steve Alpern, Thomas Lidbetter, Katerina Papadaki

摘要:

我们考虑一个最近由Alpern et al.(2011)引入的图上的巡逻游戏,其中如果巡逻者在攻击发生时处于被攻击节点,则他获胜。研究了攻击持续时间为两个周期的周期巡逻对策。我们证明了,如果巡逻者的周期是偶数,游戏可以解决任何图通过找到图的分数覆盖数和分数独立数。我们还给出了任意大小线图上周期巡逻博弈的完整解,将Papadaki et al.(2016)的工作扩展到周期域。这个模型的巡逻问题的边界或通道,这是一个经典的问题,运筹学可以追溯到莫尔斯和金博尔(1951年)。定期巡逻需要在同一地点开始和结束,例如巡逻员离开他的车开始徒步巡逻的地方。

英文摘要:

We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This paper studies the periodic patrolling game in the case that the attack duration is two periods. We show that if the Patroller's period is even, the game can be solved on any graph by finding the fractional covering number and fractional independence number of the graph. We also give a complete solution to the periodic patrolling game on line graphs of arbitrary size, extending the work of Papadaki et al. (2016) to the periodic domain. This models the patrolling problem on a border or channel, which is related to a classical problem of operational research going back to Morse and Kimball (1951). A periodic patrol is required to start and end at the same location, for example the place where the Patroller leaves his car to begin a foot patrol.

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

↑