Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Art gallery theorems and algorithms
Art gallery theorems and algorithms
A tight analysis of the greedy algorithm for set cover
Journal of Algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Approximation algorithms for terrain guarding
Information Processing Letters
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
International Journal of Computer Vision
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Optimal camera placement to measure distances regarding static and dynamic obstacles
International Journal of Sensor Networks
Hi-index | 0.00 |
The optimal sensor placement problem consists of determining the number, types, and locations of sensors satisfying inhomogeneous coverage requirements while minimising a specified cost function. The cost function can reflect various factors such as the actual cost of the sensors, their total number, and energy consumption. A strict and general formulation of the problem is described here for sensors characterised by probability of detection at some specified probability of false alarm. The formulation includes non-uniform coverage preferences and realistic, non-line-of-sight detection accounting on signal propagation effects. The optimisation is expressed as a solution to a binary linear programming problem. While exact solution of this problem is typically prohibitive, a fast greedy algorithm is presented that yields a near-optimal solution. It can also be successfully applied to improve coverage of an existing sensor network. This approach compares very favourably to an alternative heuristic strategy based on placing sensors one-by-one in the previously worst-covered location.