Sensor placement optimization in buildings

In this work we address the problem of optimal sensor placement for a given region and task. An important issue in designing sensor arrays is the appropriate placement of the sensors such that they achieve a predefined goal. There are many problems that could be considered in the placement of multiple sensors. In this work we focus on the four problems identified by Hörster and Lienhart. To solve these problems, we propose an algorithm based on Direct Search, which is able to approach the global optimal solution within reasonable time and memory consumption. The algorithm is experimentally evaluated and the results are presented on two real floorplans. The experimental results show that our DS algorithm is able to improve the results given by the most performing heuristic introduced in. The algorithm is then extended to work also on continuous solution spaces, and 3D problems. © 2012 Copyright Society of Photo-Optical Instrumentation Engineers (SPIE).