Optimal Positioning of Sensors in 2D

Abstract

Abstract. Locating the minimum number of sensors able to see at the same time the entire surface of an object is an important practical problem. Most work presented in this area is restricted to 2D objects. In this paper we present a sensor location algorithms with the following properties. In principle, the algorithm could be extended to 3D objects. The solution given by the algorithm converges toward the optimal solution when increasing the resolution of the object. Limitations due to real sensors can be easily taken into account.

Locating Guards for Visibility Coverage of Polygons

“…We note that in recent and forthcoming work of Bottino and Laurentini [6,7,8,9], experimental results are obtained similar to our own: They perform experiments on many input polygons, showing near optimality of guarding sets computed using their proposed heuristic (iterative) algorithms based on partitioning and covering.…”

Optimal Positioning of Sensors in 3D

“…Finally, the algorithm can easily take into account several constraints. Here we briefly present the essentials of a 2D sensor-positioning algorithm presented in [3]. The steps of the algorithm are as follows.…”

“…The initial active VS on P can be evaluated using a modified version of the 2D region labeling algorithm of [3].…”