Competitive Perimeter Defense in Tree Environments

We consider a perimeter defense problem in a rooted full tree graph environment in which a single defending vehicle seeks to defend a set of specified vertices, termed as the perimeter, from mobile intruders that enter the environment through the tree’s leaves. We adopt the technique of competitive analysis to characterize the performance of online algorithms for the defending vehicle. We first derive fundamental limits on the performance of any online algorithm relative to that of an optimal offline algorithm. Specifically, we give three fundamental conditions for finite, 2, and $\frac{3}{2}$ competitive ratios in terms of the environment parameters. We then design and analyze three classes of online algorithms that have provably finite competitiveness under varying environmental parameter regimes. Finally, we give a numerical visualization of these regimes to show the comparative strengths and weaknesses of each algorithm.