线上有竞争力的周边防御
Competitive Perimeter Defense on a Line
摘要:
我们考虑一个周边防御问题,其中一个单一的车辆试图保卫一个紧凑的区域,从入侵者在一个一维的环境参数化的周长大小和入侵者-车辆的速度比。入侵者以固定的速度和方向向内移动,以到达周界。我们提供了积极和消极的最坏情况下的性能结果,在参数空间使用竞争分析。我们首先建立基本的限制,确定最困难的参数组合,承认没有$c$竞争算法的任何常数$c\geq 1$和稍微容易的参数组合,其中每个算法是在最好的$2$竞争。然后,我们设计了三类算法,并证明它们是$1$,$2$,和$4$竞争,分别为越来越困难的参数组合。最后,我们提出了数值研究,这些算法对随机生成的入侵者的性能提供见解。
英文摘要:
We consider a perimeter defense problem in which a single vehicle seeks to defend a compact region from intruders in a one-dimensional environment parameterized by the perimeter size and the intruder-to-vehicle speed ratio. The intruders move inward with fixed speed and direction to reach the perimeter. We provide both positive and negative worst-case performance results over the parameter space using competitive analysis. We first establish fundamental limits by identifying the most difficult parameter combinations that admit no $c$-competitive algorithms for any constant $c\geq 1$ and slightly easier parameter combinations in which every algorithm is at best $2$-competitive. We then design three classes of algorithms and prove they are $1$, $2$, and $4$-competitive, respectively, for increasingly difficult parameter combinations. Finally, we present numerical studies that provide insights into the performance of these algorithms against stochastically generated intruders.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。