A nearly optimal sensor placement algorithm for boundary coverage

Abstract

Locating visual sensors in 2D can be often modeled as an Art Gallery problem. Tasks such as surveillance require observing or “covering” the interior of a polygon with a minimum number of sensors or “guards”. For other tasks, such as inspection and image based rendering, observing the boundaries of the environment is sufficient. As Interior Covering (IC), also Edge Covering (EC) is NP-hard, and no finite algorithm is known for its exact solution. Approximate EC solutions are provided by many heuristic algorithms, but their performances with respect to optimality (minimum number of sensors) is unknown. In this paper, we propose a new EC sensors location technique. The algorithm is incremental, and converges toward the optimal solution. It refines an initial approximation provided by an integer covering algorithm (IEC) where each edge is observed entirely by at least one sensor. A lower bound for the number of sensors, specific of the polygon considered, is used at each step for evaluating the quality of the current solution, and a set of rules are provided for performing a local refinement to reduce the computational burden. The algorithm has been implemented, and tests over hundreds of random polygons show that it supplies solutions very close to and often coincident with the lower bound, and then suboptimal or optimal. In addition, the approximate starting solutions provided by the IEC algorithms are, on the average, close to optimum. The tight lower bound can also be used for testing other EC sensor location algorithms. Running times allow dealing with polygons with up to a few hundreds of edges, which appears adequate for many practical cases. An enhanced version of the algorithm, also taking into account range and incidence constraints, has also been implemented and tested.