利用有限射程和使用时间的炮塔进行周界防御
Perimeter Defense using a Turret with Finite Range and Service Times
摘要:
我们考虑一个平面圆锥形环境中的周边防御问题,包括一个单一的炮塔,具有有限的范围和非零的服务时间。炮塔的目的是保卫一个同心圆防御$N\geq 2$入侵者。一旦被释放,每个入侵者都以固定的速度向周边放射状移动。为了捕获入侵者,炮塔的角度必须与入侵者的角度对齐,并且必须在该方向上花费指定的服务时间。我们解决这个优化问题的离线和在线版本。具体来说,在离线版本中,我们建立,在一般的参数制度,这个问题相当于解决一个旅行修理工问题的时间窗口(TRP-TW)。然后,我们确定特定的参数制度,其中有一个多项式时间算法,最大限度地提高入侵者的数量被抓获。在在线版本中,我们提出了一种竞争分析技术,在其中我们建立了一个基本的保证,在最好的$(N-1)$竞争算法的存在。我们还设计了两个在线算法,可证明$1$和$2$ -在特定的参数制度的竞争力。
英文摘要:
We consider a perimeter defense problem in a planar conical environment comprising a single turret that has a finite range and non-zero service time. The turret seeks to defend a concentric perimeter against $N\geq 2$ intruders. Upon release, each intruder moves radially towards the perimeter with a fixed speed. To capture an intruder, the turret's angle must be aligned with that of the intruder's angle and must spend a specified service time at that orientation. We address offline and online versions of this optimization problem. Specifically, in the offline version, we establish that in general parameter regimes, this problem is equivalent to solving a Travelling Repairperson Problem with Time Windows (TRP-TW). We then identify specific parameter regimes in which there is a polynomial time algorithm that maximizes the number of intruders captured. In the online version, we present a competitive analysis technique in which we establish a fundamental guarantee on the existence of at best $(N-1)$-competitive algorithms. We also design two online algorithms that are provably $1$ and $2$-competitive in specific parameter regimes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。