Optimal one-dimensional coverage by unreliable sensors

Paolo Frasca (1) , Federica Garin (2) , Balázs Gerencsér (3) , Julien M. Hendrickx (3)

1 Department of Applied Mathematics [Twente]
2 NECS - Networked Controlled Systems
3 ICTEAM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics

This paper regards the problem of optimally placing unreliable sensors in a one-dimensional environment. We assume that sensors can fail with a certain probability and we minimize the expected maximum distance between any point in the environment and the closest active sensor. We provide a computational method to find the optimal placement and we estimate the costs of the equispaced placement and of the uniform random placement. When the number of sensors goes to infinity, the equispaced placement is asymptotically equivalent to the optimal placement (that is, the ratio between their costs converges to one), whereas the cost of the random placement remains strictly larger.

Domaines: Automatique

Paolo Frasca, Federica Garin, Balázs Gerencsér, Julien M. Hendrickx. Optimal one-dimensional coverage by unreliable sensors. SIAM Journal on Control and Optimization, 2015, 53 (5), pp.3120-3140. ⟨10.1137/140968094⟩. ⟨hal-01234344⟩