Monitoring the Plane with Rotating Radars

Abstract

Consider a set $$P$$P of $$n$$n points in the plane and $$n$$n radars located at these points. The radars are rotating perpetually (around their centre) with identical constant speeds, continuously emitting pulses of radio waves (modelled as half-infinite rays). A radar can "locate" (or detect) any object in the plane (e.g., using radio echo-location when its ray is incident to the object). We propose a model for monitoring the plane based on a system of radars. For any point $$p$$p in the plane, we define the idle time of $$p$$p, as the maximum time that $$p$$p is "unattended" by any of the radars. We study the following monitoring problem: what should the initial direction of the $$n$$n radar rays be so as to minimize the maximum idle time of any point in the plane? We propose algorithms for specifying the initial directions of the radar rays and prove bounds on the idle time depending on the type of configuration of $$n$$n points. For arbitrary sets $$P$$P we give a $$O(n \log n)$$O(nlogn) time algorithm guaranteeing a $$O(1/\sqrt{n})$$O(1/n) upper bound on the idle time, and a $$O(n^{6}/\ln ^{3} n)$$O(n6/ln3n) time algorithm with associated $$O ( \log n/ n)$$O(logn/n) upper bound on the idle time. For a convex set $$P$$P, we show a $$O(n \log n)$$O(nlogn) time algorithm with associated $$O(1/n)$$O(1/n) upper bound on the idle time. Further, for any set $$P$$P of points if the radar rays are assigned a direction independently at random with the uniform distribution then we can prove a tight $$\varTheta (\ln n /n)$$?(lnn/n) upper and lower bound on the idle time with high probability.