锥形环境的竞争性周界防御
Competitive Perimeter Defense of Conical Environments
摘要:
我们考虑一个平面圆锥形环境中的周边防御问题,其中一个单一的车辆,具有有限的捕获半径,旨在保卫一个同心的周边移动入侵者。入侵者被任意释放在环境的周边,并以固定的速度向周边径向移动。我们提出了一个有竞争力的分析方法来解决这个问题,通过测量多个在线算法的车辆对任意输入的性能,相对于一个最佳的离线算法,有关于整个输入序列的信息提前。特别地,我们在参数空间上建立了两个必要条件,以保证(i)任何算法的有限竞争性和(ii)任何算法的竞争比至少为2。然后,我们设计和分析三个在线算法和参数的特点,他们有有限的竞争比制度。具体来说,我们的前两个算法是可证明的1,2-竞争,分别,而我们的第三个算法表现出不同的竞争比在不同的制度的问题参数。最后,我们在参数空间中提供了一个数值图,以揭示我们算法的相对性能的其他见解。
英文摘要:
We consider a perimeter defense problem in a planar conical environment in which a single vehicle, having a finite capture radius, aims to defend a concentric perimeter from mobile intruders. The intruders are arbitrarily released at the circumference of the environment and they move radially toward the perimeter with fixed speed. We present a competitive analysis approach to this problem by measuring the performance of multiple online algorithms for the vehicle against arbitrary inputs, relative to an optimal offline algorithm that has information about entire input sequence in advance. In particular, we establish two necessary conditions on the parameter space to guarantee (i) finite competitiveness of any algorithm and (ii) a competitive ratio of at least 2 for any algorithm. We then design and analyze three online algorithms and characterize parameter regimes in which they have finite competitive ratios. Specifically, our first two algorithms are provably 1, and 2-competitive, respectively, whereas our third algorithm exhibits different competitive ratios in different regimes of problem parameters. Finally, we provide a numerical plot in the parameter space to reveal additional insights into the relative performance of our algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。